./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/systemc/toy.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 30f4e4ab 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/toy.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 a2cf465b3c46ffeaae0c4558b2b00688c0a746a8 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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.24-30f4e4a [2019-11-28 03:45:56,960 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 03:45:56,962 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 03:45:56,980 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 03:45:56,980 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 03:45:56,982 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 03:45:56,984 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 03:45:56,993 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 03:45:56,998 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 03:45:57,001 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 03:45:57,002 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 03:45:57,004 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 03:45:57,005 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 03:45:57,007 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 03:45:57,009 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 03:45:57,011 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 03:45:57,013 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 03:45:57,014 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 03:45:57,016 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 03:45:57,021 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 03:45:57,026 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 03:45:57,029 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 03:45:57,031 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 03:45:57,033 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 03:45:57,037 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 03:45:57,037 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 03:45:57,038 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 03:45:57,039 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 03:45:57,039 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 03:45:57,040 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 03:45:57,040 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 03:45:57,041 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 03:45:57,042 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 03:45:57,043 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 03:45:57,044 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 03:45:57,044 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 03:45:57,045 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 03:45:57,045 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 03:45:57,046 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 03:45:57,047 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 03:45:57,048 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 03:45:57,048 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-28 03:45:57,064 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 03:45:57,071 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 03:45:57,072 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 03:45:57,073 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 03:45:57,073 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 03:45:57,075 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 03:45:57,075 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 03:45:57,075 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 03:45:57,076 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 03:45:57,076 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 03:45:57,078 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 03:45:57,078 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 03:45:57,078 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 03:45:57,079 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 03:45:57,079 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 03:45:57,079 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 03:45:57,079 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 03:45:57,081 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 03:45:57,081 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 03:45:57,081 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 03:45:57,081 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 03:45:57,082 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 03:45:57,082 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 03:45:57,083 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 03:45:57,083 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 03:45:57,083 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 03:45:57,083 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 03:45:57,084 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 03:45:57,085 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 03:45:57,085 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 03:45:57,085 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 03:45:57,087 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 03:45:57,088 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 -> a2cf465b3c46ffeaae0c4558b2b00688c0a746a8 [2019-11-28 03:45:57,389 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 03:45:57,402 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 03:45:57,406 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 03:45:57,407 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 03:45:57,408 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 03:45:57,409 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/toy.cil.c [2019-11-28 03:45:57,489 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5abd80d94/5b5e1dcdc192435988a7c84994440899/FLAG98f6ff14a [2019-11-28 03:45:58,011 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 03:45:58,012 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy.cil.c [2019-11-28 03:45:58,026 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5abd80d94/5b5e1dcdc192435988a7c84994440899/FLAG98f6ff14a [2019-11-28 03:45:58,363 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5abd80d94/5b5e1dcdc192435988a7c84994440899 [2019-11-28 03:45:58,367 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 03:45:58,369 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 03:45:58,370 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 03:45:58,370 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 03:45:58,374 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 03:45:58,375 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:45:58" (1/1) ... [2019-11-28 03:45:58,378 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79299060 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:45:58, skipping insertion in model container [2019-11-28 03:45:58,379 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:45:58" (1/1) ... [2019-11-28 03:45:58,387 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 03:45:58,447 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 03:45:58,717 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:45:58,723 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 03:45:58,859 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:45:58,877 INFO L208 MainTranslator]: Completed translation [2019-11-28 03:45:58,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:45:58 WrapperNode [2019-11-28 03:45:58,878 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 03:45:58,879 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 03:45:58,879 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 03:45:58,880 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 03:45:58,889 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:45:58" (1/1) ... [2019-11-28 03:45:58,897 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:45:58" (1/1) ... [2019-11-28 03:45:58,929 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 03:45:58,930 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 03:45:58,930 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 03:45:58,930 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 03:45:58,937 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:45:58" (1/1) ... [2019-11-28 03:45:58,938 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:45:58" (1/1) ... [2019-11-28 03:45:58,940 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:45:58" (1/1) ... [2019-11-28 03:45:58,940 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:45:58" (1/1) ... [2019-11-28 03:45:58,946 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:45:58" (1/1) ... [2019-11-28 03:45:58,957 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:45:58" (1/1) ... [2019-11-28 03:45:58,960 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:45:58" (1/1) ... [2019-11-28 03:45:58,964 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 03:45:58,965 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 03:45:58,965 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 03:45:58,965 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 03:45:58,966 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:45:58" (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 [2019-11-28 03:45:59,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 03:45:59,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 03:45:59,677 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 03:45:59,677 INFO L297 CfgBuilder]: Removed 26 assume(true) statements. [2019-11-28 03:45:59,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:45:59 BoogieIcfgContainer [2019-11-28 03:45:59,679 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 03:45:59,680 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 03:45:59,680 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 03:45:59,684 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 03:45:59,685 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:45:59,685 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 03:45:58" (1/3) ... [2019-11-28 03:45:59,687 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7683e8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:45:59, skipping insertion in model container [2019-11-28 03:45:59,687 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:45:59,687 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:45:58" (2/3) ... [2019-11-28 03:45:59,688 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7683e8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:45:59, skipping insertion in model container [2019-11-28 03:45:59,688 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:45:59,688 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:45:59" (3/3) ... [2019-11-28 03:45:59,690 INFO L371 chiAutomizerObserver]: Analyzing ICFG toy.cil.c [2019-11-28 03:45:59,739 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 03:45:59,740 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 03:45:59,740 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 03:45:59,740 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 03:45:59,741 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 03:45:59,741 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 03:45:59,741 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 03:45:59,741 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 03:45:59,762 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states. [2019-11-28 03:45:59,796 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2019-11-28 03:45:59,797 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:45:59,797 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:45:59,807 INFO L849 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] [2019-11-28 03:45:59,807 INFO L850 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] [2019-11-28 03:45:59,807 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 03:45:59,807 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states. [2019-11-28 03:45:59,820 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2019-11-28 03:45:59,823 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:45:59,823 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:45:59,827 INFO L849 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] [2019-11-28 03:45:59,827 INFO L850 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] [2019-11-28 03:45:59,834 INFO L794 eck$LassoCheckResult]: Stem: 87#ULTIMATE.startENTRYtrue ~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; 14#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; 4#L398true assume !(1 == ~c_req_up~0); 8#L398-2true assume !(1 == ~wl_i~0);~wl_st~0 := 2; 7#L409-1true assume !(1 == ~c1_i~0);~c1_st~0 := 2; 31#L414-1true assume 1 == ~c2_i~0;~c2_st~0 := 0; 52#L419-1true assume !(1 == ~wb_i~0);~wb_st~0 := 2; 74#L424-1true assume !(1 == ~r_i~0);~r_st~0 := 2; 100#L429-1true assume !(0 == ~e_f~0); 122#L434-1true assume !(0 == ~e_g~0); 28#L439-1true assume !(0 == ~e_e~0); 48#L444-1true assume !(0 == ~e_c~0); 71#L449-1true assume !(0 == ~e_wl~0); 94#L454-1true assume !(1 == ~wl_pc~0); 47#L466true assume !(2 == ~wl_pc~0); 120#L467true assume !(1 == ~c1_pc~0); 45#L477true assume !(1 == ~c2_pc~0); 19#L486true assume !(1 == ~wb_pc~0); 111#L495true assume !(1 == ~e_c~0); 68#L504-1true assume !(1 == ~e_e~0); 92#L509-1true assume !(1 == ~e_f~0); 117#L514-1true assume !(1 == ~e_g~0); 20#L519-1true assume !(1 == ~e_c~0); 42#L524-1true assume !(1 == ~e_wl~0); 79#L666-1true [2019-11-28 03:45:59,835 INFO L796 eck$LassoCheckResult]: Loop: 79#L666-1true assume !false; 114#L536true start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, 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; 107#L371true assume false; 6#L387true start_simulation_~kernel_st~0 := 2; 86#L542true assume !(1 == ~c_req_up~0); 93#L542-2true start_simulation_~kernel_st~0 := 3; 58#L554true assume 0 == ~e_f~0;~e_f~0 := 1; 44#L554-2true assume 0 == ~e_g~0;~e_g~0 := 1; 67#L559-1true assume !(0 == ~e_e~0); 88#L564-1true assume 0 == ~e_c~0;~e_c~0 := 1; 115#L569-1true assume 0 == ~e_wl~0;~e_wl~0 := 1; 18#L574-1true assume 1 == ~wl_pc~0; 112#L580true assume 1 == ~e_wl~0;~wl_st~0 := 0; 56#L587true assume !(1 == ~c1_pc~0); 103#L597true assume !(1 == ~c2_pc~0); 61#L606true assume !(1 == ~wb_pc~0); 33#L615true assume 1 == ~e_c~0;~r_st~0 := 0; 127#L624-1true assume 1 == ~e_e~0;~e_e~0 := 2; 16#L629-1true assume 1 == ~e_f~0;~e_f~0 := 2; 38#L634-1true assume !(1 == ~e_g~0); 62#L639-1true assume 1 == ~e_c~0;~e_c~0 := 2; 81#L644-1true assume 1 == ~e_wl~0;~e_wl~0 := 2; 110#L649-1true assume 0 == ~wl_st~0; 79#L666-1true [2019-11-28 03:45:59,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:45:59,843 INFO L82 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 1 times [2019-11-28 03:45:59,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:45:59,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528878766] [2019-11-28 03:45:59,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:45:59,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:46:00,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:46:00,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528878766] [2019-11-28 03:46:00,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:46:00,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:46:00,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612738290] [2019-11-28 03:46:00,036 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:46:00,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:00,037 INFO L82 PathProgramCache]: Analyzing trace with hash 359392569, now seen corresponding path program 1 times [2019-11-28 03:46:00,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:46:00,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740403366] [2019-11-28 03:46:00,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:46:00,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:46:00,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:46:00,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740403366] [2019-11-28 03:46:00,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:46:00,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 03:46:00,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428726388] [2019-11-28 03:46:00,052 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:46:00,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:46:00,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 03:46:00,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 03:46:00,071 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 2 states. [2019-11-28 03:46:00,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:46:00,087 INFO L93 Difference]: Finished difference Result 125 states and 219 transitions. [2019-11-28 03:46:00,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 03:46:00,089 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 219 transitions. [2019-11-28 03:46:00,095 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2019-11-28 03:46:00,100 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 120 states and 214 transitions. [2019-11-28 03:46:00,102 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 120 [2019-11-28 03:46:00,103 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 120 [2019-11-28 03:46:00,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 214 transitions. [2019-11-28 03:46:00,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:46:00,105 INFO L688 BuchiCegarLoop]: Abstraction has 120 states and 214 transitions. [2019-11-28 03:46:00,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 214 transitions. [2019-11-28 03:46:00,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-11-28 03:46:00,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-28 03:46:00,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 214 transitions. [2019-11-28 03:46:00,142 INFO L711 BuchiCegarLoop]: Abstraction has 120 states and 214 transitions. [2019-11-28 03:46:00,142 INFO L591 BuchiCegarLoop]: Abstraction has 120 states and 214 transitions. [2019-11-28 03:46:00,142 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 03:46:00,142 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 120 states and 214 transitions. [2019-11-28 03:46:00,144 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2019-11-28 03:46:00,145 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:46:00,145 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:46:00,146 INFO L849 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] [2019-11-28 03:46:00,146 INFO L850 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] [2019-11-28 03:46:00,147 INFO L794 eck$LassoCheckResult]: Stem: 368#ULTIMATE.startENTRY ~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; 281#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; 259#L398 assume !(1 == ~c_req_up~0); 261#L398-2 assume !(1 == ~wl_i~0);~wl_st~0 := 2; 267#L409-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 268#L414-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 314#L419-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 346#L424-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 363#L429-1 assume !(0 == ~e_f~0); 374#L434-1 assume !(0 == ~e_g~0); 309#L439-1 assume !(0 == ~e_e~0); 310#L444-1 assume !(0 == ~e_c~0); 342#L449-1 assume !(0 == ~e_wl~0); 361#L454-1 assume !(1 == ~wl_pc~0); 339#L466 assume !(2 == ~wl_pc~0); 340#L467 assume !(1 == ~c1_pc~0); 335#L477 assume !(1 == ~c2_pc~0); 291#L486 assume !(1 == ~wb_pc~0); 292#L495 assume !(1 == ~e_c~0); 357#L504-1 assume !(1 == ~e_e~0); 358#L509-1 assume !(1 == ~e_f~0); 371#L514-1 assume !(1 == ~e_g~0); 294#L519-1 assume !(1 == ~e_c~0); 295#L524-1 assume !(1 == ~e_wl~0); 331#L666-1 [2019-11-28 03:46:00,147 INFO L796 eck$LassoCheckResult]: Loop: 331#L666-1 assume !false; 364#L536 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, 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; 270#L371 assume !false; 370#L289 assume !(0 == ~wl_st~0); 304#L293 assume !(0 == ~c1_st~0); 273#L296 assume !(0 == ~c2_st~0); 275#L299 assume !(0 == ~wb_st~0); 287#L302 assume !(0 == ~r_st~0); 265#L387 start_simulation_~kernel_st~0 := 2; 266#L542 assume !(1 == ~c_req_up~0); 338#L542-2 start_simulation_~kernel_st~0 := 3; 350#L554 assume 0 == ~e_f~0;~e_f~0 := 1; 333#L554-2 assume 0 == ~e_g~0;~e_g~0 := 1; 334#L559-1 assume !(0 == ~e_e~0); 356#L564-1 assume 0 == ~e_c~0;~e_c~0 := 1; 369#L569-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 288#L574-1 assume 1 == ~wl_pc~0; 289#L580 assume 1 == ~e_wl~0;~wl_st~0 := 0; 272#L587 assume !(1 == ~c1_pc~0); 349#L597 assume !(1 == ~c2_pc~0); 313#L606 assume !(1 == ~wb_pc~0); 316#L615 assume 1 == ~e_c~0;~r_st~0 := 0; 317#L624-1 assume 1 == ~e_e~0;~e_e~0 := 2; 285#L629-1 assume 1 == ~e_f~0;~e_f~0 := 2; 286#L634-1 assume !(1 == ~e_g~0); 326#L639-1 assume 1 == ~e_c~0;~e_c~0 := 2; 354#L644-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 365#L649-1 assume 0 == ~wl_st~0; 331#L666-1 [2019-11-28 03:46:00,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:00,147 INFO L82 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 2 times [2019-11-28 03:46:00,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:46:00,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017960233] [2019-11-28 03:46:00,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:46:00,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:46:00,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:46:00,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017960233] [2019-11-28 03:46:00,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:46:00,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:46:00,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501586299] [2019-11-28 03:46:00,196 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:46:00,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:00,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1806372813, now seen corresponding path program 1 times [2019-11-28 03:46:00,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:46:00,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759009848] [2019-11-28 03:46:00,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:46:00,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:46:00,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:46:00,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759009848] [2019-11-28 03:46:00,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:46:00,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:46:00,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131777024] [2019-11-28 03:46:00,246 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:46:00,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:46:00,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 03:46:00,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 03:46:00,252 INFO L87 Difference]: Start difference. First operand 120 states and 214 transitions. cyclomatic complexity: 95 Second operand 3 states. [2019-11-28 03:46:00,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:46:00,277 INFO L93 Difference]: Finished difference Result 120 states and 213 transitions. [2019-11-28 03:46:00,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 03:46:00,279 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 213 transitions. [2019-11-28 03:46:00,281 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2019-11-28 03:46:00,283 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 120 states and 213 transitions. [2019-11-28 03:46:00,284 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 120 [2019-11-28 03:46:00,284 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 120 [2019-11-28 03:46:00,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 213 transitions. [2019-11-28 03:46:00,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:46:00,286 INFO L688 BuchiCegarLoop]: Abstraction has 120 states and 213 transitions. [2019-11-28 03:46:00,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 213 transitions. [2019-11-28 03:46:00,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-11-28 03:46:00,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-28 03:46:00,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 213 transitions. [2019-11-28 03:46:00,296 INFO L711 BuchiCegarLoop]: Abstraction has 120 states and 213 transitions. [2019-11-28 03:46:00,296 INFO L591 BuchiCegarLoop]: Abstraction has 120 states and 213 transitions. [2019-11-28 03:46:00,297 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 03:46:00,297 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 120 states and 213 transitions. [2019-11-28 03:46:00,299 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2019-11-28 03:46:00,299 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:46:00,299 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:46:00,301 INFO L849 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] [2019-11-28 03:46:00,301 INFO L850 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] [2019-11-28 03:46:00,301 INFO L794 eck$LassoCheckResult]: Stem: 615#ULTIMATE.startENTRY ~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; 528#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; 506#L398 assume !(1 == ~c_req_up~0); 508#L398-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 514#L409-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 515#L414-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 561#L419-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 593#L424-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 610#L429-1 assume !(0 == ~e_f~0); 621#L434-1 assume !(0 == ~e_g~0); 556#L439-1 assume !(0 == ~e_e~0); 557#L444-1 assume !(0 == ~e_c~0); 589#L449-1 assume !(0 == ~e_wl~0); 608#L454-1 assume !(1 == ~wl_pc~0); 586#L466 assume !(2 == ~wl_pc~0); 587#L467 assume !(1 == ~c1_pc~0); 582#L477 assume !(1 == ~c2_pc~0); 538#L486 assume !(1 == ~wb_pc~0); 539#L495 assume !(1 == ~e_c~0); 604#L504-1 assume !(1 == ~e_e~0); 605#L509-1 assume !(1 == ~e_f~0); 618#L514-1 assume !(1 == ~e_g~0); 541#L519-1 assume !(1 == ~e_c~0); 542#L524-1 assume !(1 == ~e_wl~0); 578#L666-1 [2019-11-28 03:46:00,302 INFO L796 eck$LassoCheckResult]: Loop: 578#L666-1 assume !false; 611#L536 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, 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; 517#L371 assume !false; 617#L289 assume !(0 == ~wl_st~0); 551#L293 assume !(0 == ~c1_st~0); 520#L296 assume !(0 == ~c2_st~0); 522#L299 assume !(0 == ~wb_st~0); 534#L302 assume !(0 == ~r_st~0); 512#L387 start_simulation_~kernel_st~0 := 2; 513#L542 assume !(1 == ~c_req_up~0); 585#L542-2 start_simulation_~kernel_st~0 := 3; 597#L554 assume 0 == ~e_f~0;~e_f~0 := 1; 580#L554-2 assume 0 == ~e_g~0;~e_g~0 := 1; 581#L559-1 assume !(0 == ~e_e~0); 603#L564-1 assume 0 == ~e_c~0;~e_c~0 := 1; 616#L569-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 535#L574-1 assume 1 == ~wl_pc~0; 536#L580 assume 1 == ~e_wl~0;~wl_st~0 := 0; 519#L587 assume !(1 == ~c1_pc~0); 596#L597 assume !(1 == ~c2_pc~0); 560#L606 assume !(1 == ~wb_pc~0); 563#L615 assume 1 == ~e_c~0;~r_st~0 := 0; 564#L624-1 assume 1 == ~e_e~0;~e_e~0 := 2; 532#L629-1 assume 1 == ~e_f~0;~e_f~0 := 2; 533#L634-1 assume !(1 == ~e_g~0); 573#L639-1 assume 1 == ~e_c~0;~e_c~0 := 2; 601#L644-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 612#L649-1 assume 0 == ~wl_st~0; 578#L666-1 [2019-11-28 03:46:00,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:00,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1738779219, now seen corresponding path program 1 times [2019-11-28 03:46:00,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:46:00,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756970745] [2019-11-28 03:46:00,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:46:00,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:46:00,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:46:00,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756970745] [2019-11-28 03:46:00,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:46:00,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:46:00,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944149804] [2019-11-28 03:46:00,356 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:46:00,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:00,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1806372813, now seen corresponding path program 2 times [2019-11-28 03:46:00,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:46:00,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546163553] [2019-11-28 03:46:00,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:46:00,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:46:00,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:46:00,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546163553] [2019-11-28 03:46:00,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:46:00,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:46:00,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135472342] [2019-11-28 03:46:00,428 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:46:00,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:46:00,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 03:46:00,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 03:46:00,429 INFO L87 Difference]: Start difference. First operand 120 states and 213 transitions. cyclomatic complexity: 94 Second operand 3 states. [2019-11-28 03:46:00,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:46:00,457 INFO L93 Difference]: Finished difference Result 120 states and 212 transitions. [2019-11-28 03:46:00,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 03:46:00,458 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 212 transitions. [2019-11-28 03:46:00,459 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2019-11-28 03:46:00,461 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 120 states and 212 transitions. [2019-11-28 03:46:00,462 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 120 [2019-11-28 03:46:00,462 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 120 [2019-11-28 03:46:00,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 212 transitions. [2019-11-28 03:46:00,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:46:00,464 INFO L688 BuchiCegarLoop]: Abstraction has 120 states and 212 transitions. [2019-11-28 03:46:00,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 212 transitions. [2019-11-28 03:46:00,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-11-28 03:46:00,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-28 03:46:00,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 212 transitions. [2019-11-28 03:46:00,472 INFO L711 BuchiCegarLoop]: Abstraction has 120 states and 212 transitions. [2019-11-28 03:46:00,472 INFO L591 BuchiCegarLoop]: Abstraction has 120 states and 212 transitions. [2019-11-28 03:46:00,472 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 03:46:00,472 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 120 states and 212 transitions. [2019-11-28 03:46:00,474 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2019-11-28 03:46:00,474 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:46:00,474 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:46:00,475 INFO L849 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] [2019-11-28 03:46:00,475 INFO L850 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] [2019-11-28 03:46:00,476 INFO L794 eck$LassoCheckResult]: Stem: 862#ULTIMATE.startENTRY ~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; 775#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; 753#L398 assume !(1 == ~c_req_up~0); 755#L398-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 761#L409-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 762#L414-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 808#L419-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 840#L424-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 857#L429-1 assume !(0 == ~e_f~0); 868#L434-1 assume !(0 == ~e_g~0); 803#L439-1 assume !(0 == ~e_e~0); 804#L444-1 assume !(0 == ~e_c~0); 836#L449-1 assume !(0 == ~e_wl~0); 855#L454-1 assume !(1 == ~wl_pc~0); 833#L466 assume !(2 == ~wl_pc~0); 834#L467 assume !(1 == ~c1_pc~0); 829#L477 assume !(1 == ~c2_pc~0); 785#L486 assume !(1 == ~wb_pc~0); 786#L495 assume !(1 == ~e_c~0); 851#L504-1 assume !(1 == ~e_e~0); 852#L509-1 assume !(1 == ~e_f~0); 865#L514-1 assume !(1 == ~e_g~0); 788#L519-1 assume !(1 == ~e_c~0); 789#L524-1 assume !(1 == ~e_wl~0); 825#L666-1 [2019-11-28 03:46:00,476 INFO L796 eck$LassoCheckResult]: Loop: 825#L666-1 assume !false; 858#L536 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, 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; 764#L371 assume !false; 864#L289 assume !(0 == ~wl_st~0); 798#L293 assume !(0 == ~c1_st~0); 767#L296 assume !(0 == ~c2_st~0); 769#L299 assume !(0 == ~wb_st~0); 781#L302 assume !(0 == ~r_st~0); 759#L387 start_simulation_~kernel_st~0 := 2; 760#L542 assume !(1 == ~c_req_up~0); 832#L542-2 start_simulation_~kernel_st~0 := 3; 844#L554 assume 0 == ~e_f~0;~e_f~0 := 1; 827#L554-2 assume 0 == ~e_g~0;~e_g~0 := 1; 828#L559-1 assume !(0 == ~e_e~0); 850#L564-1 assume 0 == ~e_c~0;~e_c~0 := 1; 863#L569-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 782#L574-1 assume !(1 == ~wl_pc~0); 784#L586 assume !(2 == ~wl_pc~0); 766#L587 assume !(1 == ~c1_pc~0); 843#L597 assume !(1 == ~c2_pc~0); 807#L606 assume !(1 == ~wb_pc~0); 810#L615 assume 1 == ~e_c~0;~r_st~0 := 0; 811#L624-1 assume 1 == ~e_e~0;~e_e~0 := 2; 779#L629-1 assume 1 == ~e_f~0;~e_f~0 := 2; 780#L634-1 assume !(1 == ~e_g~0); 820#L639-1 assume 1 == ~e_c~0;~e_c~0 := 2; 848#L644-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 859#L649-1 assume 0 == ~wl_st~0; 825#L666-1 [2019-11-28 03:46:00,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:00,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1738539627, now seen corresponding path program 1 times [2019-11-28 03:46:00,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:46:00,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397577753] [2019-11-28 03:46:00,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:46:00,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:46:00,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:46:00,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397577753] [2019-11-28 03:46:00,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:46:00,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:46:00,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319933639] [2019-11-28 03:46:00,517 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:46:00,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:00,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1257113092, now seen corresponding path program 1 times [2019-11-28 03:46:00,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:46:00,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69005935] [2019-11-28 03:46:00,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:46:00,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:46:00,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:46:00,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69005935] [2019-11-28 03:46:00,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:46:00,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:46:00,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117636770] [2019-11-28 03:46:00,571 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:46:00,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:46:00,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 03:46:00,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 03:46:00,572 INFO L87 Difference]: Start difference. First operand 120 states and 212 transitions. cyclomatic complexity: 93 Second operand 3 states. [2019-11-28 03:46:00,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:46:00,593 INFO L93 Difference]: Finished difference Result 120 states and 211 transitions. [2019-11-28 03:46:00,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 03:46:00,594 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 211 transitions. [2019-11-28 03:46:00,596 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2019-11-28 03:46:00,598 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 120 states and 211 transitions. [2019-11-28 03:46:00,598 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 120 [2019-11-28 03:46:00,599 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 120 [2019-11-28 03:46:00,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 211 transitions. [2019-11-28 03:46:00,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:46:00,600 INFO L688 BuchiCegarLoop]: Abstraction has 120 states and 211 transitions. [2019-11-28 03:46:00,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 211 transitions. [2019-11-28 03:46:00,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-11-28 03:46:00,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-28 03:46:00,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 211 transitions. [2019-11-28 03:46:00,610 INFO L711 BuchiCegarLoop]: Abstraction has 120 states and 211 transitions. [2019-11-28 03:46:00,611 INFO L591 BuchiCegarLoop]: Abstraction has 120 states and 211 transitions. [2019-11-28 03:46:00,611 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 03:46:00,612 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 120 states and 211 transitions. [2019-11-28 03:46:00,614 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2019-11-28 03:46:00,614 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:46:00,614 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:46:00,617 INFO L849 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] [2019-11-28 03:46:00,617 INFO L850 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] [2019-11-28 03:46:00,617 INFO L794 eck$LassoCheckResult]: Stem: 1109#ULTIMATE.startENTRY ~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; 1022#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; 1000#L398 assume !(1 == ~c_req_up~0); 1002#L398-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1008#L409-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1009#L414-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1055#L419-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1087#L424-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1104#L429-1 assume !(0 == ~e_f~0); 1115#L434-1 assume !(0 == ~e_g~0); 1050#L439-1 assume !(0 == ~e_e~0); 1051#L444-1 assume !(0 == ~e_c~0); 1083#L449-1 assume !(0 == ~e_wl~0); 1102#L454-1 assume !(1 == ~wl_pc~0); 1080#L466 assume !(2 == ~wl_pc~0); 1081#L467 assume !(1 == ~c1_pc~0); 1076#L477 assume !(1 == ~c2_pc~0); 1032#L486 assume !(1 == ~wb_pc~0); 1033#L495 assume !(1 == ~e_c~0); 1098#L504-1 assume !(1 == ~e_e~0); 1099#L509-1 assume !(1 == ~e_f~0); 1112#L514-1 assume !(1 == ~e_g~0); 1035#L519-1 assume !(1 == ~e_c~0); 1036#L524-1 assume !(1 == ~e_wl~0); 1072#L666-1 [2019-11-28 03:46:00,620 INFO L796 eck$LassoCheckResult]: Loop: 1072#L666-1 assume !false; 1105#L536 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, 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; 1011#L371 assume !false; 1111#L289 assume !(0 == ~wl_st~0); 1045#L293 assume !(0 == ~c1_st~0); 1014#L296 assume !(0 == ~c2_st~0); 1016#L299 assume !(0 == ~wb_st~0); 1028#L302 assume !(0 == ~r_st~0); 1006#L387 start_simulation_~kernel_st~0 := 2; 1007#L542 assume !(1 == ~c_req_up~0); 1079#L542-2 start_simulation_~kernel_st~0 := 3; 1091#L554 assume 0 == ~e_f~0;~e_f~0 := 1; 1074#L554-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1075#L559-1 assume !(0 == ~e_e~0); 1097#L564-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1110#L569-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1029#L574-1 assume 1 == ~wl_pc~0; 1030#L580 assume 1 == ~e_wl~0;~wl_st~0 := 0; 1013#L587 assume !(1 == ~c1_pc~0); 1090#L597 assume !(1 == ~c2_pc~0); 1054#L606 assume !(1 == ~wb_pc~0); 1057#L615 assume 1 == ~e_c~0;~r_st~0 := 0; 1058#L624-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1026#L629-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1027#L634-1 assume !(1 == ~e_g~0); 1067#L639-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1095#L644-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1106#L649-1 assume 0 == ~wl_st~0; 1072#L666-1 [2019-11-28 03:46:00,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:00,620 INFO L82 PathProgramCache]: Analyzing trace with hash 255605079, now seen corresponding path program 1 times [2019-11-28 03:46:00,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:46:00,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993941992] [2019-11-28 03:46:00,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:46:00,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:46:00,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:46:00,704 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:46:00,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:00,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1806372813, now seen corresponding path program 3 times [2019-11-28 03:46:00,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:46:00,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24184903] [2019-11-28 03:46:00,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:46:00,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:46:00,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:46:00,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24184903] [2019-11-28 03:46:00,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:46:00,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:46:00,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950232067] [2019-11-28 03:46:00,747 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:46:00,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:46:00,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 03:46:00,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 03:46:00,749 INFO L87 Difference]: Start difference. First operand 120 states and 211 transitions. cyclomatic complexity: 92 Second operand 3 states. [2019-11-28 03:46:00,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:46:00,807 INFO L93 Difference]: Finished difference Result 154 states and 273 transitions. [2019-11-28 03:46:00,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 03:46:00,808 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 154 states and 273 transitions. [2019-11-28 03:46:00,810 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 106 [2019-11-28 03:46:00,812 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 154 states to 154 states and 273 transitions. [2019-11-28 03:46:00,813 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 154 [2019-11-28 03:46:00,813 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 154 [2019-11-28 03:46:00,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 154 states and 273 transitions. [2019-11-28 03:46:00,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:46:00,815 INFO L688 BuchiCegarLoop]: Abstraction has 154 states and 273 transitions. [2019-11-28 03:46:00,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states and 273 transitions. [2019-11-28 03:46:00,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2019-11-28 03:46:00,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-11-28 03:46:00,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 273 transitions. [2019-11-28 03:46:00,825 INFO L711 BuchiCegarLoop]: Abstraction has 154 states and 273 transitions. [2019-11-28 03:46:00,826 INFO L591 BuchiCegarLoop]: Abstraction has 154 states and 273 transitions. [2019-11-28 03:46:00,826 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 03:46:00,826 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 154 states and 273 transitions. [2019-11-28 03:46:00,828 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 106 [2019-11-28 03:46:00,828 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:46:00,828 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:46:00,834 INFO L849 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] [2019-11-28 03:46:00,834 INFO L850 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] [2019-11-28 03:46:00,835 INFO L794 eck$LassoCheckResult]: Stem: 1392#ULTIMATE.startENTRY ~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; 1302#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; 1280#L398 assume !(1 == ~c_req_up~0); 1282#L398-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1288#L409-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1289#L414-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1335#L419-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1368#L424-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1387#L429-1 assume !(0 == ~e_f~0); 1398#L434-1 assume 0 == ~e_g~0;~e_g~0 := 1; 1403#L439-1 assume !(0 == ~e_e~0); 1417#L444-1 assume !(0 == ~e_c~0); 1416#L449-1 assume !(0 == ~e_wl~0); 1415#L454-1 assume !(1 == ~wl_pc~0); 1413#L466 assume !(2 == ~wl_pc~0); 1411#L467 assume !(1 == ~c1_pc~0); 1409#L477 assume !(1 == ~c2_pc~0); 1407#L486 assume !(1 == ~wb_pc~0); 1379#L495 assume !(1 == ~e_c~0); 1381#L504-1 assume !(1 == ~e_e~0); 1382#L509-1 assume !(1 == ~e_f~0); 1395#L514-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1315#L519-1 assume !(1 == ~e_c~0); 1316#L524-1 assume !(1 == ~e_wl~0); 1352#L666-1 [2019-11-28 03:46:00,837 INFO L796 eck$LassoCheckResult]: Loop: 1352#L666-1 assume !false; 1388#L536 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, 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; 1291#L371 assume !false; 1394#L289 assume !(0 == ~wl_st~0); 1325#L293 assume !(0 == ~c1_st~0); 1294#L296 assume !(0 == ~c2_st~0); 1296#L299 assume !(0 == ~wb_st~0); 1308#L302 assume !(0 == ~r_st~0); 1286#L387 start_simulation_~kernel_st~0 := 2; 1287#L542 assume !(1 == ~c_req_up~0); 1360#L542-2 start_simulation_~kernel_st~0 := 3; 1372#L554 assume 0 == ~e_f~0;~e_f~0 := 1; 1354#L554-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1355#L559-1 assume !(0 == ~e_e~0); 1380#L564-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1393#L569-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1309#L574-1 assume 1 == ~wl_pc~0; 1310#L580 assume 1 == ~e_wl~0;~wl_st~0 := 0; 1293#L587 assume !(1 == ~c1_pc~0); 1371#L597 assume !(1 == ~c2_pc~0); 1334#L606 assume !(1 == ~wb_pc~0); 1337#L615 assume 1 == ~e_c~0;~r_st~0 := 0; 1338#L624-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1306#L629-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1307#L634-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1347#L639-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1376#L644-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1389#L649-1 assume 0 == ~wl_st~0; 1352#L666-1 [2019-11-28 03:46:00,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:00,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1535466835, now seen corresponding path program 1 times [2019-11-28 03:46:00,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:46:00,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081861778] [2019-11-28 03:46:00,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:46:00,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:46:00,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:46:00,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081861778] [2019-11-28 03:46:00,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:46:00,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 03:46:00,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643924998] [2019-11-28 03:46:00,896 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:46:00,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:00,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1806432395, now seen corresponding path program 1 times [2019-11-28 03:46:00,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:46:00,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335009096] [2019-11-28 03:46:00,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:46:00,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:46:00,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:46:00,926 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:46:01,153 WARN L192 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2019-11-28 03:46:01,266 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:46:01,267 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:46:01,267 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:46:01,268 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:46:01,268 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 03:46:01,268 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:46:01,268 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:46:01,268 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:46:01,269 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration6_Loop [2019-11-28 03:46:01,269 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:46:01,269 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:46:01,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:01,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:01,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:01,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:01,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:01,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:01,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:01,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:01,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:01,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:01,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:01,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:01,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:01,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:01,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:01,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:01,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:01,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:01,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:01,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:01,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:01,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:01,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:01,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:01,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:01,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:01,747 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:46:01,748 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) [2019-11-28 03:46:01,758 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:46:01,759 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 [2019-11-28 03:46:01,774 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:46:01,774 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) [2019-11-28 03:46:01,790 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:46:01,790 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:46:01,822 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 03:46:01,822 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 [2019-11-28 03:46:01,831 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 03:46:01,833 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:46:01,834 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:46:01,834 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:46:01,834 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:46:01,834 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:46:01,834 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:46:01,834 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:46:01,834 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:46:01,834 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration6_Loop [2019-11-28 03:46:01,834 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:46:01,835 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:46:01,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:01,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:01,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:01,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:01,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:01,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:01,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:01,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:01,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:01,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:01,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:01,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:01,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:01,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:01,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:01,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:01,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:01,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:01,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:01,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:01,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:01,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:01,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:01,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:01,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:01,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:02,248 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:46:02,254 INFO L489 LassoAnalysis]: Using template 'affine'. 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) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:46:02,266 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 [2019-11-28 03:46:02,268 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:46:02,268 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:46:02,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:46:02,269 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 03:46:02,269 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:46:02,273 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-28 03:46:02,274 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:46:02,277 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:46:02,289 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 [2019-11-28 03:46:02,290 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:46:02,290 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:46:02,291 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:46:02,291 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:46:02,291 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:46:02,292 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:46:02,292 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 [2019-11-28 03:46:02,295 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:46:02,335 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 03:46:02,335 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:46:02,400 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:46:02,400 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 03:46:02,400 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:46:02,401 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:46:02,409 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 03:46:02,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:02,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:46:02,527 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:46:02,529 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:46:02,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:46:02,556 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:46:02,558 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:46:02,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:46:02,609 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 [2019-11-28 03:46:02,610 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 154 states and 273 transitions. cyclomatic complexity: 120 Second operand 5 states. [2019-11-28 03:46:02,723 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 154 states and 273 transitions. cyclomatic complexity: 120. Second operand 5 states. Result 480 states and 845 transitions. Complement of second has 5 states. [2019-11-28 03:46:02,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 03:46:02,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 03:46:02,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions. [2019-11-28 03:46:02,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 366 transitions. Stem has 24 letters. Loop has 28 letters. [2019-11-28 03:46:02,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:46:02,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 366 transitions. Stem has 52 letters. Loop has 28 letters. [2019-11-28 03:46:02,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:46:02,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 366 transitions. Stem has 24 letters. Loop has 56 letters. [2019-11-28 03:46:02,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:46:02,732 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 480 states and 845 transitions. [2019-11-28 03:46:02,741 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 318 [2019-11-28 03:46:02,746 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 480 states to 480 states and 845 transitions. [2019-11-28 03:46:02,746 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 367 [2019-11-28 03:46:02,747 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 371 [2019-11-28 03:46:02,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 480 states and 845 transitions. [2019-11-28 03:46:02,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:46:02,747 INFO L688 BuchiCegarLoop]: Abstraction has 480 states and 845 transitions. [2019-11-28 03:46:02,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states and 845 transitions. [2019-11-28 03:46:02,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 370. [2019-11-28 03:46:02,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-11-28 03:46:02,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 653 transitions. [2019-11-28 03:46:02,779 INFO L711 BuchiCegarLoop]: Abstraction has 370 states and 653 transitions. [2019-11-28 03:46:02,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:46:02,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 03:46:02,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 03:46:02,781 INFO L87 Difference]: Start difference. First operand 370 states and 653 transitions. Second operand 4 states. [2019-11-28 03:46:02,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:46:02,890 INFO L93 Difference]: Finished difference Result 570 states and 982 transitions. [2019-11-28 03:46:02,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 03:46:02,891 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 570 states and 982 transitions. [2019-11-28 03:46:02,898 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 332 [2019-11-28 03:46:02,904 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 570 states to 570 states and 982 transitions. [2019-11-28 03:46:02,905 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 391 [2019-11-28 03:46:02,906 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 391 [2019-11-28 03:46:02,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 570 states and 982 transitions. [2019-11-28 03:46:02,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:46:02,906 INFO L688 BuchiCegarLoop]: Abstraction has 570 states and 982 transitions. [2019-11-28 03:46:02,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states and 982 transitions. [2019-11-28 03:46:02,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 542. [2019-11-28 03:46:02,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2019-11-28 03:46:02,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 942 transitions. [2019-11-28 03:46:02,921 INFO L711 BuchiCegarLoop]: Abstraction has 542 states and 942 transitions. [2019-11-28 03:46:02,921 INFO L591 BuchiCegarLoop]: Abstraction has 542 states and 942 transitions. [2019-11-28 03:46:02,921 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 03:46:02,922 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 542 states and 942 transitions. [2019-11-28 03:46:02,926 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 332 [2019-11-28 03:46:02,926 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:46:02,926 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:46:02,927 INFO L849 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] [2019-11-28 03:46:02,927 INFO L850 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] [2019-11-28 03:46:02,927 INFO L794 eck$LassoCheckResult]: Stem: 3246#ULTIMATE.startENTRY ~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; 3073#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; 3034#L398 assume !(1 == ~c_req_up~0); 3036#L398-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 3047#L409-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 3048#L414-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 3132#L419-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 3193#L424-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 3231#L429-1 assume !(0 == ~e_f~0); 3264#L434-1 assume !(0 == ~e_g~0); 3124#L439-1 assume !(0 == ~e_e~0); 3125#L444-1 assume !(0 == ~e_c~0); 3185#L449-1 assume !(0 == ~e_wl~0); 3228#L454-1 assume !(1 == ~wl_pc~0); 3182#L466 assume !(2 == ~wl_pc~0); 3183#L467 assume !(1 == ~c1_pc~0); 3176#L477 assume !(1 == ~c2_pc~0); 3092#L486 assume !(1 == ~wb_pc~0); 3093#L495 assume !(1 == ~e_c~0); 3316#L504-1 assume !(1 == ~e_e~0); 3314#L509-1 assume 1 == ~e_f~0;~e_f~0 := 2; 3313#L514-1 assume !(1 == ~e_g~0); 3280#L519-1 assume !(1 == ~e_c~0); 3312#L524-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 3232#L666-1 [2019-11-28 03:46:02,928 INFO L796 eck$LassoCheckResult]: Loop: 3232#L666-1 assume !false; 3233#L536 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, 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; 3050#L371 assume !false; 3251#L289 assume !(0 == ~wl_st~0); 3114#L293 assume !(0 == ~c1_st~0); 3057#L296 assume !(0 == ~c2_st~0); 3059#L299 assume !(0 == ~wb_st~0); 3084#L302 assume !(0 == ~r_st~0); 3043#L387 start_simulation_~kernel_st~0 := 2; 3044#L542 assume !(1 == ~c_req_up~0); 3179#L542-2 start_simulation_~kernel_st~0 := 3; 3256#L554 assume 0 == ~e_f~0;~e_f~0 := 1; 3350#L554-2 assume !(0 == ~e_g~0); 3352#L559-1 assume !(0 == ~e_e~0); 3351#L564-1 assume 0 == ~e_c~0;~e_c~0 := 1; 3278#L569-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 3086#L574-1 assume !(1 == ~wl_pc~0); 3088#L586 assume !(2 == ~wl_pc~0); 3054#L587 assume !(1 == ~c1_pc~0); 3198#L597 assume !(1 == ~c2_pc~0); 3129#L606 assume !(1 == ~wb_pc~0); 3210#L615 assume 1 == ~e_c~0;~r_st~0 := 0; 3559#L624-1 assume 1 == ~e_e~0;~e_e~0 := 2; 3558#L629-1 assume 1 == ~e_f~0;~e_f~0 := 2; 3499#L634-1 assume !(1 == ~e_g~0); 3155#L639-1 assume 1 == ~e_c~0;~e_c~0 := 2; 3214#L644-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 3238#L649-1 assume 0 == ~wl_st~0; 3232#L666-1 [2019-11-28 03:46:02,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:02,928 INFO L82 PathProgramCache]: Analyzing trace with hash 255545495, now seen corresponding path program 1 times [2019-11-28 03:46:02,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:46:02,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14537092] [2019-11-28 03:46:02,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:46:02,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:46:02,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:46:02,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14537092] [2019-11-28 03:46:02,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:46:02,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 03:46:02,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701680256] [2019-11-28 03:46:02,998 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:46:02,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:02,999 INFO L82 PathProgramCache]: Analyzing trace with hash 2016785850, now seen corresponding path program 1 times [2019-11-28 03:46:02,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:46:02,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081264180] [2019-11-28 03:46:02,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:46:03,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:46:03,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:46:03,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081264180] [2019-11-28 03:46:03,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:46:03,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 03:46:03,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004083007] [2019-11-28 03:46:03,024 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:46:03,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:46:03,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 03:46:03,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 03:46:03,025 INFO L87 Difference]: Start difference. First operand 542 states and 942 transitions. cyclomatic complexity: 406 Second operand 4 states. [2019-11-28 03:46:03,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:46:03,158 INFO L93 Difference]: Finished difference Result 1129 states and 1896 transitions. [2019-11-28 03:46:03,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 03:46:03,159 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1129 states and 1896 transitions. [2019-11-28 03:46:03,174 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 690 [2019-11-28 03:46:03,188 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1129 states to 1129 states and 1896 transitions. [2019-11-28 03:46:03,188 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 774 [2019-11-28 03:46:03,189 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 774 [2019-11-28 03:46:03,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1129 states and 1896 transitions. [2019-11-28 03:46:03,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:46:03,191 INFO L688 BuchiCegarLoop]: Abstraction has 1129 states and 1896 transitions. [2019-11-28 03:46:03,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states and 1896 transitions. [2019-11-28 03:46:03,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 1111. [2019-11-28 03:46:03,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1111 states. [2019-11-28 03:46:03,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 1875 transitions. [2019-11-28 03:46:03,224 INFO L711 BuchiCegarLoop]: Abstraction has 1111 states and 1875 transitions. [2019-11-28 03:46:03,224 INFO L591 BuchiCegarLoop]: Abstraction has 1111 states and 1875 transitions. [2019-11-28 03:46:03,224 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-28 03:46:03,224 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1111 states and 1875 transitions. [2019-11-28 03:46:03,232 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 688 [2019-11-28 03:46:03,233 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:46:03,233 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:46:03,234 INFO L849 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] [2019-11-28 03:46:03,234 INFO L850 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] [2019-11-28 03:46:03,235 INFO L794 eck$LassoCheckResult]: Stem: 4965#ULTIMATE.startENTRY ~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; 4768#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; 4722#L398 assume !(1 == ~c_req_up~0); 4724#L398-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 4739#L409-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 4826#L414-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 4827#L419-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 4940#L424-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 4941#L429-1 assume !(0 == ~e_f~0); 5013#L434-1 assume !(0 == ~e_g~0); 5014#L439-1 assume !(0 == ~e_e~0); 4882#L444-1 assume 0 == ~e_c~0;~e_c~0 := 1; 4883#L449-1 assume !(0 == ~e_wl~0); 4936#L454-1 assume !(1 == ~wl_pc~0); 4879#L466 assume !(2 == ~wl_pc~0); 4880#L467 assume !(1 == ~c1_pc~0); 4876#L477 assume !(1 == ~c2_pc~0); 4878#L486 assume !(1 == ~wb_pc~0); 5032#L495 assume !(1 == ~e_c~0); 5030#L504-1 assume !(1 == ~e_e~0); 5028#L509-1 assume !(1 == ~e_f~0); 5025#L514-1 assume 1 == ~e_g~0;~e_g~0 := 2; 5022#L519-1 assume !(1 == ~e_c~0); 5023#L524-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 5196#L666-1 [2019-11-28 03:46:03,236 INFO L796 eck$LassoCheckResult]: Loop: 5196#L666-1 assume !false; 5346#L536 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, 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; 5718#L371 assume !false; 5717#L289 assume !(0 == ~wl_st~0); 5716#L293 assume !(0 == ~c1_st~0); 5715#L296 assume !(0 == ~c2_st~0); 5714#L299 assume !(0 == ~wb_st~0); 5322#L302 assume !(0 == ~r_st~0); 5320#L387 start_simulation_~kernel_st~0 := 2; 5313#L542 assume !(1 == ~c_req_up~0); 5312#L542-2 start_simulation_~kernel_st~0 := 3; 5305#L554 assume 0 == ~e_f~0;~e_f~0 := 1; 5303#L554-2 assume !(0 == ~e_g~0); 5301#L559-1 assume !(0 == ~e_e~0); 5298#L564-1 assume 0 == ~e_c~0;~e_c~0 := 1; 5297#L569-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 5295#L574-1 assume 1 == ~wl_pc~0; 5293#L580 assume 1 == ~e_wl~0;~wl_st~0 := 0; 5289#L587 assume !(1 == ~c1_pc~0); 5286#L597 assume !(1 == ~c2_pc~0); 5288#L606 assume !(1 == ~wb_pc~0); 5680#L615 assume 1 == ~e_c~0;~r_st~0 := 0; 5277#L624-1 assume 1 == ~e_e~0;~e_e~0 := 2; 5278#L629-1 assume 1 == ~e_f~0;~e_f~0 := 2; 5660#L634-1 assume !(1 == ~e_g~0); 5462#L639-1 assume 1 == ~e_c~0;~e_c~0 := 2; 5659#L644-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 5730#L649-1 assume 0 == ~wl_st~0; 5196#L666-1 [2019-11-28 03:46:03,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:03,236 INFO L82 PathProgramCache]: Analyzing trace with hash 842409169, now seen corresponding path program 1 times [2019-11-28 03:46:03,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:46:03,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594772574] [2019-11-28 03:46:03,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:46:03,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:46:03,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:46:03,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594772574] [2019-11-28 03:46:03,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:46:03,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 03:46:03,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556433240] [2019-11-28 03:46:03,272 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:46:03,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:03,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1467526129, now seen corresponding path program 1 times [2019-11-28 03:46:03,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:46:03,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607360143] [2019-11-28 03:46:03,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:46:03,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:46:03,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:46:03,300 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:46:03,456 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2019-11-28 03:46:03,518 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:46:03,518 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:46:03,518 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:46:03,518 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:46:03,518 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 03:46:03,518 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:46:03,518 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:46:03,518 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:46:03,518 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration8_Loop [2019-11-28 03:46:03,519 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:46:03,519 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:46:03,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:03,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:03,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:03,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:03,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:03,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:03,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:03,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:03,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:03,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:03,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:03,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:03,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:03,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:03,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:03,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:03,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:03,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:03,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:03,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:03,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:03,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:03,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:03,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:03,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:03,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:03,851 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:46:03,852 INFO L404 LassoAnalysis]: Checking for nontermination... 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) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:46:03,865 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:46:03,866 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 03:46:03,871 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:46:03,872 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:46:03,888 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:46:03,889 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:46:03,893 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:46:03,893 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:46:03,911 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:46:03,911 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 [2019-11-28 03:46:03,918 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:46:03,918 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_~kernel_st~0=3} Honda state: {ULTIMATE.start_start_simulation_~kernel_st~0=3} 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) [2019-11-28 03:46:03,933 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:46:03,934 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 [2019-11-28 03:46:03,940 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:46:03,940 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c1_st~0=-5} Honda state: {~c1_st~0=-5} 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) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:46:03,956 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:46:03,956 INFO L160 nArgumentSynthesizer]: Using integer mode. 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) [2019-11-28 03:46:03,979 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 03:46:03,979 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:46:03,989 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 03:46:03,992 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:46:03,992 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:46:03,992 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:46:03,992 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:46:03,992 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:46:03,993 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:46:03,993 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:46:03,993 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:46:03,994 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration8_Loop [2019-11-28 03:46:03,994 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:46:03,994 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:46:04,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:04,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:04,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:04,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:04,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:04,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:04,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:04,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:04,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:04,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:04,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:04,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:04,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:04,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:04,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:04,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:04,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:04,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:04,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:04,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:04,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:04,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:04,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:04,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:04,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:04,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:04,360 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:46:04,360 INFO L489 LassoAnalysis]: Using template 'affine'. 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 [2019-11-28 03:46:04,373 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 [2019-11-28 03:46:04,375 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:46:04,376 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:46:04,376 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:46:04,376 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:46:04,376 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:46:04,378 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:46:04,378 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:46:04,380 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 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 [2019-11-28 03:46:04,394 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 [2019-11-28 03:46:04,396 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:46:04,396 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:46:04,396 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:46:04,396 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 03:46:04,397 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:46:04,397 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-28 03:46:04,398 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:46:04,400 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 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 [2019-11-28 03:46:04,414 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 [2019-11-28 03:46:04,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:46:04,417 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:46:04,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:46:04,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:46:04,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:46:04,418 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:46:04,418 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:46:04,422 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 [2019-11-28 03:46:04,430 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 [2019-11-28 03:46:04,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:46:04,432 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:46:04,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:46:04,433 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 03:46:04,433 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:46:04,434 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-28 03:46:04,434 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:46:04,437 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 [2019-11-28 03:46:04,451 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 [2019-11-28 03:46:04,453 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:46:04,454 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:46:04,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:46:04,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:46:04,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:46:04,456 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:46:04,456 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:46:04,458 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:46:04,462 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 03:46:04,462 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 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 [2019-11-28 03:46:04,468 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:46:04,468 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 03:46:04,469 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:46:04,469 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] [2019-11-28 03:46:04,472 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 03:46:04,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:04,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:46:04,517 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:46:04,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:46:04,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:46:04,538 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:46:04,539 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:46:04,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:46:04,563 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 [2019-11-28 03:46:04,563 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1111 states and 1875 transitions. cyclomatic complexity: 776 Second operand 5 states. [2019-11-28 03:46:04,623 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1111 states and 1875 transitions. cyclomatic complexity: 776. Second operand 5 states. Result 1849 states and 3132 transitions. Complement of second has 5 states. [2019-11-28 03:46:04,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 03:46:04,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 03:46:04,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 359 transitions. [2019-11-28 03:46:04,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 359 transitions. Stem has 24 letters. Loop has 28 letters. [2019-11-28 03:46:04,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:46:04,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 359 transitions. Stem has 52 letters. Loop has 28 letters. [2019-11-28 03:46:04,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:46:04,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 359 transitions. Stem has 24 letters. Loop has 56 letters. [2019-11-28 03:46:04,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:46:04,629 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1849 states and 3132 transitions. [2019-11-28 03:46:04,648 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 1064 [2019-11-28 03:46:04,665 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1849 states to 1849 states and 3132 transitions. [2019-11-28 03:46:04,666 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1142 [2019-11-28 03:46:04,668 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1151 [2019-11-28 03:46:04,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1849 states and 3132 transitions. [2019-11-28 03:46:04,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:46:04,669 INFO L688 BuchiCegarLoop]: Abstraction has 1849 states and 3132 transitions. [2019-11-28 03:46:04,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1849 states and 3132 transitions. [2019-11-28 03:46:04,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1849 to 955. [2019-11-28 03:46:04,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 955 states. [2019-11-28 03:46:04,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 1615 transitions. [2019-11-28 03:46:04,708 INFO L711 BuchiCegarLoop]: Abstraction has 955 states and 1615 transitions. [2019-11-28 03:46:04,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:46:04,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 03:46:04,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 03:46:04,709 INFO L87 Difference]: Start difference. First operand 955 states and 1615 transitions. Second operand 4 states. [2019-11-28 03:46:04,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:46:04,842 INFO L93 Difference]: Finished difference Result 977 states and 1626 transitions. [2019-11-28 03:46:04,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 03:46:04,843 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 977 states and 1626 transitions. [2019-11-28 03:46:04,850 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 547 [2019-11-28 03:46:04,858 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 977 states to 977 states and 1626 transitions. [2019-11-28 03:46:04,858 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 626 [2019-11-28 03:46:04,859 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 626 [2019-11-28 03:46:04,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 977 states and 1626 transitions. [2019-11-28 03:46:04,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:46:04,860 INFO L688 BuchiCegarLoop]: Abstraction has 977 states and 1626 transitions. [2019-11-28 03:46:04,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states and 1626 transitions. [2019-11-28 03:46:04,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 894. [2019-11-28 03:46:04,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 894 states. [2019-11-28 03:46:04,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1493 transitions. [2019-11-28 03:46:04,879 INFO L711 BuchiCegarLoop]: Abstraction has 894 states and 1493 transitions. [2019-11-28 03:46:04,879 INFO L591 BuchiCegarLoop]: Abstraction has 894 states and 1493 transitions. [2019-11-28 03:46:04,879 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-28 03:46:04,880 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 894 states and 1493 transitions. [2019-11-28 03:46:04,884 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 547 [2019-11-28 03:46:04,885 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:46:04,885 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:46:04,887 INFO L849 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] [2019-11-28 03:46:04,887 INFO L850 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] [2019-11-28 03:46:04,888 INFO L794 eck$LassoCheckResult]: Stem: 10007#ULTIMATE.startENTRY ~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; 9831#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; 9788#L398 assume !(1 == ~c_req_up~0); 9790#L398-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 9801#L409-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 9802#L414-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 9954#L419-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 9955#L424-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 9995#L429-1 assume !(0 == ~e_f~0); 10039#L434-1 assume !(0 == ~e_g~0); 10040#L439-1 assume !(0 == ~e_e~0); 9946#L444-1 assume !(0 == ~e_c~0); 9947#L449-1 assume !(0 == ~e_wl~0); 10014#L454-1 assume !(1 == ~wl_pc~0); 10015#L466 assume !(2 == ~wl_pc~0); 10038#L467 assume !(1 == ~c1_pc~0); 10037#L477 assume !(1 == ~c2_pc~0); 9850#L486 assume !(1 == ~wb_pc~0); 9851#L495 assume !(1 == ~e_c~0); 10032#L504-1 assume !(1 == ~e_e~0); 10012#L509-1 assume !(1 == ~e_f~0); 10013#L514-1 assume 1 == ~e_g~0;~e_g~0 := 2; 10035#L519-1 assume !(1 == ~e_c~0); 9928#L524-1 assume !(1 == ~e_wl~0); 9929#L666-1 assume !false; 10456#L536 [2019-11-28 03:46:04,888 INFO L796 eck$LassoCheckResult]: Loop: 10456#L536 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, 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; 10532#L371 assume !false; 10531#L289 assume !(0 == ~wl_st~0); 10530#L293 assume !(0 == ~c1_st~0); 10529#L296 assume !(0 == ~c2_st~0); 10528#L299 assume !(0 == ~wb_st~0); 10527#L302 assume !(0 == ~r_st~0); 10526#L387 start_simulation_~kernel_st~0 := 2; 10441#L542 assume !(1 == ~c_req_up~0); 9940#L542-2 start_simulation_~kernel_st~0 := 3; 9963#L554 assume !(0 == ~e_f~0); 9932#L554-2 assume !(0 == ~e_g~0); 9933#L559-1 assume !(0 == ~e_e~0); 9981#L564-1 assume !(0 == ~e_c~0); 10008#L569-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 9844#L574-1 assume 1 == ~wl_pc~0; 9845#L580 assume 1 == ~e_wl~0;~wl_st~0 := 0; 9810#L587 assume !(1 == ~c1_pc~0); 9960#L597 assume !(1 == ~c2_pc~0); 9889#L606 assume !(1 == ~wb_pc~0); 9896#L615 assume !(1 == ~e_c~0); 9897#L624-1 assume 1 == ~e_e~0;~e_e~0 := 2; 10041#L629-1 assume !(1 == ~e_f~0); 10499#L634-1 assume !(1 == ~e_g~0); 9918#L639-1 assume !(1 == ~e_c~0); 10542#L644-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 10539#L649-1 assume 0 == ~wl_st~0; 10535#L666-1 assume !false; 10456#L536 [2019-11-28 03:46:04,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:04,888 INFO L82 PathProgramCache]: Analyzing trace with hash -666236546, now seen corresponding path program 1 times [2019-11-28 03:46:04,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:46:04,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991959169] [2019-11-28 03:46:04,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:46:04,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:46:04,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:46:04,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991959169] [2019-11-28 03:46:04,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:46:04,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 03:46:04,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152773209] [2019-11-28 03:46:04,930 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:46:04,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:04,930 INFO L82 PathProgramCache]: Analyzing trace with hash -311766517, now seen corresponding path program 1 times [2019-11-28 03:46:04,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:46:04,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730865882] [2019-11-28 03:46:04,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:46:04,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:46:04,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:46:04,946 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:46:05,064 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2019-11-28 03:46:05,110 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:46:05,110 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:46:05,110 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:46:05,110 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:46:05,110 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 03:46:05,111 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:46:05,111 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:46:05,111 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:46:05,111 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration9_Loop [2019-11-28 03:46:05,111 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:46:05,111 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:46:05,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:05,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:05,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:05,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:05,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:05,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:05,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:05,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:05,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:05,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:05,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:05,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:05,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:05,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:05,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:05,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:05,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:05,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:05,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:05,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:05,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:05,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:05,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:05,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:05,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:05,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:05,473 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:46:05,473 INFO L404 LassoAnalysis]: Checking for nontermination... 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) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:46:05,482 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:46:05,482 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 03:46:05,485 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:46:05,485 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 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:46:05,492 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:46:05,492 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 03:46:05,495 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:46:05,496 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~r_st~0=7} Honda state: {~r_st~0=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:46:05,502 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:46:05,502 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 03:46:05,507 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:46:05,507 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp~0=0} Honda state: {ULTIMATE.start_eval_~tmp~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:46:05,521 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:46:05,521 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:46:05,524 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:46:05,525 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___2~0=0} Honda state: {ULTIMATE.start_eval_~tmp___2~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:46:05,530 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:46:05,530 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:46:05,537 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:46:05,537 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:46:05,544 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:46:05,544 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:46:05,549 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:46:05,549 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c1_st~0=-5} Honda state: {~c1_st~0=-5} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:46:05,556 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:46:05,556 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:46:05,561 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:46:05,561 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~e_g~0=-1} Honda state: {~e_g~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:46:05,568 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:46:05,569 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:46:05,572 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:46:05,572 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet1=0} Honda state: {ULTIMATE.start_eval_#t~nondet1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:46:05,579 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:46:05,580 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:46:05,590 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:46:05,590 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~wb_st~0=7} Honda state: {~wb_st~0=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:46:05,603 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:46:05,603 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 29 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:46:05,617 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 03:46:05,618 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:46:05,633 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 03:46:05,635 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:46:05,635 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:46:05,635 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:46:05,635 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:46:05,636 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:46:05,636 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:46:05,636 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:46:05,636 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:46:05,636 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration9_Loop [2019-11-28 03:46:05,636 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:46:05,636 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:46:05,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:05,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:05,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:05,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:05,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:05,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:05,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:05,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:05,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:05,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:05,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:05,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:05,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:05,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:05,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:05,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:05,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:05,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:05,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:05,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:05,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:05,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:05,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:05,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:05,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:05,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:46:05,963 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:46:05,966 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:46:05,980 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 [2019-11-28 03:46:05,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:46:05,983 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:46:05,983 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:46:05,983 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:46:05,983 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:46:05,984 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:46:05,984 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:46:05,989 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:46:05,999 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 [2019-11-28 03:46:06,001 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:46:06,002 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:46:06,002 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:46:06,002 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 03:46:06,002 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:46:06,003 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-28 03:46:06,003 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:46:06,006 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:46:06,017 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 [2019-11-28 03:46:06,019 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:46:06,019 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:46:06,019 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:46:06,019 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:46:06,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:46:06,020 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:46:06,020 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:46:06,022 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:46:06,030 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 [2019-11-28 03:46:06,032 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:46:06,032 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:46:06,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:46:06,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:46:06,033 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:46:06,033 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:46:06,034 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:46:06,037 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:46:06,044 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 [2019-11-28 03:46:06,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:46:06,047 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:46:06,047 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:46:06,047 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 03:46:06,048 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:46:06,049 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-28 03:46:06,049 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:46:06,052 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:46:06,059 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 [2019-11-28 03:46:06,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:46:06,061 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:46:06,061 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:46:06,061 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 03:46:06,062 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:46:06,063 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-28 03:46:06,063 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:46:06,066 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:46:06,074 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 [2019-11-28 03:46:06,076 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:46:06,076 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:46:06,076 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:46:06,076 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 03:46:06,076 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:46:06,077 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-28 03:46:06,077 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:46:06,080 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:46:06,088 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 [2019-11-28 03:46:06,090 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:46:06,090 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:46:06,090 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:46:06,090 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 03:46:06,090 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:46:06,091 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-28 03:46:06,091 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:46:06,094 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:46:06,101 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 [2019-11-28 03:46:06,103 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:46:06,103 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:46:06,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:46:06,103 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 03:46:06,104 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:46:06,105 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-28 03:46:06,105 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:46:06,110 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:46:06,120 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 [2019-11-28 03:46:06,122 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:46:06,122 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:46:06,122 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:46:06,123 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 03:46:06,123 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:46:06,124 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-28 03:46:06,124 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:46:06,134 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 Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 Starting monitored process 41 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:46:06,142 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 [2019-11-28 03:46:06,143 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:46:06,144 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:46:06,144 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:46:06,144 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:46:06,144 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:46:06,145 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:46:06,145 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:46:06,148 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:46:06,150 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 03:46:06,150 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 42 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:46:06,155 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:46:06,155 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 03:46:06,155 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:46:06,155 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_e~0) = -2*~e_e~0 + 3 Supporting invariants [] [2019-11-28 03:46:06,157 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 03:46:06,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:06,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:46:06,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:46:06,193 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:46:06,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:46:06,215 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:46:06,217 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:46:06,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:46:06,236 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 03:46:06,237 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 894 states and 1493 transitions. cyclomatic complexity: 608 Second operand 4 states. [2019-11-28 03:46:06,278 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 894 states and 1493 transitions. cyclomatic complexity: 608. Second operand 4 states. Result 2509 states and 4176 transitions. Complement of second has 5 states. [2019-11-28 03:46:06,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 03:46:06,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 03:46:06,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 199 transitions. [2019-11-28 03:46:06,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 199 transitions. Stem has 25 letters. Loop has 28 letters. [2019-11-28 03:46:06,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:46:06,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 199 transitions. Stem has 53 letters. Loop has 28 letters. [2019-11-28 03:46:06,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:46:06,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 199 transitions. Stem has 25 letters. Loop has 56 letters. [2019-11-28 03:46:06,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:46:06,283 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2509 states and 4176 transitions. [2019-11-28 03:46:06,303 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 1064 [2019-11-28 03:46:06,323 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2509 states to 2509 states and 4176 transitions. [2019-11-28 03:46:06,323 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1144 [2019-11-28 03:46:06,325 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1165 [2019-11-28 03:46:06,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2509 states and 4176 transitions. [2019-11-28 03:46:06,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:46:06,326 INFO L688 BuchiCegarLoop]: Abstraction has 2509 states and 4176 transitions. [2019-11-28 03:46:06,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2509 states and 4176 transitions. [2019-11-28 03:46:06,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2509 to 2488. [2019-11-28 03:46:06,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2488 states. [2019-11-28 03:46:06,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2488 states to 2488 states and 4141 transitions. [2019-11-28 03:46:06,379 INFO L711 BuchiCegarLoop]: Abstraction has 2488 states and 4141 transitions. [2019-11-28 03:46:06,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:46:06,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 03:46:06,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 03:46:06,380 INFO L87 Difference]: Start difference. First operand 2488 states and 4141 transitions. Second operand 4 states. [2019-11-28 03:46:06,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:46:06,485 INFO L93 Difference]: Finished difference Result 3187 states and 5219 transitions. [2019-11-28 03:46:06,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 03:46:06,486 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3187 states and 5219 transitions. [2019-11-28 03:46:06,510 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 1227 [2019-11-28 03:46:06,535 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3187 states to 3187 states and 5219 transitions. [2019-11-28 03:46:06,535 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1291 [2019-11-28 03:46:06,537 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1291 [2019-11-28 03:46:06,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3187 states and 5219 transitions. [2019-11-28 03:46:06,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:46:06,538 INFO L688 BuchiCegarLoop]: Abstraction has 3187 states and 5219 transitions. [2019-11-28 03:46:06,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3187 states and 5219 transitions. [2019-11-28 03:46:06,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3187 to 3187. [2019-11-28 03:46:06,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3187 states. [2019-11-28 03:46:06,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3187 states to 3187 states and 5219 transitions. [2019-11-28 03:46:06,627 INFO L711 BuchiCegarLoop]: Abstraction has 3187 states and 5219 transitions. [2019-11-28 03:46:06,627 INFO L591 BuchiCegarLoop]: Abstraction has 3187 states and 5219 transitions. [2019-11-28 03:46:06,627 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-28 03:46:06,627 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3187 states and 5219 transitions. [2019-11-28 03:46:06,650 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 1227 [2019-11-28 03:46:06,651 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:46:06,651 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:46:06,655 INFO L849 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] [2019-11-28 03:46:06,655 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:46:06,656 INFO L794 eck$LassoCheckResult]: Stem: 19290#ULTIMATE.startENTRY ~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; 19102#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; 19055#L398 assume !(1 == ~c_req_up~0); 19057#L398-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 19062#L409-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 19063#L414-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 19222#L419-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 19223#L424-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 19271#L429-1 assume !(0 == ~e_f~0); 19344#L434-1 assume !(0 == ~e_g~0); 19147#L439-1 assume !(0 == ~e_e~0); 19148#L444-1 assume !(0 == ~e_c~0); 19343#L449-1 assume !(0 == ~e_wl~0); 19298#L454-1 assume !(1 == ~wl_pc~0); 19207#L466 assume !(2 == ~wl_pc~0); 19208#L467 assume !(1 == ~c1_pc~0); 19324#L477 assume !(1 == ~c2_pc~0); 19336#L486 assume !(1 == ~wb_pc~0); 19317#L495 assume !(1 == ~e_c~0); 19262#L504-1 assume !(1 == ~e_e~0); 19263#L509-1 assume !(1 == ~e_f~0); 19322#L514-1 assume !(1 == ~e_g~0); 19120#L519-1 assume !(1 == ~e_c~0); 19121#L524-1 assume !(1 == ~e_wl~0); 19425#L666-1 assume !false; 19426#L536 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, 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; 20838#L371 [2019-11-28 03:46:06,656 INFO L796 eck$LassoCheckResult]: Loop: 20838#L371 assume !false; 21690#L289 assume 0 == ~wl_st~0; 21685#L302-1 assume !(0 == ~wl_st~0); 21679#L311 assume !(0 == ~c1_st~0); 21676#L326 assume !(0 == ~c2_st~0); 21667#L341 assume !(0 == ~wb_st~0); 21664#L356 assume !(0 == ~r_st~0); 20838#L371 [2019-11-28 03:46:06,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:06,656 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 1 times [2019-11-28 03:46:06,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:46:06,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578527404] [2019-11-28 03:46:06,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:46:06,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:46:06,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:46:06,699 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:46:06,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:06,700 INFO L82 PathProgramCache]: Analyzing trace with hash 117964263, now seen corresponding path program 1 times [2019-11-28 03:46:06,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:46:06,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747733591] [2019-11-28 03:46:06,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:46:06,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:46:06,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:46:06,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747733591] [2019-11-28 03:46:06,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:46:06,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:46:06,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584739462] [2019-11-28 03:46:06,728 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:46:06,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:46:06,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 03:46:06,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 03:46:06,728 INFO L87 Difference]: Start difference. First operand 3187 states and 5219 transitions. cyclomatic complexity: 2068 Second operand 3 states. [2019-11-28 03:46:06,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:46:06,793 INFO L93 Difference]: Finished difference Result 4973 states and 7999 transitions. [2019-11-28 03:46:06,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 03:46:06,794 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4973 states and 7999 transitions. [2019-11-28 03:46:06,830 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 1926 [2019-11-28 03:46:06,866 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4973 states to 4973 states and 7999 transitions. [2019-11-28 03:46:06,866 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1992 [2019-11-28 03:46:06,869 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1992 [2019-11-28 03:46:06,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4973 states and 7999 transitions. [2019-11-28 03:46:06,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:46:06,869 INFO L688 BuchiCegarLoop]: Abstraction has 4973 states and 7999 transitions. [2019-11-28 03:46:06,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4973 states and 7999 transitions. [2019-11-28 03:46:06,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4973 to 4973. [2019-11-28 03:46:06,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4973 states. [2019-11-28 03:46:06,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4973 states to 4973 states and 7999 transitions. [2019-11-28 03:46:06,979 INFO L711 BuchiCegarLoop]: Abstraction has 4973 states and 7999 transitions. [2019-11-28 03:46:06,979 INFO L591 BuchiCegarLoop]: Abstraction has 4973 states and 7999 transitions. [2019-11-28 03:46:06,979 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-28 03:46:06,979 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4973 states and 7999 transitions. [2019-11-28 03:46:06,998 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 1926 [2019-11-28 03:46:06,998 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:46:06,998 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:46:06,999 INFO L849 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] [2019-11-28 03:46:06,999 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:46:06,999 INFO L794 eck$LassoCheckResult]: Stem: 27454#ULTIMATE.startENTRY ~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; 27270#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; 27221#L398 assume !(1 == ~c_req_up~0); 27223#L398-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 27228#L409-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 27229#L414-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 27385#L419-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 27386#L424-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 27435#L429-1 assume !(0 == ~e_f~0); 27509#L434-1 assume !(0 == ~e_g~0); 27311#L439-1 assume !(0 == ~e_e~0); 27312#L444-1 assume !(0 == ~e_c~0); 27508#L449-1 assume !(0 == ~e_wl~0); 27461#L454-1 assume !(1 == ~wl_pc~0); 27373#L466 assume !(2 == ~wl_pc~0); 27374#L467 assume !(1 == ~c1_pc~0); 27488#L477 assume !(1 == ~c2_pc~0); 27501#L486 assume !(1 == ~wb_pc~0); 27483#L495 assume !(1 == ~e_c~0); 27426#L504-1 assume !(1 == ~e_e~0); 27427#L509-1 assume !(1 == ~e_f~0); 27486#L514-1 assume !(1 == ~e_g~0); 27286#L519-1 assume !(1 == ~e_c~0); 27287#L524-1 assume !(1 == ~e_wl~0); 27360#L666-1 assume !false; 28735#L536 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, 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; 30068#L371 [2019-11-28 03:46:07,000 INFO L796 eck$LassoCheckResult]: Loop: 30068#L371 assume !false; 31131#L289 assume 0 == ~wl_st~0; 31003#L302-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 31120#L315 assume !(0 != eval_~tmp~0); 31129#L311 assume !(0 == ~c1_st~0); 31161#L326 assume !(0 == ~c2_st~0); 31147#L341 assume !(0 == ~wb_st~0); 31140#L356 assume !(0 == ~r_st~0); 30068#L371 [2019-11-28 03:46:07,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:07,000 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 2 times [2019-11-28 03:46:07,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:46:07,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667184487] [2019-11-28 03:46:07,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:46:07,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:46:07,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:46:07,018 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:46:07,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:07,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1280783410, now seen corresponding path program 1 times [2019-11-28 03:46:07,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:46:07,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680491547] [2019-11-28 03:46:07,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:46:07,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:46:07,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:46:07,026 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:46:07,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:07,026 INFO L82 PathProgramCache]: Analyzing trace with hash 361828906, now seen corresponding path program 1 times [2019-11-28 03:46:07,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:46:07,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092022531] [2019-11-28 03:46:07,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:46:07,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:46:07,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:46:07,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092022531] [2019-11-28 03:46:07,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:46:07,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:46:07,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190417007] [2019-11-28 03:46:07,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:46:07,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 03:46:07,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 03:46:07,113 INFO L87 Difference]: Start difference. First operand 4973 states and 7999 transitions. cyclomatic complexity: 3062 Second operand 3 states. [2019-11-28 03:46:07,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:46:07,165 INFO L93 Difference]: Finished difference Result 7644 states and 12212 transitions. [2019-11-28 03:46:07,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 03:46:07,165 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7644 states and 12212 transitions. [2019-11-28 03:46:07,207 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 2986 [2019-11-28 03:46:07,253 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7644 states to 7644 states and 12212 transitions. [2019-11-28 03:46:07,253 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3054 [2019-11-28 03:46:07,257 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3054 [2019-11-28 03:46:07,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7644 states and 12212 transitions. [2019-11-28 03:46:07,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:46:07,263 INFO L688 BuchiCegarLoop]: Abstraction has 7644 states and 12212 transitions. [2019-11-28 03:46:07,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7644 states and 12212 transitions. [2019-11-28 03:46:07,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7644 to 7644. [2019-11-28 03:46:07,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7644 states. [2019-11-28 03:46:07,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7644 states to 7644 states and 12212 transitions. [2019-11-28 03:46:07,388 INFO L711 BuchiCegarLoop]: Abstraction has 7644 states and 12212 transitions. [2019-11-28 03:46:07,388 INFO L591 BuchiCegarLoop]: Abstraction has 7644 states and 12212 transitions. [2019-11-28 03:46:07,388 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-28 03:46:07,388 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7644 states and 12212 transitions. [2019-11-28 03:46:07,413 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 2986 [2019-11-28 03:46:07,414 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:46:07,414 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:46:07,414 INFO L849 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] [2019-11-28 03:46:07,415 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:46:07,415 INFO L794 eck$LassoCheckResult]: Stem: 40073#ULTIMATE.startENTRY ~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; 39895#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; 39846#L398 assume !(1 == ~c_req_up~0); 39848#L398-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 39853#L409-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 39854#L414-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 40014#L419-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 40015#L424-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 40056#L429-1 assume !(0 == ~e_f~0); 40131#L434-1 assume !(0 == ~e_g~0); 39938#L439-1 assume !(0 == ~e_e~0); 39939#L444-1 assume !(0 == ~e_c~0); 40130#L449-1 assume !(0 == ~e_wl~0); 40080#L454-1 assume !(1 == ~wl_pc~0); 40001#L466 assume !(2 == ~wl_pc~0); 40002#L467 assume !(1 == ~c1_pc~0); 40108#L477 assume !(1 == ~c2_pc~0); 40123#L486 assume !(1 == ~wb_pc~0); 40101#L495 assume !(1 == ~e_c~0); 40045#L504-1 assume !(1 == ~e_e~0); 40046#L509-1 assume !(1 == ~e_f~0); 40105#L514-1 assume !(1 == ~e_g~0); 39912#L519-1 assume !(1 == ~e_c~0); 39913#L524-1 assume !(1 == ~e_wl~0); 39988#L666-1 assume !false; 42263#L536 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, 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; 45127#L371 [2019-11-28 03:46:07,415 INFO L796 eck$LassoCheckResult]: Loop: 45127#L371 assume !false; 47432#L289 assume 0 == ~wl_st~0; 40114#L302-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 39963#L315 assume !(0 != eval_~tmp~0); 39964#L311 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 45144#L330 assume !(0 != eval_~tmp___0~0); 45143#L326 assume !(0 == ~c2_st~0); 45131#L341 assume !(0 == ~wb_st~0); 45128#L356 assume !(0 == ~r_st~0); 45127#L371 [2019-11-28 03:46:07,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:07,416 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 3 times [2019-11-28 03:46:07,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:46:07,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808981409] [2019-11-28 03:46:07,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:46:07,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:46:07,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:46:07,431 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:46:07,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:07,432 INFO L82 PathProgramCache]: Analyzing trace with hash 998807808, now seen corresponding path program 1 times [2019-11-28 03:46:07,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:46:07,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181248083] [2019-11-28 03:46:07,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:46:07,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:46:07,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:46:07,439 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:46:07,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:07,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1718978040, now seen corresponding path program 1 times [2019-11-28 03:46:07,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:46:07,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764200518] [2019-11-28 03:46:07,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:46:07,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:46:07,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:46:07,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764200518] [2019-11-28 03:46:07,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:46:07,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:46:07,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352023316] [2019-11-28 03:46:07,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:46:07,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 03:46:07,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 03:46:07,514 INFO L87 Difference]: Start difference. First operand 7644 states and 12212 transitions. cyclomatic complexity: 4604 Second operand 3 states. [2019-11-28 03:46:07,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:46:07,593 INFO L93 Difference]: Finished difference Result 12085 states and 19155 transitions. [2019-11-28 03:46:07,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 03:46:07,594 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12085 states and 19155 transitions. [2019-11-28 03:46:07,666 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 4738 [2019-11-28 03:46:07,723 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12085 states to 12085 states and 19155 transitions. [2019-11-28 03:46:07,723 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4860 [2019-11-28 03:46:07,732 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4860 [2019-11-28 03:46:07,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12085 states and 19155 transitions. [2019-11-28 03:46:07,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:46:07,740 INFO L688 BuchiCegarLoop]: Abstraction has 12085 states and 19155 transitions. [2019-11-28 03:46:07,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12085 states and 19155 transitions. [2019-11-28 03:46:07,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12085 to 12085. [2019-11-28 03:46:07,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12085 states. [2019-11-28 03:46:07,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12085 states to 12085 states and 19155 transitions. [2019-11-28 03:46:07,921 INFO L711 BuchiCegarLoop]: Abstraction has 12085 states and 19155 transitions. [2019-11-28 03:46:07,921 INFO L591 BuchiCegarLoop]: Abstraction has 12085 states and 19155 transitions. [2019-11-28 03:46:07,921 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-28 03:46:07,921 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12085 states and 19155 transitions. [2019-11-28 03:46:07,960 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 4738 [2019-11-28 03:46:07,961 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:46:07,961 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:46:07,961 INFO L849 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] [2019-11-28 03:46:07,962 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:46:07,963 INFO L794 eck$LassoCheckResult]: Stem: 59828#ULTIMATE.startENTRY ~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; 59630#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; 59583#L398 assume !(1 == ~c_req_up~0); 59585#L398-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 59590#L409-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 59591#L414-1 assume !(1 == ~c2_i~0);~c2_st~0 := 2; 59916#L419-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 59805#L424-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 59806#L429-1 assume !(0 == ~e_f~0); 59911#L434-1 assume !(0 == ~e_g~0); 59912#L439-1 assume !(0 == ~e_e~0); 59908#L444-1 assume !(0 == ~e_c~0); 59909#L449-1 assume !(0 == ~e_wl~0); 59835#L454-1 assume !(1 == ~wl_pc~0); 59836#L466 assume !(2 == ~wl_pc~0); 59873#L467 assume !(1 == ~c1_pc~0); 59872#L477 assume !(1 == ~c2_pc~0); 59894#L486 assume !(1 == ~wb_pc~0); 59893#L495 assume !(1 == ~e_c~0); 59797#L504-1 assume !(1 == ~e_e~0); 59798#L509-1 assume !(1 == ~e_f~0); 59868#L514-1 assume !(1 == ~e_g~0); 59869#L519-1 assume !(1 == ~e_c~0); 63968#L524-1 assume !(1 == ~e_wl~0); 63963#L666-1 assume !false; 63964#L536 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, 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; 67491#L371 [2019-11-28 03:46:07,963 INFO L796 eck$LassoCheckResult]: Loop: 67491#L371 assume !false; 67695#L289 assume 0 == ~wl_st~0; 67682#L302-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 67675#L315 assume !(0 != eval_~tmp~0); 67689#L311 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 67708#L330 assume !(0 != eval_~tmp___0~0); 67706#L326 assume !(0 == ~c2_st~0); 67703#L341 assume !(0 == ~wb_st~0); 67700#L356 assume !(0 == ~r_st~0); 67491#L371 [2019-11-28 03:46:07,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:07,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1246052603, now seen corresponding path program 1 times [2019-11-28 03:46:07,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:46:07,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151333616] [2019-11-28 03:46:07,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:46:07,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:46:07,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:46:07,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151333616] [2019-11-28 03:46:07,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:46:07,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:46:07,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208378582] [2019-11-28 03:46:07,982 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:46:07,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:07,982 INFO L82 PathProgramCache]: Analyzing trace with hash 998807808, now seen corresponding path program 2 times [2019-11-28 03:46:07,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:46:07,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881456104] [2019-11-28 03:46:07,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:46:07,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:46:07,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:46:07,989 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:46:08,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:46:08,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 03:46:08,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 03:46:08,025 INFO L87 Difference]: Start difference. First operand 12085 states and 19155 transitions. cyclomatic complexity: 7106 Second operand 3 states. [2019-11-28 03:46:08,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:46:08,062 INFO L93 Difference]: Finished difference Result 12033 states and 19068 transitions. [2019-11-28 03:46:08,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 03:46:08,063 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12033 states and 19068 transitions. [2019-11-28 03:46:08,113 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 4738 [2019-11-28 03:46:08,161 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12033 states to 12033 states and 19068 transitions. [2019-11-28 03:46:08,162 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4810 [2019-11-28 03:46:08,169 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4810 [2019-11-28 03:46:08,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12033 states and 19068 transitions. [2019-11-28 03:46:08,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:46:08,170 INFO L688 BuchiCegarLoop]: Abstraction has 12033 states and 19068 transitions. [2019-11-28 03:46:08,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12033 states and 19068 transitions. [2019-11-28 03:46:08,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12033 to 12033. [2019-11-28 03:46:08,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12033 states. [2019-11-28 03:46:08,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12033 states to 12033 states and 19068 transitions. [2019-11-28 03:46:08,342 INFO L711 BuchiCegarLoop]: Abstraction has 12033 states and 19068 transitions. [2019-11-28 03:46:08,342 INFO L591 BuchiCegarLoop]: Abstraction has 12033 states and 19068 transitions. [2019-11-28 03:46:08,342 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-11-28 03:46:08,342 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12033 states and 19068 transitions. [2019-11-28 03:46:08,381 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 4738 [2019-11-28 03:46:08,381 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:46:08,382 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:46:08,382 INFO L849 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] [2019-11-28 03:46:08,382 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:46:08,383 INFO L794 eck$LassoCheckResult]: Stem: 83946#ULTIMATE.startENTRY ~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; 83750#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; 83707#L398 assume !(1 == ~c_req_up~0); 83709#L398-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 83714#L409-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 83715#L414-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 83877#L419-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 83878#L424-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 83924#L429-1 assume !(0 == ~e_f~0); 84009#L434-1 assume !(0 == ~e_g~0); 83802#L439-1 assume !(0 == ~e_e~0); 83803#L444-1 assume !(0 == ~e_c~0); 84008#L449-1 assume !(0 == ~e_wl~0); 83954#L454-1 assume !(1 == ~wl_pc~0); 83864#L466 assume !(2 == ~wl_pc~0); 83865#L467 assume !(1 == ~c1_pc~0); 83984#L477 assume !(1 == ~c2_pc~0); 84001#L486 assume !(1 == ~wb_pc~0); 83978#L495 assume !(1 == ~e_c~0); 83915#L504-1 assume !(1 == ~e_e~0); 83916#L509-1 assume !(1 == ~e_f~0); 83982#L514-1 assume !(1 == ~e_g~0); 83775#L519-1 assume !(1 == ~e_c~0); 83776#L524-1 assume !(1 == ~e_wl~0); 83851#L666-1 assume !false; 86384#L536 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, 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; 91989#L371 [2019-11-28 03:46:08,383 INFO L796 eck$LassoCheckResult]: Loop: 91989#L371 assume !false; 91753#L289 assume 0 == ~wl_st~0; 91748#L302-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 91686#L315 assume !(0 != eval_~tmp~0); 91590#L311 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 91588#L330 assume !(0 != eval_~tmp___0~0); 91586#L326 assume 0 == ~c2_st~0;eval_~tmp___1~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 91571#L345 assume !(0 != eval_~tmp___1~0); 91581#L341 assume !(0 == ~wb_st~0); 91992#L356 assume !(0 == ~r_st~0); 91989#L371 [2019-11-28 03:46:08,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:08,384 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 4 times [2019-11-28 03:46:08,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:46:08,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346496019] [2019-11-28 03:46:08,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:46:08,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:46:08,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:46:08,402 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:46:08,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:08,403 INFO L82 PathProgramCache]: Analyzing trace with hash 896651005, now seen corresponding path program 1 times [2019-11-28 03:46:08,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:46:08,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271057409] [2019-11-28 03:46:08,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:46:08,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:46:08,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:46:08,410 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:46:08,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:08,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1750331659, now seen corresponding path program 1 times [2019-11-28 03:46:08,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:46:08,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955323434] [2019-11-28 03:46:08,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:46:08,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:46:08,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:46:08,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955323434] [2019-11-28 03:46:08,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:46:08,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:46:08,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601180265] [2019-11-28 03:46:08,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:46:08,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 03:46:08,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 03:46:08,477 INFO L87 Difference]: Start difference. First operand 12033 states and 19068 transitions. cyclomatic complexity: 7071 Second operand 3 states. [2019-11-28 03:46:08,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:46:08,548 INFO L93 Difference]: Finished difference Result 18669 states and 29460 transitions. [2019-11-28 03:46:08,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 03:46:08,549 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18669 states and 29460 transitions. [2019-11-28 03:46:08,630 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 7424 [2019-11-28 03:46:08,706 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18669 states to 18669 states and 29460 transitions. [2019-11-28 03:46:08,706 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7496 [2019-11-28 03:46:08,714 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7496 [2019-11-28 03:46:08,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18669 states and 29460 transitions. [2019-11-28 03:46:08,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:46:08,733 INFO L688 BuchiCegarLoop]: Abstraction has 18669 states and 29460 transitions. [2019-11-28 03:46:08,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18669 states and 29460 transitions. [2019-11-28 03:46:09,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18669 to 18549. [2019-11-28 03:46:09,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18549 states. [2019-11-28 03:46:09,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18549 states to 18549 states and 29340 transitions. [2019-11-28 03:46:09,118 INFO L711 BuchiCegarLoop]: Abstraction has 18549 states and 29340 transitions. [2019-11-28 03:46:09,118 INFO L591 BuchiCegarLoop]: Abstraction has 18549 states and 29340 transitions. [2019-11-28 03:46:09,118 INFO L424 BuchiCegarLoop]: ======== Iteration 15============ [2019-11-28 03:46:09,118 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18549 states and 29340 transitions. [2019-11-28 03:46:09,172 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 7376 [2019-11-28 03:46:09,172 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:46:09,172 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:46:09,173 INFO L849 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] [2019-11-28 03:46:09,173 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:46:09,173 INFO L794 eck$LassoCheckResult]: Stem: 114662#ULTIMATE.startENTRY ~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; 114464#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; 114417#L398 assume !(1 == ~c_req_up~0); 114419#L398-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 114424#L409-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 114425#L414-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 114584#L419-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 114585#L424-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 114635#L429-1 assume !(0 == ~e_f~0); 114737#L434-1 assume !(0 == ~e_g~0); 114508#L439-1 assume !(0 == ~e_e~0); 114509#L444-1 assume !(0 == ~e_c~0); 114736#L449-1 assume !(0 == ~e_wl~0); 114671#L454-1 assume !(1 == ~wl_pc~0); 114571#L466 assume !(2 == ~wl_pc~0); 114572#L467 assume !(1 == ~c1_pc~0); 114710#L477 assume !(1 == ~c2_pc~0); 114729#L486 assume !(1 == ~wb_pc~0); 114703#L495 assume !(1 == ~e_c~0); 114627#L504-1 assume !(1 == ~e_e~0); 114628#L509-1 assume !(1 == ~e_f~0); 114706#L514-1 assume !(1 == ~e_g~0); 114482#L519-1 assume !(1 == ~e_c~0); 114483#L524-1 assume !(1 == ~e_wl~0); 114558#L666-1 assume !false; 120203#L536 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, 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; 127280#L371 [2019-11-28 03:46:09,174 INFO L796 eck$LassoCheckResult]: Loop: 127280#L371 assume !false; 126072#L289 assume 0 == ~wl_st~0; 126071#L302-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 126063#L315 assume !(0 != eval_~tmp~0); 126070#L311 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 126221#L330 assume !(0 != eval_~tmp___0~0); 126219#L326 assume 0 == ~c2_st~0;eval_~tmp___1~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 126206#L345 assume !(0 != eval_~tmp___1~0); 126215#L341 assume 0 == ~wb_st~0;eval_~tmp___2~0 := eval_#t~nondet3;havoc eval_#t~nondet3; 127228#L360 assume !(0 != eval_~tmp___2~0); 127238#L356 assume !(0 == ~r_st~0); 127280#L371 [2019-11-28 03:46:09,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:09,174 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 5 times [2019-11-28 03:46:09,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:46:09,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525238922] [2019-11-28 03:46:09,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:46:09,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:46:09,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:46:09,188 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:46:09,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:09,188 INFO L82 PathProgramCache]: Analyzing trace with hash 2026342965, now seen corresponding path program 1 times [2019-11-28 03:46:09,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:46:09,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268369840] [2019-11-28 03:46:09,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:46:09,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:46:09,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:46:09,194 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:46:09,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:46:09,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1574259005, now seen corresponding path program 1 times [2019-11-28 03:46:09,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:46:09,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146659915] [2019-11-28 03:46:09,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:46:09,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:46:09,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:46:09,211 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:46:09,706 WARN L192 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 110 [2019-11-28 03:46:09,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 03:46:09 BoogieIcfgContainer [2019-11-28 03:46:09,820 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 03:46:09,821 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 03:46:09,821 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 03:46:09,821 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 03:46:09,822 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:45:59" (3/4) ... [2019-11-28 03:46:09,826 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-28 03:46:09,892 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 03:46:09,892 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 03:46:09,894 INFO L168 Benchmark]: Toolchain (without parser) took 11525.43 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 410.0 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -167.8 MB). Peak memory consumption was 242.2 MB. Max. memory is 11.5 GB. [2019-11-28 03:46:09,894 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:46:09,895 INFO L168 Benchmark]: CACSL2BoogieTranslator took 508.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -170.4 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2019-11-28 03:46:09,895 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.11 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:46:09,896 INFO L168 Benchmark]: Boogie Preprocessor took 34.94 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. [2019-11-28 03:46:09,896 INFO L168 Benchmark]: RCFGBuilder took 714.49 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: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 11.5 GB. [2019-11-28 03:46:09,897 INFO L168 Benchmark]: BuchiAutomizer took 10140.72 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 274.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -48.2 MB). Peak memory consumption was 226.0 MB. Max. memory is 11.5 GB. [2019-11-28 03:46:09,897 INFO L168 Benchmark]: Witness Printer took 71.42 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:46:09,899 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 508.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -170.4 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.11 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.94 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 714.49 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: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10140.72 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 274.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -48.2 MB). Peak memory consumption was 226.0 MB. Max. memory is 11.5 GB. * Witness Printer took 71.42 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. 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 17 terminating modules (14 trivial, 3 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 -1 * e_c + 1 and consists of 3 locations. One deterministic module has affine ranking function -2 * e_e + 3 and consists of 3 locations. 14 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 18549 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.0s and 15 iterations. TraceHistogramMax:1. Analysis of lassos took 5.9s. Construction of modules took 0.4s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 12. Automata minimization 1.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 1274 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.7s Buchi closure took 0.0s. Biggest automaton had 18549 states and ocurred in iteration 14. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 4151 SDtfs, 4004 SDslu, 2207 SDs, 0 SdLazy, 345 SolverSat, 113 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc3 concLT0 SILN1 SILU0 SILI5 SILT3 lasso0 LassoPreprocessingBenchmarks: Lassos: inital81 mio100 ax100 hnf100 lsp11 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq182 hnf98 smp100 dnf190 smp75 tf108 neg92 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 21ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 14 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 288]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {p_out=0, wb_st=0, processed=0, \result=0, c2_st=0, wl_pc=0, e_wl=2, tmp=0, e_c=2, e_e=2, kernel_st=1, e_p_in=0, tmp___1=0, t_b=0, tmp___2=0, p_in=0, wb_pc=0, data=0, tmp___0=0, wb_i=1, c_req_up=0, tmp___3=0, c_t=0, wl_i=1, c1_st=0, c=0, wl_st=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7b8ecdb5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3f2a26d2=0, c1_i=1, c2_pc=0, c2_i=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1f16c494=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@71e460cc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4ff9c34c=0, r_i=0, d=0, e_f=2, e_g=2, r_st=2, __retres1=0, c1_pc=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 288]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L18] int c ; [L19] int c_t ; [L20] int c_req_up ; [L21] int p_in ; [L22] int p_out ; [L23] int wl_st ; [L24] int c1_st ; [L25] int c2_st ; [L26] int wb_st ; [L27] int r_st ; [L28] int wl_i ; [L29] int c1_i ; [L30] int c2_i ; [L31] int wb_i ; [L32] int r_i ; [L33] int wl_pc ; [L34] int c1_pc ; [L35] int c2_pc ; [L36] int wb_pc ; [L37] int e_e ; [L38] int e_f ; [L39] int e_g ; [L40] int e_c ; [L41] int e_p_in ; [L42] int e_wl ; [L48] int d ; [L49] int data ; [L50] int processed ; [L51] static int t_b ; [L683] int __retres1 ; [L687] e_wl = 2 [L688] e_c = e_wl [L689] e_g = e_c [L690] e_f = e_g [L691] e_e = e_f [L692] wl_pc = 0 [L693] c1_pc = 0 [L694] c2_pc = 0 [L695] wb_pc = 0 [L696] wb_i = 1 [L697] c2_i = wb_i [L698] c1_i = c2_i [L699] wl_i = c1_i [L700] r_i = 0 [L701] c_req_up = 0 [L702] d = 0 [L703] c = 0 [L394] int kernel_st ; [L397] kernel_st = 0 [L398] COND FALSE !((int )c_req_up == 1) [L409] COND TRUE (int )wl_i == 1 [L410] wl_st = 0 [L414] COND TRUE (int )c1_i == 1 [L415] c1_st = 0 [L419] COND TRUE (int )c2_i == 1 [L420] c2_st = 0 [L424] COND TRUE (int )wb_i == 1 [L425] wb_st = 0 [L429] COND FALSE !((int )r_i == 1) [L432] r_st = 2 [L434] COND FALSE !((int )e_f == 0) [L439] COND FALSE !((int )e_g == 0) [L444] COND FALSE !((int )e_e == 0) [L449] COND FALSE !((int )e_c == 0) [L454] COND FALSE !((int )e_wl == 0) [L459] COND FALSE !((int )wl_pc == 1) [L467] COND FALSE !((int )wl_pc == 2) [L477] COND FALSE !((int )c1_pc == 1) [L486] COND FALSE !((int )c2_pc == 1) [L495] COND FALSE !((int )wb_pc == 1) [L504] COND FALSE !((int )e_c == 1) [L509] COND FALSE !((int )e_e == 1) [L514] COND FALSE !((int )e_f == 1) [L519] COND FALSE !((int )e_g == 1) [L524] COND FALSE !((int )e_c == 1) [L529] COND FALSE !((int )e_wl == 1) [L535] COND TRUE 1 [L538] kernel_st = 1 [L280] int tmp ; [L281] int tmp___0 ; [L282] int tmp___1 ; [L283] int tmp___2 ; [L284] int tmp___3 ; Loop: [L288] COND TRUE 1 [L290] COND TRUE (int )wl_st == 0 [L311] COND TRUE (int )wl_st == 0 [L313] tmp = __VERIFIER_nondet_int() [L315] COND FALSE !(\read(tmp)) [L326] COND TRUE (int )c1_st == 0 [L328] tmp___0 = __VERIFIER_nondet_int() [L330] COND FALSE !(\read(tmp___0)) [L341] COND TRUE (int )c2_st == 0 [L343] tmp___1 = __VERIFIER_nondet_int() [L345] COND FALSE !(\read(tmp___1)) [L356] COND TRUE (int )wb_st == 0 [L358] tmp___2 = __VERIFIER_nondet_int() [L360] COND FALSE !(\read(tmp___2)) [L371] COND FALSE !((int )r_st == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...