./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/systemc/toy2_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_295f97e4-925a-49b0-866d-3f21d6a563c8/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_295f97e4-925a-49b0-866d-3f21d6a563c8/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_295f97e4-925a-49b0-866d-3f21d6a563c8/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_295f97e4-925a-49b0-866d-3f21d6a563c8/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/systemc/toy2_false-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_295f97e4-925a-49b0-866d-3f21d6a563c8/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_295f97e4-925a-49b0-866d-3f21d6a563c8/bin-2019/uautomizer --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 c8989412e094655bcf4508d76eb9764ed06d0b34 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.23-1dbac8b [2018-11-10 08:52:37,033 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 08:52:37,035 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 08:52:37,044 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 08:52:37,044 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 08:52:37,045 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 08:52:37,046 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 08:52:37,047 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 08:52:37,048 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 08:52:37,049 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 08:52:37,049 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 08:52:37,050 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 08:52:37,050 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 08:52:37,051 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 08:52:37,052 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 08:52:37,052 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 08:52:37,053 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 08:52:37,054 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 08:52:37,055 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 08:52:37,056 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 08:52:37,057 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 08:52:37,058 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 08:52:37,059 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 08:52:37,060 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 08:52:37,060 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 08:52:37,060 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 08:52:37,061 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 08:52:37,062 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 08:52:37,062 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 08:52:37,063 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 08:52:37,063 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 08:52:37,064 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 08:52:37,064 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 08:52:37,064 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 08:52:37,065 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 08:52:37,065 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 08:52:37,066 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_295f97e4-925a-49b0-866d-3f21d6a563c8/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 08:52:37,076 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 08:52:37,076 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 08:52:37,077 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 08:52:37,078 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 08:52:37,078 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 08:52:37,078 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 08:52:37,078 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 08:52:37,078 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 08:52:37,078 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 08:52:37,078 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 08:52:37,079 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 08:52:37,079 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 08:52:37,079 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 08:52:37,079 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 08:52:37,079 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 08:52:37,079 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 08:52:37,079 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 08:52:37,080 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 08:52:37,080 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 08:52:37,080 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 08:52:37,080 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 08:52:37,080 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 08:52:37,080 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 08:52:37,080 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 08:52:37,081 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 08:52:37,081 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 08:52:37,081 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 08:52:37,081 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 08:52:37,081 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 08:52:37,081 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 08:52:37,082 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 08:52:37,082 INFO L133 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_295f97e4-925a-49b0-866d-3f21d6a563c8/bin-2019/uautomizer 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 -> c8989412e094655bcf4508d76eb9764ed06d0b34 [2018-11-10 08:52:37,106 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 08:52:37,116 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 08:52:37,119 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 08:52:37,120 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 08:52:37,120 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 08:52:37,121 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_295f97e4-925a-49b0-866d-3f21d6a563c8/bin-2019/uautomizer/../../sv-benchmarks/c/systemc/toy2_false-unreach-call_false-termination.cil.c [2018-11-10 08:52:37,157 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_295f97e4-925a-49b0-866d-3f21d6a563c8/bin-2019/uautomizer/data/b0b9c0aa3/2710bc2ef26a45eb856a2d05d7e8fe24/FLAGe64a9a377 [2018-11-10 08:52:37,567 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 08:52:37,568 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_295f97e4-925a-49b0-866d-3f21d6a563c8/sv-benchmarks/c/systemc/toy2_false-unreach-call_false-termination.cil.c [2018-11-10 08:52:37,573 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_295f97e4-925a-49b0-866d-3f21d6a563c8/bin-2019/uautomizer/data/b0b9c0aa3/2710bc2ef26a45eb856a2d05d7e8fe24/FLAGe64a9a377 [2018-11-10 08:52:37,584 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_295f97e4-925a-49b0-866d-3f21d6a563c8/bin-2019/uautomizer/data/b0b9c0aa3/2710bc2ef26a45eb856a2d05d7e8fe24 [2018-11-10 08:52:37,587 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 08:52:37,588 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 08:52:37,589 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 08:52:37,589 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 08:52:37,591 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 08:52:37,591 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:52:37" (1/1) ... [2018-11-10 08:52:37,593 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35fa7d5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:52:37, skipping insertion in model container [2018-11-10 08:52:37,594 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:52:37" (1/1) ... [2018-11-10 08:52:37,599 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 08:52:37,625 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 08:52:37,757 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 08:52:37,760 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 08:52:37,796 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 08:52:37,805 INFO L193 MainTranslator]: Completed translation [2018-11-10 08:52:37,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:52:37 WrapperNode [2018-11-10 08:52:37,805 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 08:52:37,806 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 08:52:37,806 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 08:52:37,806 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 08:52:37,811 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:52:37" (1/1) ... [2018-11-10 08:52:37,817 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:52:37" (1/1) ... [2018-11-10 08:52:37,838 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 08:52:37,839 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 08:52:37,839 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 08:52:37,839 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 08:52:37,887 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:52:37" (1/1) ... [2018-11-10 08:52:37,888 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:52:37" (1/1) ... [2018-11-10 08:52:37,889 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:52:37" (1/1) ... [2018-11-10 08:52:37,889 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:52:37" (1/1) ... [2018-11-10 08:52:37,893 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:52:37" (1/1) ... [2018-11-10 08:52:37,901 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:52:37" (1/1) ... [2018-11-10 08:52:37,903 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:52:37" (1/1) ... [2018-11-10 08:52:37,906 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 08:52:37,906 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 08:52:37,906 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 08:52:37,906 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 08:52:37,907 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:52:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_295f97e4-925a-49b0-866d-3f21d6a563c8/bin-2019/uautomizer/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 [2018-11-10 08:52:37,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 08:52:37,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 08:52:38,350 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 08:52:38,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 08:52:38 BoogieIcfgContainer [2018-11-10 08:52:38,350 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 08:52:38,351 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 08:52:38,351 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 08:52:38,353 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 08:52:38,354 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 08:52:38,355 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 08:52:37" (1/3) ... [2018-11-10 08:52:38,356 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@71fe596b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 08:52:38, skipping insertion in model container [2018-11-10 08:52:38,356 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 08:52:38,356 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:52:37" (2/3) ... [2018-11-10 08:52:38,356 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@71fe596b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 08:52:38, skipping insertion in model container [2018-11-10 08:52:38,356 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 08:52:38,356 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 08:52:38" (3/3) ... [2018-11-10 08:52:38,358 INFO L375 chiAutomizerObserver]: Analyzing ICFG toy2_false-unreach-call_false-termination.cil.c [2018-11-10 08:52:38,411 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 08:52:38,411 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 08:52:38,411 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 08:52:38,411 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 08:52:38,412 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 08:52:38,412 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 08:52:38,412 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 08:52:38,412 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 08:52:38,412 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 08:52:38,427 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 136 states. [2018-11-10 08:52:38,451 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 101 [2018-11-10 08:52:38,451 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:52:38,451 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:52:38,457 INFO L866 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] [2018-11-10 08:52:38,458 INFO L867 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] [2018-11-10 08:52:38,458 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 08:52:38,458 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 136 states. [2018-11-10 08:52:38,462 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 101 [2018-11-10 08:52:38,463 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:52:38,463 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:52:38,464 INFO L866 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] [2018-11-10 08:52:38,464 INFO L867 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] [2018-11-10 08:52:38,470 INFO L793 eck$LassoCheckResult]: Stem: 100#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;~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; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 79#L394true assume !(~c_req_up~0 == 1); 68#L394-2true assume !(~wl_i~0 == 1);~wl_st~0 := 2; 66#L405-1true assume !(~c1_i~0 == 1);~c1_st~0 := 2; 94#L410-1true assume ~c2_i~0 == 1;~c2_st~0 := 0; 119#L415-1true assume !(~wb_i~0 == 1);~wb_st~0 := 2; 4#L420-1true assume !(~r_i~0 == 1);~r_st~0 := 2; 29#L425-1true assume !(~e_f~0 == 0); 59#L430-1true assume !(~e_g~0 == 0); 85#L435-1true assume !(~e_e~0 == 0); 111#L440-1true assume !(~e_c~0 == 0); 134#L445-1true assume !(~e_wl~0 == 0); 22#L450-1true assume !(~wl_pc~0 == 1); 109#L462true assume !(~wl_pc~0 == 2); 72#L463true assume !(~c1_pc~0 == 1); 107#L473true assume !(~c2_pc~0 == 1); 75#L482true assume !(~wb_pc~0 == 1); 45#L491true assume !(~e_c~0 == 1); 132#L500-1true assume !(~e_e~0 == 1); 18#L505-1true assume !(~e_f~0 == 1); 50#L510-1true assume !(~e_g~0 == 1); 76#L515-1true assume !(~e_c~0 == 1); 103#L520-1true assume !(~e_wl~0 == 1); 25#L662-1true [2018-11-10 08:52:38,470 INFO L795 eck$LassoCheckResult]: Loop: 25#L662-1true assume true; 101#L531true assume !false; 48#L532true start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;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; 54#L367true assume !true; 80#L383true assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2; 38#L538true assume !(~c_req_up~0 == 1); 19#L538-2true start_simulation_~kernel_st~0 := 3; 125#L550true assume ~e_f~0 == 0;~e_f~0 := 1; 105#L550-2true assume ~e_g~0 == 0;~e_g~0 := 1; 8#L555-1true assume ~e_e~0 == 0;~e_e~0 := 1; 39#L560-1true assume ~e_c~0 == 0;~e_c~0 := 1; 49#L565-1true assume ~e_wl~0 == 0;~e_wl~0 := 1; 73#L570-1true assume ~wl_pc~0 == 1; 64#L576true assume ~e_wl~0 == 1;~wl_st~0 := 0; 122#L583true assume !(~c1_pc~0 == 1); 35#L593true assume !(~c2_pc~0 == 1); 137#L602true assume !(~wb_pc~0 == 1); 96#L611true assume ~e_c~0 == 1;~r_st~0 := 0; 63#L620-1true assume ~e_e~0 == 1;~e_e~0 := 2; 91#L625-1true assume ~e_f~0 == 1;~e_f~0 := 2; 117#L630-1true assume ~e_g~0 == 1;~e_g~0 := 2; 138#L635-1true assume ~e_c~0 == 1;~e_c~0 := 2; 26#L640-1true assume ~e_wl~0 == 1;~e_wl~0 := 2; 43#L645-1true assume ~wl_st~0 == 0; 25#L662-1true [2018-11-10 08:52:38,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:52:38,475 INFO L82 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 1 times [2018-11-10 08:52:38,477 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:52:38,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:52:38,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:38,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:52:38,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:38,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:52:38,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:52:38,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:52:38,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:52:38,597 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 08:52:38,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:52:38,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1385552249, now seen corresponding path program 1 times [2018-11-10 08:52:38,597 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:52:38,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:52:38,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:38,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:52:38,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:38,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:52:38,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:52:38,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:52:38,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 08:52:38,606 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 08:52:38,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 08:52:38,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 08:52:38,622 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 2 states. [2018-11-10 08:52:38,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:52:38,634 INFO L93 Difference]: Finished difference Result 135 states and 228 transitions. [2018-11-10 08:52:38,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 08:52:38,636 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 135 states and 228 transitions. [2018-11-10 08:52:38,639 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 99 [2018-11-10 08:52:38,643 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 135 states to 130 states and 223 transitions. [2018-11-10 08:52:38,644 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 130 [2018-11-10 08:52:38,644 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 130 [2018-11-10 08:52:38,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 130 states and 223 transitions. [2018-11-10 08:52:38,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 08:52:38,645 INFO L705 BuchiCegarLoop]: Abstraction has 130 states and 223 transitions. [2018-11-10 08:52:38,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states and 223 transitions. [2018-11-10 08:52:38,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-11-10 08:52:38,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-10 08:52:38,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 223 transitions. [2018-11-10 08:52:38,672 INFO L728 BuchiCegarLoop]: Abstraction has 130 states and 223 transitions. [2018-11-10 08:52:38,672 INFO L608 BuchiCegarLoop]: Abstraction has 130 states and 223 transitions. [2018-11-10 08:52:38,672 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 08:52:38,673 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 130 states and 223 transitions. [2018-11-10 08:52:38,674 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 99 [2018-11-10 08:52:38,674 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:52:38,675 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:52:38,676 INFO L866 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] [2018-11-10 08:52:38,676 INFO L867 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, 1, 1] [2018-11-10 08:52:38,676 INFO L793 eck$LassoCheckResult]: Stem: 402#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~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; 298#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 299#L394 assume !(~c_req_up~0 == 1); 301#L394-2 assume !(~wl_i~0 == 1);~wl_st~0 := 2; 383#L405-1 assume !(~c1_i~0 == 1);~c1_st~0 := 2; 384#L410-1 assume ~c2_i~0 == 1;~c2_st~0 := 0; 399#L415-1 assume !(~wb_i~0 == 1);~wb_st~0 := 2; 283#L420-1 assume !(~r_i~0 == 1);~r_st~0 := 2; 284#L425-1 assume !(~e_f~0 == 0); 332#L430-1 assume !(~e_g~0 == 0); 376#L435-1 assume !(~e_e~0 == 0); 394#L440-1 assume !(~e_c~0 == 0); 405#L445-1 assume !(~e_wl~0 == 0); 322#L450-1 assume !(~wl_pc~0 == 1); 323#L462 assume !(~wl_pc~0 == 2); 308#L463 assume !(~c1_pc~0 == 1); 388#L473 assume !(~c2_pc~0 == 1); 313#L482 assume !(~wb_pc~0 == 1); 360#L491 assume !(~e_c~0 == 1); 361#L500-1 assume !(~e_e~0 == 1); 314#L505-1 assume !(~e_f~0 == 1); 315#L510-1 assume !(~e_g~0 == 1); 366#L515-1 assume !(~e_c~0 == 1); 390#L520-1 assume !(~e_wl~0 == 1); 326#L662-1 [2018-11-10 08:52:38,676 INFO L795 eck$LassoCheckResult]: Loop: 326#L662-1 assume true; 328#L531 assume !false; 363#L532 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;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; 364#L367 assume true; 371#L284-1 assume !false; 288#L285 assume !(~wl_st~0 == 0); 290#L289 assume !(~c1_st~0 == 0); 398#L292 assume !(~c2_st~0 == 0); 377#L295 assume !(~wb_st~0 == 0); 378#L298 assume !(~r_st~0 == 0); 385#L383 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2; 350#L538 assume !(~c_req_up~0 == 1); 318#L538-2 start_simulation_~kernel_st~0 := 3; 319#L550 assume ~e_f~0 == 0;~e_f~0 := 1; 403#L550-2 assume ~e_g~0 == 0;~e_g~0 := 1; 294#L555-1 assume ~e_e~0 == 0;~e_e~0 := 1; 295#L560-1 assume ~e_c~0 == 0;~e_c~0 := 1; 353#L565-1 assume ~e_wl~0 == 0;~e_wl~0 := 1; 365#L570-1 assume !(~wl_pc~0 == 1); 346#L582 assume !(~wl_pc~0 == 2); 348#L583 assume !(~c1_pc~0 == 1); 338#L593 assume !(~c2_pc~0 == 1); 339#L602 assume !(~wb_pc~0 == 1); 355#L611 assume ~e_c~0 == 1;~r_st~0 := 0; 380#L620-1 assume ~e_e~0 == 1;~e_e~0 := 2; 381#L625-1 assume ~e_f~0 == 1;~e_f~0 := 2; 396#L630-1 assume ~e_g~0 == 1;~e_g~0 := 2; 407#L635-1 assume ~e_c~0 == 1;~e_c~0 := 2; 329#L640-1 assume ~e_wl~0 == 1;~e_wl~0 := 2; 330#L645-1 assume ~wl_st~0 == 0; 326#L662-1 [2018-11-10 08:52:38,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:52:38,677 INFO L82 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 2 times [2018-11-10 08:52:38,677 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:52:38,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:52:38,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:38,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:52:38,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:38,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:52:38,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:52:38,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:52:38,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:52:38,725 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 08:52:38,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:52:38,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1415543972, now seen corresponding path program 1 times [2018-11-10 08:52:38,726 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:52:38,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:52:38,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:38,726 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:52:38,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:38,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:52:38,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:52:38,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:52:38,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 08:52:38,746 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 08:52:38,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:52:38,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:52:38,747 INFO L87 Difference]: Start difference. First operand 130 states and 223 transitions. cyclomatic complexity: 94 Second operand 3 states. [2018-11-10 08:52:38,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:52:38,759 INFO L93 Difference]: Finished difference Result 130 states and 222 transitions. [2018-11-10 08:52:38,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:52:38,760 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 130 states and 222 transitions. [2018-11-10 08:52:38,761 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 99 [2018-11-10 08:52:38,762 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 130 states to 130 states and 222 transitions. [2018-11-10 08:52:38,762 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 130 [2018-11-10 08:52:38,762 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 130 [2018-11-10 08:52:38,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 130 states and 222 transitions. [2018-11-10 08:52:38,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 08:52:38,763 INFO L705 BuchiCegarLoop]: Abstraction has 130 states and 222 transitions. [2018-11-10 08:52:38,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states and 222 transitions. [2018-11-10 08:52:38,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-11-10 08:52:38,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-10 08:52:38,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 222 transitions. [2018-11-10 08:52:38,768 INFO L728 BuchiCegarLoop]: Abstraction has 130 states and 222 transitions. [2018-11-10 08:52:38,768 INFO L608 BuchiCegarLoop]: Abstraction has 130 states and 222 transitions. [2018-11-10 08:52:38,768 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 08:52:38,768 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 130 states and 222 transitions. [2018-11-10 08:52:38,769 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 99 [2018-11-10 08:52:38,770 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:52:38,770 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:52:38,771 INFO L866 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] [2018-11-10 08:52:38,771 INFO L867 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, 1, 1] [2018-11-10 08:52:38,771 INFO L793 eck$LassoCheckResult]: Stem: 669#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~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; 565#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 566#L394 assume !(~c_req_up~0 == 1); 568#L394-2 assume ~wl_i~0 == 1;~wl_st~0 := 0; 650#L405-1 assume !(~c1_i~0 == 1);~c1_st~0 := 2; 651#L410-1 assume ~c2_i~0 == 1;~c2_st~0 := 0; 666#L415-1 assume !(~wb_i~0 == 1);~wb_st~0 := 2; 550#L420-1 assume !(~r_i~0 == 1);~r_st~0 := 2; 551#L425-1 assume !(~e_f~0 == 0); 599#L430-1 assume !(~e_g~0 == 0); 643#L435-1 assume !(~e_e~0 == 0); 661#L440-1 assume !(~e_c~0 == 0); 672#L445-1 assume !(~e_wl~0 == 0); 589#L450-1 assume !(~wl_pc~0 == 1); 590#L462 assume !(~wl_pc~0 == 2); 575#L463 assume !(~c1_pc~0 == 1); 655#L473 assume !(~c2_pc~0 == 1); 580#L482 assume !(~wb_pc~0 == 1); 627#L491 assume !(~e_c~0 == 1); 628#L500-1 assume !(~e_e~0 == 1); 581#L505-1 assume !(~e_f~0 == 1); 582#L510-1 assume !(~e_g~0 == 1); 633#L515-1 assume !(~e_c~0 == 1); 657#L520-1 assume !(~e_wl~0 == 1); 593#L662-1 [2018-11-10 08:52:38,772 INFO L795 eck$LassoCheckResult]: Loop: 593#L662-1 assume true; 595#L531 assume !false; 631#L532 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;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; 632#L367 assume true; 638#L284-1 assume !false; 555#L285 assume !(~wl_st~0 == 0); 557#L289 assume !(~c1_st~0 == 0); 665#L292 assume !(~c2_st~0 == 0); 644#L295 assume !(~wb_st~0 == 0); 645#L298 assume !(~r_st~0 == 0); 652#L383 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2; 617#L538 assume !(~c_req_up~0 == 1); 585#L538-2 start_simulation_~kernel_st~0 := 3; 586#L550 assume ~e_f~0 == 0;~e_f~0 := 1; 670#L550-2 assume ~e_g~0 == 0;~e_g~0 := 1; 561#L555-1 assume ~e_e~0 == 0;~e_e~0 := 1; 562#L560-1 assume ~e_c~0 == 0;~e_c~0 := 1; 619#L565-1 assume ~e_wl~0 == 0;~e_wl~0 := 1; 630#L570-1 assume !(~wl_pc~0 == 1); 613#L582 assume !(~wl_pc~0 == 2); 615#L583 assume !(~c1_pc~0 == 1); 607#L593 assume !(~c2_pc~0 == 1); 608#L602 assume !(~wb_pc~0 == 1); 622#L611 assume ~e_c~0 == 1;~r_st~0 := 0; 647#L620-1 assume ~e_e~0 == 1;~e_e~0 := 2; 648#L625-1 assume ~e_f~0 == 1;~e_f~0 := 2; 663#L630-1 assume ~e_g~0 == 1;~e_g~0 := 2; 674#L635-1 assume ~e_c~0 == 1;~e_c~0 := 2; 596#L640-1 assume ~e_wl~0 == 1;~e_wl~0 := 2; 597#L645-1 assume ~wl_st~0 == 0; 593#L662-1 [2018-11-10 08:52:38,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:52:38,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1738779219, now seen corresponding path program 1 times [2018-11-10 08:52:38,772 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:52:38,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:52:38,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:38,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:52:38,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:38,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:52:38,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:52:38,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:52:38,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:52:38,809 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 08:52:38,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:52:38,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1415543972, now seen corresponding path program 2 times [2018-11-10 08:52:38,810 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:52:38,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:52:38,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:38,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:52:38,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:38,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:52:38,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:52:38,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:52:38,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 08:52:38,829 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 08:52:38,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:52:38,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:52:38,829 INFO L87 Difference]: Start difference. First operand 130 states and 222 transitions. cyclomatic complexity: 93 Second operand 3 states. [2018-11-10 08:52:38,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:52:38,842 INFO L93 Difference]: Finished difference Result 130 states and 221 transitions. [2018-11-10 08:52:38,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:52:38,844 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 130 states and 221 transitions. [2018-11-10 08:52:38,844 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 99 [2018-11-10 08:52:38,845 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 130 states to 130 states and 221 transitions. [2018-11-10 08:52:38,846 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 130 [2018-11-10 08:52:38,846 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 130 [2018-11-10 08:52:38,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 130 states and 221 transitions. [2018-11-10 08:52:38,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 08:52:38,847 INFO L705 BuchiCegarLoop]: Abstraction has 130 states and 221 transitions. [2018-11-10 08:52:38,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states and 221 transitions. [2018-11-10 08:52:38,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-11-10 08:52:38,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-10 08:52:38,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 221 transitions. [2018-11-10 08:52:38,852 INFO L728 BuchiCegarLoop]: Abstraction has 130 states and 221 transitions. [2018-11-10 08:52:38,852 INFO L608 BuchiCegarLoop]: Abstraction has 130 states and 221 transitions. [2018-11-10 08:52:38,852 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 08:52:38,852 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 130 states and 221 transitions. [2018-11-10 08:52:38,853 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 99 [2018-11-10 08:52:38,853 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:52:38,853 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:52:38,854 INFO L866 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] [2018-11-10 08:52:38,854 INFO L867 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, 1, 1] [2018-11-10 08:52:38,855 INFO L793 eck$LassoCheckResult]: Stem: 936#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~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; 832#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 833#L394 assume !(~c_req_up~0 == 1); 835#L394-2 assume ~wl_i~0 == 1;~wl_st~0 := 0; 917#L405-1 assume ~c1_i~0 == 1;~c1_st~0 := 0; 918#L410-1 assume ~c2_i~0 == 1;~c2_st~0 := 0; 933#L415-1 assume !(~wb_i~0 == 1);~wb_st~0 := 2; 817#L420-1 assume !(~r_i~0 == 1);~r_st~0 := 2; 818#L425-1 assume !(~e_f~0 == 0); 866#L430-1 assume !(~e_g~0 == 0); 910#L435-1 assume !(~e_e~0 == 0); 929#L440-1 assume !(~e_c~0 == 0); 939#L445-1 assume !(~e_wl~0 == 0); 856#L450-1 assume !(~wl_pc~0 == 1); 857#L462 assume !(~wl_pc~0 == 2); 842#L463 assume !(~c1_pc~0 == 1); 922#L473 assume !(~c2_pc~0 == 1); 847#L482 assume !(~wb_pc~0 == 1); 894#L491 assume !(~e_c~0 == 1); 895#L500-1 assume !(~e_e~0 == 1); 848#L505-1 assume !(~e_f~0 == 1); 849#L510-1 assume !(~e_g~0 == 1); 900#L515-1 assume !(~e_c~0 == 1); 924#L520-1 assume !(~e_wl~0 == 1); 860#L662-1 [2018-11-10 08:52:38,855 INFO L795 eck$LassoCheckResult]: Loop: 860#L662-1 assume true; 862#L531 assume !false; 898#L532 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;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; 899#L367 assume true; 905#L284-1 assume !false; 822#L285 assume !(~wl_st~0 == 0); 824#L289 assume !(~c1_st~0 == 0); 932#L292 assume !(~c2_st~0 == 0); 911#L295 assume !(~wb_st~0 == 0); 912#L298 assume !(~r_st~0 == 0); 919#L383 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2; 884#L538 assume !(~c_req_up~0 == 1); 852#L538-2 start_simulation_~kernel_st~0 := 3; 853#L550 assume ~e_f~0 == 0;~e_f~0 := 1; 937#L550-2 assume ~e_g~0 == 0;~e_g~0 := 1; 828#L555-1 assume ~e_e~0 == 0;~e_e~0 := 1; 829#L560-1 assume ~e_c~0 == 0;~e_c~0 := 1; 887#L565-1 assume ~e_wl~0 == 0;~e_wl~0 := 1; 897#L570-1 assume !(~wl_pc~0 == 1); 880#L582 assume !(~wl_pc~0 == 2); 882#L583 assume !(~c1_pc~0 == 1); 874#L593 assume !(~c2_pc~0 == 1); 875#L602 assume !(~wb_pc~0 == 1); 889#L611 assume ~e_c~0 == 1;~r_st~0 := 0; 914#L620-1 assume ~e_e~0 == 1;~e_e~0 := 2; 915#L625-1 assume ~e_f~0 == 1;~e_f~0 := 2; 931#L630-1 assume ~e_g~0 == 1;~e_g~0 := 2; 941#L635-1 assume ~e_c~0 == 1;~e_c~0 := 2; 863#L640-1 assume ~e_wl~0 == 1;~e_wl~0 := 2; 864#L645-1 assume ~wl_st~0 == 0; 860#L662-1 [2018-11-10 08:52:38,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:52:38,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1738539627, now seen corresponding path program 1 times [2018-11-10 08:52:38,855 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:52:38,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:52:38,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:38,856 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:52:38,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:38,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:52:38,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:52:38,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:52:38,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:52:38,877 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 08:52:38,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:52:38,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1415543972, now seen corresponding path program 3 times [2018-11-10 08:52:38,878 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:52:38,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:52:38,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:38,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:52:38,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:38,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:52:38,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:52:38,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:52:38,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 08:52:38,905 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 08:52:38,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:52:38,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:52:38,905 INFO L87 Difference]: Start difference. First operand 130 states and 221 transitions. cyclomatic complexity: 92 Second operand 3 states. [2018-11-10 08:52:38,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:52:38,910 INFO L93 Difference]: Finished difference Result 130 states and 220 transitions. [2018-11-10 08:52:38,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:52:38,911 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 130 states and 220 transitions. [2018-11-10 08:52:38,911 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 99 [2018-11-10 08:52:38,912 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 130 states to 130 states and 220 transitions. [2018-11-10 08:52:38,912 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 130 [2018-11-10 08:52:38,913 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 130 [2018-11-10 08:52:38,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 130 states and 220 transitions. [2018-11-10 08:52:38,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 08:52:38,913 INFO L705 BuchiCegarLoop]: Abstraction has 130 states and 220 transitions. [2018-11-10 08:52:38,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states and 220 transitions. [2018-11-10 08:52:38,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-11-10 08:52:38,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-10 08:52:38,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 220 transitions. [2018-11-10 08:52:38,917 INFO L728 BuchiCegarLoop]: Abstraction has 130 states and 220 transitions. [2018-11-10 08:52:38,918 INFO L608 BuchiCegarLoop]: Abstraction has 130 states and 220 transitions. [2018-11-10 08:52:38,918 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 08:52:38,918 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 130 states and 220 transitions. [2018-11-10 08:52:38,918 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 99 [2018-11-10 08:52:38,919 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:52:38,919 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:52:38,919 INFO L866 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] [2018-11-10 08:52:38,919 INFO L867 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, 1, 1] [2018-11-10 08:52:38,920 INFO L793 eck$LassoCheckResult]: Stem: 1203#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~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; 1099#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 1100#L394 assume !(~c_req_up~0 == 1); 1102#L394-2 assume ~wl_i~0 == 1;~wl_st~0 := 0; 1184#L405-1 assume ~c1_i~0 == 1;~c1_st~0 := 0; 1185#L410-1 assume ~c2_i~0 == 1;~c2_st~0 := 0; 1200#L415-1 assume ~wb_i~0 == 1;~wb_st~0 := 0; 1084#L420-1 assume !(~r_i~0 == 1);~r_st~0 := 2; 1085#L425-1 assume !(~e_f~0 == 0); 1133#L430-1 assume !(~e_g~0 == 0); 1177#L435-1 assume !(~e_e~0 == 0); 1196#L440-1 assume !(~e_c~0 == 0); 1206#L445-1 assume !(~e_wl~0 == 0); 1123#L450-1 assume !(~wl_pc~0 == 1); 1124#L462 assume !(~wl_pc~0 == 2); 1109#L463 assume !(~c1_pc~0 == 1); 1189#L473 assume !(~c2_pc~0 == 1); 1114#L482 assume !(~wb_pc~0 == 1); 1161#L491 assume !(~e_c~0 == 1); 1162#L500-1 assume !(~e_e~0 == 1); 1117#L505-1 assume !(~e_f~0 == 1); 1118#L510-1 assume !(~e_g~0 == 1); 1167#L515-1 assume !(~e_c~0 == 1); 1191#L520-1 assume !(~e_wl~0 == 1); 1127#L662-1 [2018-11-10 08:52:38,920 INFO L795 eck$LassoCheckResult]: Loop: 1127#L662-1 assume true; 1129#L531 assume !false; 1165#L532 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;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; 1166#L367 assume true; 1172#L284-1 assume !false; 1089#L285 assume !(~wl_st~0 == 0); 1091#L289 assume !(~c1_st~0 == 0); 1199#L292 assume !(~c2_st~0 == 0); 1178#L295 assume !(~wb_st~0 == 0); 1179#L298 assume !(~r_st~0 == 0); 1186#L383 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2; 1151#L538 assume !(~c_req_up~0 == 1); 1115#L538-2 start_simulation_~kernel_st~0 := 3; 1116#L550 assume ~e_f~0 == 0;~e_f~0 := 1; 1204#L550-2 assume ~e_g~0 == 0;~e_g~0 := 1; 1095#L555-1 assume ~e_e~0 == 0;~e_e~0 := 1; 1096#L560-1 assume ~e_c~0 == 0;~e_c~0 := 1; 1154#L565-1 assume ~e_wl~0 == 0;~e_wl~0 := 1; 1164#L570-1 assume !(~wl_pc~0 == 1); 1147#L582 assume !(~wl_pc~0 == 2); 1149#L583 assume !(~c1_pc~0 == 1); 1141#L593 assume !(~c2_pc~0 == 1); 1142#L602 assume !(~wb_pc~0 == 1); 1156#L611 assume ~e_c~0 == 1;~r_st~0 := 0; 1181#L620-1 assume ~e_e~0 == 1;~e_e~0 := 2; 1182#L625-1 assume ~e_f~0 == 1;~e_f~0 := 2; 1198#L630-1 assume ~e_g~0 == 1;~e_g~0 := 2; 1208#L635-1 assume ~e_c~0 == 1;~e_c~0 := 2; 1130#L640-1 assume ~e_wl~0 == 1;~e_wl~0 := 2; 1131#L645-1 assume ~wl_st~0 == 0; 1127#L662-1 [2018-11-10 08:52:38,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:52:38,920 INFO L82 PathProgramCache]: Analyzing trace with hash 255605079, now seen corresponding path program 1 times [2018-11-10 08:52:38,920 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:52:38,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:52:38,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:38,921 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:52:38,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:38,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:52:38,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:52:38,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:52:38,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1415543972, now seen corresponding path program 4 times [2018-11-10 08:52:38,947 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:52:38,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:52:38,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:38,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:52:38,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:38,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:52:38,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:52:38,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:52:38,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 08:52:38,970 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 08:52:38,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:52:38,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:52:38,971 INFO L87 Difference]: Start difference. First operand 130 states and 220 transitions. cyclomatic complexity: 91 Second operand 3 states. [2018-11-10 08:52:39,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:52:39,050 INFO L93 Difference]: Finished difference Result 191 states and 317 transitions. [2018-11-10 08:52:39,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:52:39,051 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 191 states and 317 transitions. [2018-11-10 08:52:39,052 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 160 [2018-11-10 08:52:39,053 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 191 states to 191 states and 317 transitions. [2018-11-10 08:52:39,053 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 191 [2018-11-10 08:52:39,054 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 191 [2018-11-10 08:52:39,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 191 states and 317 transitions. [2018-11-10 08:52:39,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 08:52:39,055 INFO L705 BuchiCegarLoop]: Abstraction has 191 states and 317 transitions. [2018-11-10 08:52:39,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states and 317 transitions. [2018-11-10 08:52:39,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-11-10 08:52:39,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-11-10 08:52:39,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 317 transitions. [2018-11-10 08:52:39,062 INFO L728 BuchiCegarLoop]: Abstraction has 191 states and 317 transitions. [2018-11-10 08:52:39,062 INFO L608 BuchiCegarLoop]: Abstraction has 191 states and 317 transitions. [2018-11-10 08:52:39,062 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 08:52:39,063 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 191 states and 317 transitions. [2018-11-10 08:52:39,065 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 160 [2018-11-10 08:52:39,065 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:52:39,065 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:52:39,066 INFO L866 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] [2018-11-10 08:52:39,066 INFO L867 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, 1, 1] [2018-11-10 08:52:39,066 INFO L793 eck$LassoCheckResult]: Stem: 1533#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~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; 1425#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 1426#L394 assume !(~c_req_up~0 == 1); 1428#L394-2 assume ~wl_i~0 == 1;~wl_st~0 := 0; 1512#L405-1 assume ~c1_i~0 == 1;~c1_st~0 := 0; 1513#L410-1 assume ~c2_i~0 == 1;~c2_st~0 := 0; 1528#L415-1 assume ~wb_i~0 == 1;~wb_st~0 := 0; 1411#L420-1 assume !(~r_i~0 == 1);~r_st~0 := 2; 1412#L425-1 assume !(~e_f~0 == 0); 1461#L430-1 assume !(~e_g~0 == 0); 1504#L435-1 assume !(~e_e~0 == 0); 1524#L440-1 assume !(~e_c~0 == 0); 1537#L445-1 assume !(~e_wl~0 == 0); 1449#L450-1 assume !(~wl_pc~0 == 1); 1450#L462 assume !(~wl_pc~0 == 2); 1438#L463 assume !(~c1_pc~0 == 1); 1517#L473 assume !(~c2_pc~0 == 1); 1440#L482 assume !(~wb_pc~0 == 1); 1488#L491 assume !(~e_c~0 == 1); 1489#L500-1 assume !(~e_e~0 == 1); 1443#L505-1 assume !(~e_f~0 == 1); 1444#L510-1 assume !(~e_g~0 == 1); 1494#L515-1 assume !(~e_c~0 == 1); 1519#L520-1 assume !(~e_wl~0 == 1); 1534#L662-1 [2018-11-10 08:52:39,066 INFO L795 eck$LassoCheckResult]: Loop: 1534#L662-1 assume true; 1556#L531 assume !false; 1551#L532 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;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; 1547#L367 assume true; 1546#L284-1 assume !false; 1545#L285 assume !(~wl_st~0 == 0); 1417#L289 assume !(~c1_st~0 == 0); 1527#L292 assume !(~c2_st~0 == 0); 1505#L295 assume !(~wb_st~0 == 0); 1506#L298 assume !(~r_st~0 == 0); 1514#L383 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2; 1477#L538 assume !(~c_req_up~0 == 1); 1441#L538-2 start_simulation_~kernel_st~0 := 3; 1442#L550 assume ~e_f~0 == 0;~e_f~0 := 1; 1535#L550-2 assume ~e_g~0 == 0;~e_g~0 := 1; 1421#L555-1 assume ~e_e~0 == 0;~e_e~0 := 1; 1422#L560-1 assume ~e_c~0 == 0;~e_c~0 := 1; 1481#L565-1 assume ~e_wl~0 == 0;~e_wl~0 := 1; 1491#L570-1 assume ~wl_pc~0 == 1; 1510#L576 assume ~e_wl~0 == 1;~wl_st~0 := 0; 1511#L583 assume !(~c1_pc~0 == 1); 1582#L593 assume !(~c2_pc~0 == 1); 1575#L602 assume !(~wb_pc~0 == 1); 1574#L611 assume ~e_c~0 == 1;~r_st~0 := 0; 1573#L620-1 assume ~e_e~0 == 1;~e_e~0 := 2; 1572#L625-1 assume ~e_f~0 == 1;~e_f~0 := 2; 1571#L630-1 assume ~e_g~0 == 1;~e_g~0 := 2; 1566#L635-1 assume ~e_c~0 == 1;~e_c~0 := 2; 1564#L640-1 assume ~e_wl~0 == 1;~e_wl~0 := 2; 1562#L645-1 assume ~wl_st~0 == 0; 1534#L662-1 [2018-11-10 08:52:39,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:52:39,066 INFO L82 PathProgramCache]: Analyzing trace with hash 255605079, now seen corresponding path program 2 times [2018-11-10 08:52:39,067 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:52:39,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:52:39,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:39,067 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:52:39,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:39,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:52:39,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:52:39,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:52:39,082 INFO L82 PathProgramCache]: Analyzing trace with hash 866284251, now seen corresponding path program 1 times [2018-11-10 08:52:39,082 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:52:39,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:52:39,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:39,084 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:52:39,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:39,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:52:39,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:52:39,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:52:39,095 INFO L82 PathProgramCache]: Analyzing trace with hash -861392463, now seen corresponding path program 1 times [2018-11-10 08:52:39,095 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:52:39,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:52:39,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:39,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:52:39,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:39,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:52:39,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:52:39,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:52:39,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:52:39,267 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 08:52:39,268 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 08:52:39,268 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 08:52:39,268 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 08:52:39,269 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 08:52:39,269 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:52:39,269 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 08:52:39,269 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 08:52:39,269 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy2_false-unreach-call_false-termination.cil.c_Iteration6_Loop [2018-11-10 08:52:39,269 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 08:52:39,269 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 08:52:39,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:39,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:39,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:39,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:39,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:39,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:39,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:39,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:39,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:39,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:39,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:39,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:39,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:39,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:39,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:39,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:39,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:39,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:39,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:39,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:39,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:39,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:39,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:39,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:39,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:39,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:39,537 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 08:52:39,538 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_295f97e4-925a-49b0-866d-3f21d6a563c8/bin-2019/uautomizer/z3 Starting monitored process 2 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:52:39,541 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:52:39,541 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:52:39,546 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:52:39,546 INFO L446 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 /tmp/vcloud-vcloud-master/worker/working_dir_295f97e4-925a-49b0-866d-3f21d6a563c8/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:52:39,563 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:52:39,563 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_295f97e4-925a-49b0-866d-3f21d6a563c8/bin-2019/uautomizer/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:52:39,591 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 08:52:39,591 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:52:39,595 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 08:52:39,619 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 08:52:39,619 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 08:52:39,619 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 08:52:39,619 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 08:52:39,620 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 08:52:39,620 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:52:39,620 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 08:52:39,620 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 08:52:39,620 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy2_false-unreach-call_false-termination.cil.c_Iteration6_Loop [2018-11-10 08:52:39,620 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 08:52:39,620 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 08:52:39,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:39,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:39,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:39,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:39,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:39,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:39,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:39,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:39,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:39,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:39,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:39,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:39,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:39,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:39,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:39,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:39,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:39,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:39,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:39,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:39,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:39,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:39,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:39,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:39,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:39,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:39,859 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 08:52:39,863 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 08:52:39,869 INFO L122 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 [2018-11-10 08:52:39,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:52:39,870 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:52:39,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:52:39,871 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 08:52:39,871 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:52:39,873 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 08:52:39,873 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:52:39,877 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:52:39,877 INFO L122 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 [2018-11-10 08:52:39,878 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:52:39,878 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:52:39,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:52:39,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:52:39,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:52:39,879 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:52:39,879 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:52:39,882 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 08:52:39,884 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 08:52:39,884 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 08:52:39,886 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 08:52:39,886 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 08:52:39,886 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 08:52:39,887 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] [2018-11-10 08:52:39,888 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 08:52:39,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:52:39,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:52:39,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:52:39,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:52:39,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:52:39,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:52:39,987 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 [2018-11-10 08:52:39,988 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 191 states and 317 transitions. cyclomatic complexity: 127 Second operand 5 states. [2018-11-10 08:52:40,083 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 191 states and 317 transitions. cyclomatic complexity: 127. Second operand 5 states. Result 679 states and 1116 transitions. Complement of second has 5 states. [2018-11-10 08:52:40,084 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 [2018-11-10 08:52:40,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 08:52:40,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2018-11-10 08:52:40,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 388 transitions. Stem has 24 letters. Loop has 30 letters. [2018-11-10 08:52:40,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:52:40,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 388 transitions. Stem has 54 letters. Loop has 30 letters. [2018-11-10 08:52:40,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:52:40,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 388 transitions. Stem has 24 letters. Loop has 60 letters. [2018-11-10 08:52:40,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:52:40,089 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 679 states and 1116 transitions. [2018-11-10 08:52:40,095 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 480 [2018-11-10 08:52:40,099 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 679 states to 679 states and 1116 transitions. [2018-11-10 08:52:40,099 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 512 [2018-11-10 08:52:40,100 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 516 [2018-11-10 08:52:40,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 679 states and 1116 transitions. [2018-11-10 08:52:40,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:52:40,101 INFO L705 BuchiCegarLoop]: Abstraction has 679 states and 1116 transitions. [2018-11-10 08:52:40,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states and 1116 transitions. [2018-11-10 08:52:40,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 515. [2018-11-10 08:52:40,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2018-11-10 08:52:40,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 849 transitions. [2018-11-10 08:52:40,114 INFO L728 BuchiCegarLoop]: Abstraction has 515 states and 849 transitions. [2018-11-10 08:52:40,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:52:40,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:52:40,115 INFO L87 Difference]: Start difference. First operand 515 states and 849 transitions. Second operand 3 states. [2018-11-10 08:52:40,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:52:40,143 INFO L93 Difference]: Finished difference Result 515 states and 840 transitions. [2018-11-10 08:52:40,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:52:40,144 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 515 states and 840 transitions. [2018-11-10 08:52:40,147 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 320 [2018-11-10 08:52:40,149 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 515 states to 515 states and 840 transitions. [2018-11-10 08:52:40,150 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 352 [2018-11-10 08:52:40,150 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 352 [2018-11-10 08:52:40,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 515 states and 840 transitions. [2018-11-10 08:52:40,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:52:40,151 INFO L705 BuchiCegarLoop]: Abstraction has 515 states and 840 transitions. [2018-11-10 08:52:40,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states and 840 transitions. [2018-11-10 08:52:40,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 515. [2018-11-10 08:52:40,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2018-11-10 08:52:40,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 840 transitions. [2018-11-10 08:52:40,161 INFO L728 BuchiCegarLoop]: Abstraction has 515 states and 840 transitions. [2018-11-10 08:52:40,161 INFO L608 BuchiCegarLoop]: Abstraction has 515 states and 840 transitions. [2018-11-10 08:52:40,161 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 08:52:40,161 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 515 states and 840 transitions. [2018-11-10 08:52:40,165 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 320 [2018-11-10 08:52:40,165 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:52:40,165 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:52:40,166 INFO L866 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] [2018-11-10 08:52:40,166 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:52:40,166 INFO L793 eck$LassoCheckResult]: Stem: 3727#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~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; 3525#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 3526#L394 assume !(~c_req_up~0 == 1); 3528#L394-2 assume ~wl_i~0 == 1;~wl_st~0 := 0; 3684#L405-1 assume ~c1_i~0 == 1;~c1_st~0 := 0; 3685#L410-1 assume ~c2_i~0 == 1;~c2_st~0 := 0; 3713#L415-1 assume ~wb_i~0 == 1;~wb_st~0 := 0; 3499#L420-1 assume !(~r_i~0 == 1);~r_st~0 := 2; 3500#L425-1 assume !(~e_f~0 == 0); 3585#L430-1 assume !(~e_g~0 == 0); 3668#L435-1 assume !(~e_e~0 == 0); 3706#L440-1 assume !(~e_c~0 == 0); 3737#L445-1 assume !(~e_wl~0 == 0); 3563#L450-1 assume !(~wl_pc~0 == 1); 3564#L462 assume !(~wl_pc~0 == 2); 3546#L463 assume !(~c1_pc~0 == 1); 3691#L473 assume !(~c2_pc~0 == 1); 3548#L482 assume !(~wb_pc~0 == 1); 3637#L491 assume !(~e_c~0 == 1); 3638#L500-1 assume !(~e_e~0 == 1); 3553#L505-1 assume !(~e_f~0 == 1); 3554#L510-1 assume !(~e_g~0 == 1); 3647#L515-1 assume !(~e_c~0 == 1); 3693#L520-1 assume ~e_wl~0 == 1;~e_wl~0 := 2; 3571#L662-1 [2018-11-10 08:52:40,167 INFO L795 eck$LassoCheckResult]: Loop: 3571#L662-1 assume true; 3572#L531 assume !false; 3957#L532 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;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; 3953#L367 assume true; 3952#L284-1 assume !false; 3951#L285 assume ~wl_st~0 == 0; 3950#L298-1 assume ~wl_st~0 == 0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 3948#L311 assume eval_~tmp~0 != 0;~wl_st~0 := 1;assume { :begin_inline_write_loop } true;havoc write_loop_~t~0;havoc write_loop_~t~0; 3947#L56 assume ~wl_pc~0 == 0; 3934#L69 ~wl_st~0 := 2;~wl_pc~0 := 1;~e_wl~0 := 0; 3933#L117 assume { :end_inline_write_loop } true; 3932#L307 assume !(~c1_st~0 == 0); 3919#L322 assume !(~c2_st~0 == 0); 3916#L337 assume !(~wb_st~0 == 0); 3738#L352 assume !(~r_st~0 == 0); 3644#L367 assume true; 3656#L284-1 assume !false; 3507#L285 assume !(~wl_st~0 == 0); 3508#L289 assume !(~c1_st~0 == 0); 3711#L292 assume !(~c2_st~0 == 0); 3669#L295 assume !(~wb_st~0 == 0); 3671#L298 assume !(~r_st~0 == 0); 3686#L383 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2; 3695#L538 assume !(~c_req_up~0 == 1); 3813#L538-2 start_simulation_~kernel_st~0 := 3; 3812#L550 assume ~e_f~0 == 0;~e_f~0 := 1; 3811#L550-2 assume ~e_g~0 == 0;~e_g~0 := 1; 3517#L555-1 assume ~e_e~0 == 0;~e_e~0 := 1; 3518#L560-1 assume ~e_c~0 == 0;~e_c~0 := 1; 3810#L565-1 assume ~e_wl~0 == 0;~e_wl~0 := 1; 3867#L570-1 assume ~wl_pc~0 == 1; 3865#L576 assume ~e_wl~0 == 1;~wl_st~0 := 0; 3862#L583 assume !(~c1_pc~0 == 1); 3860#L593 assume !(~c2_pc~0 == 1); 3855#L602 assume !(~wb_pc~0 == 1); 3853#L611 assume ~e_c~0 == 1;~r_st~0 := 0; 3851#L620-1 assume ~e_e~0 == 1;~e_e~0 := 2; 3849#L625-1 assume ~e_f~0 == 1;~e_f~0 := 2; 3847#L630-1 assume ~e_g~0 == 1;~e_g~0 := 2; 3844#L635-1 assume ~e_c~0 == 1;~e_c~0 := 2; 3575#L640-1 assume ~e_wl~0 == 1;~e_wl~0 := 2; 3576#L645-1 assume ~wl_st~0 == 0; 3571#L662-1 [2018-11-10 08:52:40,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:52:40,167 INFO L82 PathProgramCache]: Analyzing trace with hash 255605077, now seen corresponding path program 1 times [2018-11-10 08:52:40,167 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:52:40,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:52:40,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:40,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:52:40,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:40,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:52:40,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:52:40,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:52:40,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 08:52:40,202 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 08:52:40,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:52:40,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1878871200, now seen corresponding path program 1 times [2018-11-10 08:52:40,202 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:52:40,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:52:40,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:40,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:52:40,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:40,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:52:40,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:52:40,330 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2018-11-10 08:52:40,367 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 08:52:40,367 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 08:52:40,368 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 08:52:40,368 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 08:52:40,368 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 08:52:40,368 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:52:40,368 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 08:52:40,368 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 08:52:40,368 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy2_false-unreach-call_false-termination.cil.c_Iteration7_Loop [2018-11-10 08:52:40,368 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 08:52:40,368 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 08:52:40,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:40,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:40,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:40,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:40,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:40,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:40,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:40,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:40,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:40,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:40,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:40,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:40,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:40,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:40,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:40,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:40,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:40,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:40,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:40,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:40,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:40,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:40,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:40,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:40,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:40,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:40,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:40,575 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 08:52:40,575 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_295f97e4-925a-49b0-866d-3f21d6a563c8/bin-2019/uautomizer/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 [2018-11-10 08:52:40,579 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:52:40,579 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:52:40,584 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:52:40,584 INFO L446 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 /tmp/vcloud-vcloud-master/worker/working_dir_295f97e4-925a-49b0-866d-3f21d6a563c8/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:52:40,600 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:52:40,601 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:52:40,602 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:52:40,602 INFO L446 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 /tmp/vcloud-vcloud-master/worker/working_dir_295f97e4-925a-49b0-866d-3f21d6a563c8/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:52:40,622 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:52:40,623 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_295f97e4-925a-49b0-866d-3f21d6a563c8/bin-2019/uautomizer/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 [2018-11-10 08:52:40,642 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 08:52:40,642 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:52:40,644 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 08:52:40,659 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 08:52:40,659 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 08:52:40,659 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 08:52:40,659 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 08:52:40,659 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 08:52:40,659 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:52:40,659 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 08:52:40,659 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 08:52:40,659 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy2_false-unreach-call_false-termination.cil.c_Iteration7_Loop [2018-11-10 08:52:40,659 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 08:52:40,659 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 08:52:40,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:40,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:40,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:40,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:40,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:40,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:40,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:40,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:40,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:40,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:40,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:40,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:40,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:40,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:40,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:40,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:40,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:40,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:40,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:40,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:40,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:40,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:40,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:40,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:40,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:40,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:40,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:40,855 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 08:52:40,855 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 08:52:40,855 INFO L122 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 [2018-11-10 08:52:40,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:52:40,856 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:52:40,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:52:40,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:52:40,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:52:40,856 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:52:40,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:52:40,857 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:52:40,857 INFO L122 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 [2018-11-10 08:52:40,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:52:40,857 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:52:40,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:52:40,857 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 08:52:40,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:52:40,858 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 08:52:40,858 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:52:40,858 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:52:40,858 INFO L122 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 [2018-11-10 08:52:40,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:52:40,863 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:52:40,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:52:40,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:52:40,863 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:52:40,864 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:52:40,864 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:52:40,866 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 08:52:40,867 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 08:52:40,867 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 08:52:40,868 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 08:52:40,868 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 08:52:40,868 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 08:52:40,868 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(~wl_pc~0) = -2*~wl_pc~0 + 1 Supporting invariants [] [2018-11-10 08:52:40,868 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 08:52:40,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:52:40,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:52:40,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:52:40,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:52:40,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:52:40,966 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:52:40,966 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 [2018-11-10 08:52:40,967 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 515 states and 840 transitions. cyclomatic complexity: 328 Second operand 5 states. [2018-11-10 08:52:41,062 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 515 states and 840 transitions. cyclomatic complexity: 328. Second operand 5 states. Result 999 states and 1618 transitions. Complement of second has 7 states. [2018-11-10 08:52:41,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 08:52:41,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 08:52:41,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 384 transitions. [2018-11-10 08:52:41,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 384 transitions. Stem has 24 letters. Loop has 42 letters. [2018-11-10 08:52:41,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:52:41,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 384 transitions. Stem has 66 letters. Loop has 42 letters. [2018-11-10 08:52:41,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:52:41,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 384 transitions. Stem has 24 letters. Loop has 84 letters. [2018-11-10 08:52:41,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:52:41,065 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 999 states and 1618 transitions. [2018-11-10 08:52:41,072 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 609 [2018-11-10 08:52:41,077 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 999 states to 985 states and 1599 transitions. [2018-11-10 08:52:41,077 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 672 [2018-11-10 08:52:41,078 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 674 [2018-11-10 08:52:41,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 985 states and 1599 transitions. [2018-11-10 08:52:41,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:52:41,078 INFO L705 BuchiCegarLoop]: Abstraction has 985 states and 1599 transitions. [2018-11-10 08:52:41,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states and 1599 transitions. [2018-11-10 08:52:41,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 810. [2018-11-10 08:52:41,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 810 states. [2018-11-10 08:52:41,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1319 transitions. [2018-11-10 08:52:41,092 INFO L728 BuchiCegarLoop]: Abstraction has 810 states and 1319 transitions. [2018-11-10 08:52:41,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:52:41,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:52:41,092 INFO L87 Difference]: Start difference. First operand 810 states and 1319 transitions. Second operand 3 states. [2018-11-10 08:52:41,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:52:41,158 INFO L93 Difference]: Finished difference Result 998 states and 1595 transitions. [2018-11-10 08:52:41,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:52:41,159 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 998 states and 1595 transitions. [2018-11-10 08:52:41,164 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 640 [2018-11-10 08:52:41,168 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 998 states to 998 states and 1595 transitions. [2018-11-10 08:52:41,169 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 672 [2018-11-10 08:52:41,169 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 672 [2018-11-10 08:52:41,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 998 states and 1595 transitions. [2018-11-10 08:52:41,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:52:41,170 INFO L705 BuchiCegarLoop]: Abstraction has 998 states and 1595 transitions. [2018-11-10 08:52:41,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states and 1595 transitions. [2018-11-10 08:52:41,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 995. [2018-11-10 08:52:41,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 995 states. [2018-11-10 08:52:41,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1592 transitions. [2018-11-10 08:52:41,185 INFO L728 BuchiCegarLoop]: Abstraction has 995 states and 1592 transitions. [2018-11-10 08:52:41,185 INFO L608 BuchiCegarLoop]: Abstraction has 995 states and 1592 transitions. [2018-11-10 08:52:41,185 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 08:52:41,185 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 995 states and 1592 transitions. [2018-11-10 08:52:41,189 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 638 [2018-11-10 08:52:41,189 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:52:41,189 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:52:41,190 INFO L866 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] [2018-11-10 08:52:41,190 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:52:41,190 INFO L793 eck$LassoCheckResult]: Stem: 7276#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~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; 7068#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 7069#L394 assume !(~c_req_up~0 == 1); 7071#L394-2 assume ~wl_i~0 == 1;~wl_st~0 := 0; 7236#L405-1 assume ~c1_i~0 == 1;~c1_st~0 := 0; 7237#L410-1 assume ~c2_i~0 == 1;~c2_st~0 := 0; 7268#L415-1 assume ~wb_i~0 == 1;~wb_st~0 := 0; 7044#L420-1 assume !(~r_i~0 == 1);~r_st~0 := 2; 7045#L425-1 assume !(~e_f~0 == 0); 7130#L430-1 assume !(~e_g~0 == 0); 7220#L435-1 assume !(~e_e~0 == 0); 7261#L440-1 assume !(~e_c~0 == 0); 7289#L445-1 assume !(~e_wl~0 == 0); 7106#L450-1 assume !(~wl_pc~0 == 1); 7107#L462 assume !(~wl_pc~0 == 2); 7089#L463 assume !(~c1_pc~0 == 1); 7244#L473 assume !(~c2_pc~0 == 1); 7091#L482 assume !(~wb_pc~0 == 1); 7186#L491 assume !(~e_c~0 == 1); 7187#L500-1 assume !(~e_e~0 == 1); 7100#L505-1 assume !(~e_f~0 == 1); 7101#L510-1 assume !(~e_g~0 == 1); 7197#L515-1 assume !(~e_c~0 == 1); 7248#L520-1 assume !(~e_wl~0 == 1); 7281#L662-1 assume true; 7517#L531 [2018-11-10 08:52:41,190 INFO L795 eck$LassoCheckResult]: Loop: 7517#L531 assume !false; 7935#L532 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;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; 7931#L367 assume true; 7929#L284-1 assume !false; 7928#L285 assume ~wl_st~0 == 0; 7923#L298-1 assume ~wl_st~0 == 0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 7920#L311 assume eval_~tmp~0 != 0;~wl_st~0 := 1;assume { :begin_inline_write_loop } true;havoc write_loop_~t~0;havoc write_loop_~t~0; 7198#L56 assume ~wl_pc~0 == 0; 7055#L69 ~wl_st~0 := 2;~wl_pc~0 := 1;~e_wl~0 := 0; 7245#L117 assume { :end_inline_write_loop } true; 7767#L307 assume !(~c1_st~0 == 0); 7762#L322 assume !(~c2_st~0 == 0); 7759#L337 assume !(~wb_st~0 == 0); 7622#L352 assume !(~r_st~0 == 0); 7620#L367 assume true; 7608#L284-1 assume !false; 7607#L285 assume !(~wl_st~0 == 0); 7604#L289 assume !(~c1_st~0 == 0); 7606#L292 assume !(~c2_st~0 == 0); 7660#L295 assume !(~wb_st~0 == 0); 7657#L298 assume !(~r_st~0 == 0); 7654#L383 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2; 7651#L538 assume !(~c_req_up~0 == 1); 7092#L538-2 start_simulation_~kernel_st~0 := 3; 7093#L550 assume ~e_f~0 == 0;~e_f~0 := 1; 7283#L550-2 assume ~e_g~0 == 0;~e_g~0 := 1; 7284#L555-1 assume ~e_e~0 == 0;~e_e~0 := 1; 7514#L560-1 assume !(~e_c~0 == 0); 7557#L565-1 assume ~e_wl~0 == 0;~e_wl~0 := 1; 7554#L570-1 assume ~wl_pc~0 == 1; 7555#L576 assume ~e_wl~0 == 1;~wl_st~0 := 0; 7550#L583 assume !(~c1_pc~0 == 1); 7963#L593 assume !(~c2_pc~0 == 1); 7959#L602 assume !(~wb_pc~0 == 1); 7956#L611 assume ~e_c~0 == 1;~r_st~0 := 0; 7955#L620-1 assume ~e_e~0 == 1;~e_e~0 := 2; 7952#L625-1 assume ~e_f~0 == 1;~e_f~0 := 2; 7950#L630-1 assume ~e_g~0 == 1;~e_g~0 := 2; 7948#L635-1 assume !(~e_c~0 == 1); 7942#L640-1 assume ~e_wl~0 == 1;~e_wl~0 := 2; 7941#L645-1 assume ~wl_st~0 == 0; 7939#L662-1 assume true; 7517#L531 [2018-11-10 08:52:41,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:52:41,191 INFO L82 PathProgramCache]: Analyzing trace with hash -666176969, now seen corresponding path program 1 times [2018-11-10 08:52:41,191 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:52:41,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:52:41,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:41,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:52:41,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:41,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:52:41,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:52:41,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:52:41,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1824537726, now seen corresponding path program 1 times [2018-11-10 08:52:41,203 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:52:41,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:52:41,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:41,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:52:41,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:41,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:52:41,237 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 08:52:41,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:52:41,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:52:41,237 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 08:52:41,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:52:41,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:52:41,238 INFO L87 Difference]: Start difference. First operand 995 states and 1592 transitions. cyclomatic complexity: 600 Second operand 3 states. [2018-11-10 08:52:41,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:52:41,278 INFO L93 Difference]: Finished difference Result 1169 states and 1904 transitions. [2018-11-10 08:52:41,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:52:41,278 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1169 states and 1904 transitions. [2018-11-10 08:52:41,284 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 692 [2018-11-10 08:52:41,288 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1169 states to 1117 states and 1806 transitions. [2018-11-10 08:52:41,289 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 740 [2018-11-10 08:52:41,289 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 740 [2018-11-10 08:52:41,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1117 states and 1806 transitions. [2018-11-10 08:52:41,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:52:41,290 INFO L705 BuchiCegarLoop]: Abstraction has 1117 states and 1806 transitions. [2018-11-10 08:52:41,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states and 1806 transitions. [2018-11-10 08:52:41,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 1117. [2018-11-10 08:52:41,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1117 states. [2018-11-10 08:52:41,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 1806 transitions. [2018-11-10 08:52:41,307 INFO L728 BuchiCegarLoop]: Abstraction has 1117 states and 1806 transitions. [2018-11-10 08:52:41,307 INFO L608 BuchiCegarLoop]: Abstraction has 1117 states and 1806 transitions. [2018-11-10 08:52:41,307 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 08:52:41,307 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1117 states and 1806 transitions. [2018-11-10 08:52:41,311 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 692 [2018-11-10 08:52:41,311 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:52:41,311 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:52:41,312 INFO L866 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] [2018-11-10 08:52:41,312 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:52:41,313 INFO L793 eck$LassoCheckResult]: Stem: 9449#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~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; 9239#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 9240#L394 assume !(~c_req_up~0 == 1); 9242#L394-2 assume ~wl_i~0 == 1;~wl_st~0 := 0; 9407#L405-1 assume ~c1_i~0 == 1;~c1_st~0 := 0; 9408#L410-1 assume ~c2_i~0 == 1;~c2_st~0 := 0; 9440#L415-1 assume ~wb_i~0 == 1;~wb_st~0 := 0; 9214#L420-1 assume !(~r_i~0 == 1);~r_st~0 := 2; 9215#L425-1 assume !(~e_f~0 == 0); 9300#L430-1 assume !(~e_g~0 == 0); 9389#L435-1 assume !(~e_e~0 == 0); 9433#L440-1 assume ~e_c~0 == 0;~e_c~0 := 1; 9461#L445-1 assume !(~e_wl~0 == 0); 9278#L450-1 assume !(~wl_pc~0 == 1); 9279#L462 assume !(~wl_pc~0 == 2); 9261#L463 assume !(~c1_pc~0 == 1); 9418#L473 assume !(~c2_pc~0 == 1); 9263#L482 assume !(~wb_pc~0 == 1); 9356#L491 assume ~e_c~0 == 1;~r_st~0 := 0; 9357#L500-1 assume !(~e_e~0 == 1); 9272#L505-1 assume !(~e_f~0 == 1); 9273#L510-1 assume !(~e_g~0 == 1); 9367#L515-1 assume ~e_c~0 == 1;~e_c~0 := 2; 9422#L520-1 assume !(~e_wl~0 == 1); 9454#L662-1 assume true; 9620#L531 [2018-11-10 08:52:41,313 INFO L795 eck$LassoCheckResult]: Loop: 9620#L531 assume !false; 10019#L532 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;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; 9836#L367 assume true; 9837#L284-1 assume !false; 9221#L285 assume ~wl_st~0 == 0; 9222#L298-1 assume ~wl_st~0 == 0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 9759#L311 assume eval_~tmp~0 != 0;~wl_st~0 := 1;assume { :begin_inline_write_loop } true;havoc write_loop_~t~0;havoc write_loop_~t~0; 10015#L56 assume ~wl_pc~0 == 0; 9226#L69 ~wl_st~0 := 2;~wl_pc~0 := 1;~e_wl~0 := 0; 9419#L117 assume { :end_inline_write_loop } true; 10227#L307 assume !(~c1_st~0 == 0); 10224#L322 assume !(~c2_st~0 == 0); 10220#L337 assume !(~wb_st~0 == 0); 10212#L352 assume !(~r_st~0 == 0); 9947#L367 assume true; 9948#L284-1 assume !false; 9943#L285 assume !(~wl_st~0 == 0); 9944#L289 assume !(~c1_st~0 == 0); 10235#L292 assume !(~c2_st~0 == 0); 10232#L295 assume !(~wb_st~0 == 0); 10233#L298 assume !(~r_st~0 == 0); 10234#L383 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2; 10290#L538 assume !(~c_req_up~0 == 1); 10288#L538-2 start_simulation_~kernel_st~0 := 3; 10287#L550 assume ~e_f~0 == 0;~e_f~0 := 1; 10285#L550-2 assume ~e_g~0 == 0;~e_g~0 := 1; 10282#L555-1 assume ~e_e~0 == 0;~e_e~0 := 1; 9339#L560-1 assume !(~e_c~0 == 0); 9340#L565-1 assume ~e_wl~0 == 0;~e_wl~0 := 1; 9926#L570-1 assume ~wl_pc~0 == 1; 10056#L576 assume ~e_wl~0 == 1;~wl_st~0 := 0; 10054#L583 assume !(~c1_pc~0 == 1); 10052#L593 assume !(~c2_pc~0 == 1); 10049#L602 assume !(~wb_pc~0 == 1); 10048#L611 assume !(~e_c~0 == 1); 10047#L620-1 assume ~e_e~0 == 1;~e_e~0 := 2; 10046#L625-1 assume ~e_f~0 == 1;~e_f~0 := 2; 10045#L630-1 assume ~e_g~0 == 1;~e_g~0 := 2; 10040#L635-1 assume !(~e_c~0 == 1); 10037#L640-1 assume ~e_wl~0 == 1;~e_wl~0 := 2; 10006#L645-1 assume ~wl_st~0 == 0; 10028#L662-1 assume true; 9620#L531 [2018-11-10 08:52:41,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:52:41,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1430069003, now seen corresponding path program 1 times [2018-11-10 08:52:41,313 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:52:41,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:52:41,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:41,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:52:41,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:41,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:52:41,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:52:41,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:52:41,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 08:52:41,347 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 08:52:41,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:52:41,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1661082944, now seen corresponding path program 1 times [2018-11-10 08:52:41,347 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:52:41,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:52:41,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:41,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:52:41,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:41,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:52:41,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:52:41,467 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2018-11-10 08:52:41,491 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 08:52:41,491 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 08:52:41,491 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 08:52:41,492 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 08:52:41,492 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 08:52:41,492 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:52:41,492 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 08:52:41,492 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 08:52:41,492 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy2_false-unreach-call_false-termination.cil.c_Iteration9_Loop [2018-11-10 08:52:41,492 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 08:52:41,492 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 08:52:41,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:41,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:41,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:41,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:41,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:41,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:41,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:41,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:41,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:41,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:41,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:41,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:41,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:41,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:41,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:41,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:41,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:41,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:41,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:41,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:41,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:41,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:41,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:41,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:41,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:41,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:41,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:41,647 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 08:52:41,647 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_295f97e4-925a-49b0-866d-3f21d6a563c8/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:52:41,650 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:52:41,650 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_295f97e4-925a-49b0-866d-3f21d6a563c8/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:52:41,671 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 08:52:41,671 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:52:41,674 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 08:52:41,689 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 08:52:41,689 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 08:52:41,689 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 08:52:41,689 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 08:52:41,689 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 08:52:41,689 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:52:41,689 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 08:52:41,689 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 08:52:41,689 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy2_false-unreach-call_false-termination.cil.c_Iteration9_Loop [2018-11-10 08:52:41,689 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 08:52:41,690 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 08:52:41,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:41,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:41,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:41,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:41,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:41,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:41,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:41,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:41,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:41,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:41,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:41,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:41,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:41,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:41,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:41,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:41,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:41,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:41,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:41,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:41,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:41,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:41,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:41,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:41,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:41,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:41,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:41,828 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 08:52:41,828 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 08:52:41,828 INFO L122 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 [2018-11-10 08:52:41,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:52:41,829 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:52:41,829 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:52:41,829 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:52:41,829 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:52:41,829 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:52:41,829 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:52:41,830 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:52:41,830 INFO L122 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 [2018-11-10 08:52:41,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:52:41,831 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:52:41,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:52:41,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:52:41,831 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:52:41,831 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:52:41,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:52:41,833 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 08:52:41,835 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 08:52:41,835 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 08:52:41,835 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 08:52:41,835 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 08:52:41,835 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 08:52:41,835 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_f~0) = -1*~e_f~0 + 1 Supporting invariants [] [2018-11-10 08:52:41,836 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 08:52:41,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:52:41,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:52:41,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:52:41,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:52:41,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:52:41,909 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 08:52:41,909 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 [2018-11-10 08:52:41,909 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1117 states and 1806 transitions. cyclomatic complexity: 692 Second operand 5 states. [2018-11-10 08:52:41,946 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1117 states and 1806 transitions. cyclomatic complexity: 692. Second operand 5 states. Result 3238 states and 5243 transitions. Complement of second has 5 states. [2018-11-10 08:52:41,947 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 [2018-11-10 08:52:41,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 08:52:41,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 213 transitions. [2018-11-10 08:52:41,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 213 transitions. Stem has 25 letters. Loop has 42 letters. [2018-11-10 08:52:41,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:52:41,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 213 transitions. Stem has 67 letters. Loop has 42 letters. [2018-11-10 08:52:41,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:52:41,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 213 transitions. Stem has 25 letters. Loop has 84 letters. [2018-11-10 08:52:41,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:52:41,949 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3238 states and 5243 transitions. [2018-11-10 08:52:41,961 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1342 [2018-11-10 08:52:41,971 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3238 states to 3208 states and 5207 transitions. [2018-11-10 08:52:41,972 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1415 [2018-11-10 08:52:41,973 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1432 [2018-11-10 08:52:41,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3208 states and 5207 transitions. [2018-11-10 08:52:41,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:52:41,973 INFO L705 BuchiCegarLoop]: Abstraction has 3208 states and 5207 transitions. [2018-11-10 08:52:41,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3208 states and 5207 transitions. [2018-11-10 08:52:42,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3208 to 3152. [2018-11-10 08:52:42,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3152 states. [2018-11-10 08:52:42,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3152 states to 3152 states and 5140 transitions. [2018-11-10 08:52:42,023 INFO L728 BuchiCegarLoop]: Abstraction has 3152 states and 5140 transitions. [2018-11-10 08:52:42,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 08:52:42,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 08:52:42,024 INFO L87 Difference]: Start difference. First operand 3152 states and 5140 transitions. Second operand 4 states. [2018-11-10 08:52:42,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:52:42,110 INFO L93 Difference]: Finished difference Result 4348 states and 6974 transitions. [2018-11-10 08:52:42,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 08:52:42,111 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4348 states and 6974 transitions. [2018-11-10 08:52:42,123 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 1664 [2018-11-10 08:52:42,135 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4348 states to 4348 states and 6974 transitions. [2018-11-10 08:52:42,135 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1760 [2018-11-10 08:52:42,136 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1760 [2018-11-10 08:52:42,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4348 states and 6974 transitions. [2018-11-10 08:52:42,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:52:42,136 INFO L705 BuchiCegarLoop]: Abstraction has 4348 states and 6974 transitions. [2018-11-10 08:52:42,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4348 states and 6974 transitions. [2018-11-10 08:52:42,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4348 to 3696. [2018-11-10 08:52:42,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3696 states. [2018-11-10 08:52:42,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3696 states to 3696 states and 5961 transitions. [2018-11-10 08:52:42,172 INFO L728 BuchiCegarLoop]: Abstraction has 3696 states and 5961 transitions. [2018-11-10 08:52:42,173 INFO L608 BuchiCegarLoop]: Abstraction has 3696 states and 5961 transitions. [2018-11-10 08:52:42,173 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-10 08:52:42,173 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3696 states and 5961 transitions. [2018-11-10 08:52:42,180 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1366 [2018-11-10 08:52:42,180 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:52:42,181 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:52:42,181 INFO L866 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] [2018-11-10 08:52:42,181 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:52:42,181 INFO L793 eck$LassoCheckResult]: Stem: 21543#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~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; 21317#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 21318#L394 assume !(~c_req_up~0 == 1); 21320#L394-2 assume ~wl_i~0 == 1;~wl_st~0 := 0; 21491#L405-1 assume ~c1_i~0 == 1;~c1_st~0 := 0; 21492#L410-1 assume ~c2_i~0 == 1;~c2_st~0 := 0; 21569#L415-1 assume ~wb_i~0 == 1;~wb_st~0 := 0; 21570#L420-1 assume !(~r_i~0 == 1);~r_st~0 := 2; 21378#L425-1 assume !(~e_f~0 == 0); 21379#L430-1 assume !(~e_g~0 == 0); 21469#L435-1 assume !(~e_e~0 == 0); 21560#L440-1 assume !(~e_c~0 == 0); 21561#L445-1 assume !(~e_wl~0 == 0); 21356#L450-1 assume !(~wl_pc~0 == 1); 21357#L462 assume !(~wl_pc~0 == 2); 21503#L463 assume !(~c1_pc~0 == 1); 21502#L473 assume !(~c2_pc~0 == 1); 21504#L482 assume !(~wb_pc~0 == 1); 21505#L491 assume ~e_c~0 == 1;~r_st~0 := 0; 21438#L500-1 assume !(~e_e~0 == 1); 21343#L505-1 assume !(~e_f~0 == 1); 21344#L510-1 assume !(~e_g~0 == 1); 21449#L515-1 assume ~e_c~0 == 1;~e_c~0 := 2; 21507#L520-1 assume !(~e_wl~0 == 1); 21827#L662-1 assume true; 21828#L531 assume !false; 23597#L532 [2018-11-10 08:52:42,182 INFO L795 eck$LassoCheckResult]: Loop: 23597#L532 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;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; 21458#L367 assume true; 21459#L284-1 assume !false; 21300#L285 assume ~wl_st~0 == 0; 21301#L298-1 assume ~wl_st~0 == 0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 21539#L311 assume eval_~tmp~0 != 0;~wl_st~0 := 1;assume { :begin_inline_write_loop } true;havoc write_loop_~t~0;havoc write_loop_~t~0; 21450#L56 assume ~wl_pc~0 == 0; 21305#L69 ~wl_st~0 := 2;~wl_pc~0 := 1;~e_wl~0 := 0; 21372#L117 assume { :end_inline_write_loop } true; 21373#L307 assume !(~c1_st~0 == 0); 24734#L322 assume !(~c2_st~0 == 0); 24726#L337 assume !(~wb_st~0 == 0); 24718#L352 assume !(~r_st~0 == 0); 21443#L367 assume true; 23736#L284-1 assume !false; 24616#L285 assume !(~wl_st~0 == 0); 24615#L289 assume !(~c1_st~0 == 0); 24614#L292 assume !(~c2_st~0 == 0); 24612#L295 assume !(~wb_st~0 == 0); 24609#L298 assume !(~r_st~0 == 0); 24606#L383 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2; 24252#L538 assume !(~c_req_up~0 == 1); 24253#L538-2 start_simulation_~kernel_st~0 := 3; 24772#L550 assume !(~e_f~0 == 0); 24771#L550-2 assume ~e_g~0 == 0;~e_g~0 := 1; 24770#L555-1 assume ~e_e~0 == 0;~e_e~0 := 1; 24769#L560-1 assume !(~e_c~0 == 0); 24768#L565-1 assume ~e_wl~0 == 0;~e_wl~0 := 1; 24767#L570-1 assume ~wl_pc~0 == 1; 24765#L576 assume ~e_wl~0 == 1;~wl_st~0 := 0; 24762#L583 assume !(~c1_pc~0 == 1); 24760#L593 assume !(~c2_pc~0 == 1); 24736#L602 assume !(~wb_pc~0 == 1); 24727#L611 assume !(~e_c~0 == 1); 24719#L620-1 assume ~e_e~0 == 1;~e_e~0 := 2; 24712#L625-1 assume !(~e_f~0 == 1); 24619#L630-1 assume ~e_g~0 == 1;~e_g~0 := 2; 24618#L635-1 assume !(~e_c~0 == 1); 24613#L640-1 assume ~e_wl~0 == 1;~e_wl~0 := 2; 21369#L645-1 assume ~wl_st~0 == 0; 21431#L662-1 assume true; 24983#L531 assume !false; 23597#L532 [2018-11-10 08:52:42,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:52:42,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1632637665, now seen corresponding path program 1 times [2018-11-10 08:52:42,182 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:52:42,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:52:42,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:42,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:52:42,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:42,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:52:42,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:52:42,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:52:42,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:52:42,230 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 08:52:42,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:52:42,230 INFO L82 PathProgramCache]: Analyzing trace with hash -222958810, now seen corresponding path program 1 times [2018-11-10 08:52:42,230 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:52:42,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:52:42,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:42,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:52:42,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:42,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:52:42,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:52:42,358 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 08:52:42,358 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 08:52:42,358 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 08:52:42,358 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 08:52:42,358 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 08:52:42,358 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:52:42,358 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 08:52:42,359 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 08:52:42,359 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy2_false-unreach-call_false-termination.cil.c_Iteration10_Loop [2018-11-10 08:52:42,359 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 08:52:42,359 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 08:52:42,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:42,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:42,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:42,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:42,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:42,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:42,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:42,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:42,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:42,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:42,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:42,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:42,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:42,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:42,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:42,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:42,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:42,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:42,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:42,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:42,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:42,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:42,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:42,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:42,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:42,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:42,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:42,539 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 08:52:42,539 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_295f97e4-925a-49b0-866d-3f21d6a563c8/bin-2019/uautomizer/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:52:42,544 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:52:42,544 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:52:42,546 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:52:42,546 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c1_st~0=-8} Honda state: {~c1_st~0=-8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_295f97e4-925a-49b0-866d-3f21d6a563c8/bin-2019/uautomizer/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 [2018-11-10 08:52:42,564 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:52:42,564 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_295f97e4-925a-49b0-866d-3f21d6a563c8/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:52:42,584 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 08:52:42,585 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:52:42,587 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 08:52:42,611 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 08:52:42,611 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 08:52:42,611 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 08:52:42,611 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 08:52:42,612 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 08:52:42,612 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:52:42,612 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 08:52:42,612 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 08:52:42,612 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy2_false-unreach-call_false-termination.cil.c_Iteration10_Loop [2018-11-10 08:52:42,612 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 08:52:42,612 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 08:52:42,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:42,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:42,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:42,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:42,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:42,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:42,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:42,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:42,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:42,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:42,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:42,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:42,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:42,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:42,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:42,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:42,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:42,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:42,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:42,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:42,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:42,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:42,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:42,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:42,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:42,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:42,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:52:42,785 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 08:52:42,785 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 08:52:42,786 INFO L122 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 [2018-11-10 08:52:42,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:52:42,786 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:52:42,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:52:42,786 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 08:52:42,787 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:52:42,787 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 08:52:42,787 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:52:42,788 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:52:42,788 INFO L122 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 [2018-11-10 08:52:42,788 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:52:42,788 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:52:42,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:52:42,789 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:52:42,789 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:52:42,789 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:52:42,789 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:52:42,790 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 08:52:42,791 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 08:52:42,791 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 08:52:42,792 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 08:52:42,792 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 08:52:42,792 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 08:52:42,792 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(~wl_pc~0) = -2*~wl_pc~0 + 1 Supporting invariants [] [2018-11-10 08:52:42,792 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 08:52:42,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:52:42,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:52:42,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:52:42,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:52:42,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:52:42,855 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:52:42,855 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 [2018-11-10 08:52:42,856 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3696 states and 5961 transitions. cyclomatic complexity: 2276 Second operand 5 states. [2018-11-10 08:52:42,947 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3696 states and 5961 transitions. cyclomatic complexity: 2276. Second operand 5 states. Result 9679 states and 15608 transitions. Complement of second has 7 states. [2018-11-10 08:52:42,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 08:52:42,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 08:52:42,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 219 transitions. [2018-11-10 08:52:42,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 219 transitions. Stem has 26 letters. Loop has 42 letters. [2018-11-10 08:52:42,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:52:42,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 219 transitions. Stem has 68 letters. Loop has 42 letters. [2018-11-10 08:52:42,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:52:42,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 219 transitions. Stem has 26 letters. Loop has 84 letters. [2018-11-10 08:52:42,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:52:42,950 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9679 states and 15608 transitions. [2018-11-10 08:52:43,010 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 1926 [2018-11-10 08:52:43,048 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9679 states to 9575 states and 15468 transitions. [2018-11-10 08:52:43,048 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2179 [2018-11-10 08:52:43,050 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2182 [2018-11-10 08:52:43,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9575 states and 15468 transitions. [2018-11-10 08:52:43,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:52:43,051 INFO L705 BuchiCegarLoop]: Abstraction has 9575 states and 15468 transitions. [2018-11-10 08:52:43,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9575 states and 15468 transitions. [2018-11-10 08:52:43,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9575 to 9477. [2018-11-10 08:52:43,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9477 states. [2018-11-10 08:52:43,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9477 states to 9477 states and 15330 transitions. [2018-11-10 08:52:43,183 INFO L728 BuchiCegarLoop]: Abstraction has 9477 states and 15330 transitions. [2018-11-10 08:52:43,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:52:43,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:52:43,183 INFO L87 Difference]: Start difference. First operand 9477 states and 15330 transitions. Second operand 3 states. [2018-11-10 08:52:43,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:52:43,272 INFO L93 Difference]: Finished difference Result 10395 states and 16719 transitions. [2018-11-10 08:52:43,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:52:43,274 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10395 states and 16719 transitions. [2018-11-10 08:52:43,307 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 2131 [2018-11-10 08:52:43,341 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10395 states to 10395 states and 16719 transitions. [2018-11-10 08:52:43,341 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2345 [2018-11-10 08:52:43,343 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2345 [2018-11-10 08:52:43,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10395 states and 16719 transitions. [2018-11-10 08:52:43,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:52:43,344 INFO L705 BuchiCegarLoop]: Abstraction has 10395 states and 16719 transitions. [2018-11-10 08:52:43,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10395 states and 16719 transitions. [2018-11-10 08:52:43,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10395 to 9691. [2018-11-10 08:52:43,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9691 states. [2018-11-10 08:52:43,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9691 states to 9691 states and 15658 transitions. [2018-11-10 08:52:43,473 INFO L728 BuchiCegarLoop]: Abstraction has 9691 states and 15658 transitions. [2018-11-10 08:52:43,473 INFO L608 BuchiCegarLoop]: Abstraction has 9691 states and 15658 transitions. [2018-11-10 08:52:43,473 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-10 08:52:43,474 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9691 states and 15658 transitions. [2018-11-10 08:52:43,494 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 1926 [2018-11-10 08:52:43,495 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:52:43,495 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:52:43,495 INFO L866 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, 1] [2018-11-10 08:52:43,495 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:52:43,495 INFO L793 eck$LassoCheckResult]: Stem: 55012#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~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; 54794#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 54795#L394 assume !(~c_req_up~0 == 1); 54797#L394-2 assume ~wl_i~0 == 1;~wl_st~0 := 0; 54962#L405-1 assume ~c1_i~0 == 1;~c1_st~0 := 0; 54963#L410-1 assume ~c2_i~0 == 1;~c2_st~0 := 0; 55034#L415-1 assume ~wb_i~0 == 1;~wb_st~0 := 0; 55035#L420-1 assume !(~r_i~0 == 1);~r_st~0 := 2; 54859#L425-1 assume !(~e_f~0 == 0); 54860#L430-1 assume !(~e_g~0 == 0); 54946#L435-1 assume !(~e_e~0 == 0); 55024#L440-1 assume !(~e_c~0 == 0); 55025#L445-1 assume !(~e_wl~0 == 0); 55081#L450-1 assume !(~wl_pc~0 == 1); 55077#L462 assume !(~wl_pc~0 == 2); 55074#L463 assume !(~c1_pc~0 == 1); 55071#L473 assume !(~c2_pc~0 == 1); 55067#L482 assume !(~wb_pc~0 == 1); 54913#L491 assume !(~e_c~0 == 1); 54914#L500-1 assume !(~e_e~0 == 1); 54826#L505-1 assume ~e_f~0 == 1;~e_f~0 := 2; 54827#L510-1 assume !(~e_g~0 == 1); 54979#L515-1 assume !(~e_c~0 == 1); 54980#L520-1 assume !(~e_wl~0 == 1); 55015#L662-1 assume true; 58190#L531 assume !false; 58184#L532 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;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; 55103#L367 [2018-11-10 08:52:43,496 INFO L795 eck$LassoCheckResult]: Loop: 55103#L367 assume true; 55102#L284-1 assume !false; 55101#L285 assume ~wl_st~0 == 0; 55100#L298-1 assume ~wl_st~0 == 0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 55005#L311 assume !(eval_~tmp~0 != 0); 55006#L307 assume !(~c1_st~0 == 0); 55117#L322 assume !(~c2_st~0 == 0); 55112#L337 assume !(~wb_st~0 == 0); 55106#L352 assume !(~r_st~0 == 0); 55103#L367 [2018-11-10 08:52:43,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:52:43,496 INFO L82 PathProgramCache]: Analyzing trace with hash -2020941705, now seen corresponding path program 1 times [2018-11-10 08:52:43,496 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:52:43,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:52:43,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:43,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:52:43,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:43,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:52:43,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:52:43,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:52:43,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 08:52:43,539 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 08:52:43,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:52:43,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1559341301, now seen corresponding path program 1 times [2018-11-10 08:52:43,539 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:52:43,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:52:43,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:43,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:52:43,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:43,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:52:43,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:52:43,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 08:52:43,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 08:52:43,579 INFO L87 Difference]: Start difference. First operand 9691 states and 15658 transitions. cyclomatic complexity: 6022 Second operand 4 states. [2018-11-10 08:52:43,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:52:43,763 INFO L93 Difference]: Finished difference Result 13170 states and 21040 transitions. [2018-11-10 08:52:43,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 08:52:43,765 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13170 states and 21040 transitions. [2018-11-10 08:52:43,810 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 2650 [2018-11-10 08:52:43,849 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13170 states to 12290 states and 19706 transitions. [2018-11-10 08:52:43,849 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3229 [2018-11-10 08:52:43,852 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3229 [2018-11-10 08:52:43,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12290 states and 19706 transitions. [2018-11-10 08:52:43,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:52:43,855 INFO L705 BuchiCegarLoop]: Abstraction has 12290 states and 19706 transitions. [2018-11-10 08:52:43,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12290 states and 19706 transitions. [2018-11-10 08:52:43,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12290 to 11110. [2018-11-10 08:52:43,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11110 states. [2018-11-10 08:52:43,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11110 states to 11110 states and 17882 transitions. [2018-11-10 08:52:43,981 INFO L728 BuchiCegarLoop]: Abstraction has 11110 states and 17882 transitions. [2018-11-10 08:52:43,981 INFO L608 BuchiCegarLoop]: Abstraction has 11110 states and 17882 transitions. [2018-11-10 08:52:43,982 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-10 08:52:43,982 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11110 states and 17882 transitions. [2018-11-10 08:52:44,006 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 2090 [2018-11-10 08:52:44,006 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:52:44,006 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:52:44,007 INFO L866 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, 1] [2018-11-10 08:52:44,007 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:52:44,007 INFO L793 eck$LassoCheckResult]: Stem: 77895#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~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; 77667#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 77668#L394 assume !(~c_req_up~0 == 1); 77859#L394-2 assume ~wl_i~0 == 1;~wl_st~0 := 0; 77842#L405-1 assume ~c1_i~0 == 1;~c1_st~0 := 0; 77843#L410-1 assume ~c2_i~0 == 1;~c2_st~0 := 0; 78001#L415-1 assume ~wb_i~0 == 1;~wb_st~0 := 0; 78000#L420-1 assume !(~r_i~0 == 1);~r_st~0 := 2; 77732#L425-1 assume !(~e_f~0 == 0); 77733#L430-1 assume !(~e_g~0 == 0); 77871#L435-1 assume !(~e_e~0 == 0); 77872#L440-1 assume !(~e_c~0 == 0); 77910#L445-1 assume !(~e_wl~0 == 0); 77981#L450-1 assume !(~wl_pc~0 == 1); 77974#L462 assume !(~wl_pc~0 == 2); 77969#L463 assume !(~c1_pc~0 == 1); 77963#L473 assume !(~c2_pc~0 == 1); 77957#L482 assume !(~wb_pc~0 == 1); 77951#L491 assume !(~e_c~0 == 1); 77948#L500-1 assume !(~e_e~0 == 1); 77945#L505-1 assume !(~e_f~0 == 1); 77942#L510-1 assume !(~e_g~0 == 1); 77856#L515-1 assume !(~e_c~0 == 1); 77857#L520-1 assume !(~e_wl~0 == 1); 79164#L662-1 assume true; 79157#L531 assume !false; 79159#L532 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;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; 78018#L367 [2018-11-10 08:52:44,007 INFO L795 eck$LassoCheckResult]: Loop: 78018#L367 assume true; 78071#L284-1 assume !false; 78070#L285 assume ~wl_st~0 == 0; 78069#L298-1 assume ~wl_st~0 == 0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 78067#L311 assume !(eval_~tmp~0 != 0); 78066#L307 assume !(~c1_st~0 == 0); 78033#L322 assume !(~c2_st~0 == 0); 78031#L337 assume !(~wb_st~0 == 0); 78016#L352 assume !(~r_st~0 == 0); 78018#L367 [2018-11-10 08:52:44,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:52:44,007 INFO L82 PathProgramCache]: Analyzing trace with hash -245934343, now seen corresponding path program 1 times [2018-11-10 08:52:44,008 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:52:44,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:52:44,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:44,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:52:44,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:44,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:52:44,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:52:44,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:52:44,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1559341301, now seen corresponding path program 2 times [2018-11-10 08:52:44,019 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:52:44,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:52:44,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:44,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:52:44,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:44,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:52:44,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:52:44,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:52:44,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1765976301, now seen corresponding path program 1 times [2018-11-10 08:52:44,023 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:52:44,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:52:44,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:44,024 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:52:44,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:44,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:52:44,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:52:44,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:52:44,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:52:44,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:52:44,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:52:44,076 INFO L87 Difference]: Start difference. First operand 11110 states and 17882 transitions. cyclomatic complexity: 6827 Second operand 3 states. [2018-11-10 08:52:44,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:52:44,162 INFO L93 Difference]: Finished difference Result 17836 states and 28360 transitions. [2018-11-10 08:52:44,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:52:44,164 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17836 states and 28360 transitions. [2018-11-10 08:52:44,289 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 3248 [2018-11-10 08:52:44,336 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17836 states to 17836 states and 28360 transitions. [2018-11-10 08:52:44,336 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3974 [2018-11-10 08:52:44,339 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3974 [2018-11-10 08:52:44,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17836 states and 28360 transitions. [2018-11-10 08:52:44,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:52:44,340 INFO L705 BuchiCegarLoop]: Abstraction has 17836 states and 28360 transitions. [2018-11-10 08:52:44,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17836 states and 28360 transitions. [2018-11-10 08:52:44,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17836 to 17836. [2018-11-10 08:52:44,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17836 states. [2018-11-10 08:52:44,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17836 states to 17836 states and 28360 transitions. [2018-11-10 08:52:44,493 INFO L728 BuchiCegarLoop]: Abstraction has 17836 states and 28360 transitions. [2018-11-10 08:52:44,493 INFO L608 BuchiCegarLoop]: Abstraction has 17836 states and 28360 transitions. [2018-11-10 08:52:44,493 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-10 08:52:44,493 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17836 states and 28360 transitions. [2018-11-10 08:52:44,530 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 3248 [2018-11-10 08:52:44,531 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:52:44,531 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:52:44,531 INFO L866 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, 1] [2018-11-10 08:52:44,531 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:52:44,531 INFO L793 eck$LassoCheckResult]: Stem: 106856#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~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; 106621#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 106622#L394 assume !(~c_req_up~0 == 1); 106818#L394-2 assume ~wl_i~0 == 1;~wl_st~0 := 0; 106949#L405-1 assume ~c1_i~0 == 1;~c1_st~0 := 0; 106840#L410-1 assume ~c2_i~0 == 1;~c2_st~0 := 0; 106841#L415-1 assume ~wb_i~0 == 1;~wb_st~0 := 0; 106595#L420-1 assume !(~r_i~0 == 1);~r_st~0 := 2; 106596#L425-1 assume !(~e_f~0 == 0); 106684#L430-1 assume !(~e_g~0 == 0); 106830#L435-1 assume !(~e_e~0 == 0); 106831#L440-1 assume !(~e_c~0 == 0); 106870#L445-1 assume !(~e_wl~0 == 0); 106937#L450-1 assume !(~wl_pc~0 == 1); 106930#L462 assume !(~wl_pc~0 == 2); 106925#L463 assume !(~c1_pc~0 == 1); 106919#L473 assume !(~c2_pc~0 == 1); 106913#L482 assume !(~wb_pc~0 == 1); 106907#L491 assume !(~e_c~0 == 1); 106903#L500-1 assume !(~e_e~0 == 1); 106900#L505-1 assume !(~e_f~0 == 1); 106897#L510-1 assume !(~e_g~0 == 1); 106815#L515-1 assume !(~e_c~0 == 1); 106816#L520-1 assume !(~e_wl~0 == 1); 106860#L662-1 assume true; 108697#L531 assume !false; 108232#L532 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;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; 107021#L367 [2018-11-10 08:52:44,531 INFO L795 eck$LassoCheckResult]: Loop: 107021#L367 assume true; 107123#L284-1 assume !false; 107122#L285 assume ~wl_st~0 == 0; 107011#L298-1 assume ~wl_st~0 == 0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 107012#L311 assume !(eval_~tmp~0 != 0); 107109#L307 assume ~c1_st~0 == 0;eval_~tmp___0~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 107106#L326 assume !(eval_~tmp___0~0 != 0); 107089#L322 assume !(~c2_st~0 == 0); 106981#L337 assume !(~wb_st~0 == 0); 106978#L352 assume !(~r_st~0 == 0); 107021#L367 [2018-11-10 08:52:44,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:52:44,532 INFO L82 PathProgramCache]: Analyzing trace with hash -245934343, now seen corresponding path program 2 times [2018-11-10 08:52:44,532 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:52:44,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:52:44,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:44,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:52:44,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:44,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:52:44,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:52:44,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:52:44,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1147620883, now seen corresponding path program 1 times [2018-11-10 08:52:44,541 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:52:44,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:52:44,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:44,542 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:52:44,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:44,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:52:44,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:52:44,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:52:44,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1036628709, now seen corresponding path program 1 times [2018-11-10 08:52:44,545 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:52:44,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:52:44,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:44,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:52:44,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:44,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:52:44,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:52:44,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:52:44,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:52:44,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:52:44,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:52:44,592 INFO L87 Difference]: Start difference. First operand 17836 states and 28360 transitions. cyclomatic complexity: 10579 Second operand 3 states. [2018-11-10 08:52:44,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:52:44,721 INFO L93 Difference]: Finished difference Result 28806 states and 45105 transitions. [2018-11-10 08:52:44,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:52:44,723 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28806 states and 45105 transitions. [2018-11-10 08:52:44,789 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 5124 [2018-11-10 08:52:44,875 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28806 states to 28806 states and 45105 transitions. [2018-11-10 08:52:44,875 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6508 [2018-11-10 08:52:44,880 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6508 [2018-11-10 08:52:44,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28806 states and 45105 transitions. [2018-11-10 08:52:44,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:52:44,881 INFO L705 BuchiCegarLoop]: Abstraction has 28806 states and 45105 transitions. [2018-11-10 08:52:44,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28806 states and 45105 transitions. [2018-11-10 08:52:45,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28806 to 28806. [2018-11-10 08:52:45,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28806 states. [2018-11-10 08:52:45,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28806 states to 28806 states and 45105 transitions. [2018-11-10 08:52:45,268 INFO L728 BuchiCegarLoop]: Abstraction has 28806 states and 45105 transitions. [2018-11-10 08:52:45,269 INFO L608 BuchiCegarLoop]: Abstraction has 28806 states and 45105 transitions. [2018-11-10 08:52:45,269 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-10 08:52:45,269 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28806 states and 45105 transitions. [2018-11-10 08:52:45,306 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 5124 [2018-11-10 08:52:45,306 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:52:45,306 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:52:45,307 INFO L866 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, 1] [2018-11-10 08:52:45,307 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:52:45,307 INFO L793 eck$LassoCheckResult]: Stem: 153506#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~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; 153271#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 153272#L394 assume !(~c_req_up~0 == 1); 153455#L394-2 assume ~wl_i~0 == 1;~wl_st~0 := 0; 153456#L405-1 assume ~c1_i~0 == 1;~c1_st~0 := 0; 153492#L410-1 assume !(~c2_i~0 == 1);~c2_st~0 := 2; 153493#L415-1 assume ~wb_i~0 == 1;~wb_st~0 := 0; 153245#L420-1 assume !(~r_i~0 == 1);~r_st~0 := 2; 153246#L425-1 assume !(~e_f~0 == 0); 153596#L430-1 assume !(~e_g~0 == 0); 153595#L435-1 assume !(~e_e~0 == 0); 153593#L440-1 assume !(~e_c~0 == 0); 153594#L445-1 assume !(~e_wl~0 == 0); 153590#L450-1 assume !(~wl_pc~0 == 1); 153586#L462 assume !(~wl_pc~0 == 2); 153587#L463 assume !(~c1_pc~0 == 1); 153582#L473 assume !(~c2_pc~0 == 1); 153581#L482 assume !(~wb_pc~0 == 1); 160074#L491 assume !(~e_c~0 == 1); 153570#L500-1 assume !(~e_e~0 == 1); 153571#L505-1 assume !(~e_f~0 == 1); 153561#L510-1 assume !(~e_g~0 == 1); 153562#L515-1 assume !(~e_c~0 == 1); 160072#L520-1 assume !(~e_wl~0 == 1); 160069#L662-1 assume true; 160070#L531 assume !false; 162588#L532 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;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; 156169#L367 [2018-11-10 08:52:45,307 INFO L795 eck$LassoCheckResult]: Loop: 156169#L367 assume true; 156167#L284-1 assume !false; 156165#L285 assume ~wl_st~0 == 0; 156163#L298-1 assume ~wl_st~0 == 0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 156161#L311 assume !(eval_~tmp~0 != 0); 156160#L307 assume ~c1_st~0 == 0;eval_~tmp___0~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 156142#L326 assume !(eval_~tmp___0~0 != 0); 156159#L322 assume !(~c2_st~0 == 0); 156185#L337 assume !(~wb_st~0 == 0); 156174#L352 assume !(~r_st~0 == 0); 156169#L367 [2018-11-10 08:52:45,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:52:45,307 INFO L82 PathProgramCache]: Analyzing trace with hash -27079625, now seen corresponding path program 1 times [2018-11-10 08:52:45,307 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:52:45,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:52:45,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:45,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:52:45,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:45,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:52:45,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:52:45,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:52:45,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:52:45,328 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 08:52:45,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:52:45,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1147620883, now seen corresponding path program 2 times [2018-11-10 08:52:45,329 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:52:45,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:52:45,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:45,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:52:45,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:45,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:52:45,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:52:45,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:52:45,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:52:45,370 INFO L87 Difference]: Start difference. First operand 28806 states and 45105 transitions. cyclomatic complexity: 16354 Second operand 3 states. [2018-11-10 08:52:45,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:52:45,421 INFO L93 Difference]: Finished difference Result 28701 states and 44924 transitions. [2018-11-10 08:52:45,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:52:45,422 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28701 states and 44924 transitions. [2018-11-10 08:52:45,480 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 5124 [2018-11-10 08:52:45,548 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28701 states to 28701 states and 44924 transitions. [2018-11-10 08:52:45,548 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6410 [2018-11-10 08:52:45,553 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6410 [2018-11-10 08:52:45,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28701 states and 44924 transitions. [2018-11-10 08:52:45,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:52:45,554 INFO L705 BuchiCegarLoop]: Abstraction has 28701 states and 44924 transitions. [2018-11-10 08:52:45,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28701 states and 44924 transitions. [2018-11-10 08:52:45,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28701 to 28701. [2018-11-10 08:52:45,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28701 states. [2018-11-10 08:52:45,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28701 states to 28701 states and 44924 transitions. [2018-11-10 08:52:45,798 INFO L728 BuchiCegarLoop]: Abstraction has 28701 states and 44924 transitions. [2018-11-10 08:52:45,798 INFO L608 BuchiCegarLoop]: Abstraction has 28701 states and 44924 transitions. [2018-11-10 08:52:45,798 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-10 08:52:45,798 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28701 states and 44924 transitions. [2018-11-10 08:52:45,850 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 5124 [2018-11-10 08:52:45,850 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:52:45,850 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:52:45,851 INFO L866 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, 1] [2018-11-10 08:52:45,851 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:52:45,851 INFO L793 eck$LassoCheckResult]: Stem: 211022#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~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; 210785#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 210786#L394 assume !(~c_req_up~0 == 1); 210979#L394-2 assume ~wl_i~0 == 1;~wl_st~0 := 0; 211125#L405-1 assume ~c1_i~0 == 1;~c1_st~0 := 0; 211006#L410-1 assume ~c2_i~0 == 1;~c2_st~0 := 0; 211007#L415-1 assume ~wb_i~0 == 1;~wb_st~0 := 0; 210758#L420-1 assume !(~r_i~0 == 1);~r_st~0 := 2; 210759#L425-1 assume !(~e_f~0 == 0); 210848#L430-1 assume !(~e_g~0 == 0); 210993#L435-1 assume !(~e_e~0 == 0); 210994#L440-1 assume !(~e_c~0 == 0); 211036#L445-1 assume !(~e_wl~0 == 0); 211113#L450-1 assume !(~wl_pc~0 == 1); 211106#L462 assume !(~wl_pc~0 == 2); 211101#L463 assume !(~c1_pc~0 == 1); 211095#L473 assume !(~c2_pc~0 == 1); 211089#L482 assume !(~wb_pc~0 == 1); 211083#L491 assume !(~e_c~0 == 1); 211079#L500-1 assume !(~e_e~0 == 1); 211076#L505-1 assume !(~e_f~0 == 1); 211073#L510-1 assume !(~e_g~0 == 1); 210977#L515-1 assume !(~e_c~0 == 1); 210978#L520-1 assume !(~e_wl~0 == 1); 215151#L662-1 assume true; 215152#L531 assume !false; 223705#L532 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;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; 223706#L367 [2018-11-10 08:52:45,851 INFO L795 eck$LassoCheckResult]: Loop: 223706#L367 assume true; 225877#L284-1 assume !false; 225874#L285 assume ~wl_st~0 == 0; 225872#L298-1 assume ~wl_st~0 == 0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 211014#L311 assume !(eval_~tmp~0 != 0); 211015#L307 assume ~c1_st~0 == 0;eval_~tmp___0~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 216655#L326 assume !(eval_~tmp___0~0 != 0); 216654#L322 assume ~c2_st~0 == 0;eval_~tmp___1~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 216615#L341 assume !(eval_~tmp___1~0 != 0); 216651#L337 assume !(~wb_st~0 == 0); 225881#L352 assume !(~r_st~0 == 0); 223706#L367 [2018-11-10 08:52:45,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:52:45,851 INFO L82 PathProgramCache]: Analyzing trace with hash -245934343, now seen corresponding path program 3 times [2018-11-10 08:52:45,851 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:52:45,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:52:45,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:45,852 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:52:45,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:45,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:52:45,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:52:45,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:52:45,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1218190504, now seen corresponding path program 1 times [2018-11-10 08:52:45,861 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:52:45,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:52:45,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:45,862 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:52:45,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:45,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:52:45,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:52:45,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:52:45,867 INFO L82 PathProgramCache]: Analyzing trace with hash 2069037408, now seen corresponding path program 1 times [2018-11-10 08:52:45,867 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:52:45,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:52:45,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:45,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:52:45,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:45,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:52:45,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:52:45,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:52:45,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:52:45,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:52:45,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:52:45,935 INFO L87 Difference]: Start difference. First operand 28701 states and 44924 transitions. cyclomatic complexity: 16278 Second operand 3 states. [2018-11-10 08:52:46,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:52:46,047 INFO L93 Difference]: Finished difference Result 49147 states and 75976 transitions. [2018-11-10 08:52:46,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:52:46,048 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49147 states and 75976 transitions. [2018-11-10 08:52:46,287 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 8802 [2018-11-10 08:52:46,384 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49147 states to 49147 states and 75976 transitions. [2018-11-10 08:52:46,384 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10850 [2018-11-10 08:52:46,392 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10850 [2018-11-10 08:52:46,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49147 states and 75976 transitions. [2018-11-10 08:52:46,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:52:46,393 INFO L705 BuchiCegarLoop]: Abstraction has 49147 states and 75976 transitions. [2018-11-10 08:52:46,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49147 states and 75976 transitions. [2018-11-10 08:52:46,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49147 to 49147. [2018-11-10 08:52:46,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49147 states. [2018-11-10 08:52:46,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49147 states to 49147 states and 75976 transitions. [2018-11-10 08:52:46,694 INFO L728 BuchiCegarLoop]: Abstraction has 49147 states and 75976 transitions. [2018-11-10 08:52:46,694 INFO L608 BuchiCegarLoop]: Abstraction has 49147 states and 75976 transitions. [2018-11-10 08:52:46,694 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-10 08:52:46,694 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49147 states and 75976 transitions. [2018-11-10 08:52:46,769 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 8802 [2018-11-10 08:52:46,769 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:52:46,769 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:52:46,770 INFO L866 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, 1] [2018-11-10 08:52:46,770 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:52:46,770 INFO L793 eck$LassoCheckResult]: Stem: 288886#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~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; 288641#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 288642#L394 assume !(~c_req_up~0 == 1); 288846#L394-2 assume ~wl_i~0 == 1;~wl_st~0 := 0; 288991#L405-1 assume ~c1_i~0 == 1;~c1_st~0 := 0; 288869#L410-1 assume ~c2_i~0 == 1;~c2_st~0 := 0; 288870#L415-1 assume ~wb_i~0 == 1;~wb_st~0 := 0; 288614#L420-1 assume !(~r_i~0 == 1);~r_st~0 := 2; 288615#L425-1 assume !(~e_f~0 == 0); 288707#L430-1 assume !(~e_g~0 == 0); 288857#L435-1 assume !(~e_e~0 == 0); 288858#L440-1 assume !(~e_c~0 == 0); 288903#L445-1 assume !(~e_wl~0 == 0); 288979#L450-1 assume !(~wl_pc~0 == 1); 288972#L462 assume !(~wl_pc~0 == 2); 288967#L463 assume !(~c1_pc~0 == 1); 288961#L473 assume !(~c2_pc~0 == 1); 288955#L482 assume !(~wb_pc~0 == 1); 288949#L491 assume !(~e_c~0 == 1); 288945#L500-1 assume !(~e_e~0 == 1); 288942#L505-1 assume !(~e_f~0 == 1); 288939#L510-1 assume !(~e_g~0 == 1); 288844#L515-1 assume !(~e_c~0 == 1); 288845#L520-1 assume !(~e_wl~0 == 1); 296136#L662-1 assume true; 296137#L531 assume !false; 311960#L532 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;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; 297835#L367 [2018-11-10 08:52:46,770 INFO L795 eck$LassoCheckResult]: Loop: 297835#L367 assume true; 297832#L284-1 assume !false; 297830#L285 assume ~wl_st~0 == 0; 297828#L298-1 assume ~wl_st~0 == 0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 297824#L311 assume !(eval_~tmp~0 != 0); 297825#L307 assume ~c1_st~0 == 0;eval_~tmp___0~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 302771#L326 assume !(eval_~tmp___0~0 != 0); 302769#L322 assume ~c2_st~0 == 0;eval_~tmp___1~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 302745#L341 assume !(eval_~tmp___1~0 != 0); 301233#L337 assume ~wb_st~0 == 0;eval_~tmp___2~0 := eval_#t~nondet3;havoc eval_#t~nondet3; 300844#L356 assume !(eval_~tmp___2~0 != 0); 297839#L352 assume !(~r_st~0 == 0); 297835#L367 [2018-11-10 08:52:46,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:52:46,770 INFO L82 PathProgramCache]: Analyzing trace with hash -245934343, now seen corresponding path program 4 times [2018-11-10 08:52:46,770 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:52:46,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:52:46,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:46,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:52:46,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:46,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:52:46,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:52:46,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:52:46,780 INFO L82 PathProgramCache]: Analyzing trace with hash 890763680, now seen corresponding path program 1 times [2018-11-10 08:52:46,781 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:52:46,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:52:46,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:46,781 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:52:46,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:46,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:52:46,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:52:46,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:52:46,785 INFO L82 PathProgramCache]: Analyzing trace with hash -284386152, now seen corresponding path program 1 times [2018-11-10 08:52:46,785 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:52:46,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:52:46,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:46,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:52:46,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:52:46,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:52:46,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:52:46,899 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-11-10 08:52:47,056 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-11-10 08:52:47,360 WARN L179 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 110 [2018-11-10 08:52:47,540 WARN L179 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2018-11-10 08:52:47,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 08:52:47 BoogieIcfgContainer [2018-11-10 08:52:47,558 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 08:52:47,558 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 08:52:47,558 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 08:52:47,558 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 08:52:47,559 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 08:52:38" (3/4) ... [2018-11-10 08:52:47,561 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-10 08:52:47,603 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_295f97e4-925a-49b0-866d-3f21d6a563c8/bin-2019/uautomizer/witness.graphml [2018-11-10 08:52:47,603 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 08:52:47,604 INFO L168 Benchmark]: Toolchain (without parser) took 10016.36 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 626.0 MB). Free memory was 961.2 MB in the beginning and 1.3 GB in the end (delta: -300.6 MB). Peak memory consumption was 325.4 MB. Max. memory is 11.5 GB. [2018-11-10 08:52:47,604 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 08:52:47,604 INFO L168 Benchmark]: CACSL2BoogieTranslator took 217.17 ms. Allocated memory is still 1.0 GB. Free memory was 961.2 MB in the beginning and 943.7 MB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. [2018-11-10 08:52:47,605 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.28 ms. Allocated memory is still 1.0 GB. Free memory was 943.7 MB in the beginning and 935.7 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2018-11-10 08:52:47,605 INFO L168 Benchmark]: Boogie Preprocessor took 67.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 935.7 MB in the beginning and 1.1 GB in the end (delta: -192.3 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. [2018-11-10 08:52:47,605 INFO L168 Benchmark]: RCFGBuilder took 444.33 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: 42.5 MB). Peak memory consumption was 42.5 MB. Max. memory is 11.5 GB. [2018-11-10 08:52:47,605 INFO L168 Benchmark]: BuchiAutomizer took 9207.25 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 494.9 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -176.6 MB). Peak memory consumption was 789.5 MB. Max. memory is 11.5 GB. [2018-11-10 08:52:47,606 INFO L168 Benchmark]: Witness Printer took 44.80 ms. Allocated memory is still 1.7 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 215.6 kB). Peak memory consumption was 215.6 kB. Max. memory is 11.5 GB. [2018-11-10 08:52:47,608 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 217.17 ms. Allocated memory is still 1.0 GB. Free memory was 961.2 MB in the beginning and 943.7 MB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.28 ms. Allocated memory is still 1.0 GB. Free memory was 943.7 MB in the beginning and 935.7 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 67.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 935.7 MB in the beginning and 1.1 GB in the end (delta: -192.3 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 444.33 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: 42.5 MB). Peak memory consumption was 42.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9207.25 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 494.9 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -176.6 MB). Peak memory consumption was 789.5 MB. Max. memory is 11.5 GB. * Witness Printer took 44.80 ms. Allocated memory is still 1.7 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 215.6 kB). Peak memory consumption was 215.6 kB. 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 19 terminating modules (15 trivial, 4 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * e_c + 1 and consists of 3 locations. One deterministic module has affine ranking function -2 * wl_pc + 1 and consists of 4 locations. One deterministic module has affine ranking function -1 * e_f + 1 and consists of 3 locations. One deterministic module has affine ranking function -2 * wl_pc + 1 and consists of 4 locations. 15 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 49147 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.1s and 16 iterations. TraceHistogramMax:2. Analysis of lassos took 4.2s. Construction of modules took 0.6s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 14. Automata minimization 1.6s AutomataMinimizationTime, 19 MinimizatonAttempts, 3032 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 1.1s Buchi closure took 0.0s. Biggest automaton had 49147 states and ocurred in iteration 15. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 9/9 HoareTripleCheckerStatistics: 4878 SDtfs, 4064 SDslu, 3020 SDs, 0 SdLazy, 411 SolverSat, 112 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc3 concLT1 SILN2 SILU0 SILI4 SILT3 lasso0 LassoPreprocessingBenchmarks: Lassos: inital82 mio100 ax100 hnf100 lsp11 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq184 hnf97 smp100 dnf180 smp68 tf111 neg96 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 284]: 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@777583f6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5b52bc4a=0, c1_i=1, c2_pc=0, c2_i=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3a0a1f53=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@74f44d6b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@154058c1=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: 284]: 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 ; [L679] int __retres1 ; [L683] e_wl = 2 [L684] e_c = e_wl [L685] e_g = e_c [L686] e_f = e_g [L687] e_e = e_f [L688] wl_pc = 0 [L689] c1_pc = 0 [L690] c2_pc = 0 [L691] wb_pc = 0 [L692] wb_i = 1 [L693] c2_i = wb_i [L694] c1_i = c2_i [L695] wl_i = c1_i [L696] r_i = 0 [L697] c_req_up = 0 [L698] d = 0 [L699] c = 0 [L700] CALL start_simulation() [L390] int kernel_st ; [L393] kernel_st = 0 [L394] COND FALSE !((int )c_req_up == 1) [L405] COND TRUE (int )wl_i == 1 [L406] wl_st = 0 [L410] COND TRUE (int )c1_i == 1 [L411] c1_st = 0 [L415] COND TRUE (int )c2_i == 1 [L416] c2_st = 0 [L420] COND TRUE (int )wb_i == 1 [L421] wb_st = 0 [L425] COND FALSE !((int )r_i == 1) [L428] r_st = 2 [L430] COND FALSE !((int )e_f == 0) [L435] COND FALSE !((int )e_g == 0) [L440] COND FALSE !((int )e_e == 0) [L445] COND FALSE !((int )e_c == 0) [L450] COND FALSE !((int )e_wl == 0) [L455] COND FALSE !((int )wl_pc == 1) [L463] COND FALSE !((int )wl_pc == 2) [L473] COND FALSE !((int )c1_pc == 1) [L482] COND FALSE !((int )c2_pc == 1) [L491] COND FALSE !((int )wb_pc == 1) [L500] COND FALSE !((int )e_c == 1) [L505] COND FALSE !((int )e_e == 1) [L510] COND FALSE !((int )e_f == 1) [L515] COND FALSE !((int )e_g == 1) [L520] COND FALSE !((int )e_c == 1) [L525] COND FALSE !((int )e_wl == 1) [L531] COND TRUE 1 [L534] kernel_st = 1 [L535] CALL eval() [L276] int tmp ; [L277] int tmp___0 ; [L278] int tmp___1 ; [L279] int tmp___2 ; [L280] int tmp___3 ; Loop: [L284] COND TRUE 1 [L286] COND TRUE (int )wl_st == 0 [L307] COND TRUE (int )wl_st == 0 [L309] tmp = __VERIFIER_nondet_int() [L311] COND FALSE !(\read(tmp)) [L322] COND TRUE (int )c1_st == 0 [L324] tmp___0 = __VERIFIER_nondet_int() [L326] COND FALSE !(\read(tmp___0)) [L337] COND TRUE (int )c2_st == 0 [L339] tmp___1 = __VERIFIER_nondet_int() [L341] COND FALSE !(\read(tmp___1)) [L352] COND TRUE (int )wb_st == 0 [L354] tmp___2 = __VERIFIER_nondet_int() [L356] COND FALSE !(\read(tmp___2)) [L367] COND FALSE !((int )r_st == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...