./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.5_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.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_a385bd0c-5237-4d48-abbc-1f7d38343ea9/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a385bd0c-5237-4d48-abbc-1f7d38343ea9/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a385bd0c-5237-4d48-abbc-1f7d38343ea9/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a385bd0c-5237-4d48-abbc-1f7d38343ea9/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.5_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_a385bd0c-5237-4d48-abbc-1f7d38343ea9/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a385bd0c-5237-4d48-abbc-1f7d38343ea9/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 053aeb48113c945d72b88fa8b8a723afcb7d2dc8 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 11:50:15,592 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 11:50:15,593 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 11:50:15,600 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 11:50:15,600 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 11:50:15,601 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 11:50:15,601 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 11:50:15,603 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 11:50:15,604 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 11:50:15,604 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 11:50:15,605 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 11:50:15,605 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 11:50:15,606 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 11:50:15,606 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 11:50:15,607 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 11:50:15,607 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 11:50:15,607 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 11:50:15,609 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 11:50:15,610 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 11:50:15,611 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 11:50:15,611 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 11:50:15,612 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 11:50:15,614 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 11:50:15,614 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 11:50:15,614 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 11:50:15,615 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 11:50:15,616 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 11:50:15,616 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 11:50:15,617 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 11:50:15,617 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 11:50:15,618 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 11:50:15,618 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 11:50:15,618 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 11:50:15,618 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 11:50:15,619 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 11:50:15,620 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 11:50:15,620 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a385bd0c-5237-4d48-abbc-1f7d38343ea9/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 11:50:15,628 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 11:50:15,629 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 11:50:15,630 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 11:50:15,630 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 11:50:15,630 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 11:50:15,630 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 11:50:15,630 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 11:50:15,630 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 11:50:15,630 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 11:50:15,631 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 11:50:15,631 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 11:50:15,631 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 11:50:15,631 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 11:50:15,631 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 11:50:15,631 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 11:50:15,631 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 11:50:15,631 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 11:50:15,632 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 11:50:15,632 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 11:50:15,632 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 11:50:15,632 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 11:50:15,632 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 11:50:15,632 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 11:50:15,632 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 11:50:15,632 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 11:50:15,633 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 11:50:15,633 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 11:50:15,633 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 11:50:15,633 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 11:50:15,633 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 11:50:15,634 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 11:50:15,634 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_a385bd0c-5237-4d48-abbc-1f7d38343ea9/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 -> 053aeb48113c945d72b88fa8b8a723afcb7d2dc8 [2018-11-10 11:50:15,657 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 11:50:15,666 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 11:50:15,668 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 11:50:15,669 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 11:50:15,670 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 11:50:15,670 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a385bd0c-5237-4d48-abbc-1f7d38343ea9/bin-2019/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_lcr.5_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c [2018-11-10 11:50:15,708 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a385bd0c-5237-4d48-abbc-1f7d38343ea9/bin-2019/uautomizer/data/52472fd9b/a8d76e8d69ee4c7688fb4746ddacee0a/FLAG3b7320076 [2018-11-10 11:50:16,025 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 11:50:16,026 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a385bd0c-5237-4d48-abbc-1f7d38343ea9/sv-benchmarks/c/seq-mthreaded/pals_lcr.5_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c [2018-11-10 11:50:16,031 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a385bd0c-5237-4d48-abbc-1f7d38343ea9/bin-2019/uautomizer/data/52472fd9b/a8d76e8d69ee4c7688fb4746ddacee0a/FLAG3b7320076 [2018-11-10 11:50:16,042 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a385bd0c-5237-4d48-abbc-1f7d38343ea9/bin-2019/uautomizer/data/52472fd9b/a8d76e8d69ee4c7688fb4746ddacee0a [2018-11-10 11:50:16,044 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 11:50:16,045 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 11:50:16,045 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 11:50:16,045 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 11:50:16,047 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 11:50:16,048 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:50:16" (1/1) ... [2018-11-10 11:50:16,049 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11bcb58d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:50:16, skipping insertion in model container [2018-11-10 11:50:16,050 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:50:16" (1/1) ... [2018-11-10 11:50:16,055 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 11:50:16,079 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 11:50:16,220 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:50:16,226 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 11:50:16,259 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:50:16,271 INFO L193 MainTranslator]: Completed translation [2018-11-10 11:50:16,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:50:16 WrapperNode [2018-11-10 11:50:16,272 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 11:50:16,272 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 11:50:16,272 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 11:50:16,272 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 11:50:16,279 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:50:16" (1/1) ... [2018-11-10 11:50:16,288 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:50:16" (1/1) ... [2018-11-10 11:50:16,345 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 11:50:16,345 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 11:50:16,345 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 11:50:16,345 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 11:50:16,351 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:50:16" (1/1) ... [2018-11-10 11:50:16,351 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:50:16" (1/1) ... [2018-11-10 11:50:16,353 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:50:16" (1/1) ... [2018-11-10 11:50:16,353 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:50:16" (1/1) ... [2018-11-10 11:50:16,358 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:50:16" (1/1) ... [2018-11-10 11:50:16,364 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:50:16" (1/1) ... [2018-11-10 11:50:16,366 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:50:16" (1/1) ... [2018-11-10 11:50:16,368 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 11:50:16,368 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 11:50:16,369 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 11:50:16,369 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 11:50:16,369 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:50:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a385bd0c-5237-4d48-abbc-1f7d38343ea9/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 11:50:16,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 11:50:16,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 11:50:16,806 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 11:50:16,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:50:16 BoogieIcfgContainer [2018-11-10 11:50:16,806 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 11:50:16,807 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 11:50:16,807 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 11:50:16,809 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 11:50:16,810 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 11:50:16,810 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 11:50:16" (1/3) ... [2018-11-10 11:50:16,810 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7889eec4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 11:50:16, skipping insertion in model container [2018-11-10 11:50:16,810 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 11:50:16,810 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:50:16" (2/3) ... [2018-11-10 11:50:16,811 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7889eec4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 11:50:16, skipping insertion in model container [2018-11-10 11:50:16,811 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 11:50:16,811 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:50:16" (3/3) ... [2018-11-10 11:50:16,812 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_lcr.5_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c [2018-11-10 11:50:16,846 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 11:50:16,847 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 11:50:16,847 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 11:50:16,847 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 11:50:16,847 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 11:50:16,847 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 11:50:16,848 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 11:50:16,848 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 11:50:16,848 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 11:50:16,859 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states. [2018-11-10 11:50:16,878 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 52 [2018-11-10 11:50:16,878 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:50:16,879 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:50:16,886 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 11:50:16,886 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] [2018-11-10 11:50:16,886 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 11:50:16,887 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states. [2018-11-10 11:50:16,890 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 52 [2018-11-10 11:50:16,891 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:50:16,891 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:50:16,892 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 11:50:16,892 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] [2018-11-10 11:50:16,899 INFO L793 eck$LassoCheckResult]: Stem: 39#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;~r1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~mode1~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~mode2~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~mode3~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~mode4~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~mode5~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~0 := 0;~p4~0 := 0;~send4~0 := 0;~p5~0 := 0;~send5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; 14#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~ret26, main_#t~ret27, main_#t~post28, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet5;havoc main_#t~nondet5;~id1~0 := main_#t~nondet6;havoc main_#t~nondet6;~st1~0 := main_#t~nondet7;havoc main_#t~nondet7;~send1~0 := main_#t~nondet8;havoc main_#t~nondet8;~mode1~0 := main_#t~nondet9;havoc main_#t~nondet9;~id2~0 := main_#t~nondet10;havoc main_#t~nondet10;~st2~0 := main_#t~nondet11;havoc main_#t~nondet11;~send2~0 := main_#t~nondet12;havoc main_#t~nondet12;~mode2~0 := main_#t~nondet13;havoc main_#t~nondet13;~id3~0 := main_#t~nondet14;havoc main_#t~nondet14;~st3~0 := main_#t~nondet15;havoc main_#t~nondet15;~send3~0 := main_#t~nondet16;havoc main_#t~nondet16;~mode3~0 := main_#t~nondet17;havoc main_#t~nondet17;~id4~0 := main_#t~nondet18;havoc main_#t~nondet18;~st4~0 := main_#t~nondet19;havoc main_#t~nondet19;~send4~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode4~0 := main_#t~nondet21;havoc main_#t~nondet21;~id5~0 := main_#t~nondet22;havoc main_#t~nondet22;~st5~0 := main_#t~nondet23;havoc main_#t~nondet23;~send5~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode5~0 := main_#t~nondet25;havoc main_#t~nondet25;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 75#L240true assume !(~r1~0 == 0);init_~tmp~0 := 0; 73#L240-1true init_#res := init_~tmp~0; 4#L365true main_#t~ret26 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret26;havoc main_#t~ret26;assume main_~i2~0 != 0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; 66#L437-3true [2018-11-10 11:50:16,900 INFO L795 eck$LassoCheckResult]: Loop: 66#L437-3true assume true; 60#L437-1true assume !!(main_~i2~0 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 6#L113true assume ~mode1~0 % 256 != 0;~r1~0 := (if (~r1~0 + 1) % 256 <= 127 then (~r1~0 + 1) % 256 else (~r1~0 + 1) % 256 - 256);node1_~m1~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 38#L117true assume !(node1_~m1~0 != ~nomsg~0); 13#L117-1true ~mode1~0 := 0; 3#L113-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 41#L139true assume ~mode2~0 % 256 != 0;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 27#L142true assume !(node2_~m2~0 != ~nomsg~0); 23#L142-1true ~mode2~0 := 0; 12#L139-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 29#L164true assume ~mode3~0 % 256 != 0;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 80#L167true assume !(node3_~m3~0 != ~nomsg~0); 78#L167-1true ~mode3~0 := 0; 22#L164-2true assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 82#L189true assume ~mode4~0 % 256 != 0;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 85#L192true assume !(node4_~m4~0 != ~nomsg~0); 84#L192-1true ~mode4~0 := 0; 77#L189-2true assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 88#L214true assume ~mode5~0 % 256 != 0;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 71#L217true assume !(node5_~m5~0 != ~nomsg~0); 70#L217-1true ~mode5~0 := 0; 59#L214-2true assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 36#L373true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1 := 0; 17#L373-1true check_#res := check_~tmp~1; 62#L393true main_#t~ret27 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret27;havoc main_#t~ret27;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 86#L467true assume !(assert_~arg % 256 == 0); 51#L462true assume { :end_inline_assert } true;main_#t~post28 := main_~i2~0;main_~i2~0 := main_#t~post28 + 1;havoc main_#t~post28; 66#L437-3true [2018-11-10 11:50:16,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:50:16,905 INFO L82 PathProgramCache]: Analyzing trace with hash 28874490, now seen corresponding path program 1 times [2018-11-10 11:50:16,907 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:50:16,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:50:16,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:50:16,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:50:16,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:50:16,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:50:17,047 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 11:50:17,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:50:17,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:50:17,051 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 11:50:17,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:50:17,051 INFO L82 PathProgramCache]: Analyzing trace with hash 152184859, now seen corresponding path program 1 times [2018-11-10 11:50:17,051 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:50:17,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:50:17,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:50:17,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:50:17,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:50:17,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:50:17,114 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 11:50:17,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:50:17,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 11:50:17,116 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 11:50:17,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 11:50:17,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 11:50:17,131 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 4 states. [2018-11-10 11:50:17,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:50:17,198 INFO L93 Difference]: Finished difference Result 93 states and 153 transitions. [2018-11-10 11:50:17,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 11:50:17,200 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 153 transitions. [2018-11-10 11:50:17,202 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2018-11-10 11:50:17,207 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 86 states and 116 transitions. [2018-11-10 11:50:17,208 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 86 [2018-11-10 11:50:17,208 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 86 [2018-11-10 11:50:17,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 86 states and 116 transitions. [2018-11-10 11:50:17,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 11:50:17,209 INFO L705 BuchiCegarLoop]: Abstraction has 86 states and 116 transitions. [2018-11-10 11:50:17,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states and 116 transitions. [2018-11-10 11:50:17,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-11-10 11:50:17,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-10 11:50:17,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 116 transitions. [2018-11-10 11:50:17,231 INFO L728 BuchiCegarLoop]: Abstraction has 86 states and 116 transitions. [2018-11-10 11:50:17,231 INFO L608 BuchiCegarLoop]: Abstraction has 86 states and 116 transitions. [2018-11-10 11:50:17,231 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 11:50:17,231 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 116 transitions. [2018-11-10 11:50:17,232 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2018-11-10 11:50:17,233 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:50:17,233 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:50:17,234 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:50:17,234 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] [2018-11-10 11:50:17,234 INFO L793 eck$LassoCheckResult]: Stem: 256#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~r1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~mode1~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~mode2~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~mode3~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~mode4~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~mode5~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~0 := 0;~p4~0 := 0;~send4~0 := 0;~p5~0 := 0;~send5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; 223#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~ret26, main_#t~ret27, main_#t~post28, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet5;havoc main_#t~nondet5;~id1~0 := main_#t~nondet6;havoc main_#t~nondet6;~st1~0 := main_#t~nondet7;havoc main_#t~nondet7;~send1~0 := main_#t~nondet8;havoc main_#t~nondet8;~mode1~0 := main_#t~nondet9;havoc main_#t~nondet9;~id2~0 := main_#t~nondet10;havoc main_#t~nondet10;~st2~0 := main_#t~nondet11;havoc main_#t~nondet11;~send2~0 := main_#t~nondet12;havoc main_#t~nondet12;~mode2~0 := main_#t~nondet13;havoc main_#t~nondet13;~id3~0 := main_#t~nondet14;havoc main_#t~nondet14;~st3~0 := main_#t~nondet15;havoc main_#t~nondet15;~send3~0 := main_#t~nondet16;havoc main_#t~nondet16;~mode3~0 := main_#t~nondet17;havoc main_#t~nondet17;~id4~0 := main_#t~nondet18;havoc main_#t~nondet18;~st4~0 := main_#t~nondet19;havoc main_#t~nondet19;~send4~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode4~0 := main_#t~nondet21;havoc main_#t~nondet21;~id5~0 := main_#t~nondet22;havoc main_#t~nondet22;~st5~0 := main_#t~nondet23;havoc main_#t~nondet23;~send5~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode5~0 := main_#t~nondet25;havoc main_#t~nondet25;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 224#L240 assume ~r1~0 == 0; 206#L241 assume ~id1~0 >= 0; 207#L242 assume ~st1~0 == 0; 246#L243 assume ~send1~0 == ~id1~0; 272#L244 assume ~mode1~0 % 256 == 0; 254#L245 assume ~id2~0 >= 0; 255#L246 assume ~st2~0 == 0; 277#L247 assume ~send2~0 == ~id2~0; 234#L248 assume ~mode2~0 % 256 == 0; 235#L249 assume ~id3~0 >= 0; 264#L250 assume ~st3~0 == 0; 267#L251 assume ~send3~0 == ~id3~0; 208#L252 assume ~mode3~0 % 256 == 0; 209#L253 assume ~id4~0 >= 0; 247#L254 assume ~st4~0 == 0; 225#L255 assume ~send4~0 == ~id4~0; 226#L256 assume ~mode4~0 % 256 == 0; 257#L257 assume ~id5~0 >= 0; 278#L258 assume ~st5~0 == 0; 236#L259 assume ~send5~0 == ~id5~0; 237#L260 assume ~mode5~0 % 256 == 0; 265#L261 assume ~id1~0 != ~id2~0; 268#L262 assume ~id1~0 != ~id3~0; 210#L263 assume ~id1~0 != ~id4~0; 211#L264 assume ~id1~0 != ~id5~0; 248#L265 assume ~id2~0 != ~id3~0; 227#L266 assume ~id2~0 != ~id4~0; 228#L267 assume ~id2~0 != ~id5~0; 258#L268 assume ~id3~0 != ~id4~0; 279#L269 assume ~id3~0 != ~id5~0; 238#L270 assume ~id4~0 != ~id5~0;init_~tmp~0 := 1; 239#L240-1 init_#res := init_~tmp~0; 201#L365 main_#t~ret26 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret26;havoc main_#t~ret26;assume main_~i2~0 != 0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; 202#L437-3 [2018-11-10 11:50:17,234 INFO L795 eck$LassoCheckResult]: Loop: 202#L437-3 assume true; 273#L437-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 203#L113 assume !(~mode1~0 % 256 != 0); 204#L127 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite0 := ~send1~0; 220#L127-2 ~p1_new~0 := (if node1_#t~ite0 % 256 <= 127 then node1_#t~ite0 % 256 else node1_#t~ite0 % 256 - 256);havoc node1_#t~ite0;~mode1~0 := 1; 199#L113-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 200#L139 assume ~mode2~0 % 256 != 0;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 240#L142 assume !(node2_~m2~0 != ~nomsg~0); 213#L142-1 ~mode2~0 := 0; 217#L139-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 218#L164 assume !(~mode3~0 % 256 != 0); 242#L177 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite2 := ~send3~0; 266#L177-2 ~p3_new~0 := (if node3_#t~ite2 % 256 <= 127 then node3_#t~ite2 % 256 else node3_#t~ite2 % 256 - 256);havoc node3_#t~ite2;~mode3~0 := 1; 232#L164-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 233#L189 assume !(~mode4~0 % 256 != 0); 274#L202 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite3 := ~send4~0; 249#L202-2 ~p4_new~0 := (if node4_#t~ite3 % 256 <= 127 then node4_#t~ite3 % 256 else node4_#t~ite3 % 256 - 256);havoc node4_#t~ite3;~mode4~0 := 1; 250#L189-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 282#L214 assume !(~mode5~0 % 256 != 0); 262#L227 assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite4 := ~send5~0; 260#L227-2 ~p5_new~0 := (if node5_#t~ite4 % 256 <= 127 then node5_#t~ite4 % 256 else node5_#t~ite4 % 256 - 256);havoc node5_#t~ite4;~mode5~0 := 1; 261#L214-2 assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 251#L373 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1 := 0; 221#L373-1 check_#res := check_~tmp~1; 222#L393 main_#t~ret27 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret27;havoc main_#t~ret27;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 275#L467 assume !(assert_~arg % 256 == 0); 269#L462 assume { :end_inline_assert } true;main_#t~post28 := main_~i2~0;main_~i2~0 := main_#t~post28 + 1;havoc main_#t~post28; 202#L437-3 [2018-11-10 11:50:17,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:50:17,235 INFO L82 PathProgramCache]: Analyzing trace with hash -806541263, now seen corresponding path program 1 times [2018-11-10 11:50:17,235 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:50:17,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:50:17,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:50:17,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:50:17,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:50:17,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:50:17,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:50:17,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:50:17,299 INFO L82 PathProgramCache]: Analyzing trace with hash -631904013, now seen corresponding path program 1 times [2018-11-10 11:50:17,299 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:50:17,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:50:17,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:50:17,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:50:17,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:50:17,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:50:17,347 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 11:50:17,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:50:17,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 11:50:17,348 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 11:50:17,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 11:50:17,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 11:50:17,348 INFO L87 Difference]: Start difference. First operand 86 states and 116 transitions. cyclomatic complexity: 31 Second operand 5 states. [2018-11-10 11:50:17,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:50:17,395 INFO L93 Difference]: Finished difference Result 89 states and 118 transitions. [2018-11-10 11:50:17,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 11:50:17,396 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 118 transitions. [2018-11-10 11:50:17,397 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2018-11-10 11:50:17,398 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 86 states and 113 transitions. [2018-11-10 11:50:17,398 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 86 [2018-11-10 11:50:17,399 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 86 [2018-11-10 11:50:17,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 86 states and 113 transitions. [2018-11-10 11:50:17,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 11:50:17,399 INFO L705 BuchiCegarLoop]: Abstraction has 86 states and 113 transitions. [2018-11-10 11:50:17,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states and 113 transitions. [2018-11-10 11:50:17,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-11-10 11:50:17,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-10 11:50:17,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 113 transitions. [2018-11-10 11:50:17,405 INFO L728 BuchiCegarLoop]: Abstraction has 86 states and 113 transitions. [2018-11-10 11:50:17,405 INFO L608 BuchiCegarLoop]: Abstraction has 86 states and 113 transitions. [2018-11-10 11:50:17,405 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 11:50:17,405 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 113 transitions. [2018-11-10 11:50:17,406 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2018-11-10 11:50:17,406 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:50:17,406 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:50:17,407 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:50:17,408 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] [2018-11-10 11:50:17,408 INFO L793 eck$LassoCheckResult]: Stem: 443#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~r1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~mode1~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~mode2~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~mode3~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~mode4~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~mode5~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~0 := 0;~p4~0 := 0;~send4~0 := 0;~p5~0 := 0;~send5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; 407#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~ret26, main_#t~ret27, main_#t~post28, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet5;havoc main_#t~nondet5;~id1~0 := main_#t~nondet6;havoc main_#t~nondet6;~st1~0 := main_#t~nondet7;havoc main_#t~nondet7;~send1~0 := main_#t~nondet8;havoc main_#t~nondet8;~mode1~0 := main_#t~nondet9;havoc main_#t~nondet9;~id2~0 := main_#t~nondet10;havoc main_#t~nondet10;~st2~0 := main_#t~nondet11;havoc main_#t~nondet11;~send2~0 := main_#t~nondet12;havoc main_#t~nondet12;~mode2~0 := main_#t~nondet13;havoc main_#t~nondet13;~id3~0 := main_#t~nondet14;havoc main_#t~nondet14;~st3~0 := main_#t~nondet15;havoc main_#t~nondet15;~send3~0 := main_#t~nondet16;havoc main_#t~nondet16;~mode3~0 := main_#t~nondet17;havoc main_#t~nondet17;~id4~0 := main_#t~nondet18;havoc main_#t~nondet18;~st4~0 := main_#t~nondet19;havoc main_#t~nondet19;~send4~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode4~0 := main_#t~nondet21;havoc main_#t~nondet21;~id5~0 := main_#t~nondet22;havoc main_#t~nondet22;~st5~0 := main_#t~nondet23;havoc main_#t~nondet23;~send5~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode5~0 := main_#t~nondet25;havoc main_#t~nondet25;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 408#L240 assume ~r1~0 == 0; 390#L241 assume ~id1~0 >= 0; 391#L242 assume ~st1~0 == 0; 433#L243 assume ~send1~0 == ~id1~0; 459#L244 assume ~mode1~0 % 256 == 0; 440#L245 assume ~id2~0 >= 0; 441#L246 assume ~st2~0 == 0; 464#L247 assume ~send2~0 == ~id2~0; 421#L248 assume ~mode2~0 % 256 == 0; 422#L249 assume ~id3~0 >= 0; 450#L250 assume ~st3~0 == 0; 454#L251 assume ~send3~0 == ~id3~0; 395#L252 assume ~mode3~0 % 256 == 0; 396#L253 assume ~id4~0 >= 0; 434#L254 assume ~st4~0 == 0; 409#L255 assume ~send4~0 == ~id4~0; 410#L256 assume ~mode4~0 % 256 == 0; 444#L257 assume ~id5~0 >= 0; 465#L258 assume ~st5~0 == 0; 423#L259 assume ~send5~0 == ~id5~0; 424#L260 assume ~mode5~0 % 256 == 0; 452#L261 assume ~id1~0 != ~id2~0; 456#L262 assume ~id1~0 != ~id3~0; 397#L263 assume ~id1~0 != ~id4~0; 398#L264 assume ~id1~0 != ~id5~0; 435#L265 assume ~id2~0 != ~id3~0; 414#L266 assume ~id2~0 != ~id4~0; 415#L267 assume ~id2~0 != ~id5~0; 445#L268 assume ~id3~0 != ~id4~0; 466#L269 assume ~id3~0 != ~id5~0; 425#L270 assume ~id4~0 != ~id5~0;init_~tmp~0 := 1; 426#L240-1 init_#res := init_~tmp~0; 388#L365 main_#t~ret26 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret26;havoc main_#t~ret26;assume main_~i2~0 != 0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; 389#L437-3 [2018-11-10 11:50:17,408 INFO L795 eck$LassoCheckResult]: Loop: 389#L437-3 assume true; 460#L437-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 392#L113 assume !(~mode1~0 % 256 != 0); 393#L127 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite0 := ~send1~0; 411#L127-2 ~p1_new~0 := (if node1_#t~ite0 % 256 <= 127 then node1_#t~ite0 % 256 else node1_#t~ite0 % 256 - 256);havoc node1_#t~ite0;~mode1~0 := 1; 386#L113-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 387#L139 assume ~mode2~0 % 256 != 0;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 427#L142 assume !(node2_~m2~0 != ~nomsg~0); 400#L142-1 ~mode2~0 := 0; 404#L139-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 405#L164 assume !(~mode3~0 % 256 != 0); 429#L177 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite2 := ~send3~0; 453#L177-2 ~p3_new~0 := (if node3_#t~ite2 % 256 <= 127 then node3_#t~ite2 % 256 else node3_#t~ite2 % 256 - 256);havoc node3_#t~ite2;~mode3~0 := 1; 419#L164-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 420#L189 assume ~mode4~0 % 256 != 0;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 470#L192 assume !(node4_~m4~0 != ~nomsg~0); 417#L192-1 ~mode4~0 := 0; 437#L189-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 469#L214 assume !(~mode5~0 % 256 != 0); 449#L227 assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite4 := ~send5~0; 447#L227-2 ~p5_new~0 := (if node5_#t~ite4 % 256 <= 127 then node5_#t~ite4 % 256 else node5_#t~ite4 % 256 - 256);havoc node5_#t~ite4;~mode5~0 := 1; 448#L214-2 assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 438#L373 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; 439#L374 assume ~r1~0 >= 5; 432#L378 assume ~r1~0 < 5;check_~tmp~1 := 1; 412#L373-1 check_#res := check_~tmp~1; 413#L393 main_#t~ret27 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret27;havoc main_#t~ret27;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 462#L467 assume !(assert_~arg % 256 == 0); 455#L462 assume { :end_inline_assert } true;main_#t~post28 := main_~i2~0;main_~i2~0 := main_#t~post28 + 1;havoc main_#t~post28; 389#L437-3 [2018-11-10 11:50:17,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:50:17,408 INFO L82 PathProgramCache]: Analyzing trace with hash -806541263, now seen corresponding path program 2 times [2018-11-10 11:50:17,408 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:50:17,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:50:17,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:50:17,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:50:17,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:50:17,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:50:17,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:50:17,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:50:17,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1286881555, now seen corresponding path program 1 times [2018-11-10 11:50:17,443 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:50:17,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:50:17,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:50:17,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:50:17,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:50:17,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:50:17,474 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 11:50:17,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:50:17,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:50:17,475 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 11:50:17,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:50:17,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:50:17,475 INFO L87 Difference]: Start difference. First operand 86 states and 113 transitions. cyclomatic complexity: 28 Second operand 3 states. [2018-11-10 11:50:17,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:50:17,494 INFO L93 Difference]: Finished difference Result 131 states and 180 transitions. [2018-11-10 11:50:17,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:50:17,494 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 131 states and 180 transitions. [2018-11-10 11:50:17,495 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 96 [2018-11-10 11:50:17,496 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 131 states to 131 states and 180 transitions. [2018-11-10 11:50:17,496 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 131 [2018-11-10 11:50:17,496 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 131 [2018-11-10 11:50:17,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 131 states and 180 transitions. [2018-11-10 11:50:17,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 11:50:17,497 INFO L705 BuchiCegarLoop]: Abstraction has 131 states and 180 transitions. [2018-11-10 11:50:17,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states and 180 transitions. [2018-11-10 11:50:17,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-11-10 11:50:17,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-10 11:50:17,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 180 transitions. [2018-11-10 11:50:17,501 INFO L728 BuchiCegarLoop]: Abstraction has 131 states and 180 transitions. [2018-11-10 11:50:17,501 INFO L608 BuchiCegarLoop]: Abstraction has 131 states and 180 transitions. [2018-11-10 11:50:17,501 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 11:50:17,501 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 131 states and 180 transitions. [2018-11-10 11:50:17,502 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 96 [2018-11-10 11:50:17,502 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:50:17,503 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:50:17,503 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:50:17,503 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 11:50:17,504 INFO L793 eck$LassoCheckResult]: Stem: 667#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~r1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~mode1~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~mode2~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~mode3~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~mode4~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~mode5~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~0 := 0;~p4~0 := 0;~send4~0 := 0;~p5~0 := 0;~send5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; 634#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~ret26, main_#t~ret27, main_#t~post28, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet5;havoc main_#t~nondet5;~id1~0 := main_#t~nondet6;havoc main_#t~nondet6;~st1~0 := main_#t~nondet7;havoc main_#t~nondet7;~send1~0 := main_#t~nondet8;havoc main_#t~nondet8;~mode1~0 := main_#t~nondet9;havoc main_#t~nondet9;~id2~0 := main_#t~nondet10;havoc main_#t~nondet10;~st2~0 := main_#t~nondet11;havoc main_#t~nondet11;~send2~0 := main_#t~nondet12;havoc main_#t~nondet12;~mode2~0 := main_#t~nondet13;havoc main_#t~nondet13;~id3~0 := main_#t~nondet14;havoc main_#t~nondet14;~st3~0 := main_#t~nondet15;havoc main_#t~nondet15;~send3~0 := main_#t~nondet16;havoc main_#t~nondet16;~mode3~0 := main_#t~nondet17;havoc main_#t~nondet17;~id4~0 := main_#t~nondet18;havoc main_#t~nondet18;~st4~0 := main_#t~nondet19;havoc main_#t~nondet19;~send4~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode4~0 := main_#t~nondet21;havoc main_#t~nondet21;~id5~0 := main_#t~nondet22;havoc main_#t~nondet22;~st5~0 := main_#t~nondet23;havoc main_#t~nondet23;~send5~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode5~0 := main_#t~nondet25;havoc main_#t~nondet25;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 635#L240 assume ~r1~0 == 0; 616#L241 assume ~id1~0 >= 0; 617#L242 assume ~st1~0 == 0; 657#L243 assume ~send1~0 == ~id1~0; 685#L244 assume ~mode1~0 % 256 == 0; 665#L245 assume ~id2~0 >= 0; 666#L246 assume ~st2~0 == 0; 690#L247 assume ~send2~0 == ~id2~0; 645#L248 assume ~mode2~0 % 256 == 0; 646#L249 assume ~id3~0 >= 0; 675#L250 assume ~st3~0 == 0; 678#L251 assume ~send3~0 == ~id3~0; 618#L252 assume ~mode3~0 % 256 == 0; 619#L253 assume ~id4~0 >= 0; 658#L254 assume ~st4~0 == 0; 636#L255 assume ~send4~0 == ~id4~0; 637#L256 assume ~mode4~0 % 256 == 0; 668#L257 assume ~id5~0 >= 0; 691#L258 assume ~st5~0 == 0; 647#L259 assume ~send5~0 == ~id5~0; 648#L260 assume ~mode5~0 % 256 == 0; 676#L261 assume ~id1~0 != ~id2~0; 681#L262 assume ~id1~0 != ~id3~0; 620#L263 assume ~id1~0 != ~id4~0; 621#L264 assume ~id1~0 != ~id5~0; 661#L265 assume ~id2~0 != ~id3~0; 638#L266 assume ~id2~0 != ~id4~0; 639#L267 assume ~id2~0 != ~id5~0; 670#L268 assume ~id3~0 != ~id4~0; 692#L269 assume ~id3~0 != ~id5~0; 651#L270 assume ~id4~0 != ~id5~0;init_~tmp~0 := 1; 652#L240-1 init_#res := init_~tmp~0; 611#L365 main_#t~ret26 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret26;havoc main_#t~ret26;assume main_~i2~0 != 0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; 612#L437-3 [2018-11-10 11:50:17,504 INFO L795 eck$LassoCheckResult]: Loop: 612#L437-3 assume true; 735#L437-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 734#L113 assume ~mode1~0 % 256 != 0;~r1~0 := (if (~r1~0 + 1) % 256 <= 127 then (~r1~0 + 1) % 256 else (~r1~0 + 1) % 256 - 256);node1_~m1~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 615#L117 assume !(node1_~m1~0 != ~nomsg~0); 629#L117-1 ~mode1~0 := 0; 630#L113-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 731#L139 assume ~mode2~0 % 256 != 0;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 729#L142 assume !(node2_~m2~0 != ~nomsg~0); 726#L142-1 ~mode2~0 := 0; 724#L139-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 723#L164 assume ~mode3~0 % 256 != 0;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 722#L167 assume !(node3_~m3~0 != ~nomsg~0); 717#L167-1 ~mode3~0 := 0; 716#L164-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 715#L189 assume !(~mode4~0 % 256 != 0); 711#L202 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite3 := ~send4~0; 710#L202-2 ~p4_new~0 := (if node4_#t~ite3 % 256 <= 127 then node4_#t~ite3 % 256 else node4_#t~ite3 % 256 - 256);havoc node4_#t~ite3;~mode4~0 := 1; 708#L189-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 707#L214 assume ~mode5~0 % 256 != 0;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 704#L217 assume !(node5_~m5~0 != ~nomsg~0); 701#L217-1 ~mode5~0 := 0; 700#L214-2 assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 699#L373 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; 698#L374 assume !(~r1~0 >= 5); 655#L377 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 == 0; 656#L378 assume ~r1~0 < 5;check_~tmp~1 := 1; 739#L373-1 check_#res := check_~tmp~1; 738#L393 main_#t~ret27 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret27;havoc main_#t~ret27;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 737#L467 assume !(assert_~arg % 256 == 0); 736#L462 assume { :end_inline_assert } true;main_#t~post28 := main_~i2~0;main_~i2~0 := main_#t~post28 + 1;havoc main_#t~post28; 612#L437-3 [2018-11-10 11:50:17,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:50:17,504 INFO L82 PathProgramCache]: Analyzing trace with hash -806541263, now seen corresponding path program 3 times [2018-11-10 11:50:17,504 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:50:17,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:50:17,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:50:17,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:50:17,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:50:17,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:50:17,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:50:17,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:50:17,533 INFO L82 PathProgramCache]: Analyzing trace with hash -953350166, now seen corresponding path program 1 times [2018-11-10 11:50:17,533 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:50:17,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:50:17,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:50:17,535 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:50:17,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:50:17,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:50:17,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:50:17,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:50:17,555 INFO L82 PathProgramCache]: Analyzing trace with hash 88718362, now seen corresponding path program 1 times [2018-11-10 11:50:17,555 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:50:17,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:50:17,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:50:17,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:50:17,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:50:17,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:50:17,610 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 11:50:17,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:50:17,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:50:17,952 WARN L179 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 143 [2018-11-10 11:50:18,793 WARN L179 SmtUtils]: Spent 823.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 127 [2018-11-10 11:50:18,801 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 11:50:18,802 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 11:50:18,802 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 11:50:18,802 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 11:50:18,802 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 11:50:18,802 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:50:18,802 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 11:50:18,802 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 11:50:18,802 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr.5_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration4_Loop [2018-11-10 11:50:18,802 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 11:50:18,802 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 11:50:18,833 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 11:50:18,847 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 11:50:18,848 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 11:50:18,849 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 11:50:18,870 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 11:50:18,874 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 11:50:18,875 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 11:50:18,876 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 11:50:18,877 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 11:50:18,880 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 11:50:18,881 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 11:50:18,882 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 11:50:18,884 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 11:50:18,887 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 11:50:18,888 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 11:50:18,891 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 11:50:18,892 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 11:50:18,893 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 11:50:18,894 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 11:50:18,896 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 11:50:18,897 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 11:50:18,899 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 11:50:18,960 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 11:50:18,963 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 11:50:18,967 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 11:50:18,968 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 11:50:18,969 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 11:50:18,971 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 11:50:20,036 WARN L179 SmtUtils]: Spent 752.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 92 [2018-11-10 11:50:20,062 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 11:50:20,063 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a385bd0c-5237-4d48-abbc-1f7d38343ea9/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 11:50:20,071 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:50:20,071 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a385bd0c-5237-4d48-abbc-1f7d38343ea9/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 11:50:20,095 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 11:50:20,095 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:50:20,199 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 11:50:20,200 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 11:50:20,200 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 11:50:20,200 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 11:50:20,200 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 11:50:20,200 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 11:50:20,200 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:50:20,200 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 11:50:20,200 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 11:50:20,200 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr.5_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration4_Loop [2018-11-10 11:50:20,200 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 11:50:20,200 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 11:50:20,210 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 11:50:20,223 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 11:50:20,224 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 11:50:20,226 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 11:50:20,258 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 11:50:20,260 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 11:50:20,263 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 11:50:20,264 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 11:50:20,267 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 11:50:20,267 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 11:50:20,269 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 11:50:20,270 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 11:50:20,274 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 11:50:20,275 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 11:50:20,277 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 11:50:20,279 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 11:50:20,282 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 11:50:20,284 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 11:50:20,286 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 11:50:20,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 11:50:20,290 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 11:50:20,291 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 11:50:20,292 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 11:50:20,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 11:50:20,356 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 11:50:20,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 11:50:20,362 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 11:50:20,363 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 11:50:20,569 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2018-11-10 11:50:21,389 WARN L179 SmtUtils]: Spent 712.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 92 [2018-11-10 11:50:21,407 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 11:50:21,410 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 11:50:21,411 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 11:50:21,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:50:21,412 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:50:21,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:50:21,412 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:50:21,412 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:50:21,414 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:50:21,414 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:50:21,417 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:50:21,417 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 11:50:21,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:50:21,418 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:50:21,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:50:21,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:50:21,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:50:21,419 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:50:21,419 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:50:21,419 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:50:21,420 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 11:50:21,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:50:21,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:50:21,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:50:21,420 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:50:21,427 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:50:21,427 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:50:21,429 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:50:21,429 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 11:50:21,430 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:50:21,430 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:50:21,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:50:21,430 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:50:21,430 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:50:21,431 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:50:21,431 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:50:21,434 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:50:21,434 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 11:50:21,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:50:21,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:50:21,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:50:21,435 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:50:21,436 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:50:21,436 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:50:21,441 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:50:21,442 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 11:50:21,442 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:50:21,442 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:50:21,442 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:50:21,442 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:50:21,442 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:50:21,443 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:50:21,443 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:50:21,444 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:50:21,445 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 11:50:21,445 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:50:21,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:50:21,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:50:21,445 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:50:21,446 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:50:21,446 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:50:21,448 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:50:21,448 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 11:50:21,449 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:50:21,450 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:50:21,450 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:50:21,450 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:50:21,450 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:50:21,454 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:50:21,454 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:50:21,455 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:50:21,456 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 11:50:21,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:50:21,456 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:50:21,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:50:21,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:50:21,457 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:50:21,457 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:50:21,457 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:50:21,457 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:50:21,458 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 11:50:21,458 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:50:21,458 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:50:21,458 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:50:21,458 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:50:21,459 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:50:21,459 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:50:21,461 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:50:21,461 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 11:50:21,462 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:50:21,462 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:50:21,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:50:21,462 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:50:21,462 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:50:21,463 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:50:21,463 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:50:21,463 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:50:21,463 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 11:50:21,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:50:21,464 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:50:21,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:50:21,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:50:21,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:50:21,464 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:50:21,465 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:50:21,466 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 11:50:21,468 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 11:50:21,468 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 11:50:21,470 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 11:50:21,470 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 11:50:21,470 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 11:50:21,471 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 19 Supporting invariants [] [2018-11-10 11:50:21,471 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 11:50:21,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:50:21,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:50:21,545 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:50:21,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:50:21,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:50:21,585 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 11:50:21,588 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 11:50:21,589 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 131 states and 180 transitions. cyclomatic complexity: 50 Second operand 4 states. [2018-11-10 11:50:21,628 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 131 states and 180 transitions. cyclomatic complexity: 50. Second operand 4 states. Result 226 states and 325 transitions. Complement of second has 6 states. [2018-11-10 11:50:21,630 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 11:50:21,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 11:50:21,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2018-11-10 11:50:21,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 113 transitions. Stem has 35 letters. Loop has 30 letters. [2018-11-10 11:50:21,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:50:21,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 113 transitions. Stem has 65 letters. Loop has 30 letters. [2018-11-10 11:50:21,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:50:21,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 113 transitions. Stem has 35 letters. Loop has 60 letters. [2018-11-10 11:50:21,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:50:21,636 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 226 states and 325 transitions. [2018-11-10 11:50:21,638 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 11:50:21,638 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 226 states to 0 states and 0 transitions. [2018-11-10 11:50:21,638 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 11:50:21,638 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 11:50:21,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 11:50:21,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 11:50:21,639 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:50:21,639 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:50:21,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:50:21,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:50:21,639 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2018-11-10 11:50:21,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:50:21,639 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-10 11:50:21,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 11:50:21,640 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-10 11:50:21,640 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 11:50:21,640 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 11:50:21,640 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 11:50:21,640 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 11:50:21,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 11:50:21,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 11:50:21,640 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:50:21,640 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:50:21,640 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:50:21,640 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 11:50:21,641 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 11:50:21,641 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 11:50:21,641 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 11:50:21,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 11:50:21 BoogieIcfgContainer [2018-11-10 11:50:21,653 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 11:50:21,653 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 11:50:21,653 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 11:50:21,655 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 11:50:21,655 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:50:16" (3/4) ... [2018-11-10 11:50:21,658 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 11:50:21,658 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 11:50:21,659 INFO L168 Benchmark]: Toolchain (without parser) took 5614.64 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 334.5 MB). Free memory was 960.3 MB in the beginning and 996.7 MB in the end (delta: -36.4 MB). Peak memory consumption was 298.1 MB. Max. memory is 11.5 GB. [2018-11-10 11:50:21,660 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:50:21,660 INFO L168 Benchmark]: CACSL2BoogieTranslator took 226.84 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 944.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-10 11:50:21,660 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.4 MB). Free memory was 944.2 MB in the beginning and 1.2 GB in the end (delta: -220.9 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. [2018-11-10 11:50:21,661 INFO L168 Benchmark]: Boogie Preprocessor took 23.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-10 11:50:21,661 INFO L168 Benchmark]: RCFGBuilder took 437.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 38.7 MB). Peak memory consumption was 38.7 MB. Max. memory is 11.5 GB. [2018-11-10 11:50:21,662 INFO L168 Benchmark]: BuchiAutomizer took 4846.33 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 164.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 118.8 MB). Peak memory consumption was 282.9 MB. Max. memory is 11.5 GB. [2018-11-10 11:50:21,662 INFO L168 Benchmark]: Witness Printer took 5.03 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 996.7 MB in the end (delta: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 11.5 GB. [2018-11-10 11:50:21,665 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 226.84 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 944.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 72.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.4 MB). Free memory was 944.2 MB in the beginning and 1.2 GB in the end (delta: -220.9 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 437.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 38.7 MB). Peak memory consumption was 38.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4846.33 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 164.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 118.8 MB). Peak memory consumption was 282.9 MB. Max. memory is 11.5 GB. * Witness Printer took 5.03 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 996.7 MB in the end (delta: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 19 and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.8s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 4.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 131 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 548 SDtfs, 180 SDslu, 783 SDs, 0 SdLazy, 32 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital650 mio100 ax109 hnf102 lsp15 ukn78 mio100 lsp100 div137 bol100 ite100 ukn100 eq188 hnf75 smp100 dnf707 smp49 tf100 neg99 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...