./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/systemc/toy2.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 906a4fb5 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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/systemc/toy2.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash 0f721563b23ef637d292551ef1a662f821e744b5 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-906a4fb [2020-10-19 20:11:02,596 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-19 20:11:02,599 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-19 20:11:02,624 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-19 20:11:02,624 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-19 20:11:02,626 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-19 20:11:02,627 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-19 20:11:02,629 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-19 20:11:02,631 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-19 20:11:02,632 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-19 20:11:02,633 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-19 20:11:02,634 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-19 20:11:02,635 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-19 20:11:02,636 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-19 20:11:02,637 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-19 20:11:02,638 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-19 20:11:02,639 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-19 20:11:02,640 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-19 20:11:02,642 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-19 20:11:02,644 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-19 20:11:02,649 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-19 20:11:02,650 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-19 20:11:02,654 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-19 20:11:02,655 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-19 20:11:02,657 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-19 20:11:02,658 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-19 20:11:02,658 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-19 20:11:02,659 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-19 20:11:02,660 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-19 20:11:02,661 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-19 20:11:02,661 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-19 20:11:02,662 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-19 20:11:02,663 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-19 20:11:02,664 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-19 20:11:02,665 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-19 20:11:02,665 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-19 20:11:02,666 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-19 20:11:02,666 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-19 20:11:02,666 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-19 20:11:02,668 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-19 20:11:02,669 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-19 20:11:02,670 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-19 20:11:02,698 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-19 20:11:02,698 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-19 20:11:02,699 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-19 20:11:02,700 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-19 20:11:02,700 INFO L138 SettingsManager]: * Use SBE=true [2020-10-19 20:11:02,700 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-19 20:11:02,701 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-19 20:11:02,701 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-19 20:11:02,701 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-19 20:11:02,701 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-19 20:11:02,702 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-19 20:11:02,702 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-19 20:11:02,702 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-19 20:11:02,703 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-19 20:11:02,703 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-19 20:11:02,703 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-19 20:11:02,703 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-19 20:11:02,704 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-19 20:11:02,704 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-19 20:11:02,704 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-19 20:11:02,704 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-19 20:11:02,705 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-19 20:11:02,705 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-19 20:11:02,705 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-19 20:11:02,706 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-19 20:11:02,706 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-19 20:11:02,706 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-19 20:11:02,706 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-19 20:11:02,707 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-19 20:11:02,707 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-19 20:11:02,707 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-19 20:11:02,708 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-19 20:11:02,709 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-19 20:11:02,710 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0f721563b23ef637d292551ef1a662f821e744b5 [2020-10-19 20:11:03,035 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-19 20:11:03,054 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-19 20:11:03,060 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-19 20:11:03,062 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-19 20:11:03,063 INFO L275 PluginConnector]: CDTParser initialized [2020-10-19 20:11:03,064 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/toy2.cil.c [2020-10-19 20:11:03,138 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d4aaca20/980340ac33944ee881b75937fea66f3b/FLAGf2b678b72 [2020-10-19 20:11:03,653 INFO L306 CDTParser]: Found 1 translation units. [2020-10-19 20:11:03,653 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy2.cil.c [2020-10-19 20:11:03,670 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d4aaca20/980340ac33944ee881b75937fea66f3b/FLAGf2b678b72 [2020-10-19 20:11:04,118 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d4aaca20/980340ac33944ee881b75937fea66f3b [2020-10-19 20:11:04,122 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-19 20:11:04,129 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-19 20:11:04,132 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-19 20:11:04,132 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-19 20:11:04,136 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-19 20:11:04,138 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 08:11:04" (1/1) ... [2020-10-19 20:11:04,141 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3154cacb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:11:04, skipping insertion in model container [2020-10-19 20:11:04,141 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 08:11:04" (1/1) ... [2020-10-19 20:11:04,151 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-19 20:11:04,211 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-19 20:11:04,446 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 20:11:04,461 INFO L203 MainTranslator]: Completed pre-run [2020-10-19 20:11:04,575 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 20:11:04,594 INFO L208 MainTranslator]: Completed translation [2020-10-19 20:11:04,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:11:04 WrapperNode [2020-10-19 20:11:04,595 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-19 20:11:04,596 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-19 20:11:04,596 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-19 20:11:04,596 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-19 20:11:04,605 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:11:04" (1/1) ... [2020-10-19 20:11:04,617 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:11:04" (1/1) ... [2020-10-19 20:11:04,649 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-19 20:11:04,650 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-19 20:11:04,650 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-19 20:11:04,650 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-19 20:11:04,659 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:11:04" (1/1) ... [2020-10-19 20:11:04,659 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:11:04" (1/1) ... [2020-10-19 20:11:04,663 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:11:04" (1/1) ... [2020-10-19 20:11:04,663 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:11:04" (1/1) ... [2020-10-19 20:11:04,670 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:11:04" (1/1) ... [2020-10-19 20:11:04,680 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:11:04" (1/1) ... [2020-10-19 20:11:04,683 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:11:04" (1/1) ... [2020-10-19 20:11:04,688 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-19 20:11:04,689 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-19 20:11:04,689 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-19 20:11:04,689 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-19 20:11:04,690 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:11:04" (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-19 20:11:04,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-19 20:11:04,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-19 20:11:04,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-19 20:11:04,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-19 20:11:05,455 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-19 20:11:05,455 INFO L298 CfgBuilder]: Removed 28 assume(true) statements. [2020-10-19 20:11:05,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 08:11:05 BoogieIcfgContainer [2020-10-19 20:11:05,458 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-19 20:11:05,459 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-19 20:11:05,459 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-19 20:11:05,463 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-19 20:11:05,464 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 20:11:05,465 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.10 08:11:04" (1/3) ... [2020-10-19 20:11:05,466 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7d3ae3da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 08:11:05, skipping insertion in model container [2020-10-19 20:11:05,466 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 20:11:05,467 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:11:04" (2/3) ... [2020-10-19 20:11:05,467 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7d3ae3da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 08:11:05, skipping insertion in model container [2020-10-19 20:11:05,467 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 20:11:05,468 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 08:11:05" (3/3) ... [2020-10-19 20:11:05,470 INFO L373 chiAutomizerObserver]: Analyzing ICFG toy2.cil.c [2020-10-19 20:11:05,521 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-19 20:11:05,521 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-19 20:11:05,521 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-19 20:11:05,522 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-19 20:11:05,524 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-19 20:11:05,524 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-19 20:11:05,524 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-19 20:11:05,525 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-19 20:11:05,554 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states. [2020-10-19 20:11:05,609 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2020-10-19 20:11:05,610 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:11:05,610 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:11:05,626 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:11:05,626 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:11:05,627 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-19 20:11:05,627 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states. [2020-10-19 20:11:05,644 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2020-10-19 20:11:05,645 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:11:05,645 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:11:05,650 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:11:05,650 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:11:05,667 INFO L794 eck$LassoCheckResult]: Stem: 90#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 11#L-1true havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 104#L396true assume !(1 == ~c_req_up~0); 108#L396-2true assume !(1 == ~wl_i~0);~wl_st~0 := 2; 107#L407-1true assume !(1 == ~c1_i~0);~c1_st~0 := 2; 125#L412-1true assume 1 == ~c2_i~0;~c2_st~0 := 0; 23#L417-1true assume !(1 == ~wb_i~0);~wb_st~0 := 2; 40#L422-1true assume !(1 == ~r_i~0);~r_st~0 := 2; 71#L427-1true assume !(0 == ~e_f~0); 95#L432-1true assume !(0 == ~e_g~0); 110#L437-1true assume !(0 == ~e_e~0); 3#L442-1true assume !(0 == ~e_c~0); 26#L447-1true assume !(0 == ~e_wl~0); 41#L452-1true assume !(1 == ~wl_pc~0); 19#L464true assume !(2 == ~wl_pc~0); 94#L465true assume !(1 == ~c1_pc~0); 17#L475true assume !(1 == ~c2_pc~0); 98#L484true assume !(1 == ~wb_pc~0); 68#L493true assume !(1 == ~e_c~0); 36#L502-1true assume !(1 == ~e_e~0); 63#L507-1true assume !(1 == ~e_f~0); 87#L512-1true assume !(1 == ~e_g~0); 99#L517-1true assume !(1 == ~e_c~0); 124#L522-1true assume !(1 == ~e_wl~0); 45#L664-1true [2020-10-19 20:11:05,669 INFO L796 eck$LassoCheckResult]: Loop: 45#L664-1true assume !false; 83#L534true start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 74#L369true assume !true; 106#L385true start_simulation_~kernel_st~0 := 2; 58#L540true assume !(1 == ~c_req_up~0); 64#L540-2true start_simulation_~kernel_st~0 := 3; 14#L552true assume 0 == ~e_f~0;~e_f~0 := 1; 16#L552-2true assume 0 == ~e_g~0;~e_g~0 := 1; 35#L557-1true assume 0 == ~e_e~0;~e_e~0 := 1; 59#L562-1true assume 0 == ~e_c~0;~e_c~0 := 1; 84#L567-1true assume 0 == ~e_wl~0;~e_wl~0 := 1; 117#L572-1true assume 1 == ~wl_pc~0; 81#L578true assume 1 == ~e_wl~0;~wl_st~0 := 0; 13#L585true assume !(1 == ~c1_pc~0); 54#L595true assume !(1 == ~c2_pc~0); 29#L604true assume !(1 == ~wb_pc~0); 127#L613true assume 1 == ~e_c~0;~r_st~0 := 0; 80#L622-1true assume 1 == ~e_e~0;~e_e~0 := 2; 114#L627-1true assume 1 == ~e_f~0;~e_f~0 := 2; 9#L632-1true assume 1 == ~e_g~0;~e_g~0 := 2; 30#L637-1true assume 1 == ~e_c~0;~e_c~0 := 2; 46#L642-1true assume 1 == ~e_wl~0;~e_wl~0 := 2; 77#L647-1true assume 0 == ~wl_st~0; 45#L664-1true [2020-10-19 20:11:05,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:11:05,681 INFO L82 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 1 times [2020-10-19 20:11:05,693 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:11:05,694 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393663050] [2020-10-19 20:11:05,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:11:05,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:11:05,887 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-19 20:11:05,888 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393663050] [2020-10-19 20:11:05,889 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:11:05,889 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 20:11:05,890 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236099208] [2020-10-19 20:11:05,895 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:11:05,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:11:05,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1991744151, now seen corresponding path program 1 times [2020-10-19 20:11:05,896 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:11:05,897 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646023927] [2020-10-19 20:11:05,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:11:05,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:11:05,909 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-19 20:11:05,910 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646023927] [2020-10-19 20:11:05,910 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:11:05,910 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-19 20:11:05,910 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433673137] [2020-10-19 20:11:05,912 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 20:11:05,913 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:11:05,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-19 20:11:05,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-19 20:11:05,932 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 2 states. [2020-10-19 20:11:05,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:11:05,949 INFO L93 Difference]: Finished difference Result 124 states and 217 transitions. [2020-10-19 20:11:05,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-19 20:11:05,952 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 217 transitions. [2020-10-19 20:11:05,955 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 88 [2020-10-19 20:11:05,962 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 119 states and 212 transitions. [2020-10-19 20:11:05,964 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2020-10-19 20:11:05,965 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 119 [2020-10-19 20:11:05,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 212 transitions. [2020-10-19 20:11:05,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:11:05,967 INFO L691 BuchiCegarLoop]: Abstraction has 119 states and 212 transitions. [2020-10-19 20:11:05,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 212 transitions. [2020-10-19 20:11:05,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2020-10-19 20:11:06,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-10-19 20:11:06,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 212 transitions. [2020-10-19 20:11:06,002 INFO L714 BuchiCegarLoop]: Abstraction has 119 states and 212 transitions. [2020-10-19 20:11:06,003 INFO L594 BuchiCegarLoop]: Abstraction has 119 states and 212 transitions. [2020-10-19 20:11:06,003 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-19 20:11:06,003 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 119 states and 212 transitions. [2020-10-19 20:11:06,005 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 88 [2020-10-19 20:11:06,005 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:11:06,005 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:11:06,007 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:11:06,009 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:11:06,010 INFO L794 eck$LassoCheckResult]: Stem: 366#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 275#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 276#L396 assume !(1 == ~c_req_up~0); 331#L396-2 assume !(1 == ~wl_i~0);~wl_st~0 := 2; 374#L407-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 375#L412-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 296#L417-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 297#L422-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 322#L427-1 assume !(0 == ~e_f~0); 355#L432-1 assume !(0 == ~e_g~0); 370#L437-1 assume !(0 == ~e_e~0); 258#L442-1 assume !(0 == ~e_c~0); 259#L447-1 assume !(0 == ~e_wl~0); 301#L452-1 assume !(1 == ~wl_pc~0); 289#L464 assume !(2 == ~wl_pc~0); 290#L465 assume !(1 == ~c1_pc~0); 285#L475 assume !(1 == ~c2_pc~0); 287#L484 assume !(1 == ~wb_pc~0); 293#L493 assume !(1 == ~e_c~0); 318#L502-1 assume !(1 == ~e_e~0); 319#L507-1 assume !(1 == ~e_f~0); 348#L512-1 assume !(1 == ~e_g~0); 364#L517-1 assume !(1 == ~e_c~0); 372#L522-1 assume !(1 == ~e_wl~0); 324#L664-1 [2020-10-19 20:11:06,010 INFO L796 eck$LassoCheckResult]: Loop: 324#L664-1 assume !false; 327#L534 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 268#L369 assume !false; 335#L287 assume !(0 == ~wl_st~0); 337#L291 assume !(0 == ~c1_st~0); 373#L294 assume !(0 == ~c2_st~0); 362#L297 assume !(0 == ~wb_st~0); 363#L300 assume !(0 == ~r_st~0); 368#L385 start_simulation_~kernel_st~0 := 2; 346#L540 assume !(1 == ~c_req_up~0); 288#L540-2 start_simulation_~kernel_st~0 := 3; 280#L552 assume 0 == ~e_f~0;~e_f~0 := 1; 281#L552-2 assume 0 == ~e_g~0;~e_g~0 := 1; 284#L557-1 assume 0 == ~e_e~0;~e_e~0 := 1; 317#L562-1 assume 0 == ~e_c~0;~e_c~0 := 1; 347#L567-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 361#L572-1 assume !(1 == ~wl_pc~0); 342#L584 assume !(2 == ~wl_pc~0); 279#L585 assume !(1 == ~c1_pc~0); 278#L595 assume !(1 == ~c2_pc~0); 305#L604 assume !(1 == ~wb_pc~0); 306#L613 assume 1 == ~e_c~0;~r_st~0 := 0; 358#L622-1 assume 1 == ~e_e~0;~e_e~0 := 2; 359#L627-1 assume 1 == ~e_f~0;~e_f~0 := 2; 271#L632-1 assume 1 == ~e_g~0;~e_g~0 := 2; 272#L637-1 assume 1 == ~e_c~0;~e_c~0 := 2; 308#L642-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 328#L647-1 assume 0 == ~wl_st~0; 324#L664-1 [2020-10-19 20:11:06,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:11:06,011 INFO L82 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 2 times [2020-10-19 20:11:06,011 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:11:06,012 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853051123] [2020-10-19 20:11:06,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:11:06,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:11:06,085 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-19 20:11:06,086 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853051123] [2020-10-19 20:11:06,086 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:11:06,086 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 20:11:06,087 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796077416] [2020-10-19 20:11:06,087 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:11:06,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:11:06,088 INFO L82 PathProgramCache]: Analyzing trace with hash 860549372, now seen corresponding path program 1 times [2020-10-19 20:11:06,088 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:11:06,088 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562019526] [2020-10-19 20:11:06,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:11:06,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:11:06,130 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-19 20:11:06,131 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562019526] [2020-10-19 20:11:06,131 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:11:06,131 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-19 20:11:06,132 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819622490] [2020-10-19 20:11:06,132 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 20:11:06,133 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:11:06,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 20:11:06,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 20:11:06,134 INFO L87 Difference]: Start difference. First operand 119 states and 212 transitions. cyclomatic complexity: 94 Second operand 3 states. [2020-10-19 20:11:06,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:11:06,173 INFO L93 Difference]: Finished difference Result 119 states and 211 transitions. [2020-10-19 20:11:06,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 20:11:06,178 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 211 transitions. [2020-10-19 20:11:06,181 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 88 [2020-10-19 20:11:06,184 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 119 states and 211 transitions. [2020-10-19 20:11:06,187 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2020-10-19 20:11:06,188 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 119 [2020-10-19 20:11:06,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 211 transitions. [2020-10-19 20:11:06,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:11:06,192 INFO L691 BuchiCegarLoop]: Abstraction has 119 states and 211 transitions. [2020-10-19 20:11:06,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 211 transitions. [2020-10-19 20:11:06,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2020-10-19 20:11:06,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-10-19 20:11:06,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 211 transitions. [2020-10-19 20:11:06,205 INFO L714 BuchiCegarLoop]: Abstraction has 119 states and 211 transitions. [2020-10-19 20:11:06,205 INFO L594 BuchiCegarLoop]: Abstraction has 119 states and 211 transitions. [2020-10-19 20:11:06,206 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-19 20:11:06,206 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 119 states and 211 transitions. [2020-10-19 20:11:06,209 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 88 [2020-10-19 20:11:06,209 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:11:06,209 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:11:06,211 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:11:06,212 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:11:06,212 INFO L794 eck$LassoCheckResult]: Stem: 611#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 520#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 521#L396 assume !(1 == ~c_req_up~0); 576#L396-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 619#L407-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 620#L412-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 541#L417-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 542#L422-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 567#L427-1 assume !(0 == ~e_f~0); 600#L432-1 assume !(0 == ~e_g~0); 615#L437-1 assume !(0 == ~e_e~0); 503#L442-1 assume !(0 == ~e_c~0); 504#L447-1 assume !(0 == ~e_wl~0); 546#L452-1 assume !(1 == ~wl_pc~0); 534#L464 assume !(2 == ~wl_pc~0); 535#L465 assume !(1 == ~c1_pc~0); 530#L475 assume !(1 == ~c2_pc~0); 532#L484 assume !(1 == ~wb_pc~0); 538#L493 assume !(1 == ~e_c~0); 563#L502-1 assume !(1 == ~e_e~0); 564#L507-1 assume !(1 == ~e_f~0); 593#L512-1 assume !(1 == ~e_g~0); 609#L517-1 assume !(1 == ~e_c~0); 617#L522-1 assume !(1 == ~e_wl~0); 569#L664-1 [2020-10-19 20:11:06,212 INFO L796 eck$LassoCheckResult]: Loop: 569#L664-1 assume !false; 572#L534 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 513#L369 assume !false; 580#L287 assume !(0 == ~wl_st~0); 582#L291 assume !(0 == ~c1_st~0); 618#L294 assume !(0 == ~c2_st~0); 607#L297 assume !(0 == ~wb_st~0); 608#L300 assume !(0 == ~r_st~0); 613#L385 start_simulation_~kernel_st~0 := 2; 591#L540 assume !(1 == ~c_req_up~0); 533#L540-2 start_simulation_~kernel_st~0 := 3; 525#L552 assume 0 == ~e_f~0;~e_f~0 := 1; 526#L552-2 assume 0 == ~e_g~0;~e_g~0 := 1; 529#L557-1 assume 0 == ~e_e~0;~e_e~0 := 1; 562#L562-1 assume 0 == ~e_c~0;~e_c~0 := 1; 592#L567-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 606#L572-1 assume !(1 == ~wl_pc~0); 587#L584 assume !(2 == ~wl_pc~0); 524#L585 assume !(1 == ~c1_pc~0); 523#L595 assume !(1 == ~c2_pc~0); 550#L604 assume !(1 == ~wb_pc~0); 551#L613 assume 1 == ~e_c~0;~r_st~0 := 0; 603#L622-1 assume 1 == ~e_e~0;~e_e~0 := 2; 604#L627-1 assume 1 == ~e_f~0;~e_f~0 := 2; 516#L632-1 assume 1 == ~e_g~0;~e_g~0 := 2; 517#L637-1 assume 1 == ~e_c~0;~e_c~0 := 2; 553#L642-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 573#L647-1 assume 0 == ~wl_st~0; 569#L664-1 [2020-10-19 20:11:06,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:11:06,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1738779219, now seen corresponding path program 1 times [2020-10-19 20:11:06,213 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:11:06,215 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614193650] [2020-10-19 20:11:06,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:11:06,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:11:06,307 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-19 20:11:06,308 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614193650] [2020-10-19 20:11:06,309 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:11:06,309 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 20:11:06,309 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181941441] [2020-10-19 20:11:06,310 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:11:06,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:11:06,310 INFO L82 PathProgramCache]: Analyzing trace with hash 860549372, now seen corresponding path program 2 times [2020-10-19 20:11:06,311 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:11:06,311 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703959462] [2020-10-19 20:11:06,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:11:06,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:11:06,346 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-19 20:11:06,346 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703959462] [2020-10-19 20:11:06,347 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:11:06,347 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-19 20:11:06,347 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75537882] [2020-10-19 20:11:06,348 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 20:11:06,348 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:11:06,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 20:11:06,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 20:11:06,349 INFO L87 Difference]: Start difference. First operand 119 states and 211 transitions. cyclomatic complexity: 93 Second operand 3 states. [2020-10-19 20:11:06,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:11:06,365 INFO L93 Difference]: Finished difference Result 119 states and 210 transitions. [2020-10-19 20:11:06,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 20:11:06,366 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 210 transitions. [2020-10-19 20:11:06,367 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 88 [2020-10-19 20:11:06,369 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 119 states and 210 transitions. [2020-10-19 20:11:06,370 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2020-10-19 20:11:06,370 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 119 [2020-10-19 20:11:06,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 210 transitions. [2020-10-19 20:11:06,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:11:06,375 INFO L691 BuchiCegarLoop]: Abstraction has 119 states and 210 transitions. [2020-10-19 20:11:06,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 210 transitions. [2020-10-19 20:11:06,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2020-10-19 20:11:06,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-10-19 20:11:06,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 210 transitions. [2020-10-19 20:11:06,383 INFO L714 BuchiCegarLoop]: Abstraction has 119 states and 210 transitions. [2020-10-19 20:11:06,384 INFO L594 BuchiCegarLoop]: Abstraction has 119 states and 210 transitions. [2020-10-19 20:11:06,384 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-19 20:11:06,384 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 119 states and 210 transitions. [2020-10-19 20:11:06,385 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 88 [2020-10-19 20:11:06,386 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:11:06,386 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:11:06,387 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:11:06,388 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:11:06,388 INFO L794 eck$LassoCheckResult]: Stem: 856#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 765#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 766#L396 assume !(1 == ~c_req_up~0); 821#L396-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 864#L407-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 865#L412-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 786#L417-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 787#L422-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 812#L427-1 assume !(0 == ~e_f~0); 845#L432-1 assume !(0 == ~e_g~0); 860#L437-1 assume !(0 == ~e_e~0); 748#L442-1 assume !(0 == ~e_c~0); 749#L447-1 assume !(0 == ~e_wl~0); 791#L452-1 assume !(1 == ~wl_pc~0); 779#L464 assume !(2 == ~wl_pc~0); 780#L465 assume !(1 == ~c1_pc~0); 775#L475 assume !(1 == ~c2_pc~0); 777#L484 assume !(1 == ~wb_pc~0); 783#L493 assume !(1 == ~e_c~0); 808#L502-1 assume !(1 == ~e_e~0); 809#L507-1 assume !(1 == ~e_f~0); 838#L512-1 assume !(1 == ~e_g~0); 854#L517-1 assume !(1 == ~e_c~0); 862#L522-1 assume !(1 == ~e_wl~0); 814#L664-1 [2020-10-19 20:11:06,388 INFO L796 eck$LassoCheckResult]: Loop: 814#L664-1 assume !false; 817#L534 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 758#L369 assume !false; 825#L287 assume !(0 == ~wl_st~0); 827#L291 assume !(0 == ~c1_st~0); 863#L294 assume !(0 == ~c2_st~0); 852#L297 assume !(0 == ~wb_st~0); 853#L300 assume !(0 == ~r_st~0); 858#L385 start_simulation_~kernel_st~0 := 2; 836#L540 assume !(1 == ~c_req_up~0); 778#L540-2 start_simulation_~kernel_st~0 := 3; 770#L552 assume 0 == ~e_f~0;~e_f~0 := 1; 771#L552-2 assume 0 == ~e_g~0;~e_g~0 := 1; 774#L557-1 assume 0 == ~e_e~0;~e_e~0 := 1; 807#L562-1 assume 0 == ~e_c~0;~e_c~0 := 1; 837#L567-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 851#L572-1 assume !(1 == ~wl_pc~0); 832#L584 assume !(2 == ~wl_pc~0); 769#L585 assume !(1 == ~c1_pc~0); 768#L595 assume !(1 == ~c2_pc~0); 795#L604 assume !(1 == ~wb_pc~0); 796#L613 assume 1 == ~e_c~0;~r_st~0 := 0; 848#L622-1 assume 1 == ~e_e~0;~e_e~0 := 2; 849#L627-1 assume 1 == ~e_f~0;~e_f~0 := 2; 761#L632-1 assume 1 == ~e_g~0;~e_g~0 := 2; 762#L637-1 assume 1 == ~e_c~0;~e_c~0 := 2; 798#L642-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 818#L647-1 assume 0 == ~wl_st~0; 814#L664-1 [2020-10-19 20:11:06,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:11:06,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1738539627, now seen corresponding path program 1 times [2020-10-19 20:11:06,389 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:11:06,390 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131645240] [2020-10-19 20:11:06,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:11:06,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:11:06,443 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-19 20:11:06,443 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131645240] [2020-10-19 20:11:06,444 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:11:06,445 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 20:11:06,445 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185883210] [2020-10-19 20:11:06,446 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:11:06,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:11:06,447 INFO L82 PathProgramCache]: Analyzing trace with hash 860549372, now seen corresponding path program 3 times [2020-10-19 20:11:06,447 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:11:06,447 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862834285] [2020-10-19 20:11:06,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:11:06,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:11:06,478 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-19 20:11:06,479 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862834285] [2020-10-19 20:11:06,479 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:11:06,479 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-19 20:11:06,480 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264447404] [2020-10-19 20:11:06,480 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 20:11:06,480 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:11:06,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 20:11:06,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 20:11:06,482 INFO L87 Difference]: Start difference. First operand 119 states and 210 transitions. cyclomatic complexity: 92 Second operand 3 states. [2020-10-19 20:11:06,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:11:06,496 INFO L93 Difference]: Finished difference Result 119 states and 209 transitions. [2020-10-19 20:11:06,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 20:11:06,497 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 209 transitions. [2020-10-19 20:11:06,499 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 88 [2020-10-19 20:11:06,500 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 119 states and 209 transitions. [2020-10-19 20:11:06,501 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2020-10-19 20:11:06,501 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 119 [2020-10-19 20:11:06,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 209 transitions. [2020-10-19 20:11:06,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:11:06,503 INFO L691 BuchiCegarLoop]: Abstraction has 119 states and 209 transitions. [2020-10-19 20:11:06,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 209 transitions. [2020-10-19 20:11:06,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2020-10-19 20:11:06,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-10-19 20:11:06,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 209 transitions. [2020-10-19 20:11:06,510 INFO L714 BuchiCegarLoop]: Abstraction has 119 states and 209 transitions. [2020-10-19 20:11:06,510 INFO L594 BuchiCegarLoop]: Abstraction has 119 states and 209 transitions. [2020-10-19 20:11:06,511 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-19 20:11:06,511 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 119 states and 209 transitions. [2020-10-19 20:11:06,512 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 88 [2020-10-19 20:11:06,512 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:11:06,513 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:11:06,514 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:11:06,514 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:11:06,515 INFO L794 eck$LassoCheckResult]: Stem: 1101#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 1010#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 1011#L396 assume !(1 == ~c_req_up~0); 1066#L396-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1109#L407-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1110#L412-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1031#L417-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1032#L422-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1057#L427-1 assume !(0 == ~e_f~0); 1090#L432-1 assume !(0 == ~e_g~0); 1105#L437-1 assume !(0 == ~e_e~0); 993#L442-1 assume !(0 == ~e_c~0); 994#L447-1 assume !(0 == ~e_wl~0); 1036#L452-1 assume !(1 == ~wl_pc~0); 1024#L464 assume !(2 == ~wl_pc~0); 1025#L465 assume !(1 == ~c1_pc~0); 1020#L475 assume !(1 == ~c2_pc~0); 1022#L484 assume !(1 == ~wb_pc~0); 1028#L493 assume !(1 == ~e_c~0); 1053#L502-1 assume !(1 == ~e_e~0); 1054#L507-1 assume !(1 == ~e_f~0); 1083#L512-1 assume !(1 == ~e_g~0); 1099#L517-1 assume !(1 == ~e_c~0); 1107#L522-1 assume !(1 == ~e_wl~0); 1059#L664-1 [2020-10-19 20:11:06,515 INFO L796 eck$LassoCheckResult]: Loop: 1059#L664-1 assume !false; 1062#L534 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 1003#L369 assume !false; 1070#L287 assume !(0 == ~wl_st~0); 1072#L291 assume !(0 == ~c1_st~0); 1108#L294 assume !(0 == ~c2_st~0); 1097#L297 assume !(0 == ~wb_st~0); 1098#L300 assume !(0 == ~r_st~0); 1103#L385 start_simulation_~kernel_st~0 := 2; 1081#L540 assume !(1 == ~c_req_up~0); 1023#L540-2 start_simulation_~kernel_st~0 := 3; 1015#L552 assume 0 == ~e_f~0;~e_f~0 := 1; 1016#L552-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1019#L557-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1052#L562-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1082#L567-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1096#L572-1 assume !(1 == ~wl_pc~0); 1077#L584 assume !(2 == ~wl_pc~0); 1014#L585 assume !(1 == ~c1_pc~0); 1013#L595 assume !(1 == ~c2_pc~0); 1040#L604 assume !(1 == ~wb_pc~0); 1041#L613 assume 1 == ~e_c~0;~r_st~0 := 0; 1093#L622-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1094#L627-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1006#L632-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1007#L637-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1043#L642-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1063#L647-1 assume 0 == ~wl_st~0; 1059#L664-1 [2020-10-19 20:11:06,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:11:06,516 INFO L82 PathProgramCache]: Analyzing trace with hash 255605079, now seen corresponding path program 1 times [2020-10-19 20:11:06,516 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:11:06,516 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156415051] [2020-10-19 20:11:06,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:11:06,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:11:06,535 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:11:06,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:11:06,551 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:11:06,594 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:11:06,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:11:06,595 INFO L82 PathProgramCache]: Analyzing trace with hash 860549372, now seen corresponding path program 4 times [2020-10-19 20:11:06,595 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:11:06,595 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750029171] [2020-10-19 20:11:06,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:11:06,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:11:06,620 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-19 20:11:06,621 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750029171] [2020-10-19 20:11:06,621 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:11:06,622 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-19 20:11:06,622 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219461998] [2020-10-19 20:11:06,622 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 20:11:06,623 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:11:06,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 20:11:06,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 20:11:06,624 INFO L87 Difference]: Start difference. First operand 119 states and 209 transitions. cyclomatic complexity: 91 Second operand 3 states. [2020-10-19 20:11:06,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:11:06,678 INFO L93 Difference]: Finished difference Result 171 states and 297 transitions. [2020-10-19 20:11:06,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 20:11:06,680 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 171 states and 297 transitions. [2020-10-19 20:11:06,682 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 140 [2020-10-19 20:11:06,684 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 171 states to 171 states and 297 transitions. [2020-10-19 20:11:06,684 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 171 [2020-10-19 20:11:06,685 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 171 [2020-10-19 20:11:06,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 171 states and 297 transitions. [2020-10-19 20:11:06,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 20:11:06,687 INFO L691 BuchiCegarLoop]: Abstraction has 171 states and 297 transitions. [2020-10-19 20:11:06,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states and 297 transitions. [2020-10-19 20:11:06,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2020-10-19 20:11:06,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2020-10-19 20:11:06,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 297 transitions. [2020-10-19 20:11:06,697 INFO L714 BuchiCegarLoop]: Abstraction has 171 states and 297 transitions. [2020-10-19 20:11:06,697 INFO L594 BuchiCegarLoop]: Abstraction has 171 states and 297 transitions. [2020-10-19 20:11:06,697 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-19 20:11:06,697 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 171 states and 297 transitions. [2020-10-19 20:11:06,699 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 140 [2020-10-19 20:11:06,699 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:11:06,700 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:11:06,701 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:11:06,701 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:11:06,701 INFO L794 eck$LassoCheckResult]: Stem: 1403#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 1307#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 1308#L396 assume !(1 == ~c_req_up~0); 1364#L396-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1410#L407-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1411#L412-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1328#L417-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1329#L422-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1355#L427-1 assume !(0 == ~e_f~0); 1389#L432-1 assume !(0 == ~e_g~0); 1406#L437-1 assume !(0 == ~e_e~0); 1289#L442-1 assume !(0 == ~e_c~0); 1290#L447-1 assume !(0 == ~e_wl~0); 1333#L452-1 assume !(1 == ~wl_pc~0); 1321#L464 assume !(2 == ~wl_pc~0); 1322#L465 assume !(1 == ~c1_pc~0); 1317#L475 assume !(1 == ~c2_pc~0); 1319#L484 assume !(1 == ~wb_pc~0); 1325#L493 assume !(1 == ~e_c~0); 1350#L502-1 assume !(1 == ~e_e~0); 1351#L507-1 assume !(1 == ~e_f~0); 1382#L512-1 assume !(1 == ~e_g~0); 1401#L517-1 assume !(1 == ~e_c~0); 1408#L522-1 assume !(1 == ~e_wl~0); 1415#L664-1 [2020-10-19 20:11:06,702 INFO L796 eck$LassoCheckResult]: Loop: 1415#L664-1 assume !false; 1419#L534 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 1418#L369 assume !false; 1417#L287 assume !(0 == ~wl_st~0); 1370#L291 assume !(0 == ~c1_st~0); 1409#L294 assume !(0 == ~c2_st~0); 1398#L297 assume !(0 == ~wb_st~0); 1400#L300 assume !(0 == ~r_st~0); 1404#L385 start_simulation_~kernel_st~0 := 2; 1380#L540 assume !(1 == ~c_req_up~0); 1320#L540-2 start_simulation_~kernel_st~0 := 3; 1312#L552 assume 0 == ~e_f~0;~e_f~0 := 1; 1313#L552-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1316#L557-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1349#L562-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1381#L567-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1397#L572-1 assume 1 == ~wl_pc~0; 1395#L578 assume 1 == ~e_wl~0;~wl_st~0 := 0; 1311#L585 assume !(1 == ~c1_pc~0); 1310#L595 assume !(1 == ~c2_pc~0); 1337#L604 assume !(1 == ~wb_pc~0); 1338#L613 assume 1 == ~e_c~0;~r_st~0 := 0; 1393#L622-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1394#L627-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1303#L632-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1304#L637-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1340#L642-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1361#L647-1 assume 0 == ~wl_st~0; 1415#L664-1 [2020-10-19 20:11:06,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:11:06,702 INFO L82 PathProgramCache]: Analyzing trace with hash 255605079, now seen corresponding path program 2 times [2020-10-19 20:11:06,703 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:11:06,703 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247672190] [2020-10-19 20:11:06,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:11:06,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:11:06,717 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:11:06,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:11:06,728 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:11:06,738 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:11:06,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:11:06,739 INFO L82 PathProgramCache]: Analyzing trace with hash 311289651, now seen corresponding path program 1 times [2020-10-19 20:11:06,739 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:11:06,740 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802991309] [2020-10-19 20:11:06,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:11:06,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:11:06,747 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:11:06,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:11:06,753 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:11:06,759 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:11:06,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:11:06,760 INFO L82 PathProgramCache]: Analyzing trace with hash -629054583, now seen corresponding path program 1 times [2020-10-19 20:11:06,760 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:11:06,761 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011519299] [2020-10-19 20:11:06,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:11:06,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:11:06,809 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-19 20:11:06,809 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011519299] [2020-10-19 20:11:06,809 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:11:06,810 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 20:11:06,810 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217593194] [2020-10-19 20:11:06,922 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2020-10-19 20:11:07,063 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 20:11:07,065 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 20:11:07,066 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 20:11:07,066 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 20:11:07,067 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-19 20:11:07,067 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:11:07,067 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 20:11:07,068 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 20:11:07,068 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration6_Loop [2020-10-19 20:11:07,069 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 20:11:07,069 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 20:11:07,097 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-19 20:11:07,106 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-19 20:11:07,109 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-19 20:11:07,115 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-19 20:11:07,118 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-19 20:11:07,122 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-19 20:11:07,126 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-19 20:11:07,132 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-19 20:11:07,136 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-19 20:11:07,140 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-19 20:11:07,144 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-19 20:11:07,147 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-19 20:11:07,155 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-19 20:11:07,158 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-19 20:11:07,162 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-19 20:11:07,169 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-19 20:11:07,173 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-19 20:11:07,180 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-19 20:11:07,184 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-19 20:11:07,189 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-19 20:11:07,192 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-19 20:11:07,200 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-19 20:11:07,204 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-19 20:11:07,207 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-19 20:11:07,211 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-19 20:11:07,214 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-19 20:11:07,511 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 20:11:07,512 INFO L404 LassoAnalysis]: Checking for nontermination... 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-19 20:11:07,522 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-19 20:11:07,522 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:11:07,532 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-19 20:11:07,532 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c2_st~0=7} Honda state: {~c2_st~0=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:11:07,565 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-19 20:11:07,566 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-19 20:11:07,569 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-19 20:11:07,570 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet11=0} Honda state: {ULTIMATE.start_eval_#t~nondet11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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-19 20:11:07,603 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-19 20:11:07,603 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:11:07,661 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-19 20:11:07,661 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-19 20:11:07,672 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:11:07,701 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 20:11:07,701 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 20:11:07,702 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 20:11:07,702 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 20:11:07,702 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 20:11:07,702 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:11:07,702 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 20:11:07,702 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 20:11:07,702 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration6_Loop [2020-10-19 20:11:07,702 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 20:11:07,702 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 20:11:07,709 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-19 20:11:07,713 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-19 20:11:07,716 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-19 20:11:07,722 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-19 20:11:07,725 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-19 20:11:07,729 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-19 20:11:07,733 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-19 20:11:07,740 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-19 20:11:07,743 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-19 20:11:07,747 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-19 20:11:07,751 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-19 20:11:07,754 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-19 20:11:07,761 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-19 20:11:07,765 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-19 20:11:07,769 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-19 20:11:07,777 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-19 20:11:07,781 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-19 20:11:07,790 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-19 20:11:07,795 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-19 20:11:07,800 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-19 20:11:07,805 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-19 20:11:07,815 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-19 20:11:07,819 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-19 20:11:07,826 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-19 20:11:07,832 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-19 20:11:07,836 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-19 20:11:08,180 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 20:11:08,186 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2020-10-19 20:11:08,202 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-19 20:11:08,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:11:08,206 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:11:08,206 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:11:08,207 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-19 20:11:08,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:11:08,210 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-10-19 20:11:08,210 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:11:08,214 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) [2020-10-19 20:11:08,264 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-19 20:11:08,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:11:08,267 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:11:08,267 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:11:08,267 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:11:08,267 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:11:08,268 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:11:08,269 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:11:08,271 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-19 20:11:08,318 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-19 20:11:08,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:11:08,320 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:11:08,321 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:11:08,321 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:11:08,321 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:11:08,322 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:11:08,323 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:11:08,326 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 20:11:08,334 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-19 20:11:08,334 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. 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-19 20:11:08,341 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-19 20:11:08,341 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-19 20:11:08,341 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 20:11:08,342 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] [2020-10-19 20:11:08,379 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-19 20:11:08,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:11:08,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:11:08,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 20:11:08,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:11:08,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:11:08,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 20:11:08,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:11:08,517 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-19 20:11:08,522 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-10-19 20:11:08,523 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 171 states and 297 transitions. cyclomatic complexity: 127 Second operand 5 states. [2020-10-19 20:11:08,675 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 171 states and 297 transitions. cyclomatic complexity: 127. Second operand 5 states. Result 599 states and 1036 transitions. Complement of second has 5 states. [2020-10-19 20:11:08,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-19 20:11:08,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-19 20:11:08,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions. [2020-10-19 20:11:08,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 366 transitions. Stem has 24 letters. Loop has 28 letters. [2020-10-19 20:11:08,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:11:08,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 366 transitions. Stem has 52 letters. Loop has 28 letters. [2020-10-19 20:11:08,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:11:08,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 366 transitions. Stem has 24 letters. Loop has 56 letters. [2020-10-19 20:11:08,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:11:08,694 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 599 states and 1036 transitions. [2020-10-19 20:11:08,704 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 420 [2020-10-19 20:11:08,709 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 599 states to 599 states and 1036 transitions. [2020-10-19 20:11:08,710 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 452 [2020-10-19 20:11:08,711 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 456 [2020-10-19 20:11:08,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 599 states and 1036 transitions. [2020-10-19 20:11:08,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:11:08,712 INFO L691 BuchiCegarLoop]: Abstraction has 599 states and 1036 transitions. [2020-10-19 20:11:08,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states and 1036 transitions. [2020-10-19 20:11:08,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 455. [2020-10-19 20:11:08,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2020-10-19 20:11:08,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 789 transitions. [2020-10-19 20:11:08,757 INFO L714 BuchiCegarLoop]: Abstraction has 455 states and 789 transitions. [2020-10-19 20:11:08,757 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:11:08,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 20:11:08,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 20:11:08,758 INFO L87 Difference]: Start difference. First operand 455 states and 789 transitions. Second operand 3 states. [2020-10-19 20:11:08,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:11:08,799 INFO L93 Difference]: Finished difference Result 455 states and 780 transitions. [2020-10-19 20:11:08,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 20:11:08,799 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 455 states and 780 transitions. [2020-10-19 20:11:08,804 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 280 [2020-10-19 20:11:08,809 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 455 states to 455 states and 780 transitions. [2020-10-19 20:11:08,809 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 312 [2020-10-19 20:11:08,811 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 312 [2020-10-19 20:11:08,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 455 states and 780 transitions. [2020-10-19 20:11:08,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:11:08,812 INFO L691 BuchiCegarLoop]: Abstraction has 455 states and 780 transitions. [2020-10-19 20:11:08,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states and 780 transitions. [2020-10-19 20:11:08,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 455. [2020-10-19 20:11:08,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2020-10-19 20:11:08,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 780 transitions. [2020-10-19 20:11:08,827 INFO L714 BuchiCegarLoop]: Abstraction has 455 states and 780 transitions. [2020-10-19 20:11:08,827 INFO L594 BuchiCegarLoop]: Abstraction has 455 states and 780 transitions. [2020-10-19 20:11:08,827 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-19 20:11:08,828 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 455 states and 780 transitions. [2020-10-19 20:11:08,831 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 280 [2020-10-19 20:11:08,831 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:11:08,831 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:11:08,837 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:11:08,838 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:11:08,838 INFO L794 eck$LassoCheckResult]: Stem: 3359#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 3181#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 3182#L396 assume !(1 == ~c_req_up~0); 3281#L396-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 3374#L407-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 3375#L412-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 3214#L417-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 3215#L422-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 3262#L427-1 assume !(0 == ~e_f~0); 3330#L432-1 assume !(0 == ~e_g~0); 3365#L437-1 assume !(0 == ~e_e~0); 3148#L442-1 assume !(0 == ~e_c~0); 3149#L447-1 assume !(0 == ~e_wl~0); 3222#L452-1 assume !(1 == ~wl_pc~0); 3205#L464 assume !(2 == ~wl_pc~0); 3206#L465 assume !(1 == ~c1_pc~0); 3200#L475 assume !(1 == ~c2_pc~0); 3202#L484 assume !(1 == ~wb_pc~0); 3209#L493 assume !(1 == ~e_c~0); 3257#L502-1 assume !(1 == ~e_e~0); 3258#L507-1 assume !(1 == ~e_f~0); 3317#L512-1 assume !(1 == ~e_g~0); 3355#L517-1 assume !(1 == ~e_c~0); 3368#L522-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 3269#L664-1 [2020-10-19 20:11:08,839 INFO L796 eck$LassoCheckResult]: Loop: 3269#L664-1 assume !false; 3270#L534 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 3165#L369 assume !false; 3289#L287 assume 0 == ~wl_st~0; 3290#L300-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet7;havoc eval_#t~nondet7; 3360#L313 assume 0 != eval_~tmp~0;~wl_st~0 := 1;havoc write_loop_~t~0;havoc write_loop_~t~0; 3322#L58 assume 0 == ~wl_pc~0; 3296#L71 ~wl_st~0 := 2;~wl_pc~0 := 1;~e_wl~0 := 0; 3288#L309 assume !(0 == ~c1_st~0); 3534#L324 assume !(0 == ~c2_st~0); 3407#L339 assume !(0 == ~wb_st~0); 3405#L354 assume !(0 == ~r_st~0); 3394#L369 assume !false; 3395#L287 assume !(0 == ~wl_st~0); 3383#L291 assume !(0 == ~c1_st~0); 3370#L294 assume !(0 == ~c2_st~0); 3372#L297 assume !(0 == ~wb_st~0); 3416#L300 assume !(0 == ~r_st~0); 3415#L385 start_simulation_~kernel_st~0 := 2; 3413#L540 assume !(1 == ~c_req_up~0); 3412#L540-2 start_simulation_~kernel_st~0 := 3; 3411#L552 assume 0 == ~e_f~0;~e_f~0 := 1; 3410#L552-2 assume 0 == ~e_g~0;~e_g~0 := 1; 3409#L557-1 assume 0 == ~e_e~0;~e_e~0 := 1; 3402#L562-1 assume 0 == ~e_c~0;~e_c~0 := 1; 3403#L567-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 3476#L572-1 assume 1 == ~wl_pc~0; 3475#L578 assume 1 == ~e_wl~0;~wl_st~0 := 0; 3474#L585 assume !(1 == ~c1_pc~0); 3599#L595 assume !(1 == ~c2_pc~0); 3597#L604 assume !(1 == ~wb_pc~0); 3595#L613 assume 1 == ~e_c~0;~r_st~0 := 0; 3594#L622-1 assume 1 == ~e_e~0;~e_e~0 := 2; 3593#L627-1 assume 1 == ~e_f~0;~e_f~0 := 2; 3592#L632-1 assume 1 == ~e_g~0;~e_g~0 := 2; 3235#L637-1 assume 1 == ~e_c~0;~e_c~0 := 2; 3236#L642-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 3561#L647-1 assume 0 == ~wl_st~0; 3269#L664-1 [2020-10-19 20:11:08,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:11:08,839 INFO L82 PathProgramCache]: Analyzing trace with hash 255605077, now seen corresponding path program 1 times [2020-10-19 20:11:08,839 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:11:08,840 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82729658] [2020-10-19 20:11:08,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:11:08,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:11:08,907 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-19 20:11:08,907 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82729658] [2020-10-19 20:11:08,907 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:11:08,907 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 20:11:08,908 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577028779] [2020-10-19 20:11:08,908 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:11:08,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:11:08,908 INFO L82 PathProgramCache]: Analyzing trace with hash 378230695, now seen corresponding path program 1 times [2020-10-19 20:11:08,908 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:11:08,909 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183240601] [2020-10-19 20:11:08,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:11:08,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:11:08,926 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:11:08,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:11:08,935 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:11:08,951 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:11:09,146 WARN L193 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2020-10-19 20:11:09,217 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 20:11:09,217 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 20:11:09,218 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 20:11:09,218 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 20:11:09,218 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-19 20:11:09,218 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:11:09,218 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 20:11:09,218 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 20:11:09,218 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration7_Loop [2020-10-19 20:11:09,218 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 20:11:09,218 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 20:11:09,221 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-19 20:11:09,227 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-19 20:11:09,231 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-19 20:11:09,233 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-19 20:11:09,236 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-19 20:11:09,241 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-19 20:11:09,244 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-19 20:11:09,247 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-19 20:11:09,250 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-19 20:11:09,255 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-19 20:11:09,258 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-19 20:11:09,261 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-19 20:11:09,269 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-19 20:11:09,274 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-19 20:11:09,278 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-19 20:11:09,284 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-19 20:11:09,286 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-19 20:11:09,293 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-19 20:11:09,299 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-19 20:11:09,304 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-19 20:11:09,308 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-19 20:11:09,311 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-19 20:11:09,314 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-19 20:11:09,318 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-19 20:11:09,321 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-19 20:11:09,325 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-19 20:11:09,332 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-19 20:11:09,591 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 20:11:09,591 INFO L404 LassoAnalysis]: Checking for nontermination... 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) [2020-10-19 20:11:09,606 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-19 20:11:09,606 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:11:09,611 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-19 20:11:09,611 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet10=0} Honda state: {ULTIMATE.start_eval_#t~nondet10=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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-19 20:11:09,661 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-19 20:11:09,662 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:11:09,668 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-19 20:11:09,668 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c2_st~0=7} Honda state: {~c2_st~0=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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-19 20:11:09,717 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-19 20:11:09,718 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:11:09,726 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-19 20:11:09,727 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet11=0} Honda state: {ULTIMATE.start_eval_#t~nondet11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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-19 20:11:09,769 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-19 20:11:09,769 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-19 20:11:09,775 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-19 20:11:09,775 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___3~0=0} Honda state: {ULTIMATE.start_eval_~tmp___3~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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-19 20:11:09,802 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-19 20:11:09,803 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:11:09,869 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-19 20:11:09,869 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-19 20:11:09,875 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-19 20:11:09,919 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 20:11:09,919 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 20:11:09,919 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 20:11:09,919 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 20:11:09,919 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 20:11:09,919 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:11:09,919 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 20:11:09,919 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 20:11:09,920 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration7_Loop [2020-10-19 20:11:09,920 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 20:11:09,920 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 20:11:09,923 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-19 20:11:09,925 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-19 20:11:09,927 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-19 20:11:09,930 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-19 20:11:09,932 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-19 20:11:09,937 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-19 20:11:09,939 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-19 20:11:09,942 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-19 20:11:09,945 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-19 20:11:09,950 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-19 20:11:09,953 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-19 20:11:09,955 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-19 20:11:09,960 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-19 20:11:09,963 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-19 20:11:09,965 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-19 20:11:09,968 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-19 20:11:09,972 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-19 20:11:09,977 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-19 20:11:09,982 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-19 20:11:09,985 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-19 20:11:09,988 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-19 20:11:09,990 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-19 20:11:09,993 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-19 20:11:09,997 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-19 20:11:09,999 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-19 20:11:10,005 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-19 20:11:10,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-19 20:11:10,233 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 20:11:10,233 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:11:10,244 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-19 20:11:10,246 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:11:10,246 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:11:10,246 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:11:10,246 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:11:10,246 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:11:10,247 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:11:10,247 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:11:10,249 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 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:11:10,287 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-19 20:11:10,288 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:11:10,289 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:11:10,289 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:11:10,289 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:11:10,289 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:11:10,290 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:11:10,290 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:11:10,291 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 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:11:10,347 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-19 20:11:10,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:11:10,349 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:11:10,349 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:11:10,349 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-19 20:11:10,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:11:10,350 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-10-19 20:11:10,350 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:11:10,352 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 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:11:10,410 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-19 20:11:10,411 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:11:10,412 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:11:10,412 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:11:10,412 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:11:10,412 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:11:10,413 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:11:10,413 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 20:11:10,414 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:11:10,457 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-19 20:11:10,459 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 20:11:10,460 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 20:11:10,460 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 20:11:10,460 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 20:11:10,460 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 20:11:10,461 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 20:11:10,461 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:11:10,464 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 20:11:10,468 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-19 20:11:10,468 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 20:11:10,485 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-19 20:11:10,485 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-19 20:11:10,485 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 20:11:10,485 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~wl_pc~0) = -2*~wl_pc~0 + 1 Supporting invariants [] Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 20:11:10,518 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-19 20:11:10,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:11:10,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:11:10,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 20:11:10,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:11:10,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:11:10,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 20:11:10,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 20:11:10,624 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:11:10,625 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-10-19 20:11:10,625 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 455 states and 780 transitions. cyclomatic complexity: 328 Second operand 5 states. [2020-10-19 20:11:10,713 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 455 states and 780 transitions. cyclomatic complexity: 328. Second operand 5 states. Result 882 states and 1504 transitions. Complement of second has 7 states. [2020-10-19 20:11:10,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-19 20:11:10,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-19 20:11:10,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 364 transitions. [2020-10-19 20:11:10,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 364 transitions. Stem has 24 letters. Loop has 38 letters. [2020-10-19 20:11:10,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:11:10,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 364 transitions. Stem has 62 letters. Loop has 38 letters. [2020-10-19 20:11:10,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:11:10,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 364 transitions. Stem has 24 letters. Loop has 76 letters. [2020-10-19 20:11:10,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 20:11:10,717 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 882 states and 1504 transitions. [2020-10-19 20:11:10,725 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 532 [2020-10-19 20:11:10,732 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 882 states to 869 states and 1486 transitions. [2020-10-19 20:11:10,733 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 593 [2020-10-19 20:11:10,734 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 596 [2020-10-19 20:11:10,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 869 states and 1486 transitions. [2020-10-19 20:11:10,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:11:10,735 INFO L691 BuchiCegarLoop]: Abstraction has 869 states and 1486 transitions. [2020-10-19 20:11:10,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states and 1486 transitions. [2020-10-19 20:11:10,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 714. [2020-10-19 20:11:10,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 714 states. [2020-10-19 20:11:10,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 1225 transitions. [2020-10-19 20:11:10,753 INFO L714 BuchiCegarLoop]: Abstraction has 714 states and 1225 transitions. [2020-10-19 20:11:10,753 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:11:10,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-19 20:11:10,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-19 20:11:10,754 INFO L87 Difference]: Start difference. First operand 714 states and 1225 transitions. Second operand 4 states. [2020-10-19 20:11:10,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:11:10,878 INFO L93 Difference]: Finished difference Result 1180 states and 2016 transitions. [2020-10-19 20:11:10,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-19 20:11:10,879 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1180 states and 2016 transitions. [2020-10-19 20:11:10,892 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 603 [2020-10-19 20:11:10,901 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1180 states to 1180 states and 2016 transitions. [2020-10-19 20:11:10,902 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 709 [2020-10-19 20:11:10,903 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 709 [2020-10-19 20:11:10,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1180 states and 2016 transitions. [2020-10-19 20:11:10,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:11:10,905 INFO L691 BuchiCegarLoop]: Abstraction has 1180 states and 2016 transitions. [2020-10-19 20:11:10,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states and 2016 transitions. [2020-10-19 20:11:10,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 1178. [2020-10-19 20:11:10,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1178 states. [2020-10-19 20:11:10,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 1178 states and 2014 transitions. [2020-10-19 20:11:10,967 INFO L714 BuchiCegarLoop]: Abstraction has 1178 states and 2014 transitions. [2020-10-19 20:11:10,967 INFO L594 BuchiCegarLoop]: Abstraction has 1178 states and 2014 transitions. [2020-10-19 20:11:10,974 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-19 20:11:10,975 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1178 states and 2014 transitions. [2020-10-19 20:11:10,990 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 603 [2020-10-19 20:11:10,990 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:11:10,991 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:11:10,992 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:11:10,992 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:11:10,992 INFO L794 eck$LassoCheckResult]: Stem: 6822#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 6630#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 6631#L396 assume !(1 == ~c_req_up~0); 6839#L396-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 6848#L407-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 6862#L412-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 6863#L417-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 6714#L422-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 6715#L427-1 assume !(0 == ~e_f~0); 6790#L432-1 assume !(0 == ~e_g~0); 6849#L437-1 assume !(0 == ~e_e~0); 6850#L442-1 assume 0 == ~e_c~0;~e_c~0 := 1; 6599#L447-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 6671#L452-1 assume !(1 == ~wl_pc~0); 7001#L464 assume !(2 == ~wl_pc~0); 6971#L465 assume !(1 == ~c1_pc~0); 6966#L475 assume !(1 == ~c2_pc~0); 6914#L484 assume !(1 == ~wb_pc~0); 6911#L493 assume !(1 == ~e_c~0); 6909#L502-1 assume !(1 == ~e_e~0); 6907#L507-1 assume !(1 == ~e_f~0); 6905#L512-1 assume !(1 == ~e_g~0); 6902#L517-1 assume !(1 == ~e_c~0); 6893#L522-1 assume !(1 == ~e_wl~0); 6861#L664-1 assume !false; 7063#L534 [2020-10-19 20:11:10,995 INFO L796 eck$LassoCheckResult]: Loop: 7063#L534 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 7243#L369 assume !false; 7241#L287 assume 0 == ~wl_st~0; 7239#L300-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet7;havoc eval_#t~nondet7; 7235#L313 assume 0 != eval_~tmp~0;~wl_st~0 := 1;havoc write_loop_~t~0;havoc write_loop_~t~0; 7232#L58 assume 0 == ~wl_pc~0; 6754#L71 ~wl_st~0 := 2;~wl_pc~0 := 1;~e_wl~0 := 0; 7692#L309 assume !(0 == ~c1_st~0); 7681#L324 assume !(0 == ~c2_st~0); 7672#L339 assume !(0 == ~wb_st~0); 7669#L354 assume !(0 == ~r_st~0); 7666#L369 assume !false; 7616#L287 assume !(0 == ~wl_st~0); 7614#L291 assume !(0 == ~c1_st~0); 7611#L294 assume !(0 == ~c2_st~0); 7608#L297 assume !(0 == ~wb_st~0); 7605#L300 assume !(0 == ~r_st~0); 7603#L385 start_simulation_~kernel_st~0 := 2; 7600#L540 assume !(1 == ~c_req_up~0); 7597#L540-2 start_simulation_~kernel_st~0 := 3; 7595#L552 assume 0 == ~e_f~0;~e_f~0 := 1; 7593#L552-2 assume 0 == ~e_g~0;~e_g~0 := 1; 7591#L557-1 assume 0 == ~e_e~0;~e_e~0 := 1; 7586#L562-1 assume !(0 == ~e_c~0); 6804#L567-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 6805#L572-1 assume 1 == ~wl_pc~0; 7636#L578 assume 1 == ~e_wl~0;~wl_st~0 := 0; 7635#L585 assume !(1 == ~c1_pc~0); 7633#L595 assume !(1 == ~c2_pc~0); 7629#L604 assume !(1 == ~wb_pc~0); 7626#L613 assume 1 == ~e_c~0;~r_st~0 := 0; 7624#L622-1 assume 1 == ~e_e~0;~e_e~0 := 2; 7622#L627-1 assume 1 == ~e_f~0;~e_f~0 := 2; 7620#L632-1 assume 1 == ~e_g~0;~e_g~0 := 2; 7619#L637-1 assume !(1 == ~e_c~0); 7293#L642-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 7291#L647-1 assume 0 == ~wl_st~0; 7292#L664-1 assume !false; 7063#L534 [2020-10-19 20:11:10,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:11:10,996 INFO L82 PathProgramCache]: Analyzing trace with hash 931746300, now seen corresponding path program 1 times [2020-10-19 20:11:10,996 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:11:10,996 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698408228] [2020-10-19 20:11:10,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:11:11,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:11:11,073 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-19 20:11:11,073 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698408228] [2020-10-19 20:11:11,073 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:11:11,074 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-19 20:11:11,074 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084272422] [2020-10-19 20:11:11,074 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:11:11,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:11:11,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1422753563, now seen corresponding path program 1 times [2020-10-19 20:11:11,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:11:11,075 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213739181] [2020-10-19 20:11:11,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:11:11,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:11:11,100 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-19 20:11:11,100 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213739181] [2020-10-19 20:11:11,100 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:11:11,100 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 20:11:11,101 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583138247] [2020-10-19 20:11:11,101 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 20:11:11,101 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:11:11,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-19 20:11:11,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-19 20:11:11,102 INFO L87 Difference]: Start difference. First operand 1178 states and 2014 transitions. cyclomatic complexity: 844 Second operand 4 states. [2020-10-19 20:11:11,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:11:11,215 INFO L93 Difference]: Finished difference Result 2126 states and 3618 transitions. [2020-10-19 20:11:11,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-19 20:11:11,216 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2126 states and 3618 transitions. [2020-10-19 20:11:11,233 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 1099 [2020-10-19 20:11:11,248 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2126 states to 2126 states and 3618 transitions. [2020-10-19 20:11:11,248 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1284 [2020-10-19 20:11:11,250 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1284 [2020-10-19 20:11:11,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2126 states and 3618 transitions. [2020-10-19 20:11:11,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:11:11,253 INFO L691 BuchiCegarLoop]: Abstraction has 2126 states and 3618 transitions. [2020-10-19 20:11:11,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2126 states and 3618 transitions. [2020-10-19 20:11:11,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2126 to 2106. [2020-10-19 20:11:11,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2106 states. [2020-10-19 20:11:11,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2106 states to 2106 states and 3598 transitions. [2020-10-19 20:11:11,295 INFO L714 BuchiCegarLoop]: Abstraction has 2106 states and 3598 transitions. [2020-10-19 20:11:11,295 INFO L594 BuchiCegarLoop]: Abstraction has 2106 states and 3598 transitions. [2020-10-19 20:11:11,296 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-19 20:11:11,296 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2106 states and 3598 transitions. [2020-10-19 20:11:11,307 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 1099 [2020-10-19 20:11:11,307 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:11:11,307 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:11:11,309 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:11:11,309 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:11:11,310 INFO L794 eck$LassoCheckResult]: Stem: 10149#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 9944#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 9945#L396 assume !(1 == ~c_req_up~0); 10172#L396-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 10187#L407-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 10207#L412-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 10208#L417-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 10031#L422-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 10032#L427-1 assume !(0 == ~e_f~0); 10118#L432-1 assume !(0 == ~e_g~0); 10161#L437-1 assume !(0 == ~e_e~0); 9912#L442-1 assume !(0 == ~e_c~0); 9913#L447-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 10817#L452-1 assume !(1 == ~wl_pc~0); 10951#L464 assume !(2 == ~wl_pc~0); 10949#L465 assume !(1 == ~c1_pc~0); 10947#L475 assume !(1 == ~c2_pc~0); 10945#L484 assume !(1 == ~wb_pc~0); 10943#L493 assume !(1 == ~e_c~0); 10940#L502-1 assume !(1 == ~e_e~0); 10937#L507-1 assume 1 == ~e_f~0;~e_f~0 := 2; 10934#L512-1 assume !(1 == ~e_g~0); 10802#L517-1 assume !(1 == ~e_c~0); 10163#L522-1 assume !(1 == ~e_wl~0); 10206#L664-1 assume !false; 10716#L534 [2020-10-19 20:11:11,310 INFO L796 eck$LassoCheckResult]: Loop: 10716#L534 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 11949#L369 assume !false; 11797#L287 assume 0 == ~wl_st~0; 11798#L300-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet7;havoc eval_#t~nondet7; 11787#L313 assume 0 != eval_~tmp~0;~wl_st~0 := 1;havoc write_loop_~t~0;havoc write_loop_~t~0; 11789#L58 assume 0 == ~wl_pc~0; 10173#L71 ~wl_st~0 := 2;~wl_pc~0 := 1;~e_wl~0 := 0; 10174#L309 assume !(0 == ~c1_st~0); 11892#L324 assume !(0 == ~c2_st~0); 11785#L339 assume !(0 == ~wb_st~0); 11783#L354 assume !(0 == ~r_st~0); 10121#L369 assume !false; 10122#L287 assume !(0 == ~wl_st~0); 10209#L291 assume !(0 == ~c1_st~0); 10210#L294 assume !(0 == ~c2_st~0); 10140#L297 assume !(0 == ~wb_st~0); 10142#L300 assume !(0 == ~r_st~0); 10177#L385 start_simulation_~kernel_st~0 := 2; 10178#L540 assume !(1 == ~c_req_up~0); 11697#L540-2 start_simulation_~kernel_st~0 := 3; 11698#L552 assume 0 == ~e_f~0;~e_f~0 := 1; 9958#L552-2 assume 0 == ~e_g~0;~e_g~0 := 1; 9959#L557-1 assume 0 == ~e_e~0;~e_e~0 := 1; 10095#L562-1 assume !(0 == ~e_c~0); 10096#L567-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 10135#L572-1 assume 1 == ~wl_pc~0; 11319#L578 assume 1 == ~e_wl~0;~wl_st~0 := 0; 11320#L585 assume !(1 == ~c1_pc~0); 11308#L595 assume !(1 == ~c2_pc~0); 11307#L604 assume !(1 == ~wb_pc~0); 11831#L613 assume 1 == ~e_c~0;~r_st~0 := 0; 11830#L622-1 assume 1 == ~e_e~0;~e_e~0 := 2; 11829#L627-1 assume 1 == ~e_f~0;~e_f~0 := 2; 11294#L632-1 assume 1 == ~e_g~0;~e_g~0 := 2; 11828#L637-1 assume !(1 == ~e_c~0); 11814#L642-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 11012#L647-1 assume 0 == ~wl_st~0; 11980#L664-1 assume !false; 10716#L534 [2020-10-19 20:11:11,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:11:11,311 INFO L82 PathProgramCache]: Analyzing trace with hash -81217992, now seen corresponding path program 1 times [2020-10-19 20:11:11,311 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:11:11,311 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838293409] [2020-10-19 20:11:11,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:11:11,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:11:11,343 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-19 20:11:11,343 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838293409] [2020-10-19 20:11:11,343 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:11:11,344 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-19 20:11:11,344 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110938119] [2020-10-19 20:11:11,344 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:11:11,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:11:11,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1422753563, now seen corresponding path program 2 times [2020-10-19 20:11:11,345 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:11:11,345 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547243471] [2020-10-19 20:11:11,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:11:11,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:11:11,366 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-19 20:11:11,367 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547243471] [2020-10-19 20:11:11,367 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:11:11,367 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 20:11:11,367 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923659643] [2020-10-19 20:11:11,368 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 20:11:11,368 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:11:11,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-19 20:11:11,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-19 20:11:11,368 INFO L87 Difference]: Start difference. First operand 2106 states and 3598 transitions. cyclomatic complexity: 1508 Second operand 4 states. [2020-10-19 20:11:11,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:11:11,444 INFO L93 Difference]: Finished difference Result 1864 states and 3088 transitions. [2020-10-19 20:11:11,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-19 20:11:11,445 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1864 states and 3088 transitions. [2020-10-19 20:11:11,457 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 1019 [2020-10-19 20:11:11,470 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1864 states to 1864 states and 3088 transitions. [2020-10-19 20:11:11,470 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1105 [2020-10-19 20:11:11,472 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1105 [2020-10-19 20:11:11,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1864 states and 3088 transitions. [2020-10-19 20:11:11,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:11:11,474 INFO L691 BuchiCegarLoop]: Abstraction has 1864 states and 3088 transitions. [2020-10-19 20:11:11,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1864 states and 3088 transitions. [2020-10-19 20:11:11,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1864 to 1751. [2020-10-19 20:11:11,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1751 states. [2020-10-19 20:11:11,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1751 states to 1751 states and 2918 transitions. [2020-10-19 20:11:11,528 INFO L714 BuchiCegarLoop]: Abstraction has 1751 states and 2918 transitions. [2020-10-19 20:11:11,528 INFO L594 BuchiCegarLoop]: Abstraction has 1751 states and 2918 transitions. [2020-10-19 20:11:11,528 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-19 20:11:11,528 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1751 states and 2918 transitions. [2020-10-19 20:11:11,540 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 978 [2020-10-19 20:11:11,541 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:11:11,541 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:11:11,542 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:11:11,542 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:11:11,542 INFO L794 eck$LassoCheckResult]: Stem: 14108#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 13924#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 13925#L396 assume !(1 == ~c_req_up~0); 14025#L396-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 14141#L407-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 14142#L412-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 13955#L417-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 13956#L422-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 14004#L427-1 assume !(0 == ~e_f~0); 14083#L432-1 assume !(0 == ~e_g~0); 14163#L437-1 assume !(0 == ~e_e~0); 13892#L442-1 assume !(0 == ~e_c~0); 13893#L447-1 assume !(0 == ~e_wl~0); 13965#L452-1 assume !(1 == ~wl_pc~0); 13946#L464 assume !(2 == ~wl_pc~0); 13947#L465 assume !(1 == ~c1_pc~0); 13943#L475 assume !(1 == ~c2_pc~0); 13945#L484 assume !(1 == ~wb_pc~0); 14080#L493 assume !(1 == ~e_c~0); 14000#L502-1 assume !(1 == ~e_e~0); 14001#L507-1 assume 1 == ~e_f~0;~e_f~0 := 2; 14438#L512-1 assume !(1 == ~e_g~0); 14127#L517-1 assume !(1 == ~e_c~0); 14128#L522-1 assume !(1 == ~e_wl~0); 14712#L664-1 assume !false; 14713#L534 [2020-10-19 20:11:11,543 INFO L796 eck$LassoCheckResult]: Loop: 14713#L534 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 15591#L369 assume !false; 15590#L287 assume 0 == ~wl_st~0; 15589#L300-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet7;havoc eval_#t~nondet7; 15587#L313 assume 0 != eval_~tmp~0;~wl_st~0 := 1;havoc write_loop_~t~0;havoc write_loop_~t~0; 15586#L58 assume !(0 == ~wl_pc~0); 15585#L61 assume !(2 == ~wl_pc~0); 14041#L64 assume 1 == ~wl_pc~0; 13986#L16 assume !false; 14129#L80 write_loop_~t~0 := ~d~0;~data~0 := ~d~0;~processed~0 := 0;~e_f~0 := 1; 14150#L85 assume !(1 == ~c1_pc~0); 14055#L85-1 assume !(1 == ~c2_pc~0); 14026#L94 ~e_f~0 := 2;~wl_st~0 := 2;~wl_pc~0 := 2;~t_b~0 := write_loop_~t~0; 14027#L309 assume !(0 == ~c1_st~0); 15514#L324 assume !(0 == ~c2_st~0); 15474#L339 assume !(0 == ~wb_st~0); 15472#L354 assume !(0 == ~r_st~0); 15456#L369 assume !false; 15457#L287 assume !(0 == ~wl_st~0); 14159#L291 assume !(0 == ~c1_st~0); 14130#L294 assume !(0 == ~c2_st~0); 14131#L297 assume !(0 == ~wb_st~0); 14111#L300 assume !(0 == ~r_st~0); 14113#L385 start_simulation_~kernel_st~0 := 2; 14058#L540 assume !(1 == ~c_req_up~0); 13941#L540-2 start_simulation_~kernel_st~0 := 3; 15493#L552 assume 0 == ~e_f~0;~e_f~0 := 1; 15492#L552-2 assume 0 == ~e_g~0;~e_g~0 := 1; 15491#L557-1 assume 0 == ~e_e~0;~e_e~0 := 1; 14061#L562-1 assume !(0 == ~e_c~0); 14062#L567-1 assume !(0 == ~e_wl~0); 14151#L572-1 assume !(1 == ~wl_pc~0); 14091#L584 assume 2 == ~wl_pc~0; 14143#L586 assume 1 == ~e_e~0;~wl_st~0 := 0; 14144#L585 assume !(1 == ~c1_pc~0); 15486#L595 assume !(1 == ~c2_pc~0); 15482#L604 assume !(1 == ~wb_pc~0); 15477#L613 assume !(1 == ~e_c~0); 15478#L622-1 assume 1 == ~e_e~0;~e_e~0 := 2; 15635#L627-1 assume 1 == ~e_f~0;~e_f~0 := 2; 15634#L632-1 assume 1 == ~e_g~0;~e_g~0 := 2; 15633#L637-1 assume !(1 == ~e_c~0); 15632#L642-1 assume !(1 == ~e_wl~0); 15631#L647-1 assume 0 == ~wl_st~0; 15630#L664-1 assume !false; 14713#L534 [2020-10-19 20:11:11,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:11:11,543 INFO L82 PathProgramCache]: Analyzing trace with hash -668024006, now seen corresponding path program 1 times [2020-10-19 20:11:11,543 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:11:11,544 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444043140] [2020-10-19 20:11:11,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:11:11,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:11:11,572 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-19 20:11:11,572 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444043140] [2020-10-19 20:11:11,572 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:11:11,573 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-19 20:11:11,573 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510375376] [2020-10-19 20:11:11,573 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:11:11,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:11:11,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1070317994, now seen corresponding path program 1 times [2020-10-19 20:11:11,574 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:11:11,575 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194389488] [2020-10-19 20:11:11,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:11:11,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:11:11,597 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 20:11:11,597 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194389488] [2020-10-19 20:11:11,597 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:11:11,598 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-19 20:11:11,598 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375558747] [2020-10-19 20:11:11,598 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 20:11:11,599 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:11:11,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-19 20:11:11,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-19 20:11:11,599 INFO L87 Difference]: Start difference. First operand 1751 states and 2918 transitions. cyclomatic complexity: 1176 Second operand 4 states. [2020-10-19 20:11:11,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:11:11,741 INFO L93 Difference]: Finished difference Result 2009 states and 3284 transitions. [2020-10-19 20:11:11,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-19 20:11:11,742 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2009 states and 3284 transitions. [2020-10-19 20:11:11,762 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 1129 [2020-10-19 20:11:11,779 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2009 states to 2009 states and 3284 transitions. [2020-10-19 20:11:11,779 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1205 [2020-10-19 20:11:11,781 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1205 [2020-10-19 20:11:11,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2009 states and 3284 transitions. [2020-10-19 20:11:11,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:11:11,784 INFO L691 BuchiCegarLoop]: Abstraction has 2009 states and 3284 transitions. [2020-10-19 20:11:11,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2009 states and 3284 transitions. [2020-10-19 20:11:11,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2009 to 1977. [2020-10-19 20:11:11,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1977 states. [2020-10-19 20:11:11,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1977 states to 1977 states and 3252 transitions. [2020-10-19 20:11:11,838 INFO L714 BuchiCegarLoop]: Abstraction has 1977 states and 3252 transitions. [2020-10-19 20:11:11,838 INFO L594 BuchiCegarLoop]: Abstraction has 1977 states and 3252 transitions. [2020-10-19 20:11:11,838 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-10-19 20:11:11,839 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1977 states and 3252 transitions. [2020-10-19 20:11:11,851 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 1124 [2020-10-19 20:11:11,852 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:11:11,852 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:11:11,853 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:11:11,853 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:11:11,854 INFO L794 eck$LassoCheckResult]: Stem: 17883#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 17696#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 17697#L396 assume !(1 == ~c_req_up~0); 17910#L396-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 17916#L407-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 17935#L412-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 17729#L417-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 17730#L422-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 17779#L427-1 assume !(0 == ~e_f~0); 17859#L432-1 assume !(0 == ~e_g~0); 17932#L437-1 assume !(0 == ~e_e~0); 17664#L442-1 assume !(0 == ~e_c~0); 17665#L447-1 assume !(0 == ~e_wl~0); 17739#L452-1 assume !(1 == ~wl_pc~0); 17943#L464 assume !(2 == ~wl_pc~0); 17892#L465 assume !(1 == ~c1_pc~0); 17891#L475 assume !(1 == ~c2_pc~0); 17899#L484 assume !(1 == ~wb_pc~0); 17724#L493 assume !(1 == ~e_c~0); 17776#L502-1 assume !(1 == ~e_e~0); 17777#L507-1 assume !(1 == ~e_f~0); 17845#L512-1 assume !(1 == ~e_g~0); 17900#L517-1 assume !(1 == ~e_c~0); 17901#L522-1 assume !(1 == ~e_wl~0); 17926#L664-1 assume !false; 18587#L534 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 19232#L369 [2020-10-19 20:11:11,854 INFO L796 eck$LassoCheckResult]: Loop: 19232#L369 assume !false; 19233#L287 assume 0 == ~wl_st~0; 19228#L300-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet7;havoc eval_#t~nondet7; 19229#L313 assume !(0 != eval_~tmp~0); 19378#L309 assume !(0 == ~c1_st~0); 19376#L324 assume !(0 == ~c2_st~0); 19349#L339 assume !(0 == ~wb_st~0); 19347#L354 assume !(0 == ~r_st~0); 19232#L369 [2020-10-19 20:11:11,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:11:11,855 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 1 times [2020-10-19 20:11:11,855 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:11:11,855 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108052300] [2020-10-19 20:11:11,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:11:11,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:11:11,866 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:11:11,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:11:11,876 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:11:11,884 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:11:11,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:11:11,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1277920495, now seen corresponding path program 1 times [2020-10-19 20:11:11,885 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:11:11,885 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541626865] [2020-10-19 20:11:11,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:11:11,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:11:11,889 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:11:11,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:11:11,891 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:11:11,893 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:11:11,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:11:11,893 INFO L82 PathProgramCache]: Analyzing trace with hash 358965991, now seen corresponding path program 1 times [2020-10-19 20:11:11,894 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:11:11,894 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427355123] [2020-10-19 20:11:11,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:11:11,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:11:11,921 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-19 20:11:11,921 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427355123] [2020-10-19 20:11:11,921 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:11:11,922 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 20:11:11,922 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990552339] [2020-10-19 20:11:11,954 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:11:11,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 20:11:11,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 20:11:11,955 INFO L87 Difference]: Start difference. First operand 1977 states and 3252 transitions. cyclomatic complexity: 1284 Second operand 3 states. [2020-10-19 20:11:12,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:11:12,002 INFO L93 Difference]: Finished difference Result 3149 states and 5142 transitions. [2020-10-19 20:11:12,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 20:11:12,003 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3149 states and 5142 transitions. [2020-10-19 20:11:12,022 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 1811 [2020-10-19 20:11:12,044 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3149 states to 3149 states and 5142 transitions. [2020-10-19 20:11:12,045 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1878 [2020-10-19 20:11:12,047 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1878 [2020-10-19 20:11:12,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3149 states and 5142 transitions. [2020-10-19 20:11:12,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:11:12,048 INFO L691 BuchiCegarLoop]: Abstraction has 3149 states and 5142 transitions. [2020-10-19 20:11:12,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3149 states and 5142 transitions. [2020-10-19 20:11:12,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3149 to 3149. [2020-10-19 20:11:12,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3149 states. [2020-10-19 20:11:12,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3149 states to 3149 states and 5142 transitions. [2020-10-19 20:11:12,112 INFO L714 BuchiCegarLoop]: Abstraction has 3149 states and 5142 transitions. [2020-10-19 20:11:12,112 INFO L594 BuchiCegarLoop]: Abstraction has 3149 states and 5142 transitions. [2020-10-19 20:11:12,112 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-10-19 20:11:12,112 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3149 states and 5142 transitions. [2020-10-19 20:11:12,125 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 1811 [2020-10-19 20:11:12,125 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:11:12,125 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:11:12,126 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:11:12,126 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:11:12,126 INFO L794 eck$LassoCheckResult]: Stem: 23023#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 22826#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 22827#L396 assume !(1 == ~c_req_up~0); 22933#L396-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 23057#L407-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 23058#L412-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 23075#L417-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 23084#L422-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 23083#L427-1 assume !(0 == ~e_f~0); 23082#L432-1 assume !(0 == ~e_g~0); 23081#L437-1 assume !(0 == ~e_e~0); 22794#L442-1 assume !(0 == ~e_c~0); 22795#L447-1 assume !(0 == ~e_wl~0); 22869#L452-1 assume !(1 == ~wl_pc~0); 23095#L464 assume !(2 == ~wl_pc~0); 23034#L465 assume !(1 == ~c1_pc~0); 23033#L475 assume !(1 == ~c2_pc~0); 23041#L484 assume !(1 == ~wb_pc~0); 22856#L493 assume !(1 == ~e_c~0); 22905#L502-1 assume !(1 == ~e_e~0); 22906#L507-1 assume !(1 == ~e_f~0); 22978#L512-1 assume !(1 == ~e_g~0); 23042#L517-1 assume !(1 == ~e_c~0); 23043#L522-1 assume !(1 == ~e_wl~0); 23074#L664-1 assume !false; 24163#L534 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 25526#L369 [2020-10-19 20:11:12,127 INFO L796 eck$LassoCheckResult]: Loop: 25526#L369 assume !false; 25525#L287 assume 0 == ~wl_st~0; 25523#L300-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet7;havoc eval_#t~nondet7; 25522#L313 assume !(0 != eval_~tmp~0); 25521#L309 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet8;havoc eval_#t~nondet8; 25507#L328 assume !(0 != eval_~tmp___0~0); 25520#L324 assume !(0 == ~c2_st~0); 25533#L339 assume !(0 == ~wb_st~0); 25530#L354 assume !(0 == ~r_st~0); 25526#L369 [2020-10-19 20:11:12,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:11:12,127 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 2 times [2020-10-19 20:11:12,127 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:11:12,127 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856314557] [2020-10-19 20:11:12,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:11:12,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:11:12,135 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:11:12,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:11:12,146 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:11:12,151 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:11:12,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:11:12,152 INFO L82 PathProgramCache]: Analyzing trace with hash 910057440, now seen corresponding path program 1 times [2020-10-19 20:11:12,152 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:11:12,153 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861580800] [2020-10-19 20:11:12,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:11:12,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:11:12,156 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:11:12,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:11:12,157 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:11:12,159 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:11:12,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:11:12,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1807728408, now seen corresponding path program 1 times [2020-10-19 20:11:12,160 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:11:12,160 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875819248] [2020-10-19 20:11:12,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:11:12,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:11:12,180 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-19 20:11:12,181 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875819248] [2020-10-19 20:11:12,181 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:11:12,181 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 20:11:12,181 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305330593] [2020-10-19 20:11:12,212 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:11:12,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 20:11:12,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 20:11:12,212 INFO L87 Difference]: Start difference. First operand 3149 states and 5142 transitions. cyclomatic complexity: 2002 Second operand 3 states. [2020-10-19 20:11:12,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:11:12,258 INFO L93 Difference]: Finished difference Result 5098 states and 8207 transitions. [2020-10-19 20:11:12,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 20:11:12,259 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5098 states and 8207 transitions. [2020-10-19 20:11:12,287 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 2918 [2020-10-19 20:11:12,318 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5098 states to 5098 states and 8207 transitions. [2020-10-19 20:11:12,319 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3040 [2020-10-19 20:11:12,322 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3040 [2020-10-19 20:11:12,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5098 states and 8207 transitions. [2020-10-19 20:11:12,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:11:12,323 INFO L691 BuchiCegarLoop]: Abstraction has 5098 states and 8207 transitions. [2020-10-19 20:11:12,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5098 states and 8207 transitions. [2020-10-19 20:11:12,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5098 to 5098. [2020-10-19 20:11:12,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5098 states. [2020-10-19 20:11:12,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5098 states to 5098 states and 8207 transitions. [2020-10-19 20:11:12,409 INFO L714 BuchiCegarLoop]: Abstraction has 5098 states and 8207 transitions. [2020-10-19 20:11:12,409 INFO L594 BuchiCegarLoop]: Abstraction has 5098 states and 8207 transitions. [2020-10-19 20:11:12,409 INFO L427 BuchiCegarLoop]: ======== Iteration 13============ [2020-10-19 20:11:12,409 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5098 states and 8207 transitions. [2020-10-19 20:11:12,428 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 2918 [2020-10-19 20:11:12,428 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:11:12,428 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:11:12,429 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:11:12,429 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:11:12,430 INFO L794 eck$LassoCheckResult]: Stem: 31285#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 31083#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 31084#L396 assume !(1 == ~c_req_up~0); 31186#L396-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 31306#L407-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 31307#L412-1 assume !(1 == ~c2_i~0);~c2_st~0 := 2; 32048#L417-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 32087#L422-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 32086#L427-1 assume !(0 == ~e_f~0); 32085#L432-1 assume !(0 == ~e_g~0); 32084#L437-1 assume !(0 == ~e_e~0); 32083#L442-1 assume !(0 == ~e_c~0); 32082#L447-1 assume !(0 == ~e_wl~0); 32081#L452-1 assume !(1 == ~wl_pc~0); 32078#L464 assume !(2 == ~wl_pc~0); 32077#L465 assume !(1 == ~c1_pc~0); 32075#L475 assume !(1 == ~c2_pc~0); 32073#L484 assume !(1 == ~wb_pc~0); 32071#L493 assume !(1 == ~e_c~0); 32070#L502-1 assume !(1 == ~e_e~0); 32069#L507-1 assume !(1 == ~e_f~0); 32068#L512-1 assume !(1 == ~e_g~0); 32067#L517-1 assume !(1 == ~e_c~0); 32066#L522-1 assume !(1 == ~e_wl~0); 32064#L664-1 assume !false; 32065#L534 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 35333#L369 [2020-10-19 20:11:12,430 INFO L796 eck$LassoCheckResult]: Loop: 35333#L369 assume !false; 35331#L287 assume 0 == ~wl_st~0; 35330#L300-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet7;havoc eval_#t~nondet7; 35328#L313 assume !(0 != eval_~tmp~0); 35329#L309 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet8;havoc eval_#t~nondet8; 35453#L328 assume !(0 != eval_~tmp___0~0); 35449#L324 assume !(0 == ~c2_st~0); 35343#L339 assume !(0 == ~wb_st~0); 35338#L354 assume !(0 == ~r_st~0); 35333#L369 [2020-10-19 20:11:12,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:11:12,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1246052603, now seen corresponding path program 1 times [2020-10-19 20:11:12,431 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:11:12,431 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81236792] [2020-10-19 20:11:12,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:11:12,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:11:12,454 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-19 20:11:12,454 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81236792] [2020-10-19 20:11:12,455 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:11:12,455 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 20:11:12,455 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650474173] [2020-10-19 20:11:12,455 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 20:11:12,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:11:12,456 INFO L82 PathProgramCache]: Analyzing trace with hash 910057440, now seen corresponding path program 2 times [2020-10-19 20:11:12,456 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:11:12,456 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908865948] [2020-10-19 20:11:12,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:11:12,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:11:12,459 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:11:12,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:11:12,460 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:11:12,462 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:11:12,502 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:11:12,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 20:11:12,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 20:11:12,502 INFO L87 Difference]: Start difference. First operand 5098 states and 8207 transitions. cyclomatic complexity: 3118 Second operand 3 states. [2020-10-19 20:11:12,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:11:12,531 INFO L93 Difference]: Finished difference Result 5048 states and 8126 transitions. [2020-10-19 20:11:12,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 20:11:12,532 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5048 states and 8126 transitions. [2020-10-19 20:11:12,562 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 2918 [2020-10-19 20:11:12,616 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5048 states to 5048 states and 8126 transitions. [2020-10-19 20:11:12,616 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2991 [2020-10-19 20:11:12,619 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2991 [2020-10-19 20:11:12,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5048 states and 8126 transitions. [2020-10-19 20:11:12,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:11:12,620 INFO L691 BuchiCegarLoop]: Abstraction has 5048 states and 8126 transitions. [2020-10-19 20:11:12,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5048 states and 8126 transitions. [2020-10-19 20:11:12,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5048 to 5048. [2020-10-19 20:11:12,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5048 states. [2020-10-19 20:11:12,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5048 states to 5048 states and 8126 transitions. [2020-10-19 20:11:12,709 INFO L714 BuchiCegarLoop]: Abstraction has 5048 states and 8126 transitions. [2020-10-19 20:11:12,709 INFO L594 BuchiCegarLoop]: Abstraction has 5048 states and 8126 transitions. [2020-10-19 20:11:12,709 INFO L427 BuchiCegarLoop]: ======== Iteration 14============ [2020-10-19 20:11:12,709 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5048 states and 8126 transitions. [2020-10-19 20:11:12,727 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 2918 [2020-10-19 20:11:12,728 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:11:12,728 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:11:12,728 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:11:12,728 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:11:12,728 INFO L794 eck$LassoCheckResult]: Stem: 41442#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 41235#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 41236#L396 assume !(1 == ~c_req_up~0); 41471#L396-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 41480#L407-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 41506#L412-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 41274#L417-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 41275#L422-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 41321#L427-1 assume !(0 == ~e_f~0); 41409#L432-1 assume !(0 == ~e_g~0); 41503#L437-1 assume !(0 == ~e_e~0); 41205#L442-1 assume !(0 == ~e_c~0); 41206#L447-1 assume !(0 == ~e_wl~0); 41284#L452-1 assume !(1 == ~wl_pc~0); 41514#L464 assume !(2 == ~wl_pc~0); 41454#L465 assume !(1 == ~c1_pc~0); 41453#L475 assume !(1 == ~c2_pc~0); 41462#L484 assume !(1 == ~wb_pc~0); 41269#L493 assume !(1 == ~e_c~0); 41318#L502-1 assume !(1 == ~e_e~0); 41319#L507-1 assume !(1 == ~e_f~0); 41395#L512-1 assume !(1 == ~e_g~0); 41463#L517-1 assume !(1 == ~e_c~0); 41464#L522-1 assume !(1 == ~e_wl~0); 41498#L664-1 assume !false; 43312#L534 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 45291#L369 [2020-10-19 20:11:12,729 INFO L796 eck$LassoCheckResult]: Loop: 45291#L369 assume !false; 45948#L287 assume 0 == ~wl_st~0; 45947#L300-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet7;havoc eval_#t~nondet7; 45946#L313 assume !(0 != eval_~tmp~0); 45945#L309 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet8;havoc eval_#t~nondet8; 45933#L328 assume !(0 != eval_~tmp___0~0); 45307#L324 assume 0 == ~c2_st~0;eval_~tmp___1~0 := eval_#t~nondet9;havoc eval_#t~nondet9; 45301#L343 assume !(0 != eval_~tmp___1~0); 45302#L339 assume !(0 == ~wb_st~0); 45952#L354 assume !(0 == ~r_st~0); 45291#L369 [2020-10-19 20:11:12,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:11:12,729 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 3 times [2020-10-19 20:11:12,729 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:11:12,729 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554629610] [2020-10-19 20:11:12,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:11:12,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:11:12,737 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:11:12,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:11:12,745 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:11:12,754 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:11:12,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:11:12,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1854610406, now seen corresponding path program 1 times [2020-10-19 20:11:12,754 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:11:12,755 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381607389] [2020-10-19 20:11:12,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:11:12,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:11:12,757 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:11:12,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:11:12,759 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:11:12,763 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:11:12,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:11:12,763 INFO L82 PathProgramCache]: Analyzing trace with hash -206625774, now seen corresponding path program 1 times [2020-10-19 20:11:12,763 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:11:12,763 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743210899] [2020-10-19 20:11:12,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:11:12,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 20:11:12,787 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-19 20:11:12,787 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743210899] [2020-10-19 20:11:12,787 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 20:11:12,788 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 20:11:12,788 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456224252] [2020-10-19 20:11:12,825 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 20:11:12,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 20:11:12,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 20:11:12,826 INFO L87 Difference]: Start difference. First operand 5048 states and 8126 transitions. cyclomatic complexity: 3087 Second operand 3 states. [2020-10-19 20:11:12,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 20:11:12,879 INFO L93 Difference]: Finished difference Result 8741 states and 13910 transitions. [2020-10-19 20:11:12,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 20:11:12,880 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8741 states and 13910 transitions. [2020-10-19 20:11:12,920 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 5065 [2020-10-19 20:11:12,952 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8741 states to 8741 states and 13910 transitions. [2020-10-19 20:11:12,952 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5150 [2020-10-19 20:11:12,958 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5150 [2020-10-19 20:11:12,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8741 states and 13910 transitions. [2020-10-19 20:11:12,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 20:11:12,963 INFO L691 BuchiCegarLoop]: Abstraction has 8741 states and 13910 transitions. [2020-10-19 20:11:12,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8741 states and 13910 transitions. [2020-10-19 20:11:13,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8741 to 8741. [2020-10-19 20:11:13,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8741 states. [2020-10-19 20:11:13,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8741 states to 8741 states and 13910 transitions. [2020-10-19 20:11:13,107 INFO L714 BuchiCegarLoop]: Abstraction has 8741 states and 13910 transitions. [2020-10-19 20:11:13,107 INFO L594 BuchiCegarLoop]: Abstraction has 8741 states and 13910 transitions. [2020-10-19 20:11:13,107 INFO L427 BuchiCegarLoop]: ======== Iteration 15============ [2020-10-19 20:11:13,108 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8741 states and 13910 transitions. [2020-10-19 20:11:13,145 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 5065 [2020-10-19 20:11:13,145 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 20:11:13,145 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 20:11:13,146 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:11:13,146 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 20:11:13,146 INFO L794 eck$LassoCheckResult]: Stem: 55243#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 55037#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 55038#L396 assume !(1 == ~c_req_up~0); 55275#L396-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 55281#L407-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 55304#L412-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 55069#L417-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 55070#L422-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 55117#L427-1 assume !(0 == ~e_f~0); 55202#L432-1 assume !(0 == ~e_g~0); 55301#L437-1 assume !(0 == ~e_e~0); 55002#L442-1 assume !(0 == ~e_c~0); 55003#L447-1 assume !(0 == ~e_wl~0); 55079#L452-1 assume !(1 == ~wl_pc~0); 55312#L464 assume !(2 == ~wl_pc~0); 55255#L465 assume !(1 == ~c1_pc~0); 55254#L475 assume !(1 == ~c2_pc~0); 55264#L484 assume !(1 == ~wb_pc~0); 55064#L493 assume !(1 == ~e_c~0); 55114#L502-1 assume !(1 == ~e_e~0); 55115#L507-1 assume !(1 == ~e_f~0); 55186#L512-1 assume !(1 == ~e_g~0); 55265#L517-1 assume !(1 == ~e_c~0); 55266#L522-1 assume !(1 == ~e_wl~0); 55294#L664-1 assume !false; 57270#L534 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 62178#L369 [2020-10-19 20:11:13,146 INFO L796 eck$LassoCheckResult]: Loop: 62178#L369 assume !false; 62175#L287 assume 0 == ~wl_st~0; 62174#L300-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet7;havoc eval_#t~nondet7; 62172#L313 assume !(0 != eval_~tmp~0); 62173#L309 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet8;havoc eval_#t~nondet8; 63541#L328 assume !(0 != eval_~tmp___0~0); 62538#L324 assume 0 == ~c2_st~0;eval_~tmp___1~0 := eval_#t~nondet9;havoc eval_#t~nondet9; 62535#L343 assume !(0 != eval_~tmp___1~0); 62534#L339 assume 0 == ~wb_st~0;eval_~tmp___2~0 := eval_#t~nondet10;havoc eval_#t~nondet10; 62523#L358 assume !(0 != eval_~tmp___2~0); 62182#L354 assume !(0 == ~r_st~0); 62178#L369 [2020-10-19 20:11:13,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:11:13,147 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 4 times [2020-10-19 20:11:13,147 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:11:13,147 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510276258] [2020-10-19 20:11:13,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:11:13,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:11:13,157 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:11:13,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:11:13,166 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:11:13,171 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:11:13,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:11:13,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1658382155, now seen corresponding path program 1 times [2020-10-19 20:11:13,172 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:11:13,172 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116744990] [2020-10-19 20:11:13,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:11:13,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:11:13,175 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:11:13,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:11:13,181 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:11:13,184 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:11:13,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 20:11:13,185 INFO L82 PathProgramCache]: Analyzing trace with hash -2110466115, now seen corresponding path program 1 times [2020-10-19 20:11:13,185 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 20:11:13,186 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858187916] [2020-10-19 20:11:13,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 20:11:13,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:11:13,194 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:11:13,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 20:11:13,205 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 20:11:13,214 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 20:11:14,217 WARN L193 SmtUtils]: Spent 892.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 157 [2020-10-19 20:11:14,430 WARN L193 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2020-10-19 20:11:14,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.10 08:11:14 BoogieIcfgContainer [2020-10-19 20:11:14,486 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-19 20:11:14,486 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-19 20:11:14,486 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-19 20:11:14,487 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-19 20:11:14,487 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 08:11:05" (3/4) ... [2020-10-19 20:11:14,490 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-10-19 20:11:14,552 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-19 20:11:14,553 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-19 20:11:14,555 INFO L168 Benchmark]: Toolchain (without parser) took 10430.96 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 325.6 MB). Free memory was 960.0 MB in the beginning and 1.1 GB in the end (delta: -118.5 MB). Peak memory consumption was 207.1 MB. Max. memory is 11.5 GB. [2020-10-19 20:11:14,557 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 20:11:14,558 INFO L168 Benchmark]: CACSL2BoogieTranslator took 463.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 960.0 MB in the beginning and 1.1 GB in the end (delta: -157.9 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2020-10-19 20:11:14,559 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2020-10-19 20:11:14,560 INFO L168 Benchmark]: Boogie Preprocessor took 38.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-10-19 20:11:14,560 INFO L168 Benchmark]: RCFGBuilder took 769.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. [2020-10-19 20:11:14,561 INFO L168 Benchmark]: BuchiAutomizer took 9026.97 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 197.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -22.7 MB). Peak memory consumption was 446.9 MB. Max. memory is 11.5 GB. [2020-10-19 20:11:14,561 INFO L168 Benchmark]: Witness Printer took 66.83 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 11.5 GB. [2020-10-19 20:11:14,564 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.28 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 463.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 960.0 MB in the beginning and 1.1 GB in the end (delta: -157.9 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 769.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9026.97 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 197.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -22.7 MB). Peak memory consumption was 446.9 MB. Max. memory is 11.5 GB. * Witness Printer took 66.83 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 16 terminating modules (14 trivial, 2 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * e_c + 1 and consists of 3 locations. One deterministic module has affine ranking function -2 * wl_pc + 1 and consists of 4 locations. 14 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 8741 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.9s and 15 iterations. TraceHistogramMax:2. Analysis of lassos took 5.9s. Construction of modules took 0.4s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 11. Automata minimization 0.7s AutomataMinimizationTime, 16 MinimizatonAttempts, 466 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.4s Buchi closure took 0.0s. Biggest automaton had 8741 states and ocurred in iteration 14. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/2 HoareTripleCheckerStatistics: 4187 SDtfs, 3711 SDslu, 2257 SDs, 0 SdLazy, 384 SolverSat, 113 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT0 conc3 concLT1 SILN1 SILU0 SILI7 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital81 mio100 ax100 hnf100 lsp11 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq188 hnf94 smp100 dnf150 smp100 tf108 neg92 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 26ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 286]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=8785} State at position 1 is {wb_st=0, NULL=0, NULL=8785, c2_st=0, tmp=0, e_c=2, e_e=2, e_p_in=0, kernel_st=1, t_b=0, tmp___2=0, wb_pc=0, tmp___0=0, wb_i=1, c_t=0, NULL=0, NULL=0, c=0, wl_st=0, c2_pc=0, r_i=0, e_f=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6955a9a6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7125868=0, NULL=0, r_st=2, __retres1=0, p_out=0, NULL=8786, processed=0, \result=0, wl_pc=0, e_wl=2, tmp___1=0, data=0, p_in=0, tmp___3=0, c_req_up=0, NULL=8787, wl_i=1, NULL=0, c1_st=0, NULL=8788, c1_i=1, c2_i=1, d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5930f44a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3183ccbe=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4844ddb1=0, e_g=2, c1_pc=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 286]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L20] int c ; [L21] int c_t ; [L22] int c_req_up ; [L23] int p_in ; [L24] int p_out ; [L25] int wl_st ; [L26] int c1_st ; [L27] int c2_st ; [L28] int wb_st ; [L29] int r_st ; [L30] int wl_i ; [L31] int c1_i ; [L32] int c2_i ; [L33] int wb_i ; [L34] int r_i ; [L35] int wl_pc ; [L36] int c1_pc ; [L37] int c2_pc ; [L38] int wb_pc ; [L39] int e_e ; [L40] int e_f ; [L41] int e_g ; [L42] int e_c ; [L43] int e_p_in ; [L44] int e_wl ; [L50] int d ; [L51] int data ; [L52] int processed ; [L53] static int t_b ; [L681] int __retres1 ; [L685] e_wl = 2 [L686] e_c = e_wl [L687] e_g = e_c [L688] e_f = e_g [L689] e_e = e_f [L690] wl_pc = 0 [L691] c1_pc = 0 [L692] c2_pc = 0 [L693] wb_pc = 0 [L694] wb_i = 1 [L695] c2_i = wb_i [L696] c1_i = c2_i [L697] wl_i = c1_i [L698] r_i = 0 [L699] c_req_up = 0 [L700] d = 0 [L701] c = 0 [L392] int kernel_st ; [L395] kernel_st = 0 [L396] COND FALSE !((int )c_req_up == 1) [L407] COND TRUE (int )wl_i == 1 [L408] wl_st = 0 [L412] COND TRUE (int )c1_i == 1 [L413] c1_st = 0 [L417] COND TRUE (int )c2_i == 1 [L418] c2_st = 0 [L422] COND TRUE (int )wb_i == 1 [L423] wb_st = 0 [L427] COND FALSE !((int )r_i == 1) [L430] r_st = 2 [L432] COND FALSE !((int )e_f == 0) [L437] COND FALSE !((int )e_g == 0) [L442] COND FALSE !((int )e_e == 0) [L447] COND FALSE !((int )e_c == 0) [L452] COND FALSE !((int )e_wl == 0) [L457] COND FALSE !((int )wl_pc == 1) [L465] COND FALSE !((int )wl_pc == 2) [L475] COND FALSE !((int )c1_pc == 1) [L484] COND FALSE !((int )c2_pc == 1) [L493] COND FALSE !((int )wb_pc == 1) [L502] COND FALSE !((int )e_c == 1) [L507] COND FALSE !((int )e_e == 1) [L512] COND FALSE !((int )e_f == 1) [L517] COND FALSE !((int )e_g == 1) [L522] COND FALSE !((int )e_c == 1) [L527] COND FALSE !((int )e_wl == 1) [L533] COND TRUE 1 [L536] kernel_st = 1 [L278] int tmp ; [L279] int tmp___0 ; [L280] int tmp___1 ; [L281] int tmp___2 ; [L282] int tmp___3 ; Loop: [L286] COND TRUE 1 [L288] COND TRUE (int )wl_st == 0 [L309] COND TRUE (int )wl_st == 0 [L311] tmp = __VERIFIER_nondet_int() [L313] COND FALSE !(\read(tmp)) [L324] COND TRUE (int )c1_st == 0 [L326] tmp___0 = __VERIFIER_nondet_int() [L328] COND FALSE !(\read(tmp___0)) [L339] COND TRUE (int )c2_st == 0 [L341] tmp___1 = __VERIFIER_nondet_int() [L343] COND FALSE !(\read(tmp___1)) [L354] COND TRUE (int )wb_st == 0 [L356] tmp___2 = __VERIFIER_nondet_int() [L358] COND FALSE !(\read(tmp___2)) [L369] COND FALSE !((int )r_st == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...