./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted/NonTermination3-1.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-crafted/NonTermination3-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 76e89a58b9c6f7059fcf416ee7a1666558a3d440 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 06:33:06,390 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 06:33:06,393 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 06:33:06,426 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 06:33:06,426 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 06:33:06,438 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 06:33:06,440 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 06:33:06,444 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 06:33:06,447 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 06:33:06,449 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 06:33:06,450 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 06:33:06,453 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 06:33:06,455 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 06:33:06,458 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 06:33:06,462 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 06:33:06,463 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 06:33:06,465 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 06:33:06,467 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 06:33:06,470 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 06:33:06,473 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 06:33:06,485 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 06:33:06,486 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 06:33:06,488 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 06:33:06,491 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 06:33:06,493 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 06:33:06,496 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 06:33:06,496 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 06:33:06,498 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 06:33:06,499 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 06:33:06,500 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 06:33:06,500 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 06:33:06,501 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 06:33:06,503 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 06:33:06,504 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 06:33:06,505 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 06:33:06,505 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 06:33:06,506 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 06:33:06,506 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 06:33:06,506 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 06:33:06,507 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 06:33:06,511 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 06:33:06,512 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-10-20 06:33:06,541 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 06:33:06,541 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 06:33:06,542 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 06:33:06,543 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 06:33:06,543 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 06:33:06,543 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-20 06:33:06,543 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-20 06:33:06,544 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-20 06:33:06,544 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-20 06:33:06,544 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-20 06:33:06,544 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-20 06:33:06,545 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 06:33:06,545 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 06:33:06,545 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 06:33:06,545 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 06:33:06,546 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-20 06:33:06,546 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-20 06:33:06,546 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-20 06:33:06,546 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 06:33:06,547 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-20 06:33:06,547 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 06:33:06,547 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-20 06:33:06,547 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 06:33:06,548 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 06:33:06,548 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-20 06:33:06,548 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 06:33:06,548 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 06:33:06,549 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 06:33:06,549 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-20 06:33:06,550 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-20 06:33:06,550 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 76e89a58b9c6f7059fcf416ee7a1666558a3d440 [2020-10-20 06:33:06,761 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 06:33:06,774 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 06:33:06,778 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 06:33:06,780 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 06:33:06,780 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 06:33:06,781 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/NonTermination3-1.c [2020-10-20 06:33:06,849 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8bcb2441/e50e615a951a4d7cadebefea3b1183fb/FLAGd9b984d49 [2020-10-20 06:33:07,319 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 06:33:07,321 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/NonTermination3-1.c [2020-10-20 06:33:07,328 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8bcb2441/e50e615a951a4d7cadebefea3b1183fb/FLAGd9b984d49 [2020-10-20 06:33:07,697 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8bcb2441/e50e615a951a4d7cadebefea3b1183fb [2020-10-20 06:33:07,700 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 06:33:07,707 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 06:33:07,708 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 06:33:07,709 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 06:33:07,712 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 06:33:07,713 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:33:07" (1/1) ... [2020-10-20 06:33:07,716 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ae856b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:33:07, skipping insertion in model container [2020-10-20 06:33:07,717 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:33:07" (1/1) ... [2020-10-20 06:33:07,725 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 06:33:07,741 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 06:33:07,968 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:33:07,972 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 06:33:07,989 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:33:08,009 INFO L208 MainTranslator]: Completed translation [2020-10-20 06:33:08,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:33:08 WrapperNode [2020-10-20 06:33:08,010 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 06:33:08,011 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 06:33:08,011 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 06:33:08,011 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 06:33:08,020 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:33:08" (1/1) ... [2020-10-20 06:33:08,028 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:33:08" (1/1) ... [2020-10-20 06:33:08,049 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 06:33:08,049 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 06:33:08,050 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 06:33:08,050 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 06:33:08,059 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:33:08" (1/1) ... [2020-10-20 06:33:08,060 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:33:08" (1/1) ... [2020-10-20 06:33:08,061 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:33:08" (1/1) ... [2020-10-20 06:33:08,062 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:33:08" (1/1) ... [2020-10-20 06:33:08,067 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:33:08" (1/1) ... [2020-10-20 06:33:08,072 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:33:08" (1/1) ... [2020-10-20 06:33:08,074 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:33:08" (1/1) ... [2020-10-20 06:33:08,076 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 06:33:08,076 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 06:33:08,077 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 06:33:08,077 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 06:33:08,078 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:33:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:33:08,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-20 06:33:08,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 06:33:08,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 06:33:08,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-20 06:33:08,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 06:33:08,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 06:33:08,371 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 06:33:08,372 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-10-20 06:33:08,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:33:08 BoogieIcfgContainer [2020-10-20 06:33:08,374 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 06:33:08,374 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-20 06:33:08,375 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-20 06:33:08,378 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-20 06:33:08,379 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:33:08,380 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.10 06:33:07" (1/3) ... [2020-10-20 06:33:08,381 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6447a694 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 06:33:08, skipping insertion in model container [2020-10-20 06:33:08,381 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:33:08,381 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:33:08" (2/3) ... [2020-10-20 06:33:08,381 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6447a694 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 06:33:08, skipping insertion in model container [2020-10-20 06:33:08,382 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:33:08,382 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:33:08" (3/3) ... [2020-10-20 06:33:08,383 INFO L373 chiAutomizerObserver]: Analyzing ICFG NonTermination3-1.c [2020-10-20 06:33:08,436 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-20 06:33:08,437 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-20 06:33:08,437 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-20 06:33:08,437 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 06:33:08,437 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 06:33:08,438 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-20 06:33:08,438 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 06:33:08,438 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-20 06:33:08,459 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-10-20 06:33:08,489 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-10-20 06:33:08,489 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:33:08,489 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:33:08,499 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:33:08,499 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 06:33:08,499 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-20 06:33:08,499 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-10-20 06:33:08,501 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-10-20 06:33:08,501 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:33:08,501 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:33:08,502 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:33:08,502 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 06:33:08,512 INFO L794 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3#L-1true havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 5#L13-3true [2020-10-20 06:33:08,512 INFO L796 eck$LassoCheckResult]: Loop: 5#L13-3true assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 7#L13-2true main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 5#L13-3true [2020-10-20 06:33:08,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:33:08,520 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-10-20 06:33:08,531 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:33:08,532 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416371802] [2020-10-20 06:33:08,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:33:08,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:33:08,653 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:33:08,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:33:08,664 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:33:08,687 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:33:08,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:33:08,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2020-10-20 06:33:08,689 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:33:08,690 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35093089] [2020-10-20 06:33:08,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:33:08,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:33:08,699 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:33:08,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:33:08,707 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:33:08,710 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:33:08,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:33:08,712 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2020-10-20 06:33:08,713 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:33:08,713 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375301960] [2020-10-20 06:33:08,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:33:08,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:33:08,737 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:33:08,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:33:08,753 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:33:08,758 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:33:08,965 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:33:08,966 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:33:08,966 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:33:08,966 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:33:08,966 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:33:08,967 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:33:08,967 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:33:08,967 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:33:08,967 INFO L133 ssoRankerPreferences]: Filename of dumped script: NonTermination3-1.c_Iteration1_Lasso [2020-10-20 06:33:08,968 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:33:08,968 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:33:08,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:33:09,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:33:09,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:33:09,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:33:09,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:33:09,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:33:09,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:33:09,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:33:09,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:33:09,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:33:09,264 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:33:09,270 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:33:09,288 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:33:09,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:33:09,291 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:33:09,292 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:33:09,292 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:33:09,293 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:33:09,295 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:33:09,296 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:33:09,301 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:33:09,350 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:33:09,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:33:09,352 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:33:09,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:33:09,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:33:09,353 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:33:09,354 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:33:09,354 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:33:09,356 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:33:09,401 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:33:09,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:33:09,403 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:33:09,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:33:09,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:33:09,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:33:09,405 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:33:09,405 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:33:09,407 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:33:09,444 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:33:09,446 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:33:09,446 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:33:09,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:33:09,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:33:09,447 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:33:09,448 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:33:09,448 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:33:09,450 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:33:09,477 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:33:09,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:33:09,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:33:09,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:33:09,481 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:33:09,493 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:33:09,493 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:33:09,498 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:33:09,533 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:33:09,534 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:33:09,535 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:33:09,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:33:09,535 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:33:09,535 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:33:09,536 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:33:09,536 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:33:09,538 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:33:09,582 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:33:09,586 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:33:09,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:33:09,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:33:09,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:33:09,592 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:33:09,592 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:33:09,604 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:33:09,641 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:33:09,643 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:33:09,643 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:33:09,643 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:33:09,643 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:33:09,647 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:33:09,647 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:33:09,659 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:33:09,688 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:33:09,690 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:33:09,690 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:33:09,690 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:33:09,691 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:33:09,695 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:33:09,696 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:33:09,708 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:33:09,760 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:33:09,761 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:33:09,762 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:33:09,762 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:33:09,762 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:33:09,762 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:33:09,765 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:33:09,765 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:33:09,767 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:33:09,799 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:33:09,801 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:33:09,801 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:33:09,802 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:33:09,802 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:33:09,802 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:33:09,802 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:33:09,802 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:33:09,804 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:33:09,830 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:33:09,832 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:33:09,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:33:09,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:33:09,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:33:09,838 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:33:09,838 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:33:09,850 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:33:09,900 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2020-10-20 06:33:09,901 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:33:09,910 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:33:09,920 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 06:33:09,920 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:33:09,921 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = -2*ULTIMATE.start_main_~n~0 + 19 Supporting invariants [] [2020-10-20 06:33:09,964 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2020-10-20 06:33:09,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:33:10,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:33:10,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:33:10,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:33:10,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:33:10,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 06:33:10,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:33:10,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:33:10,060 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-20 06:33:10,062 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states. Second operand 3 states. [2020-10-20 06:33:10,163 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states.. Second operand 3 states. Result 28 states and 40 transitions. Complement of second has 7 states. [2020-10-20 06:33:10,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 06:33:10,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 06:33:10,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2020-10-20 06:33:10,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 2 letters. Loop has 2 letters. [2020-10-20 06:33:10,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:33:10,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 4 letters. Loop has 2 letters. [2020-10-20 06:33:10,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:33:10,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 2 letters. Loop has 4 letters. [2020-10-20 06:33:10,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:33:10,172 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 40 transitions. [2020-10-20 06:33:10,180 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:33:10,185 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 9 states and 12 transitions. [2020-10-20 06:33:10,186 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-10-20 06:33:10,186 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-10-20 06:33:10,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2020-10-20 06:33:10,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:33:10,188 INFO L691 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2020-10-20 06:33:10,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2020-10-20 06:33:10,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2020-10-20 06:33:10,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-20 06:33:10,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2020-10-20 06:33:10,214 INFO L714 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2020-10-20 06:33:10,214 INFO L594 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2020-10-20 06:33:10,215 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-20 06:33:10,215 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. [2020-10-20 06:33:10,215 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:33:10,215 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:33:10,215 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:33:10,216 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-10-20 06:33:10,216 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 06:33:10,216 INFO L794 eck$LassoCheckResult]: Stem: 88#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 84#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 85#L13-3 assume !(main_~n~0 < 10); 83#L17-4 [2020-10-20 06:33:10,216 INFO L796 eck$LassoCheckResult]: Loop: 83#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 89#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 82#L17-2 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 83#L17-4 [2020-10-20 06:33:10,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:33:10,217 INFO L82 PathProgramCache]: Analyzing trace with hash 29861, now seen corresponding path program 1 times [2020-10-20 06:33:10,217 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:33:10,217 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478928580] [2020-10-20 06:33:10,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:33:10,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:33:10,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:33:10,259 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478928580] [2020-10-20 06:33:10,260 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:33:10,260 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 06:33:10,261 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375938884] [2020-10-20 06:33:10,266 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:33:10,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:33:10,274 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 1 times [2020-10-20 06:33:10,274 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:33:10,274 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448080402] [2020-10-20 06:33:10,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:33:10,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:33:10,285 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:33:10,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:33:10,292 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:33:10,295 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:33:10,401 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2020-10-20 06:33:10,453 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:33:10,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:33:10,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:33:10,458 INFO L87 Difference]: Start difference. First operand 8 states and 11 transitions. cyclomatic complexity: 5 Second operand 3 states. [2020-10-20 06:33:10,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:33:10,474 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2020-10-20 06:33:10,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:33:10,476 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 11 transitions. [2020-10-20 06:33:10,477 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:33:10,477 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 11 transitions. [2020-10-20 06:33:10,477 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-10-20 06:33:10,478 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-10-20 06:33:10,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2020-10-20 06:33:10,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:33:10,478 INFO L691 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2020-10-20 06:33:10,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2020-10-20 06:33:10,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2020-10-20 06:33:10,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-20 06:33:10,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2020-10-20 06:33:10,481 INFO L714 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2020-10-20 06:33:10,481 INFO L594 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2020-10-20 06:33:10,481 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-20 06:33:10,482 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2020-10-20 06:33:10,482 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:33:10,482 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:33:10,483 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:33:10,483 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-20 06:33:10,483 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 06:33:10,484 INFO L794 eck$LassoCheckResult]: Stem: 111#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 105#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 106#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 109#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 110#L13-3 assume !(main_~n~0 < 10); 108#L17-4 [2020-10-20 06:33:10,484 INFO L796 eck$LassoCheckResult]: Loop: 108#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 112#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 107#L17-2 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 108#L17-4 [2020-10-20 06:33:10,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:33:10,485 INFO L82 PathProgramCache]: Analyzing trace with hash 28698723, now seen corresponding path program 1 times [2020-10-20 06:33:10,485 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:33:10,485 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914239935] [2020-10-20 06:33:10,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:33:10,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:33:10,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:33:10,514 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914239935] [2020-10-20 06:33:10,514 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317753738] [2020-10-20 06:33:10,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:33:10,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:33:10,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-20 06:33:10,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:33:10,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:33:10,577 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:33:10,578 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2020-10-20 06:33:10,578 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613467098] [2020-10-20 06:33:10,578 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:33:10,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:33:10,579 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 2 times [2020-10-20 06:33:10,579 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:33:10,580 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666893551] [2020-10-20 06:33:10,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:33:10,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:33:10,588 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:33:10,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:33:10,595 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:33:10,597 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:33:10,729 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:33:10,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 06:33:10,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-20 06:33:10,730 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. cyclomatic complexity: 4 Second operand 5 states. [2020-10-20 06:33:10,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:33:10,753 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2020-10-20 06:33:10,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 06:33:10,754 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2020-10-20 06:33:10,754 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:33:10,755 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 13 transitions. [2020-10-20 06:33:10,755 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-10-20 06:33:10,755 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-10-20 06:33:10,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2020-10-20 06:33:10,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:33:10,756 INFO L691 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2020-10-20 06:33:10,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2020-10-20 06:33:10,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2020-10-20 06:33:10,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-20 06:33:10,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2020-10-20 06:33:10,759 INFO L714 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2020-10-20 06:33:10,759 INFO L594 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2020-10-20 06:33:10,759 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-20 06:33:10,759 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2020-10-20 06:33:10,760 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:33:10,760 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:33:10,760 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:33:10,761 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1] [2020-10-20 06:33:10,761 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 06:33:10,761 INFO L794 eck$LassoCheckResult]: Stem: 151#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 144#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 145#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 148#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 149#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 150#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 153#L13-3 assume !(main_~n~0 < 10); 147#L17-4 [2020-10-20 06:33:10,761 INFO L796 eck$LassoCheckResult]: Loop: 147#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 152#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 146#L17-2 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 147#L17-4 [2020-10-20 06:33:10,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:33:10,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1809671329, now seen corresponding path program 2 times [2020-10-20 06:33:10,762 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:33:10,763 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145147269] [2020-10-20 06:33:10,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:33:10,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:33:10,803 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:33:10,804 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145147269] [2020-10-20 06:33:10,804 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894535812] [2020-10-20 06:33:10,804 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:33:10,844 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 06:33:10,845 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:33:10,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 06:33:10,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:33:10,864 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:33:10,864 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:33:10,864 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-10-20 06:33:10,865 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412567296] [2020-10-20 06:33:10,865 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:33:10,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:33:10,866 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 3 times [2020-10-20 06:33:10,866 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:33:10,866 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814935550] [2020-10-20 06:33:10,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:33:10,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:33:10,873 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:33:10,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:33:10,879 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:33:10,884 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:33:10,993 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2020-10-20 06:33:11,027 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:33:11,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 06:33:11,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-10-20 06:33:11,028 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. cyclomatic complexity: 4 Second operand 6 states. [2020-10-20 06:33:11,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:33:11,050 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2020-10-20 06:33:11,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 06:33:11,051 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 15 transitions. [2020-10-20 06:33:11,052 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:33:11,053 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 15 transitions. [2020-10-20 06:33:11,053 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-10-20 06:33:11,053 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-10-20 06:33:11,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 15 transitions. [2020-10-20 06:33:11,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:33:11,054 INFO L691 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2020-10-20 06:33:11,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 15 transitions. [2020-10-20 06:33:11,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2020-10-20 06:33:11,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-20 06:33:11,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2020-10-20 06:33:11,056 INFO L714 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2020-10-20 06:33:11,057 INFO L594 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2020-10-20 06:33:11,057 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-20 06:33:11,057 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 14 transitions. [2020-10-20 06:33:11,058 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:33:11,058 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:33:11,058 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:33:11,059 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1] [2020-10-20 06:33:11,059 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 06:33:11,059 INFO L794 eck$LassoCheckResult]: Stem: 201#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 196#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 197#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 198#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 199#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 200#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 205#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 204#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 203#L13-3 assume !(main_~n~0 < 10); 195#L17-4 [2020-10-20 06:33:11,059 INFO L796 eck$LassoCheckResult]: Loop: 195#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 202#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 194#L17-2 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 195#L17-4 [2020-10-20 06:33:11,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:33:11,060 INFO L82 PathProgramCache]: Analyzing trace with hash -367605409, now seen corresponding path program 3 times [2020-10-20 06:33:11,060 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:33:11,060 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998022482] [2020-10-20 06:33:11,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:33:11,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:33:11,108 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:33:11,108 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998022482] [2020-10-20 06:33:11,108 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417784232] [2020-10-20 06:33:11,109 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:33:11,160 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-10-20 06:33:11,160 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:33:11,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-20 06:33:11,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:33:11,181 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:33:11,182 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:33:11,182 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-10-20 06:33:11,182 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337588323] [2020-10-20 06:33:11,183 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:33:11,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:33:11,183 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 4 times [2020-10-20 06:33:11,183 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:33:11,184 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285045488] [2020-10-20 06:33:11,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:33:11,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:33:11,190 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:33:11,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:33:11,195 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:33:11,197 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:33:11,322 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:33:11,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 06:33:11,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-10-20 06:33:11,323 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. cyclomatic complexity: 4 Second operand 7 states. [2020-10-20 06:33:11,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:33:11,350 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2020-10-20 06:33:11,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 06:33:11,351 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2020-10-20 06:33:11,352 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:33:11,362 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 17 transitions. [2020-10-20 06:33:11,362 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-10-20 06:33:11,362 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-10-20 06:33:11,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 17 transitions. [2020-10-20 06:33:11,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:33:11,363 INFO L691 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2020-10-20 06:33:11,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 17 transitions. [2020-10-20 06:33:11,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2020-10-20 06:33:11,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-20 06:33:11,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2020-10-20 06:33:11,366 INFO L714 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2020-10-20 06:33:11,366 INFO L594 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2020-10-20 06:33:11,366 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-20 06:33:11,366 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2020-10-20 06:33:11,367 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:33:11,367 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:33:11,367 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:33:11,368 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1] [2020-10-20 06:33:11,368 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 06:33:11,368 INFO L794 eck$LassoCheckResult]: Stem: 262#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 255#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 256#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 259#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 260#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 261#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 263#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 268#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 267#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 266#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 265#L13-3 assume !(main_~n~0 < 10); 258#L17-4 [2020-10-20 06:33:11,368 INFO L796 eck$LassoCheckResult]: Loop: 258#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 264#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 257#L17-2 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 258#L17-4 [2020-10-20 06:33:11,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:33:11,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1081477475, now seen corresponding path program 4 times [2020-10-20 06:33:11,369 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:33:11,370 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233381817] [2020-10-20 06:33:11,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:33:11,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:33:11,420 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:33:11,421 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233381817] [2020-10-20 06:33:11,421 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949413068] [2020-10-20 06:33:11,421 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:33:11,456 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-20 06:33:11,457 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:33:11,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-20 06:33:11,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:33:11,480 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:33:11,481 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:33:11,481 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-10-20 06:33:11,482 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696245294] [2020-10-20 06:33:11,482 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:33:11,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:33:11,483 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 5 times [2020-10-20 06:33:11,483 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:33:11,483 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667305760] [2020-10-20 06:33:11,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:33:11,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:33:11,489 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:33:11,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:33:11,494 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:33:11,496 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:33:11,617 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:33:11,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 06:33:11,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-10-20 06:33:11,618 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. cyclomatic complexity: 4 Second operand 8 states. [2020-10-20 06:33:11,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:33:11,645 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2020-10-20 06:33:11,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 06:33:11,646 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2020-10-20 06:33:11,647 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:33:11,647 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 19 transitions. [2020-10-20 06:33:11,647 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-10-20 06:33:11,648 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-10-20 06:33:11,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2020-10-20 06:33:11,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:33:11,648 INFO L691 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2020-10-20 06:33:11,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2020-10-20 06:33:11,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2020-10-20 06:33:11,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-10-20 06:33:11,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2020-10-20 06:33:11,650 INFO L714 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2020-10-20 06:33:11,650 INFO L594 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2020-10-20 06:33:11,650 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-20 06:33:11,651 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 18 transitions. [2020-10-20 06:33:11,652 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:33:11,652 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:33:11,652 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:33:11,653 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1] [2020-10-20 06:33:11,653 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 06:33:11,653 INFO L794 eck$LassoCheckResult]: Stem: 334#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 329#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 330#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 331#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 332#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 333#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 335#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 342#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 341#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 340#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 339#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 338#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 337#L13-3 assume !(main_~n~0 < 10); 328#L17-4 [2020-10-20 06:33:11,653 INFO L796 eck$LassoCheckResult]: Loop: 328#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 336#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 327#L17-2 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 328#L17-4 [2020-10-20 06:33:11,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:33:11,654 INFO L82 PathProgramCache]: Analyzing trace with hash 82234459, now seen corresponding path program 5 times [2020-10-20 06:33:11,654 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:33:11,654 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064458877] [2020-10-20 06:33:11,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:33:11,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:33:11,709 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:33:11,709 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064458877] [2020-10-20 06:33:11,709 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978142834] [2020-10-20 06:33:11,709 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:33:11,747 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2020-10-20 06:33:11,747 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:33:11,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-20 06:33:11,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:33:11,770 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:33:11,770 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:33:11,771 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2020-10-20 06:33:11,771 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625383978] [2020-10-20 06:33:11,772 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:33:11,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:33:11,772 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 6 times [2020-10-20 06:33:11,772 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:33:11,773 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13452555] [2020-10-20 06:33:11,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:33:11,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:33:11,778 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:33:11,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:33:11,782 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:33:11,784 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:33:11,897 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:33:11,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-20 06:33:11,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-10-20 06:33:11,897 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. cyclomatic complexity: 4 Second operand 9 states. [2020-10-20 06:33:11,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:33:11,926 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2020-10-20 06:33:11,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 06:33:11,927 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 21 transitions. [2020-10-20 06:33:11,928 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:33:11,929 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 21 transitions. [2020-10-20 06:33:11,929 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-10-20 06:33:11,929 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-10-20 06:33:11,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 21 transitions. [2020-10-20 06:33:11,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:33:11,929 INFO L691 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2020-10-20 06:33:11,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 21 transitions. [2020-10-20 06:33:11,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2020-10-20 06:33:11,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-10-20 06:33:11,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2020-10-20 06:33:11,931 INFO L714 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2020-10-20 06:33:11,932 INFO L594 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2020-10-20 06:33:11,932 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-20 06:33:11,932 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 20 transitions. [2020-10-20 06:33:11,933 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:33:11,933 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:33:11,933 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:33:11,934 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1] [2020-10-20 06:33:11,934 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 06:33:11,934 INFO L794 eck$LassoCheckResult]: Stem: 417#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 410#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 411#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 414#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 415#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 416#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 418#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 427#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 426#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 425#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 424#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 423#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 422#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 421#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 420#L13-3 assume !(main_~n~0 < 10); 413#L17-4 [2020-10-20 06:33:11,935 INFO L796 eck$LassoCheckResult]: Loop: 413#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 419#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 412#L17-2 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 413#L17-4 [2020-10-20 06:33:11,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:33:11,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1717906073, now seen corresponding path program 6 times [2020-10-20 06:33:11,935 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:33:11,936 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217494935] [2020-10-20 06:33:11,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:33:11,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:33:11,999 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:33:11,999 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217494935] [2020-10-20 06:33:11,999 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743963474] [2020-10-20 06:33:11,999 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:33:12,058 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2020-10-20 06:33:12,058 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:33:12,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-20 06:33:12,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:33:12,082 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:33:12,082 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:33:12,083 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2020-10-20 06:33:12,083 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223067416] [2020-10-20 06:33:12,083 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:33:12,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:33:12,084 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 7 times [2020-10-20 06:33:12,084 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:33:12,084 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497458992] [2020-10-20 06:33:12,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:33:12,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:33:12,090 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:33:12,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:33:12,094 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:33:12,096 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:33:12,205 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:33:12,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 06:33:12,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-10-20 06:33:12,206 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. cyclomatic complexity: 4 Second operand 10 states. [2020-10-20 06:33:12,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:33:12,240 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2020-10-20 06:33:12,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-20 06:33:12,243 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 23 transitions. [2020-10-20 06:33:12,244 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:33:12,245 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 23 transitions. [2020-10-20 06:33:12,245 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-10-20 06:33:12,245 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-10-20 06:33:12,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 23 transitions. [2020-10-20 06:33:12,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:33:12,245 INFO L691 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2020-10-20 06:33:12,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 23 transitions. [2020-10-20 06:33:12,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2020-10-20 06:33:12,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-10-20 06:33:12,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2020-10-20 06:33:12,248 INFO L714 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2020-10-20 06:33:12,248 INFO L594 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2020-10-20 06:33:12,248 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-20 06:33:12,249 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 22 transitions. [2020-10-20 06:33:12,249 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:33:12,249 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:33:12,249 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:33:12,250 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1] [2020-10-20 06:33:12,250 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 06:33:12,251 INFO L794 eck$LassoCheckResult]: Stem: 511#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 504#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 505#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 508#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 509#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 510#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 512#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 523#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 522#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 521#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 520#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 519#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 518#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 517#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 516#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 515#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 514#L13-3 assume !(main_~n~0 < 10); 507#L17-4 [2020-10-20 06:33:12,251 INFO L796 eck$LassoCheckResult]: Loop: 507#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 513#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 506#L17-2 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 507#L17-4 [2020-10-20 06:33:12,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:33:12,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1640296791, now seen corresponding path program 7 times [2020-10-20 06:33:12,252 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:33:12,252 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231809716] [2020-10-20 06:33:12,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:33:12,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:33:12,348 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:33:12,348 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231809716] [2020-10-20 06:33:12,349 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725408327] [2020-10-20 06:33:12,349 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:33:12,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:33:12,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-20 06:33:12,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:33:12,416 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:33:12,417 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:33:12,417 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2020-10-20 06:33:12,417 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99121542] [2020-10-20 06:33:12,417 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:33:12,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:33:12,418 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 8 times [2020-10-20 06:33:12,418 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:33:12,418 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312668328] [2020-10-20 06:33:12,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:33:12,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:33:12,423 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:33:12,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:33:12,426 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:33:12,428 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:33:12,535 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:33:12,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-20 06:33:12,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2020-10-20 06:33:12,536 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. cyclomatic complexity: 4 Second operand 11 states. [2020-10-20 06:33:12,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:33:12,582 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2020-10-20 06:33:12,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-20 06:33:12,582 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 25 transitions. [2020-10-20 06:33:12,583 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:33:12,583 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 25 transitions. [2020-10-20 06:33:12,583 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-10-20 06:33:12,584 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-10-20 06:33:12,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 25 transitions. [2020-10-20 06:33:12,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:33:12,584 INFO L691 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2020-10-20 06:33:12,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 25 transitions. [2020-10-20 06:33:12,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2020-10-20 06:33:12,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-10-20 06:33:12,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2020-10-20 06:33:12,586 INFO L714 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2020-10-20 06:33:12,586 INFO L594 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2020-10-20 06:33:12,587 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-20 06:33:12,587 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 24 transitions. [2020-10-20 06:33:12,587 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:33:12,587 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:33:12,587 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:33:12,588 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1] [2020-10-20 06:33:12,588 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 06:33:12,588 INFO L794 eck$LassoCheckResult]: Stem: 616#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 611#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 612#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 613#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 614#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 615#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 617#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 630#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 629#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 628#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 627#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 626#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 625#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 624#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 623#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 622#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 621#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 620#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 619#L13-3 assume !(main_~n~0 < 10); 610#L17-4 [2020-10-20 06:33:12,589 INFO L796 eck$LassoCheckResult]: Loop: 610#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 618#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 609#L17-2 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 610#L17-4 [2020-10-20 06:33:12,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:33:12,589 INFO L82 PathProgramCache]: Analyzing trace with hash 72220821, now seen corresponding path program 8 times [2020-10-20 06:33:12,589 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:33:12,589 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63667111] [2020-10-20 06:33:12,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:33:12,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:33:12,670 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:33:12,671 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63667111] [2020-10-20 06:33:12,671 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963757831] [2020-10-20 06:33:12,671 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:33:12,708 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 06:33:12,708 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:33:12,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-20 06:33:12,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:33:12,735 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:33:12,736 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:33:12,736 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2020-10-20 06:33:12,736 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175355404] [2020-10-20 06:33:12,737 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:33:12,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:33:12,737 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 9 times [2020-10-20 06:33:12,737 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:33:12,737 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944759051] [2020-10-20 06:33:12,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:33:12,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:33:12,742 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:33:12,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:33:12,746 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:33:12,747 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:33:12,873 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:33:12,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-20 06:33:12,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2020-10-20 06:33:12,874 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. cyclomatic complexity: 4 Second operand 12 states. [2020-10-20 06:33:12,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:33:12,926 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2020-10-20 06:33:12,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-20 06:33:12,927 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 27 transitions. [2020-10-20 06:33:12,927 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:33:12,928 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 27 transitions. [2020-10-20 06:33:12,928 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-10-20 06:33:12,928 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-10-20 06:33:12,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 27 transitions. [2020-10-20 06:33:12,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:33:12,929 INFO L691 BuchiCegarLoop]: Abstraction has 25 states and 27 transitions. [2020-10-20 06:33:12,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 27 transitions. [2020-10-20 06:33:12,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2020-10-20 06:33:12,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-10-20 06:33:12,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2020-10-20 06:33:12,931 INFO L714 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2020-10-20 06:33:12,931 INFO L594 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2020-10-20 06:33:12,932 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-10-20 06:33:12,932 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 26 transitions. [2020-10-20 06:33:12,932 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:33:12,933 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:33:12,933 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:33:12,934 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 1, 1, 1] [2020-10-20 06:33:12,934 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 06:33:12,934 INFO L794 eck$LassoCheckResult]: Stem: 732#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 727#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 728#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 729#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 730#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 731#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 733#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 748#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 747#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 746#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 745#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 744#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 743#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 742#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 741#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 740#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 739#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 738#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 737#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 736#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 735#L13-3 assume !(main_~n~0 < 10); 726#L17-4 [2020-10-20 06:33:12,934 INFO L796 eck$LassoCheckResult]: Loop: 726#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 734#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 725#L17-2 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 726#L17-4 [2020-10-20 06:33:12,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:33:12,935 INFO L82 PathProgramCache]: Analyzing trace with hash 684734547, now seen corresponding path program 9 times [2020-10-20 06:33:12,935 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:33:12,935 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287923600] [2020-10-20 06:33:12,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:33:12,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:33:13,034 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:33:13,035 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287923600] [2020-10-20 06:33:13,035 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280415269] [2020-10-20 06:33:13,035 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:33:13,106 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2020-10-20 06:33:13,106 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:33:13,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-20 06:33:13,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:33:13,162 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:33:13,163 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:33:13,163 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2020-10-20 06:33:13,163 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103172233] [2020-10-20 06:33:13,164 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:33:13,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:33:13,164 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 10 times [2020-10-20 06:33:13,164 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:33:13,165 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733108526] [2020-10-20 06:33:13,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:33:13,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:33:13,169 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:33:13,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:33:13,171 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:33:13,173 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:33:13,276 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:33:13,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-20 06:33:13,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2020-10-20 06:33:13,277 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. cyclomatic complexity: 4 Second operand 13 states. [2020-10-20 06:33:13,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:33:13,332 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2020-10-20 06:33:13,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-20 06:33:13,335 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 28 transitions. [2020-10-20 06:33:13,338 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:33:13,338 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 28 transitions. [2020-10-20 06:33:13,338 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-10-20 06:33:13,338 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-10-20 06:33:13,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 28 transitions. [2020-10-20 06:33:13,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:33:13,339 INFO L691 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2020-10-20 06:33:13,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 28 transitions. [2020-10-20 06:33:13,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-10-20 06:33:13,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-10-20 06:33:13,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2020-10-20 06:33:13,346 INFO L714 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2020-10-20 06:33:13,346 INFO L594 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2020-10-20 06:33:13,346 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-10-20 06:33:13,346 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 28 transitions. [2020-10-20 06:33:13,347 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:33:13,349 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:33:13,349 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:33:13,350 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1] [2020-10-20 06:33:13,351 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 06:33:13,351 INFO L794 eck$LassoCheckResult]: Stem: 858#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 853#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(40);main_~n~0 := 0; 854#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 855#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 856#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 857#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 859#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 876#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 875#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 874#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 873#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 872#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 871#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 870#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 869#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 868#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 867#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 866#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 865#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 864#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 863#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 862#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 861#L13-3 assume !(main_~n~0 < 10); 852#L17-4 [2020-10-20 06:33:13,352 INFO L796 eck$LassoCheckResult]: Loop: 852#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 860#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 851#L17-2 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 852#L17-4 [2020-10-20 06:33:13,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:33:13,353 INFO L82 PathProgramCache]: Analyzing trace with hash 899905681, now seen corresponding path program 10 times [2020-10-20 06:33:13,353 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:33:13,353 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540347819] [2020-10-20 06:33:13,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:33:13,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:33:13,366 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:33:13,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:33:13,377 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:33:13,383 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:33:13,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:33:13,384 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 11 times [2020-10-20 06:33:13,384 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:33:13,385 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607158557] [2020-10-20 06:33:13,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:33:13,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:33:13,388 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:33:13,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:33:13,391 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:33:13,393 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:33:13,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:33:13,393 INFO L82 PathProgramCache]: Analyzing trace with hash -95699990, now seen corresponding path program 1 times [2020-10-20 06:33:13,394 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:33:13,394 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324403768] [2020-10-20 06:33:13,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:33:13,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:33:13,410 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:33:13,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:33:13,425 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:33:13,430 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:33:17,654 WARN L193 SmtUtils]: Spent 4.11 s on a formula simplification. DAG size of input: 212 DAG size of output: 146 [2020-10-20 06:33:17,848 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2020-10-20 06:33:17,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.10 06:33:17 BoogieIcfgContainer [2020-10-20 06:33:17,890 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-20 06:33:17,890 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 06:33:17,890 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 06:33:17,891 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 06:33:17,891 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:33:08" (3/4) ... [2020-10-20 06:33:17,895 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-10-20 06:33:17,949 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 06:33:17,949 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 06:33:17,951 INFO L168 Benchmark]: Toolchain (without parser) took 10249.30 ms. Allocated memory was 35.1 MB in the beginning and 76.5 MB in the end (delta: 41.4 MB). Free memory was 15.9 MB in the beginning and 43.8 MB in the end (delta: -27.9 MB). Peak memory consumption was 13.5 MB. Max. memory is 14.3 GB. [2020-10-20 06:33:17,952 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 32.5 MB. Free memory was 9.7 MB in the beginning and 9.6 MB in the end (delta: 43.7 kB). Peak memory consumption was 43.7 kB. Max. memory is 14.3 GB. [2020-10-20 06:33:17,953 INFO L168 Benchmark]: CACSL2BoogieTranslator took 301.65 ms. Allocated memory was 35.1 MB in the beginning and 44.6 MB in the end (delta: 9.4 MB). Free memory was 15.0 MB in the beginning and 26.1 MB in the end (delta: -11.1 MB). Peak memory consumption was 11.4 MB. Max. memory is 14.3 GB. [2020-10-20 06:33:17,954 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.59 ms. Allocated memory is still 44.6 MB. Free memory was 26.1 MB in the beginning and 24.6 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 14.3 GB. [2020-10-20 06:33:17,955 INFO L168 Benchmark]: Boogie Preprocessor took 26.66 ms. Allocated memory is still 44.6 MB. Free memory was 24.4 MB in the beginning and 23.2 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.2 MB. Max. memory is 14.3 GB. [2020-10-20 06:33:17,955 INFO L168 Benchmark]: RCFGBuilder took 297.36 ms. Allocated memory was 44.6 MB in the beginning and 46.7 MB in the end (delta: 2.1 MB). Free memory was 23.2 MB in the beginning and 23.4 MB in the end (delta: -196.6 kB). Peak memory consumption was 11.6 MB. Max. memory is 14.3 GB. [2020-10-20 06:33:17,956 INFO L168 Benchmark]: BuchiAutomizer took 9515.55 ms. Allocated memory was 46.7 MB in the beginning and 76.5 MB in the end (delta: 29.9 MB). Free memory was 23.2 MB in the beginning and 45.7 MB in the end (delta: -22.5 MB). Peak memory consumption was 45.6 MB. Max. memory is 14.3 GB. [2020-10-20 06:33:17,957 INFO L168 Benchmark]: Witness Printer took 59.01 ms. Allocated memory is still 76.5 MB. Free memory was 45.7 MB in the beginning and 43.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 14.3 GB. [2020-10-20 06:33:17,960 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 32.5 MB. Free memory was 9.7 MB in the beginning and 9.6 MB in the end (delta: 43.7 kB). Peak memory consumption was 43.7 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 301.65 ms. Allocated memory was 35.1 MB in the beginning and 44.6 MB in the end (delta: 9.4 MB). Free memory was 15.0 MB in the beginning and 26.1 MB in the end (delta: -11.1 MB). Peak memory consumption was 11.4 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 38.59 ms. Allocated memory is still 44.6 MB. Free memory was 26.1 MB in the beginning and 24.6 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 26.66 ms. Allocated memory is still 44.6 MB. Free memory was 24.4 MB in the beginning and 23.2 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.2 MB. Max. memory is 14.3 GB. * RCFGBuilder took 297.36 ms. Allocated memory was 44.6 MB in the beginning and 46.7 MB in the end (delta: 2.1 MB). Free memory was 23.2 MB in the beginning and 23.4 MB in the end (delta: -196.6 kB). Peak memory consumption was 11.6 MB. Max. memory is 14.3 GB. * BuchiAutomizer took 9515.55 ms. Allocated memory was 46.7 MB in the beginning and 76.5 MB in the end (delta: 29.9 MB). Free memory was 23.2 MB in the beginning and 45.7 MB in the end (delta: -22.5 MB). Peak memory consumption was 45.6 MB. Max. memory is 14.3 GB. * Witness Printer took 59.01 ms. Allocated memory is still 76.5 MB. Free memory was 45.7 MB in the beginning and 43.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (10 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -2 * n + 19 and consists of 5 locations. 10 modules have a trivial ranking function, the largest among these consists of 13 locations. The remainder module has 26 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.4s and 12 iterations. TraceHistogramMax:10. Analysis of lassos took 8.6s. Construction of modules took 0.2s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 11. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 10 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 26 states and ocurred in iteration 11. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 80 SDtfs, 65 SDslu, 251 SDs, 0 SdLazy, 188 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU10 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital88 mio100 ax100 hnf100 lsp93 ukn59 mio100 lsp69 div100 bol100 ite100 ukn100 eq152 hnf92 smp100 dnf100 smp100 tf100 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 23ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 17]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@e36b436=0, NULL=0, \result=0, NULL=1, n=10, i=2, a=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@251ce7c7=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@769deb0a=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@282d1d8e=0, a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1976c89b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@50ef4dbf=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 9]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L10] int i = __VERIFIER_nondet_int(); [L11] int a[10]; [L13] int n = 0; [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND FALSE !(n < 10) Loop: [L17] 0 <= i && i < 10 && a[i] >= 0 [L17] EXPR a[i] [L17] 0 <= i && i < 10 && a[i] >= 0 [L17] COND TRUE 0 <= i && i < 10 && a[i] >= 0 [L18] i = __VERIFIER_nondet_int() [L20] a[i] = 0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...