/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 12:32:37,455 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 12:32:37,458 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 12:32:37,469 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 12:32:37,469 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 12:32:37,470 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 12:32:37,472 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 12:32:37,473 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 12:32:37,475 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 12:32:37,475 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 12:32:37,476 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 12:32:37,477 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 12:32:37,478 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 12:32:37,478 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 12:32:37,479 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 12:32:37,480 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 12:32:37,481 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 12:32:37,482 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 12:32:37,484 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 12:32:37,486 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 12:32:37,487 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 12:32:37,488 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 12:32:37,489 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 12:32:37,490 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 12:32:37,492 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 12:32:37,492 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 12:32:37,493 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 12:32:37,493 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 12:32:37,494 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 12:32:37,495 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 12:32:37,495 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 12:32:37,495 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 12:32:37,496 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 12:32:37,497 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 12:32:37,498 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 12:32:37,498 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 12:32:37,499 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 12:32:37,499 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 12:32:37,499 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 12:32:37,500 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 12:32:37,500 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 12:32:37,501 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-07-01 12:32:37,515 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 12:32:37,515 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 12:32:37,516 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 12:32:37,517 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 12:32:37,517 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 12:32:37,517 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:32:37,517 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 12:32:37,517 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 12:32:37,518 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 12:32:37,518 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 12:32:37,518 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 12:32:37,518 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 12:32:37,518 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 12:32:37,518 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 12:32:37,519 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:32:37,519 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 12:32:37,519 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 12:32:37,519 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 12:32:37,519 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 12:32:37,520 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 12:32:37,520 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 12:32:37,520 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 12:32:37,520 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 12:32:37,520 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 12:32:37,520 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:32:37,521 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 12:32:37,521 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 12:32:37,521 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 12:32:37,521 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 12:32:37,690 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 12:32:37,703 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 12:32:37,707 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 12:32:37,708 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 12:32:37,708 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 12:32:37,709 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 12:32:37,778 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_9IN4LT/tmp/2e3f03e8271441f2977ce4e9f8f346b3/FLAG493c1f99a [2020-07-01 12:32:38,127 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 12:32:38,128 INFO L160 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 12:32:38,129 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 12:32:38,136 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_9IN4LT/tmp/2e3f03e8271441f2977ce4e9f8f346b3/FLAG493c1f99a [2020-07-01 12:32:38,532 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/BenchExec_run_9IN4LT/tmp/2e3f03e8271441f2977ce4e9f8f346b3 [2020-07-01 12:32:38,543 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 12:32:38,544 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 12:32:38,546 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 12:32:38,546 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 12:32:38,550 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 12:32:38,551 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:32:38" (1/1) ... [2020-07-01 12:32:38,554 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a0bb443 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:32:38, skipping insertion in model container [2020-07-01 12:32:38,554 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:32:38" (1/1) ... [2020-07-01 12:32:38,562 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 12:32:38,580 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 12:32:38,808 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:32:38,818 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 12:32:38,838 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:32:38,853 INFO L208 MainTranslator]: Completed translation [2020-07-01 12:32:38,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:32:38 WrapperNode [2020-07-01 12:32:38,853 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 12:32:38,854 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 12:32:38,854 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 12:32:38,855 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 12:32:38,863 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:32:38" (1/1) ... [2020-07-01 12:32:38,872 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:32:38" (1/1) ... [2020-07-01 12:32:38,894 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 12:32:38,895 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 12:32:38,895 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 12:32:38,895 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 12:32:38,904 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:32:38" (1/1) ... [2020-07-01 12:32:38,904 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:32:38" (1/1) ... [2020-07-01 12:32:38,906 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:32:38" (1/1) ... [2020-07-01 12:32:38,906 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:32:38" (1/1) ... [2020-07-01 12:32:38,912 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:32:38" (1/1) ... [2020-07-01 12:32:38,917 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:32:38" (1/1) ... [2020-07-01 12:32:38,918 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:32:38" (1/1) ... [2020-07-01 12:32:38,920 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 12:32:38,921 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 12:32:38,921 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 12:32:38,921 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 12:32:38,922 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:32:38" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:32:38,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 12:32:38,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 12:32:38,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 12:32:38,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 12:32:38,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 12:32:38,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 12:32:39,242 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 12:32:39,243 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-01 12:32:39,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:32:39 BoogieIcfgContainer [2020-07-01 12:32:39,247 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 12:32:39,247 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 12:32:39,248 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 12:32:39,250 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 12:32:39,250 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:32:39" (1/1) ... [2020-07-01 12:32:39,264 INFO L313 BlockEncoder]: Initial Icfg 28 locations, 34 edges [2020-07-01 12:32:39,266 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 12:32:39,266 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 12:32:39,267 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 12:32:39,267 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:32:39,269 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 12:32:39,270 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 12:32:39,270 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 12:32:39,292 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 12:32:39,320 INFO L200 BlockEncoder]: SBE split 11 edges [2020-07-01 12:32:39,325 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility [2020-07-01 12:32:39,327 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:32:39,357 INFO L100 BaseMinimizeStates]: Removed 12 edges and 6 locations by large block encoding [2020-07-01 12:32:39,360 INFO L70 RemoveSinkStates]: Removed 3 edges and 2 locations by removing sink states [2020-07-01 12:32:39,362 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 12:32:39,362 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:32:39,362 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 12:32:39,363 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 12:32:39,363 INFO L313 BlockEncoder]: Encoded RCFG 20 locations, 36 edges [2020-07-01 12:32:39,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:32:39 BasicIcfg [2020-07-01 12:32:39,364 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 12:32:39,365 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 12:32:39,365 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 12:32:39,369 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 12:32:39,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 12:32:38" (1/4) ... [2020-07-01 12:32:39,370 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@273153d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:32:39, skipping insertion in model container [2020-07-01 12:32:39,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:32:38" (2/4) ... [2020-07-01 12:32:39,370 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@273153d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:32:39, skipping insertion in model container [2020-07-01 12:32:39,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:32:39" (3/4) ... [2020-07-01 12:32:39,371 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@273153d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:32:39, skipping insertion in model container [2020-07-01 12:32:39,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:32:39" (4/4) ... [2020-07-01 12:32:39,373 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:32:39,383 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 12:32:39,390 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2020-07-01 12:32:39,404 INFO L251 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-07-01 12:32:39,427 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 12:32:39,428 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 12:32:39,428 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:32:39,428 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:32:39,428 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:32:39,428 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 12:32:39,428 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:32:39,429 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 12:32:39,443 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2020-07-01 12:32:39,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:32:39,449 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:32:39,450 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:32:39,451 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:32:39,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:39,457 INFO L82 PathProgramCache]: Analyzing trace with hash 159033776, now seen corresponding path program 1 times [2020-07-01 12:32:39,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:39,467 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044457382] [2020-07-01 12:32:39,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:39,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:39,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:39,623 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044457382] [2020-07-01 12:32:39,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:32:39,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:32:39,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852753455] [2020-07-01 12:32:39,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:32:39,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:39,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:32:39,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:32:39,647 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. [2020-07-01 12:32:39,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:39,731 INFO L93 Difference]: Finished difference Result 36 states and 63 transitions. [2020-07-01 12:32:39,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:32:39,734 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:32:39,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:39,746 INFO L225 Difference]: With dead ends: 36 [2020-07-01 12:32:39,746 INFO L226 Difference]: Without dead ends: 20 [2020-07-01 12:32:39,749 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:32:39,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-07-01 12:32:39,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-07-01 12:32:39,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-01 12:32:39,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 33 transitions. [2020-07-01 12:32:39,785 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 33 transitions. Word has length 5 [2020-07-01 12:32:39,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:39,786 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 33 transitions. [2020-07-01 12:32:39,786 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:32:39,786 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 33 transitions. [2020-07-01 12:32:39,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:32:39,786 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:32:39,786 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:32:39,788 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 12:32:39,788 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:32:39,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:39,789 INFO L82 PathProgramCache]: Analyzing trace with hash 159033838, now seen corresponding path program 1 times [2020-07-01 12:32:39,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:39,789 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019393145] [2020-07-01 12:32:39,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:39,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:39,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:39,829 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019393145] [2020-07-01 12:32:39,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:32:39,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:32:39,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955411835] [2020-07-01 12:32:39,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:32:39,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:39,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:32:39,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:32:39,832 INFO L87 Difference]: Start difference. First operand 20 states and 33 transitions. Second operand 3 states. [2020-07-01 12:32:39,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:39,901 INFO L93 Difference]: Finished difference Result 20 states and 33 transitions. [2020-07-01 12:32:39,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:32:39,902 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:32:39,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:39,903 INFO L225 Difference]: With dead ends: 20 [2020-07-01 12:32:39,903 INFO L226 Difference]: Without dead ends: 19 [2020-07-01 12:32:39,904 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:32:39,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-07-01 12:32:39,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-07-01 12:32:39,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-01 12:32:39,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 31 transitions. [2020-07-01 12:32:39,909 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 31 transitions. Word has length 5 [2020-07-01 12:32:39,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:39,909 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 31 transitions. [2020-07-01 12:32:39,909 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:32:39,909 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 31 transitions. [2020-07-01 12:32:39,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:32:39,910 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:32:39,910 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:32:39,910 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 12:32:39,910 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:32:39,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:39,911 INFO L82 PathProgramCache]: Analyzing trace with hash 159033840, now seen corresponding path program 1 times [2020-07-01 12:32:39,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:39,911 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680322771] [2020-07-01 12:32:39,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:39,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:39,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:39,957 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680322771] [2020-07-01 12:32:39,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:32:39,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:32:39,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486262331] [2020-07-01 12:32:39,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:32:39,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:39,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:32:39,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:32:39,959 INFO L87 Difference]: Start difference. First operand 19 states and 31 transitions. Second operand 4 states. [2020-07-01 12:32:40,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:40,007 INFO L93 Difference]: Finished difference Result 20 states and 31 transitions. [2020-07-01 12:32:40,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:32:40,008 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-07-01 12:32:40,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:40,009 INFO L225 Difference]: With dead ends: 20 [2020-07-01 12:32:40,009 INFO L226 Difference]: Without dead ends: 19 [2020-07-01 12:32:40,010 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:32:40,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-07-01 12:32:40,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-07-01 12:32:40,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-01 12:32:40,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 30 transitions. [2020-07-01 12:32:40,014 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 30 transitions. Word has length 5 [2020-07-01 12:32:40,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:40,014 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 30 transitions. [2020-07-01 12:32:40,014 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:32:40,014 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2020-07-01 12:32:40,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:32:40,015 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:32:40,015 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:32:40,015 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 12:32:40,015 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:32:40,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:40,016 INFO L82 PathProgramCache]: Analyzing trace with hash 159033841, now seen corresponding path program 1 times [2020-07-01 12:32:40,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:40,016 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666610024] [2020-07-01 12:32:40,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:40,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:40,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:40,049 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666610024] [2020-07-01 12:32:40,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:32:40,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:32:40,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308038243] [2020-07-01 12:32:40,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:32:40,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:40,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:32:40,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:32:40,051 INFO L87 Difference]: Start difference. First operand 19 states and 30 transitions. Second operand 3 states. [2020-07-01 12:32:40,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:40,094 INFO L93 Difference]: Finished difference Result 19 states and 30 transitions. [2020-07-01 12:32:40,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:32:40,095 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:32:40,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:40,095 INFO L225 Difference]: With dead ends: 19 [2020-07-01 12:32:40,095 INFO L226 Difference]: Without dead ends: 18 [2020-07-01 12:32:40,096 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:32:40,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-01 12:32:40,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-07-01 12:32:40,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-01 12:32:40,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 29 transitions. [2020-07-01 12:32:40,099 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 29 transitions. Word has length 5 [2020-07-01 12:32:40,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:40,100 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 29 transitions. [2020-07-01 12:32:40,100 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:32:40,100 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 29 transitions. [2020-07-01 12:32:40,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 12:32:40,101 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:32:40,101 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:32:40,101 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 12:32:40,101 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:32:40,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:40,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1787281710, now seen corresponding path program 1 times [2020-07-01 12:32:40,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:40,102 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766505881] [2020-07-01 12:32:40,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:40,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:40,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:40,152 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766505881] [2020-07-01 12:32:40,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:32:40,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:32:40,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217289503] [2020-07-01 12:32:40,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:32:40,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:40,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:32:40,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:32:40,153 INFO L87 Difference]: Start difference. First operand 18 states and 29 transitions. Second operand 4 states. [2020-07-01 12:32:40,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:40,231 INFO L93 Difference]: Finished difference Result 18 states and 29 transitions. [2020-07-01 12:32:40,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:32:40,231 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-01 12:32:40,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:40,232 INFO L225 Difference]: With dead ends: 18 [2020-07-01 12:32:40,232 INFO L226 Difference]: Without dead ends: 17 [2020-07-01 12:32:40,233 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:32:40,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-07-01 12:32:40,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-07-01 12:32:40,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-01 12:32:40,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 27 transitions. [2020-07-01 12:32:40,236 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 27 transitions. Word has length 7 [2020-07-01 12:32:40,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:40,237 INFO L479 AbstractCegarLoop]: Abstraction has 17 states and 27 transitions. [2020-07-01 12:32:40,237 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:32:40,237 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 27 transitions. [2020-07-01 12:32:40,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 12:32:40,237 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:32:40,237 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:32:40,238 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 12:32:40,238 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:32:40,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:40,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1787281708, now seen corresponding path program 1 times [2020-07-01 12:32:40,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:40,239 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162391163] [2020-07-01 12:32:40,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:40,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:40,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:40,300 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162391163] [2020-07-01 12:32:40,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:32:40,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 12:32:40,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958296463] [2020-07-01 12:32:40,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 12:32:40,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:40,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 12:32:40,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:32:40,302 INFO L87 Difference]: Start difference. First operand 17 states and 27 transitions. Second operand 5 states. [2020-07-01 12:32:40,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:40,387 INFO L93 Difference]: Finished difference Result 25 states and 39 transitions. [2020-07-01 12:32:40,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 12:32:40,387 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2020-07-01 12:32:40,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:40,390 INFO L225 Difference]: With dead ends: 25 [2020-07-01 12:32:40,390 INFO L226 Difference]: Without dead ends: 24 [2020-07-01 12:32:40,390 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-01 12:32:40,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-01 12:32:40,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2020-07-01 12:32:40,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-01 12:32:40,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 30 transitions. [2020-07-01 12:32:40,396 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 30 transitions. Word has length 7 [2020-07-01 12:32:40,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:40,396 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 30 transitions. [2020-07-01 12:32:40,396 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 12:32:40,396 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2020-07-01 12:32:40,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 12:32:40,397 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:32:40,397 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:32:40,397 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 12:32:40,397 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:32:40,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:40,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1787281707, now seen corresponding path program 1 times [2020-07-01 12:32:40,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:40,398 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146390551] [2020-07-01 12:32:40,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:40,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:40,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:40,482 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146390551] [2020-07-01 12:32:40,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:32:40,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-01 12:32:40,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971006201] [2020-07-01 12:32:40,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-01 12:32:40,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:40,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-01 12:32:40,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-01 12:32:40,485 INFO L87 Difference]: Start difference. First operand 19 states and 30 transitions. Second operand 6 states. [2020-07-01 12:32:40,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:40,621 INFO L93 Difference]: Finished difference Result 24 states and 38 transitions. [2020-07-01 12:32:40,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-01 12:32:40,622 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2020-07-01 12:32:40,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:40,623 INFO L225 Difference]: With dead ends: 24 [2020-07-01 12:32:40,623 INFO L226 Difference]: Without dead ends: 23 [2020-07-01 12:32:40,623 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-07-01 12:32:40,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-01 12:32:40,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2020-07-01 12:32:40,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-01 12:32:40,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 29 transitions. [2020-07-01 12:32:40,628 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 29 transitions. Word has length 7 [2020-07-01 12:32:40,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:40,628 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 29 transitions. [2020-07-01 12:32:40,628 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-01 12:32:40,629 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 29 transitions. [2020-07-01 12:32:40,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-01 12:32:40,629 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:32:40,629 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:32:40,629 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 12:32:40,629 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:32:40,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:40,630 INFO L82 PathProgramCache]: Analyzing trace with hash 428840850, now seen corresponding path program 1 times [2020-07-01 12:32:40,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:40,630 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298202969] [2020-07-01 12:32:40,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:40,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:40,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:40,680 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298202969] [2020-07-01 12:32:40,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:32:40,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 12:32:40,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4338019] [2020-07-01 12:32:40,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 12:32:40,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:40,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 12:32:40,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:32:40,681 INFO L87 Difference]: Start difference. First operand 19 states and 29 transitions. Second operand 5 states. [2020-07-01 12:32:40,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:40,762 INFO L93 Difference]: Finished difference Result 24 states and 37 transitions. [2020-07-01 12:32:40,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 12:32:40,763 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-07-01 12:32:40,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:40,763 INFO L225 Difference]: With dead ends: 24 [2020-07-01 12:32:40,763 INFO L226 Difference]: Without dead ends: 23 [2020-07-01 12:32:40,764 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-01 12:32:40,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-01 12:32:40,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2020-07-01 12:32:40,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-01 12:32:40,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 33 transitions. [2020-07-01 12:32:40,768 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 33 transitions. Word has length 8 [2020-07-01 12:32:40,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:40,769 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 33 transitions. [2020-07-01 12:32:40,769 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 12:32:40,769 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 33 transitions. [2020-07-01 12:32:40,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-01 12:32:40,769 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:32:40,770 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:32:40,770 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-01 12:32:40,770 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:32:40,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:40,771 INFO L82 PathProgramCache]: Analyzing trace with hash 428840851, now seen corresponding path program 1 times [2020-07-01 12:32:40,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:40,771 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797833095] [2020-07-01 12:32:40,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:40,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:40,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:40,897 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797833095] [2020-07-01 12:32:40,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:32:40,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-01 12:32:40,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287262497] [2020-07-01 12:32:40,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-01 12:32:40,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:40,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-01 12:32:40,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-01 12:32:40,899 INFO L87 Difference]: Start difference. First operand 20 states and 33 transitions. Second operand 7 states. [2020-07-01 12:32:41,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:41,185 INFO L93 Difference]: Finished difference Result 58 states and 94 transitions. [2020-07-01 12:32:41,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-01 12:32:41,186 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2020-07-01 12:32:41,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:41,188 INFO L225 Difference]: With dead ends: 58 [2020-07-01 12:32:41,188 INFO L226 Difference]: Without dead ends: 57 [2020-07-01 12:32:41,188 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-07-01 12:32:41,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-07-01 12:32:41,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 26. [2020-07-01 12:32:41,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-01 12:32:41,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 42 transitions. [2020-07-01 12:32:41,194 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 42 transitions. Word has length 8 [2020-07-01 12:32:41,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:41,194 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 42 transitions. [2020-07-01 12:32:41,194 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-01 12:32:41,195 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 42 transitions. [2020-07-01 12:32:41,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-01 12:32:41,195 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:32:41,195 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:32:41,195 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-01 12:32:41,195 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:32:41,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:41,196 INFO L82 PathProgramCache]: Analyzing trace with hash 428840848, now seen corresponding path program 1 times [2020-07-01 12:32:41,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:41,197 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15487408] [2020-07-01 12:32:41,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:41,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:41,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:41,242 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15487408] [2020-07-01 12:32:41,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:32:41,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 12:32:41,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669596042] [2020-07-01 12:32:41,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 12:32:41,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:41,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 12:32:41,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:32:41,244 INFO L87 Difference]: Start difference. First operand 26 states and 42 transitions. Second operand 5 states. [2020-07-01 12:32:41,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:41,330 INFO L93 Difference]: Finished difference Result 26 states and 42 transitions. [2020-07-01 12:32:41,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 12:32:41,331 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-07-01 12:32:41,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:41,331 INFO L225 Difference]: With dead ends: 26 [2020-07-01 12:32:41,332 INFO L226 Difference]: Without dead ends: 25 [2020-07-01 12:32:41,332 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-01 12:32:41,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-01 12:32:41,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-07-01 12:32:41,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-01 12:32:41,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 36 transitions. [2020-07-01 12:32:41,337 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 36 transitions. Word has length 8 [2020-07-01 12:32:41,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:41,338 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 36 transitions. [2020-07-01 12:32:41,338 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 12:32:41,338 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 36 transitions. [2020-07-01 12:32:41,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-01 12:32:41,338 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:32:41,338 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:32:41,339 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-01 12:32:41,339 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:32:41,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:41,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1373602834, now seen corresponding path program 1 times [2020-07-01 12:32:41,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:41,339 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649638667] [2020-07-01 12:32:41,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:41,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:41,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:41,445 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649638667] [2020-07-01 12:32:41,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:32:41,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-01 12:32:41,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042110717] [2020-07-01 12:32:41,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-01 12:32:41,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:41,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-01 12:32:41,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-01 12:32:41,447 INFO L87 Difference]: Start difference. First operand 25 states and 36 transitions. Second operand 7 states. [2020-07-01 12:32:41,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:41,689 INFO L93 Difference]: Finished difference Result 43 states and 63 transitions. [2020-07-01 12:32:41,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-01 12:32:41,689 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2020-07-01 12:32:41,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:41,690 INFO L225 Difference]: With dead ends: 43 [2020-07-01 12:32:41,690 INFO L226 Difference]: Without dead ends: 42 [2020-07-01 12:32:41,691 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-07-01 12:32:41,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-01 12:32:41,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 25. [2020-07-01 12:32:41,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-01 12:32:41,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 36 transitions. [2020-07-01 12:32:41,696 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 36 transitions. Word has length 8 [2020-07-01 12:32:41,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:41,696 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 36 transitions. [2020-07-01 12:32:41,696 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-01 12:32:41,696 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 36 transitions. [2020-07-01 12:32:41,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-01 12:32:41,697 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:32:41,697 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:32:41,697 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-01 12:32:41,697 INFO L427 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:32:41,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:41,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1203615402, now seen corresponding path program 1 times [2020-07-01 12:32:41,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:41,698 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066151691] [2020-07-01 12:32:41,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:41,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:41,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:41,763 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066151691] [2020-07-01 12:32:41,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:32:41,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-01 12:32:41,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316551703] [2020-07-01 12:32:41,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-01 12:32:41,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:41,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-01 12:32:41,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-01 12:32:41,764 INFO L87 Difference]: Start difference. First operand 25 states and 36 transitions. Second operand 6 states. [2020-07-01 12:32:41,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:41,911 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2020-07-01 12:32:41,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-01 12:32:41,911 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2020-07-01 12:32:41,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:41,912 INFO L225 Difference]: With dead ends: 48 [2020-07-01 12:32:41,912 INFO L226 Difference]: Without dead ends: 47 [2020-07-01 12:32:41,912 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-07-01 12:32:41,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-07-01 12:32:41,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 25. [2020-07-01 12:32:41,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-01 12:32:41,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 36 transitions. [2020-07-01 12:32:41,918 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 36 transitions. Word has length 8 [2020-07-01 12:32:41,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:41,918 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 36 transitions. [2020-07-01 12:32:41,918 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-01 12:32:41,918 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 36 transitions. [2020-07-01 12:32:41,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-01 12:32:41,919 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:32:41,919 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:32:41,919 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-01 12:32:41,919 INFO L427 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:32:41,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:41,919 INFO L82 PathProgramCache]: Analyzing trace with hash -258853419, now seen corresponding path program 1 times [2020-07-01 12:32:41,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:41,920 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344725108] [2020-07-01 12:32:41,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:41,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:41,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:41,994 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344725108] [2020-07-01 12:32:41,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:32:41,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-01 12:32:41,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97271547] [2020-07-01 12:32:41,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-01 12:32:41,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:41,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-01 12:32:41,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-01 12:32:41,996 INFO L87 Difference]: Start difference. First operand 25 states and 36 transitions. Second operand 6 states. [2020-07-01 12:32:42,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:42,099 INFO L93 Difference]: Finished difference Result 27 states and 39 transitions. [2020-07-01 12:32:42,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-01 12:32:42,101 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2020-07-01 12:32:42,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:42,101 INFO L225 Difference]: With dead ends: 27 [2020-07-01 12:32:42,102 INFO L226 Difference]: Without dead ends: 26 [2020-07-01 12:32:42,102 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-07-01 12:32:42,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-01 12:32:42,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 19. [2020-07-01 12:32:42,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-01 12:32:42,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 28 transitions. [2020-07-01 12:32:42,106 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 28 transitions. Word has length 8 [2020-07-01 12:32:42,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:42,106 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 28 transitions. [2020-07-01 12:32:42,106 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-01 12:32:42,106 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 28 transitions. [2020-07-01 12:32:42,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-01 12:32:42,107 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:32:42,107 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:32:42,107 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-01 12:32:42,107 INFO L427 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:32:42,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:42,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1931186257, now seen corresponding path program 1 times [2020-07-01 12:32:42,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:42,108 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824590504] [2020-07-01 12:32:42,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:42,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:42,163 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:42,164 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824590504] [2020-07-01 12:32:42,164 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749588521] [2020-07-01 12:32:42,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:32:42,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:42,216 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 12:32:42,221 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:32:42,267 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:42,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 12:32:42,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2020-07-01 12:32:42,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236424172] [2020-07-01 12:32:42,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 12:32:42,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:42,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 12:32:42,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-07-01 12:32:42,269 INFO L87 Difference]: Start difference. First operand 19 states and 28 transitions. Second operand 5 states. [2020-07-01 12:32:42,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:42,349 INFO L93 Difference]: Finished difference Result 42 states and 63 transitions. [2020-07-01 12:32:42,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 12:32:42,349 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-07-01 12:32:42,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:42,350 INFO L225 Difference]: With dead ends: 42 [2020-07-01 12:32:42,350 INFO L226 Difference]: Without dead ends: 30 [2020-07-01 12:32:42,351 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-07-01 12:32:42,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-01 12:32:42,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2020-07-01 12:32:42,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-01 12:32:42,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2020-07-01 12:32:42,355 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 11 [2020-07-01 12:32:42,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:42,355 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2020-07-01 12:32:42,356 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 12:32:42,356 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2020-07-01 12:32:42,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-01 12:32:42,356 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:32:42,356 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:32:42,557 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-07-01 12:32:42,557 INFO L427 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:32:42,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:42,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1447641392, now seen corresponding path program 1 times [2020-07-01 12:32:42,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:42,558 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169023315] [2020-07-01 12:32:42,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:42,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:42,615 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:42,615 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169023315] [2020-07-01 12:32:42,615 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153386968] [2020-07-01 12:32:42,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:32:42,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:42,664 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 12:32:42,666 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:32:42,681 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:42,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:32:42,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2020-07-01 12:32:42,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41744861] [2020-07-01 12:32:42,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-01 12:32:42,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:42,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-01 12:32:42,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-01 12:32:42,683 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand 8 states. [2020-07-01 12:32:42,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:42,808 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2020-07-01 12:32:42,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-01 12:32:42,809 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2020-07-01 12:32:42,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:42,809 INFO L225 Difference]: With dead ends: 27 [2020-07-01 12:32:42,810 INFO L226 Difference]: Without dead ends: 26 [2020-07-01 12:32:42,810 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-07-01 12:32:42,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-01 12:32:42,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2020-07-01 12:32:42,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-01 12:32:42,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2020-07-01 12:32:42,814 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 11 [2020-07-01 12:32:42,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:42,815 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2020-07-01 12:32:42,815 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-01 12:32:42,815 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2020-07-01 12:32:42,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-01 12:32:42,815 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:32:42,815 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:32:43,016 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2020-07-01 12:32:43,016 INFO L427 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:32:43,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:43,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1447641391, now seen corresponding path program 1 times [2020-07-01 12:32:43,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:43,017 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600043881] [2020-07-01 12:32:43,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:43,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:43,094 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:43,094 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600043881] [2020-07-01 12:32:43,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:32:43,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-01 12:32:43,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103091564] [2020-07-01 12:32:43,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-01 12:32:43,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:43,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-01 12:32:43,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-01 12:32:43,096 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand 7 states. [2020-07-01 12:32:43,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:43,216 INFO L93 Difference]: Finished difference Result 54 states and 74 transitions. [2020-07-01 12:32:43,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-01 12:32:43,217 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2020-07-01 12:32:43,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:43,218 INFO L225 Difference]: With dead ends: 54 [2020-07-01 12:32:43,218 INFO L226 Difference]: Without dead ends: 43 [2020-07-01 12:32:43,218 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-07-01 12:32:43,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-01 12:32:43,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 26. [2020-07-01 12:32:43,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-01 12:32:43,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2020-07-01 12:32:43,223 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 11 [2020-07-01 12:32:43,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:43,223 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2020-07-01 12:32:43,223 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-01 12:32:43,223 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2020-07-01 12:32:43,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-01 12:32:43,224 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:32:43,224 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:32:43,224 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-01 12:32:43,224 INFO L427 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:32:43,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:43,225 INFO L82 PathProgramCache]: Analyzing trace with hash -2037181906, now seen corresponding path program 1 times [2020-07-01 12:32:43,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:43,225 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560301449] [2020-07-01 12:32:43,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:43,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:43,381 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:43,381 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560301449] [2020-07-01 12:32:43,381 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134102314] [2020-07-01 12:32:43,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:32:43,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:43,439 INFO L264 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 28 conjunts are in the unsatisfiable core [2020-07-01 12:32:43,440 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:32:43,511 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:43,512 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2020-07-01 12:32:43,512 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:32:43,534 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:43,535 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2020-07-01 12:32:43,535 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:32:43,587 INFO L619 ElimStorePlain]: treesize reduction 20, result has 68.3 percent of original size [2020-07-01 12:32:43,588 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2020-07-01 12:32:43,588 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:25 [2020-07-01 12:32:43,628 INFO L296 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-07-01 12:32:43,629 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:32:43,631 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:32:43,652 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-07-01 12:32:43,652 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:32:43,659 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-01 12:32:43,660 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:32:43,682 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:43,685 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2020-07-01 12:32:43,686 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:44 [2020-07-01 12:32:43,739 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:32:43,820 INFO L296 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 1] term [2020-07-01 12:32:43,821 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:32:43,859 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:43,860 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2020-07-01 12:32:43,861 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:32:43,862 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 12:32:43,891 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:43,899 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 12:32:43,901 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 7 [2020-07-01 12:32:43,901 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:32:43,925 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:43,928 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:32:43,930 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:32:43,932 INFO L539 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-07-01 12:32:43,932 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:68, output treesize:31 [2020-07-01 12:32:43,990 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:32:43,991 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:32:44,024 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:32:44,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:44,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:32:44,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2020-07-01 12:32:44,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919695590] [2020-07-01 12:32:44,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-01 12:32:44,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:44,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-01 12:32:44,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2020-07-01 12:32:44,056 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand 15 states. [2020-07-01 12:32:44,444 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2020-07-01 12:32:44,614 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2020-07-01 12:32:44,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:44,868 INFO L93 Difference]: Finished difference Result 33 states and 47 transitions. [2020-07-01 12:32:44,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-01 12:32:44,868 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 11 [2020-07-01 12:32:44,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:44,869 INFO L225 Difference]: With dead ends: 33 [2020-07-01 12:32:44,869 INFO L226 Difference]: Without dead ends: 32 [2020-07-01 12:32:44,870 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=125, Invalid=381, Unknown=0, NotChecked=0, Total=506 [2020-07-01 12:32:44,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-01 12:32:44,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2020-07-01 12:32:44,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-01 12:32:44,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2020-07-01 12:32:44,875 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 11 [2020-07-01 12:32:44,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:44,876 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2020-07-01 12:32:44,876 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-01 12:32:44,876 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2020-07-01 12:32:44,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-01 12:32:44,876 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:32:44,877 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:32:45,077 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-07-01 12:32:45,078 INFO L427 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:32:45,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:45,078 INFO L82 PathProgramCache]: Analyzing trace with hash 261271321, now seen corresponding path program 1 times [2020-07-01 12:32:45,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:45,078 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60294474] [2020-07-01 12:32:45,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:45,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:45,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:45,127 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60294474] [2020-07-01 12:32:45,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:32:45,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-01 12:32:45,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956235132] [2020-07-01 12:32:45,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-01 12:32:45,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:45,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-01 12:32:45,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-01 12:32:45,129 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand 7 states. [2020-07-01 12:32:45,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:45,232 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2020-07-01 12:32:45,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-01 12:32:45,232 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2020-07-01 12:32:45,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:45,233 INFO L225 Difference]: With dead ends: 45 [2020-07-01 12:32:45,233 INFO L226 Difference]: Without dead ends: 40 [2020-07-01 12:32:45,234 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-07-01 12:32:45,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-01 12:32:45,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2020-07-01 12:32:45,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-01 12:32:45,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 53 transitions. [2020-07-01 12:32:45,240 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 53 transitions. Word has length 12 [2020-07-01 12:32:45,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:45,241 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 53 transitions. [2020-07-01 12:32:45,241 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-01 12:32:45,241 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 53 transitions. [2020-07-01 12:32:45,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-01 12:32:45,241 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:32:45,242 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:32:45,242 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-07-01 12:32:45,242 INFO L427 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:32:45,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:45,242 INFO L82 PathProgramCache]: Analyzing trace with hash 261271352, now seen corresponding path program 1 times [2020-07-01 12:32:45,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:45,243 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387712866] [2020-07-01 12:32:45,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:45,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:45,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:45,276 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387712866] [2020-07-01 12:32:45,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:32:45,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-01 12:32:45,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274509839] [2020-07-01 12:32:45,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 12:32:45,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:45,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 12:32:45,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:32:45,278 INFO L87 Difference]: Start difference. First operand 38 states and 53 transitions. Second operand 5 states. [2020-07-01 12:32:45,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:45,332 INFO L93 Difference]: Finished difference Result 47 states and 66 transitions. [2020-07-01 12:32:45,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 12:32:45,333 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-07-01 12:32:45,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:45,333 INFO L225 Difference]: With dead ends: 47 [2020-07-01 12:32:45,333 INFO L226 Difference]: Without dead ends: 31 [2020-07-01 12:32:45,334 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-01 12:32:45,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-01 12:32:45,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-07-01 12:32:45,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-01 12:32:45,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2020-07-01 12:32:45,339 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 40 transitions. Word has length 12 [2020-07-01 12:32:45,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:45,339 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 40 transitions. [2020-07-01 12:32:45,339 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 12:32:45,339 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 40 transitions. [2020-07-01 12:32:45,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-01 12:32:45,340 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:32:45,340 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:32:45,340 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-07-01 12:32:45,340 INFO L427 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:32:45,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:45,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1928707048, now seen corresponding path program 1 times [2020-07-01 12:32:45,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:45,341 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793302862] [2020-07-01 12:32:45,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:45,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:45,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:45,381 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793302862] [2020-07-01 12:32:45,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:32:45,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-01 12:32:45,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043400665] [2020-07-01 12:32:45,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-01 12:32:45,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:45,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-01 12:32:45,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-01 12:32:45,382 INFO L87 Difference]: Start difference. First operand 31 states and 40 transitions. Second operand 6 states. [2020-07-01 12:32:45,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:45,469 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2020-07-01 12:32:45,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-01 12:32:45,470 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-07-01 12:32:45,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:45,470 INFO L225 Difference]: With dead ends: 31 [2020-07-01 12:32:45,470 INFO L226 Difference]: Without dead ends: 30 [2020-07-01 12:32:45,471 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-07-01 12:32:45,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-01 12:32:45,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-01 12:32:45,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-01 12:32:45,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2020-07-01 12:32:45,476 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 12 [2020-07-01 12:32:45,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:45,476 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2020-07-01 12:32:45,476 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-01 12:32:45,477 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2020-07-01 12:32:45,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-01 12:32:45,477 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:32:45,477 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:32:45,477 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-07-01 12:32:45,478 INFO L427 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:32:45,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:45,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1928707046, now seen corresponding path program 1 times [2020-07-01 12:32:45,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:45,478 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136130695] [2020-07-01 12:32:45,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:45,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:45,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:45,536 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136130695] [2020-07-01 12:32:45,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:32:45,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-01 12:32:45,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911231915] [2020-07-01 12:32:45,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-01 12:32:45,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:45,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-01 12:32:45,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-01 12:32:45,538 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand 8 states. [2020-07-01 12:32:45,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:45,665 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2020-07-01 12:32:45,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-01 12:32:45,666 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2020-07-01 12:32:45,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:45,666 INFO L225 Difference]: With dead ends: 31 [2020-07-01 12:32:45,666 INFO L226 Difference]: Without dead ends: 30 [2020-07-01 12:32:45,667 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2020-07-01 12:32:45,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-01 12:32:45,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-01 12:32:45,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-01 12:32:45,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2020-07-01 12:32:45,672 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 12 [2020-07-01 12:32:45,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:45,672 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2020-07-01 12:32:45,672 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-01 12:32:45,673 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2020-07-01 12:32:45,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-01 12:32:45,673 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:32:45,673 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:32:45,673 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-07-01 12:32:45,673 INFO L427 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:32:45,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:45,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1928707045, now seen corresponding path program 1 times [2020-07-01 12:32:45,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:45,674 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359387928] [2020-07-01 12:32:45,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:45,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:45,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:45,767 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359387928] [2020-07-01 12:32:45,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:32:45,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-01 12:32:45,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082213065] [2020-07-01 12:32:45,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-01 12:32:45,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:45,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-01 12:32:45,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-07-01 12:32:45,769 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 9 states. [2020-07-01 12:32:45,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:45,953 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2020-07-01 12:32:45,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-01 12:32:45,954 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2020-07-01 12:32:45,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:45,954 INFO L225 Difference]: With dead ends: 32 [2020-07-01 12:32:45,955 INFO L226 Difference]: Without dead ends: 31 [2020-07-01 12:32:45,955 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2020-07-01 12:32:45,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-01 12:32:45,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-07-01 12:32:45,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-01 12:32:45,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2020-07-01 12:32:45,960 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 12 [2020-07-01 12:32:45,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:45,961 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2020-07-01 12:32:45,961 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-01 12:32:45,961 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2020-07-01 12:32:45,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-01 12:32:45,962 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:32:45,962 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:32:45,962 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-07-01 12:32:45,962 INFO L427 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:32:45,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:45,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1271869273, now seen corresponding path program 1 times [2020-07-01 12:32:45,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:45,963 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323794777] [2020-07-01 12:32:45,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:45,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:46,018 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:46,018 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323794777] [2020-07-01 12:32:46,018 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907994187] [2020-07-01 12:32:46,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:32:46,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:46,074 INFO L264 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 12:32:46,075 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:32:46,087 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:46,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:32:46,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2020-07-01 12:32:46,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249084001] [2020-07-01 12:32:46,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-01 12:32:46,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:46,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-01 12:32:46,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-01 12:32:46,089 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand 8 states. [2020-07-01 12:32:46,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:46,206 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2020-07-01 12:32:46,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-01 12:32:46,206 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2020-07-01 12:32:46,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:46,207 INFO L225 Difference]: With dead ends: 32 [2020-07-01 12:32:46,207 INFO L226 Difference]: Without dead ends: 31 [2020-07-01 12:32:46,208 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-07-01 12:32:46,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-01 12:32:46,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-07-01 12:32:46,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-01 12:32:46,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2020-07-01 12:32:46,213 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 12 [2020-07-01 12:32:46,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:46,213 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2020-07-01 12:32:46,213 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-01 12:32:46,213 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2020-07-01 12:32:46,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-01 12:32:46,214 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:32:46,214 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:32:46,414 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:32:46,415 INFO L427 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:32:46,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:46,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1271869274, now seen corresponding path program 1 times [2020-07-01 12:32:46,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:46,416 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907475098] [2020-07-01 12:32:46,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:46,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:46,507 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:46,507 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907475098] [2020-07-01 12:32:46,507 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073026584] [2020-07-01 12:32:46,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:32:46,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:46,562 INFO L264 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 29 conjunts are in the unsatisfiable core [2020-07-01 12:32:46,563 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:32:46,568 INFO L435 ElimStorePlain]: Different costs {0=[|v_#length_15|], 1=[|v_#valid_27|]} [2020-07-01 12:32:46,572 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 12:32:46,573 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-07-01 12:32:46,573 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:32:46,581 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:46,588 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-01 12:32:46,588 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:32:46,595 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:46,596 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:32:46,596 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2020-07-01 12:32:46,658 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:46,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:32:46,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2020-07-01 12:32:46,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944657622] [2020-07-01 12:32:46,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-01 12:32:46,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:46,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-01 12:32:46,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-07-01 12:32:46,660 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand 11 states. [2020-07-01 12:32:46,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:46,893 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2020-07-01 12:32:46,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-01 12:32:46,894 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 12 [2020-07-01 12:32:46,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:46,894 INFO L225 Difference]: With dead ends: 40 [2020-07-01 12:32:46,895 INFO L226 Difference]: Without dead ends: 39 [2020-07-01 12:32:46,895 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2020-07-01 12:32:46,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-07-01 12:32:46,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2020-07-01 12:32:46,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-01 12:32:46,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2020-07-01 12:32:46,900 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 12 [2020-07-01 12:32:46,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:46,900 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2020-07-01 12:32:46,900 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-01 12:32:46,901 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2020-07-01 12:32:46,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-01 12:32:46,901 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:32:46,901 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:32:47,102 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2020-07-01 12:32:47,102 INFO L427 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:32:47,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:47,102 INFO L82 PathProgramCache]: Analyzing trace with hash -38844345, now seen corresponding path program 1 times [2020-07-01 12:32:47,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:47,103 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303565100] [2020-07-01 12:32:47,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:47,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:47,227 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-01 12:32:47,227 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303565100] [2020-07-01 12:32:47,227 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053451697] [2020-07-01 12:32:47,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:32:47,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:47,285 INFO L264 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 65 conjunts are in the unsatisfiable core [2020-07-01 12:32:47,287 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:32:47,304 INFO L435 ElimStorePlain]: Different costs {0=[|v_#length_16|], 1=[|v_#valid_28|]} [2020-07-01 12:32:47,308 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 12:32:47,309 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-07-01 12:32:47,309 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:32:47,326 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:47,331 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-01 12:32:47,332 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:32:47,342 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:47,342 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:32:47,343 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:24 [2020-07-01 12:32:47,624 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:47,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:32:47,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2020-07-01 12:32:47,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861754702] [2020-07-01 12:32:47,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-01 12:32:47,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:47,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-01 12:32:47,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2020-07-01 12:32:47,626 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 21 states. [2020-07-01 12:32:48,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:48,826 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2020-07-01 12:32:48,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-07-01 12:32:48,830 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 15 [2020-07-01 12:32:48,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:48,831 INFO L225 Difference]: With dead ends: 43 [2020-07-01 12:32:48,831 INFO L226 Difference]: Without dead ends: 42 [2020-07-01 12:32:48,832 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=295, Invalid=1345, Unknown=0, NotChecked=0, Total=1640 [2020-07-01 12:32:48,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-01 12:32:48,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2020-07-01 12:32:48,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-01 12:32:48,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2020-07-01 12:32:48,836 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 15 [2020-07-01 12:32:48,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:48,837 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2020-07-01 12:32:48,837 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-01 12:32:48,837 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2020-07-01 12:32:48,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-01 12:32:48,837 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:32:48,838 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:32:49,038 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:32:49,039 INFO L427 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:32:49,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:49,039 INFO L82 PathProgramCache]: Analyzing trace with hash -38844314, now seen corresponding path program 1 times [2020-07-01 12:32:49,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:49,039 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580980677] [2020-07-01 12:32:49,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:49,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:49,071 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:49,071 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580980677] [2020-07-01 12:32:49,072 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778895935] [2020-07-01 12:32:49,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:32:49,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:49,119 INFO L264 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 12:32:49,120 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:32:49,123 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:49,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:32:49,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2020-07-01 12:32:49,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191050437] [2020-07-01 12:32:49,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 12:32:49,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:49,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 12:32:49,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:32:49,125 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 5 states. [2020-07-01 12:32:49,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:49,169 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2020-07-01 12:32:49,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 12:32:49,169 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-07-01 12:32:49,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:49,170 INFO L225 Difference]: With dead ends: 33 [2020-07-01 12:32:49,170 INFO L226 Difference]: Without dead ends: 16 [2020-07-01 12:32:49,170 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-01 12:32:49,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-01 12:32:49,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-07-01 12:32:49,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-01 12:32:49,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2020-07-01 12:32:49,173 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 15 [2020-07-01 12:32:49,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:49,173 INFO L479 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2020-07-01 12:32:49,173 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 12:32:49,173 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2020-07-01 12:32:49,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-01 12:32:49,174 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:32:49,174 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2020-07-01 12:32:49,374 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2020-07-01 12:32:49,375 INFO L427 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:32:49,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:49,375 INFO L82 PathProgramCache]: Analyzing trace with hash 54783625, now seen corresponding path program 2 times [2020-07-01 12:32:49,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:49,376 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965137407] [2020-07-01 12:32:49,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:49,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:49,675 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:49,675 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965137407] [2020-07-01 12:32:49,676 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628946846] [2020-07-01 12:32:49,676 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:32:49,725 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-01 12:32:49,725 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 12:32:49,727 INFO L264 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 42 conjunts are in the unsatisfiable core [2020-07-01 12:32:49,729 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:32:49,732 INFO L435 ElimStorePlain]: Different costs {0=[|v_#length_17|], 1=[|v_#valid_29|]} [2020-07-01 12:32:49,736 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 12:32:49,737 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-07-01 12:32:49,737 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:32:49,746 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:49,750 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-01 12:32:49,751 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:32:49,760 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:49,760 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:32:49,760 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 [2020-07-01 12:32:49,798 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-07-01 12:32:49,799 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:32:49,804 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:49,805 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:32:49,805 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2020-07-01 12:32:49,849 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-07-01 12:32:49,849 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:32:49,855 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:49,855 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:32:49,855 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2020-07-01 12:32:49,904 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:49,904 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2020-07-01 12:32:49,916 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:32:49,916 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 12:32:49,925 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:49,926 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:32:49,927 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-07-01 12:32:49,927 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2020-07-01 12:32:49,961 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:32:49,963 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:49,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:32:49,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2020-07-01 12:32:49,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839858964] [2020-07-01 12:32:49,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-01 12:32:49,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:49,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-01 12:32:49,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2020-07-01 12:32:49,965 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 17 states. [2020-07-01 12:32:50,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:50,706 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2020-07-01 12:32:50,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-01 12:32:50,706 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 15 [2020-07-01 12:32:50,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:50,707 INFO L225 Difference]: With dead ends: 18 [2020-07-01 12:32:50,707 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 12:32:50,707 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=163, Invalid=539, Unknown=0, NotChecked=0, Total=702 [2020-07-01 12:32:50,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 12:32:50,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 12:32:50,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 12:32:50,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 12:32:50,708 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2020-07-01 12:32:50,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:50,708 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:32:50,708 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-01 12:32:50,708 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 12:32:50,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 12:32:50,909 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2020-07-01 12:32:50,912 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 12:32:51,789 WARN L192 SmtUtils]: Spent 696.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 75 [2020-07-01 12:32:52,243 WARN L192 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 65 [2020-07-01 12:32:52,247 INFO L268 CegarLoopResult]: For program point L31(lines 31 33) no Hoare annotation was computed. [2020-07-01 12:32:52,247 INFO L268 CegarLoopResult]: For program point L31-2(lines 28 42) no Hoare annotation was computed. [2020-07-01 12:32:52,247 INFO L268 CegarLoopResult]: For program point L21(line 21) no Hoare annotation was computed. [2020-07-01 12:32:52,247 INFO L268 CegarLoopResult]: For program point L34-1(lines 34 36) no Hoare annotation was computed. [2020-07-01 12:32:52,247 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 12:32:52,247 INFO L268 CegarLoopResult]: For program point L20-1(lines 20 21) no Hoare annotation was computed. [2020-07-01 12:32:52,248 INFO L264 CegarLoopResult]: At program point L20-3(lines 20 21) the Hoare annotation is: (let ((.cse0 (<= 0 ULTIMATE.start_cstrncpy_~n2~0)) (.cse1 (= ULTIMATE.start_main_~n~0 (select |#length| ULTIMATE.start_main_~nondetArea~0.base))) (.cse2 (<= 1 ULTIMATE.start_main_~n~0)) (.cse3 (or (< 1 ULTIMATE.start_main_~length~0) (= 1 (+ ULTIMATE.start_main_~length~0 ULTIMATE.start_main_~nondetString~0.offset)))) (.cse4 (= 1 (select |#valid| ULTIMATE.start_cstrncpy_~dst~0.base))) (.cse5 (= ULTIMATE.start_main_~length~0 (select |#length| ULTIMATE.start_main_~nondetString~0.base))) (.cse6 (<= 1 |#StackHeapBarrier|)) (.cse7 (<= 1 ULTIMATE.start_cstrncpy_~src~0.offset)) (.cse8 (<= 0 ULTIMATE.start_cstrncpy_~n)) (.cse9 (= (select |#valid| ULTIMATE.start_main_~nondetArea~0.base) 1)) (.cse10 (= 1 (select |#valid| ULTIMATE.start_cstrncpy_~src~0.base))) (.cse11 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString~0.base))) (.cse12 (= 0 ULTIMATE.start_main_~nondetArea~0.offset)) (.cse13 (= 0 ULTIMATE.start_main_~nondetString~0.offset))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_cstrncpy_~n2~0 0) .cse8 (<= ULTIMATE.start_main_~n~0 1) .cse9 .cse10 .cse11 (<= ULTIMATE.start_cstrncpy_~n 0) .cse12 .cse13) (and .cse0 .cse1 (not (= ULTIMATE.start_main_~nondetString~0.base ULTIMATE.start_main_~nondetArea~0.base)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 1 ULTIMATE.start_cstrncpy_~us~0.offset) .cse8 (<= 1 ULTIMATE.start_cstrncpy_~dst~0.offset) .cse9 .cse10 (= (select |#valid| ULTIMATE.start_cstrncpy_~us~0.base) 1) .cse11 (<= (+ ULTIMATE.start_cstrncpy_~n ULTIMATE.start_cstrncpy_~dst~0.offset) (select |#length| ULTIMATE.start_cstrncpy_~dst~0.base)) .cse12 .cse13 (<= (+ ULTIMATE.start_cstrncpy_~us~0.offset ULTIMATE.start_cstrncpy_~n2~0) (select |#length| ULTIMATE.start_cstrncpy_~us~0.base))))) [2020-07-01 12:32:52,248 INFO L268 CegarLoopResult]: For program point L14(line 14) no Hoare annotation was computed. [2020-07-01 12:32:52,248 INFO L268 CegarLoopResult]: For program point L14-1(line 14) no Hoare annotation was computed. [2020-07-01 12:32:52,248 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. [2020-07-01 12:32:52,248 INFO L268 CegarLoopResult]: For program point L14-2(lines 14 23) no Hoare annotation was computed. [2020-07-01 12:32:52,248 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:32:52,249 INFO L264 CegarLoopResult]: At program point L12-2(lines 12 24) the Hoare annotation is: (let ((.cse21 (= ULTIMATE.start_main_~nondetString~0.base ULTIMATE.start_main_~nondetArea~0.base)) (.cse18 (select |#length| ULTIMATE.start_cstrncpy_~dst~0.base)) (.cse20 (select |#length| ULTIMATE.start_cstrncpy_~src~0.base))) (let ((.cse8 (<= ULTIMATE.start_main_~n~0 1)) (.cse3 (= 0 ULTIMATE.start_cstrncpy_~src~0.offset)) (.cse4 (<= 1 .cse20)) (.cse10 (= 0 ULTIMATE.start_cstrncpy_~dst~0.offset)) (.cse14 (<= 1 .cse18)) (.cse16 (not .cse21)) (.cse0 (= ULTIMATE.start_main_~n~0 (select |#length| ULTIMATE.start_main_~nondetArea~0.base))) (.cse1 (<= 1 ULTIMATE.start_main_~n~0)) (.cse2 (<= 1 ULTIMATE.start_main_~length~0)) (.cse5 (= 1 (select |#valid| ULTIMATE.start_cstrncpy_~dst~0.base))) (.cse6 (= ULTIMATE.start_main_~length~0 (select |#length| ULTIMATE.start_main_~nondetString~0.base))) (.cse7 (<= 1 |#StackHeapBarrier|)) (.cse17 (= 0 (select (select |#memory_int| ULTIMATE.start_cstrncpy_~src~0.base) (+ .cse20 (- 1))))) (.cse9 (= 1 (select |#valid| ULTIMATE.start_cstrncpy_~src~0.base))) (.cse11 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString~0.base))) (.cse12 (or .cse21 (= (select |#valid| ULTIMATE.start_main_~nondetArea~0.base) 1))) (.cse13 (= 0 ULTIMATE.start_main_~nondetArea~0.offset)) (.cse15 (= 0 ULTIMATE.start_main_~nondetString~0.offset)) (.cse19 (not (= ULTIMATE.start_cstrncpy_~src~0.base ULTIMATE.start_cstrncpy_~dst~0.base)))) (or (and .cse0 (<= ULTIMATE.start_cstrncpy_~n 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (exists ((ULTIMATE.start_main_~nondetString~0.offset Int)) (and (<= ULTIMATE.start_main_~nondetString~0.offset 0) (<= ULTIMATE.start_cstrncpy_~src~0.offset ULTIMATE.start_main_~nondetString~0.offset) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrncpy_~src~0.base) (+ (select |#length| ULTIMATE.start_cstrncpy_~src~0.base) ULTIMATE.start_main_~nondetString~0.offset (- 1)))))) .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 (<= ULTIMATE.start_cstrncpy_~n 0) .cse13 .cse15) (and .cse0 .cse16 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse17 (<= ULTIMATE.start_cstrncpy_~n .cse18) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19 .cse15) (and .cse16 .cse0 .cse1 .cse2 (<= (+ ULTIMATE.start_cstrncpy_~src~0.offset 1) .cse20) .cse5 .cse6 .cse7 (<= 1 ULTIMATE.start_cstrncpy_~src~0.offset) .cse17 (<= 0 ULTIMATE.start_cstrncpy_~n) (<= 1 ULTIMATE.start_cstrncpy_~dst~0.offset) .cse9 .cse11 .cse12 (<= (+ ULTIMATE.start_cstrncpy_~n ULTIMATE.start_cstrncpy_~dst~0.offset) .cse18) .cse13 .cse15 .cse19)))) [2020-07-01 12:32:52,249 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. [2020-07-01 12:32:52,249 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:32:52,249 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 39) no Hoare annotation was computed. [2020-07-01 12:32:52,249 INFO L268 CegarLoopResult]: For program point L39(line 39) no Hoare annotation was computed. [2020-07-01 12:32:52,249 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:32:52,249 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:32:52,249 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 39) no Hoare annotation was computed. [2020-07-01 12:32:52,252 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 12:32:52,260 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:32:52,261 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:32:52,261 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:32:52,267 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,267 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,268 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,268 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:32:52,268 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:52,269 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,269 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,269 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,269 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,269 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:32:52,270 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,270 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,270 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,271 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:32:52,271 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:52,271 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,271 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,272 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,272 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,272 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,272 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,273 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:32:52,273 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:52,273 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,273 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,282 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:32:52,282 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:32:52,283 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:32:52,286 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,286 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,286 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,287 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:32:52,287 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:52,287 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,287 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,288 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,288 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,288 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:32:52,288 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,289 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,289 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,289 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:32:52,289 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:52,290 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,290 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,290 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,290 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,290 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,291 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,291 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:32:52,291 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:52,291 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,292 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,296 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,296 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,296 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:32:52,296 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,297 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,297 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:32:52,297 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,297 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,299 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,300 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,300 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:32:52,300 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,300 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,301 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:32:52,301 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,301 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:32:52 BasicIcfg [2020-07-01 12:32:52,303 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 12:32:52,304 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 12:32:52,304 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 12:32:52,308 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 12:32:52,308 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:32:52,308 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 12:32:38" (1/5) ... [2020-07-01 12:32:52,309 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@29cc7d63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:32:52, skipping insertion in model container [2020-07-01 12:32:52,309 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:32:52,309 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:32:38" (2/5) ... [2020-07-01 12:32:52,309 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@29cc7d63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:32:52, skipping insertion in model container [2020-07-01 12:32:52,310 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:32:52,310 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:32:39" (3/5) ... [2020-07-01 12:32:52,310 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@29cc7d63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:32:52, skipping insertion in model container [2020-07-01 12:32:52,310 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:32:52,310 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:32:39" (4/5) ... [2020-07-01 12:32:52,310 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@29cc7d63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:32:52, skipping insertion in model container [2020-07-01 12:32:52,310 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:32:52,312 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:32:52" (5/5) ... [2020-07-01 12:32:52,314 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:32:52,338 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 12:32:52,339 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 12:32:52,339 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:32:52,339 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:32:52,339 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:32:52,339 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 12:32:52,339 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:32:52,339 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 12:32:52,342 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2020-07-01 12:32:52,347 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-07-01 12:32:52,347 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:32:52,347 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:32:52,351 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-01 12:32:52,351 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-01 12:32:52,351 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 12:32:52,351 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2020-07-01 12:32:52,352 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-07-01 12:32:52,352 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:32:52,352 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:32:52,353 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-01 12:32:52,353 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-01 12:32:52,358 INFO L794 eck$LassoCheckResult]: Stem: 16#ULTIMATE.startENTRYtrue [138] ULTIMATE.startENTRY-->L31: Formula: (and (= 0 |v_#NULL.base_2|) (< 0 |v_#StackHeapBarrier_3|) (= 0 |v_#NULL.offset_2|) (= |v_#valid_17| (store |v_#valid_18| 0 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_5|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_5|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_4, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_6, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_4, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_6|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret10.base=|v_ULTIMATE.start_main_#t~ret10.base_4|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_5|, #valid=|v_#valid_17|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_5|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_10, ULTIMATE.start_main_#t~ret10.offset=|v_ULTIMATE.start_main_#t~ret10.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~nondetArea~0.base, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, #NULL.base, ULTIMATE.start_main_#t~ret10.base, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_~length~0, ULTIMATE.start_main_#t~ret10.offset] 12#L31true [100] L31-->L31-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 8#L31-2true [101] L31-2-->L34-1: Formula: (>= v_ULTIMATE.start_main_~n~0_6 1) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[] 18#L34-1true [117] L34-1-->L39: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc8.base_2| 1))) (and (> 0 |v_ULTIMATE.start_main_#t~malloc9.base_2|) (= v_ULTIMATE.start_main_~nondetString~0.base_2 |v_ULTIMATE.start_main_#t~malloc9.base_2|) (= v_ULTIMATE.start_main_~nondetArea~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc9.offset_2|) (= (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc8.base_2| v_ULTIMATE.start_main_~n~0_7) |v_ULTIMATE.start_main_#t~malloc9.base_2| v_ULTIMATE.start_main_~length~0_7) |v_#length_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc8.base_2|)) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc9.base_2| 1) |v_#valid_3|) (= v_ULTIMATE.start_main_~nondetString~0.offset_2 |v_ULTIMATE.start_main_#t~malloc9.offset_2|) (> 0 |v_ULTIMATE.start_main_#t~malloc8.base_2|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc8.base_2|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc9.base_2|)) (= v_ULTIMATE.start_main_~nondetArea~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_2|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc9.base_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc8.offset_2|))) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_2|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_2|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_2, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_2, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_2, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_2, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_2|, #valid=|v_#valid_3|, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_2|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_~nondetArea~0.base, #length, ULTIMATE.start_main_#t~malloc9.offset] 6#L39true [139] L39-->L12-2: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length~0_11))) (and (= v_ULTIMATE.start_cstrncpy_~s2.offset_3 v_ULTIMATE.start_cstrncpy_~src~0.offset_5) (= v_ULTIMATE.start_cstrncpy_~s1.base_4 |v_ULTIMATE.start_cstrncpy_#in~s1.base_2|) (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= v_ULTIMATE.start_cstrncpy_~s1.offset_4 |v_ULTIMATE.start_cstrncpy_#in~s1.offset_2|) (= v_ULTIMATE.start_cstrncpy_~s2.base_3 |v_ULTIMATE.start_cstrncpy_#in~s2.base_2|) (= v_ULTIMATE.start_cstrncpy_~n_7 |v_ULTIMATE.start_cstrncpy_#in~n_2|) (= |v_ULTIMATE.start_cstrncpy_#in~s2.offset_2| v_ULTIMATE.start_main_~nondetString~0.offset_7) (= v_ULTIMATE.start_cstrncpy_~s2.base_3 v_ULTIMATE.start_cstrncpy_~src~0.base_5) (= |v_ULTIMATE.start_cstrncpy_#in~s1.offset_2| v_ULTIMATE.start_main_~nondetArea~0.offset_5) (= v_ULTIMATE.start_cstrncpy_~s1.offset_4 v_ULTIMATE.start_cstrncpy_~dst~0.offset_6) (<= 1 .cse0) (= v_ULTIMATE.start_cstrncpy_~s1.base_4 v_ULTIMATE.start_cstrncpy_~dst~0.base_6) (= |v_ULTIMATE.start_cstrncpy_#in~s1.base_2| v_ULTIMATE.start_main_~nondetArea~0.base_5) (<= .cse0 (select |v_#length_12| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= v_ULTIMATE.start_main_~nondetString~0.base_8 |v_ULTIMATE.start_cstrncpy_#in~s2.base_2|) (= v_ULTIMATE.start_cstrncpy_~s2.offset_3 |v_ULTIMATE.start_cstrncpy_#in~s2.offset_2|) (= |v_ULTIMATE.start_cstrncpy_#in~n_2| v_ULTIMATE.start_main_~n~0_10) (= (store |v_#memory_int_9| v_ULTIMATE.start_main_~nondetString~0.base_8 (store (select |v_#memory_int_9| v_ULTIMATE.start_main_~nondetString~0.base_8) (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length~0_11 (- 1)) 0)) |v_#memory_int_8|))) InVars {ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_5, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, #valid=|v_#valid_19|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_10, #memory_int=|v_#memory_int_9|, #length=|v_#length_12|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} OutVars{ULTIMATE.start_cstrncpy_#in~s2.base=|v_ULTIMATE.start_cstrncpy_#in~s2.base_2|, ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_8|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_5, ULTIMATE.start_cstrncpy_~dst~0.base=v_ULTIMATE.start_cstrncpy_~dst~0.base_6, ULTIMATE.start_cstrncpy_#in~s1.base=|v_ULTIMATE.start_cstrncpy_#in~s1.base_2|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, ULTIMATE.start_cstrncpy_~us~0.base=v_ULTIMATE.start_cstrncpy_~us~0.base_6, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_8|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, ULTIMATE.start_cstrncpy_~dst~0.offset=v_ULTIMATE.start_cstrncpy_~dst~0.offset_6, ULTIMATE.start_cstrncpy_~us~0.offset=v_ULTIMATE.start_cstrncpy_~us~0.offset_6, ULTIMATE.start_cstrncpy_#res.base=|v_ULTIMATE.start_cstrncpy_#res.base_4|, ULTIMATE.start_cstrncpy_~s1.offset=v_ULTIMATE.start_cstrncpy_~s1.offset_4, #length=|v_#length_12|, ULTIMATE.start_cstrncpy_#in~n=|v_ULTIMATE.start_cstrncpy_#in~n_2|, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_7, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_7|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_10, ULTIMATE.start_cstrncpy_~src~0.base=v_ULTIMATE.start_cstrncpy_~src~0.base_5, ULTIMATE.start_cstrncpy_~s1.base=v_ULTIMATE.start_cstrncpy_~s1.base_4, ULTIMATE.start_cstrncpy_#in~s2.offset=|v_ULTIMATE.start_cstrncpy_#in~s2.offset_2|, ULTIMATE.start_cstrncpy_#res.offset=|v_ULTIMATE.start_cstrncpy_#res.offset_4|, ULTIMATE.start_cstrncpy_~n2~0=v_ULTIMATE.start_cstrncpy_~n2~0_6, ULTIMATE.start_cstrncpy_#t~post4=|v_ULTIMATE.start_cstrncpy_#t~post4_7|, ULTIMATE.start_cstrncpy_~s2.base=v_ULTIMATE.start_cstrncpy_~s2.base_3, ULTIMATE.start_cstrncpy_#in~s1.offset=|v_ULTIMATE.start_cstrncpy_#in~s1.offset_2|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_8|, ULTIMATE.start_cstrncpy_#t~post5.offset=|v_ULTIMATE.start_cstrncpy_#t~post5.offset_6|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, ULTIMATE.start_cstrncpy_#t~post5.base=|v_ULTIMATE.start_cstrncpy_#t~post5.base_7|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrncpy_~src~0.offset=v_ULTIMATE.start_cstrncpy_~src~0.offset_5, ULTIMATE.start_cstrncpy_~s2.offset=v_ULTIMATE.start_cstrncpy_~s2.offset_3, ULTIMATE.start_cstrncpy_#t~post0=|v_ULTIMATE.start_cstrncpy_#t~post0_4|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#in~s2.base, ULTIMATE.start_cstrncpy_#t~mem3, ULTIMATE.start_cstrncpy_~dst~0.base, ULTIMATE.start_cstrncpy_#in~s1.base, ULTIMATE.start_cstrncpy_~us~0.base, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_~dst~0.offset, ULTIMATE.start_cstrncpy_~us~0.offset, ULTIMATE.start_cstrncpy_#res.base, ULTIMATE.start_cstrncpy_~s1.offset, ULTIMATE.start_cstrncpy_#in~n, ULTIMATE.start_cstrncpy_~n, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_~src~0.base, ULTIMATE.start_cstrncpy_~s1.base, ULTIMATE.start_cstrncpy_#in~s2.offset, ULTIMATE.start_cstrncpy_#res.offset, ULTIMATE.start_cstrncpy_~n2~0, ULTIMATE.start_cstrncpy_#t~post4, ULTIMATE.start_cstrncpy_~s2.base, ULTIMATE.start_cstrncpy_#in~s1.offset, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_#t~post5.offset, ULTIMATE.start_cstrncpy_#t~post5.base, #memory_int, ULTIMATE.start_cstrncpy_~src~0.offset, ULTIMATE.start_cstrncpy_~s2.offset, ULTIMATE.start_cstrncpy_#t~post0, ULTIMATE.start_cstrncpy_#t~post2.offset] 14#L12-2true [2020-07-01 12:32:52,358 INFO L796 eck$LassoCheckResult]: Loop: 14#L12-2true [75] L12-2-->L14: Formula: (and (= |v_ULTIMATE.start_cstrncpy_#t~post1.base_2| v_ULTIMATE.start_cstrncpy_~dst~0.base_4) (= v_ULTIMATE.start_cstrncpy_~dst~0.offset_3 (+ |v_ULTIMATE.start_cstrncpy_#t~post1.offset_2| 1)) (= |v_ULTIMATE.start_cstrncpy_#t~post1.offset_2| v_ULTIMATE.start_cstrncpy_~dst~0.offset_4) (= v_ULTIMATE.start_cstrncpy_~src~0.offset_3 (+ |v_ULTIMATE.start_cstrncpy_#t~post2.offset_2| 1)) (= v_ULTIMATE.start_cstrncpy_~dst~0.base_3 |v_ULTIMATE.start_cstrncpy_#t~post1.base_2|) (= |v_ULTIMATE.start_cstrncpy_#t~post2.offset_2| v_ULTIMATE.start_cstrncpy_~src~0.offset_4) (= v_ULTIMATE.start_cstrncpy_~n_5 (+ v_ULTIMATE.start_cstrncpy_~n_4 1)) (= v_ULTIMATE.start_cstrncpy_~src~0.base_3 |v_ULTIMATE.start_cstrncpy_#t~post2.base_2|) (= |v_ULTIMATE.start_cstrncpy_#t~post2.base_2| v_ULTIMATE.start_cstrncpy_~src~0.base_4) (< 0 v_ULTIMATE.start_cstrncpy_~n_5)) InVars {ULTIMATE.start_cstrncpy_~src~0.base=v_ULTIMATE.start_cstrncpy_~src~0.base_4, ULTIMATE.start_cstrncpy_~src~0.offset=v_ULTIMATE.start_cstrncpy_~src~0.offset_4, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_5, ULTIMATE.start_cstrncpy_~dst~0.offset=v_ULTIMATE.start_cstrncpy_~dst~0.offset_4, ULTIMATE.start_cstrncpy_~dst~0.base=v_ULTIMATE.start_cstrncpy_~dst~0.base_4} OutVars{ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_4, ULTIMATE.start_cstrncpy_~dst~0.base=v_ULTIMATE.start_cstrncpy_~dst~0.base_3, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_2|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_2|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_2|, ULTIMATE.start_cstrncpy_~src~0.base=v_ULTIMATE.start_cstrncpy_~src~0.base_3, ULTIMATE.start_cstrncpy_~src~0.offset=v_ULTIMATE.start_cstrncpy_~src~0.offset_3, ULTIMATE.start_cstrncpy_~dst~0.offset=v_ULTIMATE.start_cstrncpy_~dst~0.offset_3, ULTIMATE.start_cstrncpy_#t~post0=|v_ULTIMATE.start_cstrncpy_#t~post0_2|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~n, ULTIMATE.start_cstrncpy_~dst~0.base, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_~src~0.base, ULTIMATE.start_cstrncpy_~src~0.offset, ULTIMATE.start_cstrncpy_~dst~0.offset, ULTIMATE.start_cstrncpy_#t~post0, ULTIMATE.start_cstrncpy_#t~post2.offset] 22#L14true [86] L14-->L14-1: Formula: (and (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3| 1) (select |v_#length_6| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|)) (= (select |v_#valid_8| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|) 1) (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|) (= |v_ULTIMATE.start_cstrncpy_#t~mem3_2| (select (select |v_#memory_int_3| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|) |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|))) InVars {#memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_3|, #valid=|v_#valid_8|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_2|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~mem3] 21#L14-1true [82] L14-1-->L14-2: Formula: (and (= (store |v_#memory_int_5| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3| (store (select |v_#memory_int_5| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|) |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3| |v_ULTIMATE.start_cstrncpy_#t~mem3_3|)) |v_#memory_int_4|) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3| 1) (select |v_#length_8| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|)) (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|) (= 1 (select |v_#valid_10| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|))) InVars {ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_3|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_3|, #length=|v_#length_8|} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_3|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_3|, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 20#L14-2true [130] L14-2-->L12-2: Formula: (< 0 |v_ULTIMATE.start_cstrncpy_#t~mem3_7|) InVars {ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_7|} OutVars{ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_7|, ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_6|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_7|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_6|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~mem3, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_#t~post2.offset] 14#L12-2true [2020-07-01 12:32:52,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:52,359 INFO L82 PathProgramCache]: Analyzing trace with hash 159154976, now seen corresponding path program 1 times [2020-07-01 12:32:52,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:52,360 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146601536] [2020-07-01 12:32:52,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:52,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:52,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:52,372 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146601536] [2020-07-01 12:32:52,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:32:52,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:32:52,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133962577] [2020-07-01 12:32:52,373 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 12:32:52,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:52,373 INFO L82 PathProgramCache]: Analyzing trace with hash 3243164, now seen corresponding path program 1 times [2020-07-01 12:32:52,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:52,374 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603892478] [2020-07-01 12:32:52,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:52,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:32:52,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:32:52,397 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:32:52,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:52,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:32:52,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:32:52,473 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. [2020-07-01 12:32:52,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:52,506 INFO L93 Difference]: Finished difference Result 20 states and 33 transitions. [2020-07-01 12:32:52,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:32:52,509 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 12:32:52,512 INFO L168 Benchmark]: Toolchain (without parser) took 13968.49 ms. Allocated memory was 649.6 MB in the beginning and 917.0 MB in the end (delta: 267.4 MB). Free memory was 563.8 MB in the beginning and 664.7 MB in the end (delta: -101.0 MB). Peak memory consumption was 166.4 MB. Max. memory is 50.3 GB. [2020-07-01 12:32:52,513 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 582.1 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:32:52,513 INFO L168 Benchmark]: CACSL2BoogieTranslator took 307.92 ms. Allocated memory was 649.6 MB in the beginning and 679.0 MB in the end (delta: 29.4 MB). Free memory was 563.8 MB in the beginning and 640.4 MB in the end (delta: -76.6 MB). Peak memory consumption was 27.9 MB. Max. memory is 50.3 GB. [2020-07-01 12:32:52,513 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.09 ms. Allocated memory is still 679.0 MB. Free memory was 640.4 MB in the beginning and 638.2 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-07-01 12:32:52,514 INFO L168 Benchmark]: Boogie Preprocessor took 25.88 ms. Allocated memory is still 679.0 MB. Free memory was 638.2 MB in the beginning and 636.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-07-01 12:32:52,514 INFO L168 Benchmark]: RCFGBuilder took 326.09 ms. Allocated memory is still 679.0 MB. Free memory was 636.1 MB in the beginning and 612.9 MB in the end (delta: 23.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 50.3 GB. [2020-07-01 12:32:52,514 INFO L168 Benchmark]: BlockEncodingV2 took 116.74 ms. Allocated memory is still 679.0 MB. Free memory was 612.9 MB in the beginning and 603.1 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 50.3 GB. [2020-07-01 12:32:52,515 INFO L168 Benchmark]: TraceAbstraction took 12938.22 ms. Allocated memory was 679.0 MB in the beginning and 917.0 MB in the end (delta: 238.0 MB). Free memory was 603.1 MB in the beginning and 692.3 MB in the end (delta: -89.1 MB). Peak memory consumption was 390.9 MB. Max. memory is 50.3 GB. [2020-07-01 12:32:52,515 INFO L168 Benchmark]: BuchiAutomizer took 207.17 ms. Allocated memory is still 917.0 MB. Free memory was 692.3 MB in the beginning and 664.7 MB in the end (delta: 27.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 50.3 GB. [2020-07-01 12:32:52,517 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 28 locations, 34 edges - StatisticsResult: Encoded RCFG 20 locations, 36 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 582.1 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 307.92 ms. Allocated memory was 649.6 MB in the beginning and 679.0 MB in the end (delta: 29.4 MB). Free memory was 563.8 MB in the beginning and 640.4 MB in the end (delta: -76.6 MB). Peak memory consumption was 27.9 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 40.09 ms. Allocated memory is still 679.0 MB. Free memory was 640.4 MB in the beginning and 638.2 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 25.88 ms. Allocated memory is still 679.0 MB. Free memory was 638.2 MB in the beginning and 636.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * RCFGBuilder took 326.09 ms. Allocated memory is still 679.0 MB. Free memory was 636.1 MB in the beginning and 612.9 MB in the end (delta: 23.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 116.74 ms. Allocated memory is still 679.0 MB. Free memory was 612.9 MB in the beginning and 603.1 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 50.3 GB. * TraceAbstraction took 12938.22 ms. Allocated memory was 679.0 MB in the beginning and 917.0 MB in the end (delta: 238.0 MB). Free memory was 603.1 MB in the beginning and 692.3 MB in the end (delta: -89.1 MB). Peak memory consumption was 390.9 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 207.17 ms. Allocated memory is still 917.0 MB. Free memory was 692.3 MB in the beginning and 664.7 MB in the end (delta: 27.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 39]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 39]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 12]: Loop Invariant [2020-07-01 12:32:52,527 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:32:52,527 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:32:52,527 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:32:52,530 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,530 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,530 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,530 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:32:52,531 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:52,531 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,531 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,531 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,531 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,532 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:32:52,532 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,532 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,532 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,532 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:32:52,533 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:52,533 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,533 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,533 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,533 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,534 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,534 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,534 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:32:52,534 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:52,534 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,535 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,536 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:32:52,536 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:32:52,536 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-07-01 12:32:52,538 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,538 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,538 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,539 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:32:52,539 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:52,539 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,539 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,539 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,540 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,540 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:32:52,540 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,540 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,540 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,541 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:32:52,541 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:52,541 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,541 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,541 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,542 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,542 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,542 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,542 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:32:52,542 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:52,543 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,543 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((((((((((((n == unknown-#length-unknown[nondetArea] && n <= 1) && 1 <= n) && 1 <= length) && 0 == src) && 1 <= unknown-#length-unknown[src]) && 1 == \valid[dst]) && length == unknown-#length-unknown[nondetString]) && 1 <= unknown-#StackHeapBarrier-unknown) && n <= 1) && 1 == \valid[src]) && 0 == dst) && 1 == \valid[nondetString]) && (nondetString == nondetArea || \valid[nondetArea] == 1)) && (\exists ULTIMATE.start_main_~nondetString~0.offset : int :: (ULTIMATE.start_main_~nondetString~0.offset <= 0 && src <= ULTIMATE.start_main_~nondetString~0.offset) && 0 == unknown-#memory_int-unknown[src][unknown-#length-unknown[src] + ULTIMATE.start_main_~nondetString~0.offset + -1])) && 0 == nondetArea) && 1 <= unknown-#length-unknown[dst]) && 0 == nondetString) || ((((((((((((n == unknown-#length-unknown[nondetArea] && 1 <= n) && 1 <= length) && 1 == \valid[dst]) && length == unknown-#length-unknown[nondetString]) && 1 <= unknown-#StackHeapBarrier-unknown) && n <= 1) && 1 == \valid[src]) && 1 == \valid[nondetString]) && (nondetString == nondetArea || \valid[nondetArea] == 1)) && n <= 0) && 0 == nondetArea) && 0 == nondetString)) || ((((((((((((((((((n == unknown-#length-unknown[nondetArea] && !(nondetString == nondetArea)) && 1 <= n) && 1 <= length) && 0 == src) && 1 <= unknown-#length-unknown[src]) && 1 == \valid[dst]) && length == unknown-#length-unknown[nondetString]) && 1 <= unknown-#StackHeapBarrier-unknown) && 0 == unknown-#memory_int-unknown[src][unknown-#length-unknown[src] + -1]) && n <= unknown-#length-unknown[dst]) && 1 == \valid[src]) && 0 == dst) && 1 == \valid[nondetString]) && (nondetString == nondetArea || \valid[nondetArea] == 1)) && 0 == nondetArea) && 1 <= unknown-#length-unknown[dst]) && !(src == dst)) && 0 == nondetString)) || ((((((((((((((((((!(nondetString == nondetArea) && n == unknown-#length-unknown[nondetArea]) && 1 <= n) && 1 <= length) && src + 1 <= unknown-#length-unknown[src]) && 1 == \valid[dst]) && length == unknown-#length-unknown[nondetString]) && 1 <= unknown-#StackHeapBarrier-unknown) && 1 <= src) && 0 == unknown-#memory_int-unknown[src][unknown-#length-unknown[src] + -1]) && 0 <= n) && 1 <= dst) && 1 == \valid[src]) && 1 == \valid[nondetString]) && (nondetString == nondetArea || \valid[nondetArea] == 1)) && n + dst <= unknown-#length-unknown[dst]) && 0 == nondetArea) && 0 == nondetString) && !(src == dst)) - InvariantResult [Line: 20]: Loop Invariant [2020-07-01 12:32:52,544 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,545 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,545 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:32:52,545 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,545 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,545 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:32:52,546 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,546 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,547 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,547 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,547 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:32:52,547 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,548 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,548 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:32:52,548 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:52,548 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((((((((0 <= n2 && n == unknown-#length-unknown[nondetArea]) && 1 <= n) && (1 < length || 1 == length + nondetString)) && 1 == \valid[dst]) && length == unknown-#length-unknown[nondetString]) && 1 <= unknown-#StackHeapBarrier-unknown) && 1 <= src) && n2 <= 0) && 0 <= n) && n <= 1) && \valid[nondetArea] == 1) && 1 == \valid[src]) && 1 == \valid[nondetString]) && n <= 0) && 0 == nondetArea) && 0 == nondetString) || (((((((((((((((((((0 <= n2 && n == unknown-#length-unknown[nondetArea]) && !(nondetString == nondetArea)) && 1 <= n) && (1 < length || 1 == length + nondetString)) && 1 == \valid[dst]) && length == unknown-#length-unknown[nondetString]) && 1 <= unknown-#StackHeapBarrier-unknown) && 1 <= src) && 1 <= us) && 0 <= n) && 1 <= dst) && \valid[nondetArea] == 1) && 1 == \valid[src]) && \valid[us] == 1) && 1 == \valid[nondetString]) && n + dst <= unknown-#length-unknown[dst]) && 0 == nondetArea) && 0 == nondetString) && us + n2 <= unknown-#length-unknown[us]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 8 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 11.4s, OverallIterations: 27, TraceHistogramMax: 3, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 152 SDtfs, 1049 SDslu, 1113 SDs, 0 SdLazy, 2172 SolverSat, 294 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 339 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 244 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 27 MinimizatonAttempts, 138 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 11 NumberOfFragments, 492 HoareAnnotationTreeSize, 2 FomulaSimplifications, 22113 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 2 FomulaSimplificationsInter, 11963 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 364 NumberOfCodeBlocks, 364 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 329 ConstructedInterpolants, 11 QuantifiedInterpolants, 23559 SizeOfPredicates, 82 NumberOfNonLiveVariables, 1019 ConjunctsInSsa, 181 ConjunctsInUnsatCore, 35 InterpolantComputations, 20 PerfectInterpolantSequences, 11/54 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !SESSION 2020-07-01 12:32:35.206 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp/BenchExec_run_9IN4LT/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 12:32:52.773 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check