./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.4_false-unreach-call.1.ufo.BOUNDED-8.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e8050446-9f5b-43cd-85a3-931eb834f19c/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e8050446-9f5b-43cd-85a3-931eb834f19c/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e8050446-9f5b-43cd-85a3-931eb834f19c/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e8050446-9f5b-43cd-85a3-931eb834f19c/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.4_false-unreach-call.1.ufo.BOUNDED-8.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_e8050446-9f5b-43cd-85a3-931eb834f19c/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e8050446-9f5b-43cd-85a3-931eb834f19c/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 188aaf9001adccb91c68b27294cad7318066e2a0 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 15:08:33,684 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 15:08:33,685 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 15:08:33,694 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 15:08:33,694 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 15:08:33,695 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 15:08:33,696 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 15:08:33,697 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 15:08:33,698 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 15:08:33,699 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 15:08:33,699 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 15:08:33,700 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 15:08:33,700 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 15:08:33,701 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 15:08:33,702 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 15:08:33,702 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 15:08:33,703 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 15:08:33,704 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 15:08:33,706 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 15:08:33,707 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 15:08:33,707 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 15:08:33,708 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 15:08:33,710 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 15:08:33,710 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 15:08:33,710 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 15:08:33,711 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 15:08:33,712 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 15:08:33,712 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 15:08:33,713 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 15:08:33,713 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 15:08:33,714 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 15:08:33,715 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 15:08:33,715 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 15:08:33,715 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 15:08:33,716 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 15:08:33,716 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 15:08:33,716 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e8050446-9f5b-43cd-85a3-931eb834f19c/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 15:08:33,727 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 15:08:33,727 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 15:08:33,728 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 15:08:33,728 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 15:08:33,728 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 15:08:33,728 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 15:08:33,728 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 15:08:33,729 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 15:08:33,729 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 15:08:33,729 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 15:08:33,729 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 15:08:33,729 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 15:08:33,729 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 15:08:33,729 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 15:08:33,730 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 15:08:33,730 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 15:08:33,730 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 15:08:33,730 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 15:08:33,730 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 15:08:33,730 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 15:08:33,730 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 15:08:33,731 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 15:08:33,731 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 15:08:33,731 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 15:08:33,731 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 15:08:33,731 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 15:08:33,731 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 15:08:33,731 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 15:08:33,732 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 15:08:33,732 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 15:08:33,732 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 15:08:33,732 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 15:08:33,733 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_e8050446-9f5b-43cd-85a3-931eb834f19c/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 -> 188aaf9001adccb91c68b27294cad7318066e2a0 [2018-11-18 15:08:33,752 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 15:08:33,760 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 15:08:33,763 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 15:08:33,764 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 15:08:33,764 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 15:08:33,765 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e8050446-9f5b-43cd-85a3-931eb834f19c/bin-2019/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.4_false-unreach-call.1.ufo.BOUNDED-8.pals_true-termination.c [2018-11-18 15:08:33,810 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e8050446-9f5b-43cd-85a3-931eb834f19c/bin-2019/uautomizer/data/baddaccaf/6e9f74c7c5fe402c816fdaed29d30d3f/FLAG8c4da4d52 [2018-11-18 15:08:34,182 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 15:08:34,182 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e8050446-9f5b-43cd-85a3-931eb834f19c/sv-benchmarks/c/seq-mthreaded/pals_floodmax.4_false-unreach-call.1.ufo.BOUNDED-8.pals_true-termination.c [2018-11-18 15:08:34,191 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e8050446-9f5b-43cd-85a3-931eb834f19c/bin-2019/uautomizer/data/baddaccaf/6e9f74c7c5fe402c816fdaed29d30d3f/FLAG8c4da4d52 [2018-11-18 15:08:34,574 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e8050446-9f5b-43cd-85a3-931eb834f19c/bin-2019/uautomizer/data/baddaccaf/6e9f74c7c5fe402c816fdaed29d30d3f [2018-11-18 15:08:34,576 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 15:08:34,577 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 15:08:34,578 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 15:08:34,578 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 15:08:34,579 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 15:08:34,580 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:08:34" (1/1) ... [2018-11-18 15:08:34,582 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37764a8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:08:34, skipping insertion in model container [2018-11-18 15:08:34,582 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:08:34" (1/1) ... [2018-11-18 15:08:34,589 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 15:08:34,622 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 15:08:34,801 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 15:08:34,809 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 15:08:34,868 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 15:08:34,925 INFO L195 MainTranslator]: Completed translation [2018-11-18 15:08:34,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:08:34 WrapperNode [2018-11-18 15:08:34,926 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 15:08:34,927 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 15:08:34,927 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 15:08:34,927 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 15:08:34,933 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:08:34" (1/1) ... [2018-11-18 15:08:34,943 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:08:34" (1/1) ... [2018-11-18 15:08:34,971 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 15:08:34,972 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 15:08:34,972 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 15:08:34,972 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 15:08:34,977 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:08:34" (1/1) ... [2018-11-18 15:08:34,977 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:08:34" (1/1) ... [2018-11-18 15:08:34,980 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:08:34" (1/1) ... [2018-11-18 15:08:34,981 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:08:34" (1/1) ... [2018-11-18 15:08:34,990 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:08:34" (1/1) ... [2018-11-18 15:08:35,001 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:08:34" (1/1) ... [2018-11-18 15:08:35,004 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:08:34" (1/1) ... [2018-11-18 15:08:35,008 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 15:08:35,009 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 15:08:35,009 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 15:08:35,009 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 15:08:35,009 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:08:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e8050446-9f5b-43cd-85a3-931eb834f19c/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-18 15:08:35,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 15:08:35,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 15:08:35,866 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 15:08:35,867 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:08:35 BoogieIcfgContainer [2018-11-18 15:08:35,867 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 15:08:35,868 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 15:08:35,868 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 15:08:35,871 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 15:08:35,871 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 15:08:35,872 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 03:08:34" (1/3) ... [2018-11-18 15:08:35,872 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@67b6c9c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 03:08:35, skipping insertion in model container [2018-11-18 15:08:35,873 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 15:08:35,873 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:08:34" (2/3) ... [2018-11-18 15:08:35,873 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@67b6c9c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 03:08:35, skipping insertion in model container [2018-11-18 15:08:35,873 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 15:08:35,873 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:08:35" (3/3) ... [2018-11-18 15:08:35,874 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_floodmax.4_false-unreach-call.1.ufo.BOUNDED-8.pals_true-termination.c [2018-11-18 15:08:35,904 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 15:08:35,904 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 15:08:35,904 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 15:08:35,904 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 15:08:35,905 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 15:08:35,905 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 15:08:35,905 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 15:08:35,905 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 15:08:35,905 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 15:08:35,918 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 290 states. [2018-11-18 15:08:35,939 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 108 [2018-11-18 15:08:35,939 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:08:35,939 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:08:35,945 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:08:35,945 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] [2018-11-18 15:08:35,945 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 15:08:35,945 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 290 states. [2018-11-18 15:08:35,951 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 108 [2018-11-18 15:08:35,951 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:08:35,951 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:08:35,952 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:08:35,952 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] [2018-11-18 15:08:35,960 INFO L794 eck$LassoCheckResult]: Stem: 114#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p13~0 := 0;~p14~0 := 0;~p21~0 := 0;~p23~0 := 0;~p24~0 := 0;~p31~0 := 0;~p32~0 := 0;~p34~0 := 0;~p41~0 := 0;~p42~0 := 0;~p43~0 := 0;~nodes~0.base, ~nodes~0.offset := ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.base(), ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.offset();~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]; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc 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~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~ret52, main_#t~ret53, main_#t~post54, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet12;havoc main_#t~nondet12;~ep13~0 := main_#t~nondet13;havoc main_#t~nondet13;~ep14~0 := main_#t~nondet14;havoc main_#t~nondet14;~ep21~0 := main_#t~nondet15;havoc main_#t~nondet15;~ep23~0 := main_#t~nondet16;havoc main_#t~nondet16;~ep24~0 := main_#t~nondet17;havoc main_#t~nondet17;~ep31~0 := main_#t~nondet18;havoc main_#t~nondet18;~ep32~0 := main_#t~nondet19;havoc main_#t~nondet19;~ep34~0 := main_#t~nondet20;havoc main_#t~nondet20;~ep41~0 := main_#t~nondet21;havoc main_#t~nondet21;~ep42~0 := main_#t~nondet22;havoc main_#t~nondet22;~ep43~0 := main_#t~nondet23;havoc main_#t~nondet23;~id1~0 := main_#t~nondet24;havoc main_#t~nondet24;~r1~0 := main_#t~nondet25;havoc main_#t~nondet25;~st1~0 := main_#t~nondet26;havoc main_#t~nondet26;~nl1~0 := main_#t~nondet27;havoc main_#t~nondet27;~m1~0 := main_#t~nondet28;havoc main_#t~nondet28;~max1~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode1~0 := main_#t~nondet30;havoc main_#t~nondet30;~id2~0 := main_#t~nondet31;havoc main_#t~nondet31;~r2~0 := main_#t~nondet32;havoc main_#t~nondet32;~st2~0 := main_#t~nondet33;havoc main_#t~nondet33;~nl2~0 := main_#t~nondet34;havoc main_#t~nondet34;~m2~0 := main_#t~nondet35;havoc main_#t~nondet35;~max2~0 := main_#t~nondet36;havoc main_#t~nondet36;~mode2~0 := main_#t~nondet37;havoc main_#t~nondet37;~id3~0 := main_#t~nondet38;havoc main_#t~nondet38;~r3~0 := main_#t~nondet39;havoc main_#t~nondet39;~st3~0 := main_#t~nondet40;havoc main_#t~nondet40;~nl3~0 := main_#t~nondet41;havoc main_#t~nondet41;~m3~0 := main_#t~nondet42;havoc main_#t~nondet42;~max3~0 := main_#t~nondet43;havoc main_#t~nondet43;~mode3~0 := main_#t~nondet44;havoc main_#t~nondet44;~id4~0 := main_#t~nondet45;havoc main_#t~nondet45;~r4~0 := main_#t~nondet46;havoc main_#t~nondet46;~st4~0 := main_#t~nondet47;havoc main_#t~nondet47;~nl4~0 := main_#t~nondet48;havoc main_#t~nondet48;~m4~0 := main_#t~nondet49;havoc main_#t~nondet49;~max4~0 := main_#t~nondet50;havoc main_#t~nondet50;~mode4~0 := main_#t~nondet51;havoc main_#t~nondet51;assume { :begin_inline_init } true;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r141~0, init_~r211~0, init_~r231~0, init_~r241~0, init_~r311~0, init_~r321~0, init_~r341~0, init_~r411~0, init_~r421~0, init_~r431~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r142~0, init_~tmp___1~0, init_~r212~0, init_~tmp___2~0, init_~r232~0, init_~tmp___3~0, init_~r242~0, init_~tmp___4~0, init_~r312~0, init_~tmp___5~0, init_~r322~0, init_~tmp___6~0, init_~r342~0, init_~tmp___7~0, init_~r412~0, init_~tmp___8~0, init_~r422~0, init_~tmp___9~0, init_~r432~0, init_~tmp___10~0, init_~r123~0, init_~tmp___11~0, init_~r133~0, init_~tmp___12~0, init_~r143~0, init_~tmp___13~0, init_~r213~0, init_~tmp___14~0, init_~r233~0, init_~tmp___15~0, init_~r243~0, init_~tmp___16~0, init_~r313~0, init_~tmp___17~0, init_~r323~0, init_~tmp___18~0, init_~r343~0, init_~tmp___19~0, init_~r413~0, init_~tmp___20~0, init_~r423~0, init_~tmp___21~0, init_~r433~0, init_~tmp___22~0, init_~tmp___23~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r141~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r241~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r341~0;havoc init_~r411~0;havoc init_~r421~0;havoc init_~r431~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r142~0;havoc init_~tmp___1~0;havoc init_~r212~0;havoc init_~tmp___2~0;havoc init_~r232~0;havoc init_~tmp___3~0;havoc init_~r242~0;havoc init_~tmp___4~0;havoc init_~r312~0;havoc init_~tmp___5~0;havoc init_~r322~0;havoc init_~tmp___6~0;havoc init_~r342~0;havoc init_~tmp___7~0;havoc init_~r412~0;havoc init_~tmp___8~0;havoc init_~r422~0;havoc init_~tmp___9~0;havoc init_~r432~0;havoc init_~tmp___10~0;havoc init_~r123~0;havoc init_~tmp___11~0;havoc init_~r133~0;havoc init_~tmp___12~0;havoc init_~r143~0;havoc init_~tmp___13~0;havoc init_~r213~0;havoc init_~tmp___14~0;havoc init_~r233~0;havoc init_~tmp___15~0;havoc init_~r243~0;havoc init_~tmp___16~0;havoc init_~r313~0;havoc init_~tmp___17~0;havoc init_~r323~0;havoc init_~tmp___18~0;havoc init_~r343~0;havoc init_~tmp___19~0;havoc init_~r413~0;havoc init_~tmp___20~0;havoc init_~r423~0;havoc init_~tmp___21~0;havoc init_~r433~0;havoc init_~tmp___22~0;havoc init_~tmp___23~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r141~0 := ~ep14~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r241~0 := ~ep24~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0;init_~r341~0 := ~ep34~0;init_~r411~0 := ~ep41~0;init_~r421~0 := ~ep42~0;init_~r431~0 := ~ep43~0; 175#L436true assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 197#L447true init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 89#L457true assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 88#L468true init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 142#L478true assume 0 != init_~r141~0 % 256;init_~tmp___1~0 := 1; 140#L489true init_~r142~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 50#L499true assume 0 != init_~r211~0 % 256;init_~tmp___2~0 := 1; 48#L510true init_~r212~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 249#L520true assume 0 != init_~r231~0 % 256;init_~tmp___3~0 := 1; 247#L531true init_~r232~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 166#L541true assume 0 != init_~r241~0 % 256;init_~tmp___4~0 := 1; 165#L552true init_~r242~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 219#L562true assume 0 != init_~r311~0 % 256;init_~tmp___5~0 := 1; 218#L573true init_~r312~0 := (if 0 == init_~tmp___5~0 then 0 else 1); 132#L583true assume 0 != init_~r321~0 % 256;init_~tmp___6~0 := 1; 131#L594true init_~r322~0 := (if 0 == init_~tmp___6~0 then 0 else 1); 33#L604true assume 0 != init_~r341~0 % 256;init_~tmp___7~0 := 1; 32#L615true init_~r342~0 := (if 0 == init_~tmp___7~0 then 0 else 1); 232#L625true assume 0 != init_~r411~0 % 256;init_~tmp___8~0 := 1; 230#L636true init_~r412~0 := (if 0 == init_~tmp___8~0 then 0 else 1); 291#L646true assume 0 != init_~r421~0 % 256;init_~tmp___9~0 := 1; 290#L657true init_~r422~0 := (if 0 == init_~tmp___9~0 then 0 else 1); 205#L667true assume 0 != init_~r431~0 % 256;init_~tmp___10~0 := 1; 204#L678true init_~r432~0 := (if 0 == init_~tmp___10~0 then 0 else 1); 119#L688true assume 0 != init_~r122~0 % 256;init_~tmp___11~0 := 1; 118#L699true init_~r123~0 := (if 0 == init_~tmp___11~0 then 0 else 1); 18#L709true assume 0 != init_~r132~0 % 256;init_~tmp___12~0 := 1; 17#L720true init_~r133~0 := (if 0 == init_~tmp___12~0 then 0 else 1); 80#L730true assume 0 != init_~r142~0 % 256;init_~tmp___13~0 := 1; 78#L741true init_~r143~0 := (if 0 == init_~tmp___13~0 then 0 else 1); 272#L751true assume 0 != init_~r212~0 % 256;init_~tmp___14~0 := 1; 271#L762true init_~r213~0 := (if 0 == init_~tmp___14~0 then 0 else 1); 171#L772true assume 0 != init_~r232~0 % 256;init_~tmp___15~0 := 1; 188#L783true init_~r233~0 := (if 0 == init_~tmp___15~0 then 0 else 1); 84#L793true assume 0 != init_~r242~0 % 256;init_~tmp___16~0 := 1; 83#L804true init_~r243~0 := (if 0 == init_~tmp___16~0 then 0 else 1); 137#L814true assume 0 != init_~r312~0 % 256;init_~tmp___17~0 := 1; 135#L825true init_~r313~0 := (if 0 == init_~tmp___17~0 then 0 else 1); 41#L835true assume 0 != init_~r322~0 % 256;init_~tmp___18~0 := 1; 39#L846true init_~r323~0 := (if 0 == init_~tmp___18~0 then 0 else 1); 239#L856true assume 0 != init_~r342~0 % 256;init_~tmp___19~0 := 1; 238#L867true init_~r343~0 := (if 0 == init_~tmp___19~0 then 0 else 1); 158#L877true assume 0 != init_~r412~0 % 256;init_~tmp___20~0 := 1; 157#L888true init_~r413~0 := (if 0 == init_~tmp___20~0 then 0 else 1); 212#L898true assume 0 != init_~r422~0 % 256;init_~tmp___21~0 := 1; 211#L909true init_~r423~0 := (if 0 == init_~tmp___21~0 then 0 else 1); 126#L919true assume 0 != init_~r432~0 % 256;init_~tmp___22~0 := 1; 125#L930true init_~r433~0 := (if 0 == init_~tmp___22~0 then 0 else 1); 25#L940true assume !(~id1~0 != ~id2~0);init_~tmp___23~0 := 0; 28#L940-1true init_#res := init_~tmp___23~0; 36#L1061true main_#t~ret52 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret52;havoc main_#t~ret52;assume 0 != main_~i2~0;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0 := 0; 65#L1198-3true [2018-11-18 15:08:35,960 INFO L796 eck$LassoCheckResult]: Loop: 65#L1198-3true assume true; 61#L1198-1true assume !!(main_~i2~0 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_#t~ite1, node1_#t~ite2; 265#L151true assume !(0 != ~mode1~0 % 256); 180#L183true assume !(~r1~0 < 3); 177#L183-1true ~mode1~0 := 1; 262#L151-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite3, node2_#t~ite4, node2_#t~ite5; 97#L204true assume !(0 != ~mode2~0 % 256); 149#L236true assume !(~r2~0 < 3); 144#L236-1true ~mode2~0 := 1; 90#L204-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6, node3_#t~ite7, node3_#t~ite8; 53#L257true assume !(0 != ~mode3~0 % 256); 251#L289true assume !(~r3~0 < 3); 248#L289-1true ~mode3~0 := 1; 47#L257-2true assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9, node4_#t~ite10, node4_#t~ite11; 161#L310true assume !(0 != ~mode4~0 % 256); 214#L342true assume !(~r4~0 < 3); 215#L342-1true ~mode4~0 := 1; 286#L310-2true assume { :end_inline_node4 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 191#L1069true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1 := 0; 194#L1069-1true check_#res := check_~tmp~1; 64#L1121true main_#t~ret53 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret53;havoc main_#t~ret53;assume { :begin_inline_assert } true;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 257#L1241true assume !(0 == assert_~arg % 256); 227#L1236true assume { :end_inline_assert } true;main_#t~post54 := main_~i2~0;main_~i2~0 := 1 + main_#t~post54;havoc main_#t~post54; 65#L1198-3true [2018-11-18 15:08:35,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:08:35,966 INFO L82 PathProgramCache]: Analyzing trace with hash 15460348, now seen corresponding path program 1 times [2018-11-18 15:08:35,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:08:35,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:08:36,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:08:36,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:08:36,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:08:36,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:08:36,154 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-18 15:08:36,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:08:36,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:08:36,159 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 15:08:36,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:08:36,159 INFO L82 PathProgramCache]: Analyzing trace with hash 341808156, now seen corresponding path program 1 times [2018-11-18 15:08:36,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:08:36,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:08:36,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:08:36,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:08:36,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:08:36,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:08:36,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:08:36,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:08:36,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 15:08:36,230 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 15:08:36,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:08:36,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:08:36,241 INFO L87 Difference]: Start difference. First operand 290 states. Second operand 5 states. [2018-11-18 15:08:36,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:08:36,335 INFO L93 Difference]: Finished difference Result 294 states and 520 transitions. [2018-11-18 15:08:36,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 15:08:36,340 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 294 states and 520 transitions. [2018-11-18 15:08:36,344 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 107 [2018-11-18 15:08:36,350 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 294 states to 285 states and 503 transitions. [2018-11-18 15:08:36,351 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 285 [2018-11-18 15:08:36,352 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 285 [2018-11-18 15:08:36,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 285 states and 503 transitions. [2018-11-18 15:08:36,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:08:36,354 INFO L705 BuchiCegarLoop]: Abstraction has 285 states and 503 transitions. [2018-11-18 15:08:36,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states and 503 transitions. [2018-11-18 15:08:36,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2018-11-18 15:08:36,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-11-18 15:08:36,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 503 transitions. [2018-11-18 15:08:36,384 INFO L728 BuchiCegarLoop]: Abstraction has 285 states and 503 transitions. [2018-11-18 15:08:36,384 INFO L608 BuchiCegarLoop]: Abstraction has 285 states and 503 transitions. [2018-11-18 15:08:36,385 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 15:08:36,385 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 285 states and 503 transitions. [2018-11-18 15:08:36,386 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 107 [2018-11-18 15:08:36,386 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:08:36,387 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:08:36,388 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:08:36,388 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, 1] [2018-11-18 15:08:36,389 INFO L794 eck$LassoCheckResult]: Stem: 806#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p13~0 := 0;~p14~0 := 0;~p21~0 := 0;~p23~0 := 0;~p24~0 := 0;~p31~0 := 0;~p32~0 := 0;~p34~0 := 0;~p41~0 := 0;~p42~0 := 0;~p43~0 := 0;~nodes~0.base, ~nodes~0.offset := ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.base(), ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.offset();~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]; 617#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc 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~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~ret52, main_#t~ret53, main_#t~post54, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet12;havoc main_#t~nondet12;~ep13~0 := main_#t~nondet13;havoc main_#t~nondet13;~ep14~0 := main_#t~nondet14;havoc main_#t~nondet14;~ep21~0 := main_#t~nondet15;havoc main_#t~nondet15;~ep23~0 := main_#t~nondet16;havoc main_#t~nondet16;~ep24~0 := main_#t~nondet17;havoc main_#t~nondet17;~ep31~0 := main_#t~nondet18;havoc main_#t~nondet18;~ep32~0 := main_#t~nondet19;havoc main_#t~nondet19;~ep34~0 := main_#t~nondet20;havoc main_#t~nondet20;~ep41~0 := main_#t~nondet21;havoc main_#t~nondet21;~ep42~0 := main_#t~nondet22;havoc main_#t~nondet22;~ep43~0 := main_#t~nondet23;havoc main_#t~nondet23;~id1~0 := main_#t~nondet24;havoc main_#t~nondet24;~r1~0 := main_#t~nondet25;havoc main_#t~nondet25;~st1~0 := main_#t~nondet26;havoc main_#t~nondet26;~nl1~0 := main_#t~nondet27;havoc main_#t~nondet27;~m1~0 := main_#t~nondet28;havoc main_#t~nondet28;~max1~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode1~0 := main_#t~nondet30;havoc main_#t~nondet30;~id2~0 := main_#t~nondet31;havoc main_#t~nondet31;~r2~0 := main_#t~nondet32;havoc main_#t~nondet32;~st2~0 := main_#t~nondet33;havoc main_#t~nondet33;~nl2~0 := main_#t~nondet34;havoc main_#t~nondet34;~m2~0 := main_#t~nondet35;havoc main_#t~nondet35;~max2~0 := main_#t~nondet36;havoc main_#t~nondet36;~mode2~0 := main_#t~nondet37;havoc main_#t~nondet37;~id3~0 := main_#t~nondet38;havoc main_#t~nondet38;~r3~0 := main_#t~nondet39;havoc main_#t~nondet39;~st3~0 := main_#t~nondet40;havoc main_#t~nondet40;~nl3~0 := main_#t~nondet41;havoc main_#t~nondet41;~m3~0 := main_#t~nondet42;havoc main_#t~nondet42;~max3~0 := main_#t~nondet43;havoc main_#t~nondet43;~mode3~0 := main_#t~nondet44;havoc main_#t~nondet44;~id4~0 := main_#t~nondet45;havoc main_#t~nondet45;~r4~0 := main_#t~nondet46;havoc main_#t~nondet46;~st4~0 := main_#t~nondet47;havoc main_#t~nondet47;~nl4~0 := main_#t~nondet48;havoc main_#t~nondet48;~m4~0 := main_#t~nondet49;havoc main_#t~nondet49;~max4~0 := main_#t~nondet50;havoc main_#t~nondet50;~mode4~0 := main_#t~nondet51;havoc main_#t~nondet51;assume { :begin_inline_init } true;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r141~0, init_~r211~0, init_~r231~0, init_~r241~0, init_~r311~0, init_~r321~0, init_~r341~0, init_~r411~0, init_~r421~0, init_~r431~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r142~0, init_~tmp___1~0, init_~r212~0, init_~tmp___2~0, init_~r232~0, init_~tmp___3~0, init_~r242~0, init_~tmp___4~0, init_~r312~0, init_~tmp___5~0, init_~r322~0, init_~tmp___6~0, init_~r342~0, init_~tmp___7~0, init_~r412~0, init_~tmp___8~0, init_~r422~0, init_~tmp___9~0, init_~r432~0, init_~tmp___10~0, init_~r123~0, init_~tmp___11~0, init_~r133~0, init_~tmp___12~0, init_~r143~0, init_~tmp___13~0, init_~r213~0, init_~tmp___14~0, init_~r233~0, init_~tmp___15~0, init_~r243~0, init_~tmp___16~0, init_~r313~0, init_~tmp___17~0, init_~r323~0, init_~tmp___18~0, init_~r343~0, init_~tmp___19~0, init_~r413~0, init_~tmp___20~0, init_~r423~0, init_~tmp___21~0, init_~r433~0, init_~tmp___22~0, init_~tmp___23~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r141~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r241~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r341~0;havoc init_~r411~0;havoc init_~r421~0;havoc init_~r431~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r142~0;havoc init_~tmp___1~0;havoc init_~r212~0;havoc init_~tmp___2~0;havoc init_~r232~0;havoc init_~tmp___3~0;havoc init_~r242~0;havoc init_~tmp___4~0;havoc init_~r312~0;havoc init_~tmp___5~0;havoc init_~r322~0;havoc init_~tmp___6~0;havoc init_~r342~0;havoc init_~tmp___7~0;havoc init_~r412~0;havoc init_~tmp___8~0;havoc init_~r422~0;havoc init_~tmp___9~0;havoc init_~r432~0;havoc init_~tmp___10~0;havoc init_~r123~0;havoc init_~tmp___11~0;havoc init_~r133~0;havoc init_~tmp___12~0;havoc init_~r143~0;havoc init_~tmp___13~0;havoc init_~r213~0;havoc init_~tmp___14~0;havoc init_~r233~0;havoc init_~tmp___15~0;havoc init_~r243~0;havoc init_~tmp___16~0;havoc init_~r313~0;havoc init_~tmp___17~0;havoc init_~r323~0;havoc init_~tmp___18~0;havoc init_~r343~0;havoc init_~tmp___19~0;havoc init_~r413~0;havoc init_~tmp___20~0;havoc init_~r423~0;havoc init_~tmp___21~0;havoc init_~r433~0;havoc init_~tmp___22~0;havoc init_~tmp___23~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r141~0 := ~ep14~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r241~0 := ~ep24~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0;init_~r341~0 := ~ep34~0;init_~r411~0 := ~ep41~0;init_~r421~0 := ~ep42~0;init_~r431~0 := ~ep43~0; 618#L436 assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 774#L447 init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 768#L457 assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 642#L468 init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 766#L478 assume 0 != init_~r141~0 % 256;init_~tmp___1~0 := 1; 710#L489 init_~r142~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 706#L499 assume 0 != init_~r211~0 % 256;init_~tmp___2~0 := 1; 616#L510 init_~r212~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 699#L520 assume 0 != init_~r231~0 % 256;init_~tmp___3~0 := 1; 697#L531 init_~r232~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 842#L541 assume 0 != init_~r241~0 % 256;init_~tmp___4~0 := 1; 801#L552 init_~r242~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 841#L562 assume 0 != init_~r311~0 % 256;init_~tmp___5~0 := 1; 607#L573 init_~r312~0 := (if 0 == init_~tmp___5~0 then 0 else 1); 823#L583 assume 0 != init_~r321~0 % 256;init_~tmp___6~0 := 1; 671#L594 init_~r322~0 := (if 0 == init_~tmp___6~0 then 0 else 1); 668#L604 assume 0 != init_~r341~0 % 256;init_~tmp___7~0 := 1; 666#L615 init_~r342~0 := (if 0 == init_~tmp___7~0 then 0 else 1); 667#L625 assume 0 != init_~r411~0 % 256;init_~tmp___8~0 := 1; 665#L636 init_~r412~0 := (if 0 == init_~tmp___8~0 then 0 else 1); 881#L646 assume 0 != init_~r421~0 % 256;init_~tmp___9~0 := 1; 764#L657 init_~r422~0 := (if 0 == init_~tmp___9~0 then 0 else 1); 870#L667 assume 0 != init_~r431~0 % 256;init_~tmp___10~0 := 1; 813#L678 init_~r432~0 := (if 0 == init_~tmp___10~0 then 0 else 1); 810#L688 assume 0 != init_~r122~0 % 256;init_~tmp___11~0 := 1; 637#L699 init_~r123~0 := (if 0 == init_~tmp___11~0 then 0 else 1); 634#L709 assume 0 != init_~r132~0 % 256;init_~tmp___12~0 := 1; 632#L720 init_~r133~0 := (if 0 == init_~tmp___12~0 then 0 else 1); 633#L730 assume 0 != init_~r142~0 % 256;init_~tmp___13~0 := 1; 628#L741 init_~r143~0 := (if 0 == init_~tmp___13~0 then 0 else 1); 751#L751 assume 0 != init_~r212~0 % 256;init_~tmp___14~0 := 1; 750#L762 init_~r213~0 := (if 0 == init_~tmp___14~0 then 0 else 1); 849#L772 assume 0 != init_~r232~0 % 256;init_~tmp___15~0 := 1; 762#L783 init_~r233~0 := (if 0 == init_~tmp___15~0 then 0 else 1); 760#L793 assume 0 != init_~r242~0 % 256;init_~tmp___16~0 := 1; 622#L804 init_~r243~0 := (if 0 == init_~tmp___16~0 then 0 else 1); 757#L814 assume 0 != init_~r312~0 % 256;init_~tmp___17~0 := 1; 691#L825 init_~r313~0 := (if 0 == init_~tmp___17~0 then 0 else 1); 684#L835 assume 0 != init_~r322~0 % 256;init_~tmp___18~0 := 1; 682#L846 init_~r323~0 := (if 0 == init_~tmp___18~0 then 0 else 1); 683#L856 assume 0 != init_~r342~0 % 256;init_~tmp___19~0 := 1; 679#L867 init_~r343~0 := (if 0 == init_~tmp___19~0 then 0 else 1); 835#L877 assume 0 != init_~r412~0 % 256;init_~tmp___20~0 := 1; 786#L888 init_~r413~0 := (if 0 == init_~tmp___20~0 then 0 else 1); 834#L898 assume 0 != init_~r422~0 % 256;init_~tmp___21~0 := 1; 819#L909 init_~r423~0 := (if 0 == init_~tmp___21~0 then 0 else 1); 817#L919 assume 0 != init_~r432~0 % 256;init_~tmp___22~0 := 1; 655#L930 init_~r433~0 := (if 0 == init_~tmp___22~0 then 0 else 1); 652#L940 assume !(~id1~0 != ~id2~0);init_~tmp___23~0 := 0; 645#L940-1 init_#res := init_~tmp___23~0; 659#L1061 main_#t~ret52 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret52;havoc main_#t~ret52;assume 0 != main_~i2~0;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0 := 0; 675#L1198-3 [2018-11-18 15:08:36,389 INFO L796 eck$LassoCheckResult]: Loop: 675#L1198-3 assume true; 728#L1198-1 assume !!(main_~i2~0 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_#t~ite1, node1_#t~ite2; 729#L151 assume !(0 != ~mode1~0 % 256); 856#L183 assume !(~r1~0 < 3); 658#L183-1 ~mode1~0 := 1; 752#L151-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite3, node2_#t~ite4, node2_#t~ite5; 780#L204 assume !(0 != ~mode2~0 % 256); 781#L236 assume !(~r2~0 < 3); 727#L236-1 ~mode2~0 := 1; 770#L204-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6, node3_#t~ite7, node3_#t~ite8; 711#L257 assume !(0 != ~mode3~0 % 256); 713#L289 assume !(~r3~0 < 3); 800#L289-1 ~mode3~0 := 1; 694#L257-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9, node4_#t~ite10, node4_#t~ite11; 695#L310 assume !(0 != ~mode4~0 % 256); 839#L342 assume !(~r4~0 < 3); 745#L342-1 ~mode4~0 := 1; 873#L310-2 assume { :end_inline_node4 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 862#L1069 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 863#L1070 assume ~st1~0 + ~nl1~0 <= 1; 882#L1071 assume ~st2~0 + ~nl2~0 <= 1; 676#L1072 assume ~st3~0 + ~nl3~0 <= 1; 677#L1073 assume ~st4~0 + ~nl4~0 <= 1; 825#L1074 assume ~r1~0 >= 3; 609#L1078 assume ~r1~0 < 3; 610#L1083 assume ~r1~0 >= 3; 673#L1088 assume ~r1~0 < 3;check_~tmp~1 := 1; 739#L1069-1 check_#res := check_~tmp~1; 735#L1121 main_#t~ret53 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret53;havoc main_#t~ret53;assume { :begin_inline_assert } true;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 736#L1241 assume !(0 == assert_~arg % 256); 879#L1236 assume { :end_inline_assert } true;main_#t~post54 := main_~i2~0;main_~i2~0 := 1 + main_#t~post54;havoc main_#t~post54; 675#L1198-3 [2018-11-18 15:08:36,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:08:36,390 INFO L82 PathProgramCache]: Analyzing trace with hash 15460348, now seen corresponding path program 2 times [2018-11-18 15:08:36,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:08:36,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:08:36,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:08:36,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:08:36,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:08:36,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:08:36,463 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-18 15:08:36,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:08:36,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:08:36,463 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 15:08:36,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:08:36,464 INFO L82 PathProgramCache]: Analyzing trace with hash 448004075, now seen corresponding path program 1 times [2018-11-18 15:08:36,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:08:36,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:08:36,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:08:36,465 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:08:36,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:08:36,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:08:36,506 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-18 15:08:36,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:08:36,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:08:36,506 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 15:08:36,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:08:36,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:08:36,507 INFO L87 Difference]: Start difference. First operand 285 states and 503 transitions. cyclomatic complexity: 219 Second operand 3 states. [2018-11-18 15:08:36,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:08:36,576 INFO L93 Difference]: Finished difference Result 371 states and 638 transitions. [2018-11-18 15:08:36,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:08:36,576 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 371 states and 638 transitions. [2018-11-18 15:08:36,579 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 193 [2018-11-18 15:08:36,582 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 371 states to 371 states and 638 transitions. [2018-11-18 15:08:36,582 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 371 [2018-11-18 15:08:36,583 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 371 [2018-11-18 15:08:36,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 371 states and 638 transitions. [2018-11-18 15:08:36,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:08:36,584 INFO L705 BuchiCegarLoop]: Abstraction has 371 states and 638 transitions. [2018-11-18 15:08:36,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states and 638 transitions. [2018-11-18 15:08:36,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 371. [2018-11-18 15:08:36,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-11-18 15:08:36,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 638 transitions. [2018-11-18 15:08:36,597 INFO L728 BuchiCegarLoop]: Abstraction has 371 states and 638 transitions. [2018-11-18 15:08:36,597 INFO L608 BuchiCegarLoop]: Abstraction has 371 states and 638 transitions. [2018-11-18 15:08:36,597 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 15:08:36,597 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 371 states and 638 transitions. [2018-11-18 15:08:36,599 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 193 [2018-11-18 15:08:36,599 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:08:36,600 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:08:36,601 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:08:36,601 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, 1, 1, 1, 1, 1, 1] [2018-11-18 15:08:36,602 INFO L794 eck$LassoCheckResult]: Stem: 1470#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p13~0 := 0;~p14~0 := 0;~p21~0 := 0;~p23~0 := 0;~p24~0 := 0;~p31~0 := 0;~p32~0 := 0;~p34~0 := 0;~p41~0 := 0;~p42~0 := 0;~p43~0 := 0;~nodes~0.base, ~nodes~0.offset := ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.base(), ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.offset();~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]; 1280#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc 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~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~ret52, main_#t~ret53, main_#t~post54, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet12;havoc main_#t~nondet12;~ep13~0 := main_#t~nondet13;havoc main_#t~nondet13;~ep14~0 := main_#t~nondet14;havoc main_#t~nondet14;~ep21~0 := main_#t~nondet15;havoc main_#t~nondet15;~ep23~0 := main_#t~nondet16;havoc main_#t~nondet16;~ep24~0 := main_#t~nondet17;havoc main_#t~nondet17;~ep31~0 := main_#t~nondet18;havoc main_#t~nondet18;~ep32~0 := main_#t~nondet19;havoc main_#t~nondet19;~ep34~0 := main_#t~nondet20;havoc main_#t~nondet20;~ep41~0 := main_#t~nondet21;havoc main_#t~nondet21;~ep42~0 := main_#t~nondet22;havoc main_#t~nondet22;~ep43~0 := main_#t~nondet23;havoc main_#t~nondet23;~id1~0 := main_#t~nondet24;havoc main_#t~nondet24;~r1~0 := main_#t~nondet25;havoc main_#t~nondet25;~st1~0 := main_#t~nondet26;havoc main_#t~nondet26;~nl1~0 := main_#t~nondet27;havoc main_#t~nondet27;~m1~0 := main_#t~nondet28;havoc main_#t~nondet28;~max1~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode1~0 := main_#t~nondet30;havoc main_#t~nondet30;~id2~0 := main_#t~nondet31;havoc main_#t~nondet31;~r2~0 := main_#t~nondet32;havoc main_#t~nondet32;~st2~0 := main_#t~nondet33;havoc main_#t~nondet33;~nl2~0 := main_#t~nondet34;havoc main_#t~nondet34;~m2~0 := main_#t~nondet35;havoc main_#t~nondet35;~max2~0 := main_#t~nondet36;havoc main_#t~nondet36;~mode2~0 := main_#t~nondet37;havoc main_#t~nondet37;~id3~0 := main_#t~nondet38;havoc main_#t~nondet38;~r3~0 := main_#t~nondet39;havoc main_#t~nondet39;~st3~0 := main_#t~nondet40;havoc main_#t~nondet40;~nl3~0 := main_#t~nondet41;havoc main_#t~nondet41;~m3~0 := main_#t~nondet42;havoc main_#t~nondet42;~max3~0 := main_#t~nondet43;havoc main_#t~nondet43;~mode3~0 := main_#t~nondet44;havoc main_#t~nondet44;~id4~0 := main_#t~nondet45;havoc main_#t~nondet45;~r4~0 := main_#t~nondet46;havoc main_#t~nondet46;~st4~0 := main_#t~nondet47;havoc main_#t~nondet47;~nl4~0 := main_#t~nondet48;havoc main_#t~nondet48;~m4~0 := main_#t~nondet49;havoc main_#t~nondet49;~max4~0 := main_#t~nondet50;havoc main_#t~nondet50;~mode4~0 := main_#t~nondet51;havoc main_#t~nondet51;assume { :begin_inline_init } true;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r141~0, init_~r211~0, init_~r231~0, init_~r241~0, init_~r311~0, init_~r321~0, init_~r341~0, init_~r411~0, init_~r421~0, init_~r431~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r142~0, init_~tmp___1~0, init_~r212~0, init_~tmp___2~0, init_~r232~0, init_~tmp___3~0, init_~r242~0, init_~tmp___4~0, init_~r312~0, init_~tmp___5~0, init_~r322~0, init_~tmp___6~0, init_~r342~0, init_~tmp___7~0, init_~r412~0, init_~tmp___8~0, init_~r422~0, init_~tmp___9~0, init_~r432~0, init_~tmp___10~0, init_~r123~0, init_~tmp___11~0, init_~r133~0, init_~tmp___12~0, init_~r143~0, init_~tmp___13~0, init_~r213~0, init_~tmp___14~0, init_~r233~0, init_~tmp___15~0, init_~r243~0, init_~tmp___16~0, init_~r313~0, init_~tmp___17~0, init_~r323~0, init_~tmp___18~0, init_~r343~0, init_~tmp___19~0, init_~r413~0, init_~tmp___20~0, init_~r423~0, init_~tmp___21~0, init_~r433~0, init_~tmp___22~0, init_~tmp___23~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r141~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r241~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r341~0;havoc init_~r411~0;havoc init_~r421~0;havoc init_~r431~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r142~0;havoc init_~tmp___1~0;havoc init_~r212~0;havoc init_~tmp___2~0;havoc init_~r232~0;havoc init_~tmp___3~0;havoc init_~r242~0;havoc init_~tmp___4~0;havoc init_~r312~0;havoc init_~tmp___5~0;havoc init_~r322~0;havoc init_~tmp___6~0;havoc init_~r342~0;havoc init_~tmp___7~0;havoc init_~r412~0;havoc init_~tmp___8~0;havoc init_~r422~0;havoc init_~tmp___9~0;havoc init_~r432~0;havoc init_~tmp___10~0;havoc init_~r123~0;havoc init_~tmp___11~0;havoc init_~r133~0;havoc init_~tmp___12~0;havoc init_~r143~0;havoc init_~tmp___13~0;havoc init_~r213~0;havoc init_~tmp___14~0;havoc init_~r233~0;havoc init_~tmp___15~0;havoc init_~r243~0;havoc init_~tmp___16~0;havoc init_~r313~0;havoc init_~tmp___17~0;havoc init_~r323~0;havoc init_~tmp___18~0;havoc init_~r343~0;havoc init_~tmp___19~0;havoc init_~r413~0;havoc init_~tmp___20~0;havoc init_~r423~0;havoc init_~tmp___21~0;havoc init_~r433~0;havoc init_~tmp___22~0;havoc init_~tmp___23~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r141~0 := ~ep14~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r241~0 := ~ep24~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0;init_~r341~0 := ~ep34~0;init_~r411~0 := ~ep41~0;init_~r421~0 := ~ep42~0;init_~r431~0 := ~ep43~0; 1281#L436 assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 1438#L447 init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 1433#L457 assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 1305#L468 init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 1430#L478 assume 0 != init_~r141~0 % 256;init_~tmp___1~0 := 1; 1373#L489 init_~r142~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 1369#L499 assume 0 != init_~r211~0 % 256;init_~tmp___2~0 := 1; 1279#L510 init_~r212~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 1365#L520 assume 0 != init_~r231~0 % 256;init_~tmp___3~0 := 1; 1361#L531 init_~r232~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 1506#L541 assume 0 != init_~r241~0 % 256;init_~tmp___4~0 := 1; 1465#L552 init_~r242~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 1505#L562 assume 0 != init_~r311~0 % 256;init_~tmp___5~0 := 1; 1271#L573 init_~r312~0 := (if 0 == init_~tmp___5~0 then 0 else 1); 1487#L583 assume 0 != init_~r321~0 % 256;init_~tmp___6~0 := 1; 1334#L594 init_~r322~0 := (if 0 == init_~tmp___6~0 then 0 else 1); 1331#L604 assume 0 != init_~r341~0 % 256;init_~tmp___7~0 := 1; 1329#L615 init_~r342~0 := (if 0 == init_~tmp___7~0 then 0 else 1); 1330#L625 assume 0 != init_~r411~0 % 256;init_~tmp___8~0 := 1; 1328#L636 init_~r412~0 := (if 0 == init_~tmp___8~0 then 0 else 1); 1548#L646 assume 0 != init_~r421~0 % 256;init_~tmp___9~0 := 1; 1428#L657 init_~r422~0 := (if 0 == init_~tmp___9~0 then 0 else 1); 1535#L667 assume 0 != init_~r431~0 % 256;init_~tmp___10~0 := 1; 1477#L678 init_~r432~0 := (if 0 == init_~tmp___10~0 then 0 else 1); 1474#L688 assume 0 != init_~r122~0 % 256;init_~tmp___11~0 := 1; 1302#L699 init_~r123~0 := (if 0 == init_~tmp___11~0 then 0 else 1); 1297#L709 assume 0 != init_~r132~0 % 256;init_~tmp___12~0 := 1; 1295#L720 init_~r133~0 := (if 0 == init_~tmp___12~0 then 0 else 1); 1296#L730 assume 0 != init_~r142~0 % 256;init_~tmp___13~0 := 1; 1291#L741 init_~r143~0 := (if 0 == init_~tmp___13~0 then 0 else 1); 1416#L751 assume 0 != init_~r212~0 % 256;init_~tmp___14~0 := 1; 1414#L762 init_~r213~0 := (if 0 == init_~tmp___14~0 then 0 else 1); 1513#L772 assume 0 != init_~r232~0 % 256;init_~tmp___15~0 := 1; 1426#L783 init_~r233~0 := (if 0 == init_~tmp___15~0 then 0 else 1); 1424#L793 assume 0 != init_~r242~0 % 256;init_~tmp___16~0 := 1; 1285#L804 init_~r243~0 := (if 0 == init_~tmp___16~0 then 0 else 1); 1421#L814 assume 0 != init_~r312~0 % 256;init_~tmp___17~0 := 1; 1354#L825 init_~r313~0 := (if 0 == init_~tmp___17~0 then 0 else 1); 1347#L835 assume 0 != init_~r322~0 % 256;init_~tmp___18~0 := 1; 1345#L846 init_~r323~0 := (if 0 == init_~tmp___18~0 then 0 else 1); 1346#L856 assume 0 != init_~r342~0 % 256;init_~tmp___19~0 := 1; 1342#L867 init_~r343~0 := (if 0 == init_~tmp___19~0 then 0 else 1); 1499#L877 assume 0 != init_~r412~0 % 256;init_~tmp___20~0 := 1; 1448#L888 init_~r413~0 := (if 0 == init_~tmp___20~0 then 0 else 1); 1498#L898 assume 0 != init_~r422~0 % 256;init_~tmp___21~0 := 1; 1483#L909 init_~r423~0 := (if 0 == init_~tmp___21~0 then 0 else 1); 1481#L919 assume 0 != init_~r432~0 % 256;init_~tmp___22~0 := 1; 1318#L930 init_~r433~0 := (if 0 == init_~tmp___22~0 then 0 else 1); 1315#L940 assume !(~id1~0 != ~id2~0);init_~tmp___23~0 := 0; 1308#L940-1 init_#res := init_~tmp___23~0; 1322#L1061 main_#t~ret52 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret52;havoc main_#t~ret52;assume 0 != main_~i2~0;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0 := 0; 1338#L1198-3 [2018-11-18 15:08:36,602 INFO L796 eck$LassoCheckResult]: Loop: 1338#L1198-3 assume true; 1573#L1198-1 assume !!(main_~i2~0 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_#t~ite1, node1_#t~ite2; 1570#L151 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256); 1299#L153 assume !(0 != ~ep21~0 % 256); 1292#L153-1 assume !(0 != ~ep31~0 % 256); 1294#L160 assume !(0 != ~ep41~0 % 256); 1442#L167 assume !(3 == ~r1~0); 1555#L174 ~mode1~0 := 0; 1611#L151-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite3, node2_#t~ite4, node2_#t~ite5; 1609#L204 assume !(0 != ~mode2~0 % 256); 1610#L236 assume !(~r2~0 < 3); 1595#L236-1 ~mode2~0 := 1; 1594#L204-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6, node3_#t~ite7, node3_#t~ite8; 1592#L257 assume !(0 != ~mode3~0 % 256); 1593#L289 assume !(~r3~0 < 3); 1581#L289-1 ~mode3~0 := 1; 1579#L257-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9, node4_#t~ite10, node4_#t~ite11; 1577#L310 assume !(0 != ~mode4~0 % 256); 1538#L342 assume !(~r4~0 < 3); 1411#L342-1 ~mode4~0 := 1; 1563#L310-2 assume { :end_inline_node4 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 1562#L1069 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 1561#L1070 assume ~st1~0 + ~nl1~0 <= 1; 1560#L1071 assume ~st2~0 + ~nl2~0 <= 1; 1559#L1072 assume ~st3~0 + ~nl3~0 <= 1; 1558#L1073 assume ~st4~0 + ~nl4~0 <= 1; 1557#L1074 assume !(~r1~0 >= 3); 1402#L1077 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; 1403#L1078 assume ~r1~0 < 3; 1626#L1083 assume !(~r1~0 >= 3); 1552#L1087 assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0 + ~nl4~0; 1553#L1088 assume ~r1~0 < 3;check_~tmp~1 := 1; 1583#L1069-1 check_#res := check_~tmp~1; 1580#L1121 main_#t~ret53 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret53;havoc main_#t~ret53;assume { :begin_inline_assert } true;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 1578#L1241 assume !(0 == assert_~arg % 256); 1576#L1236 assume { :end_inline_assert } true;main_#t~post54 := main_~i2~0;main_~i2~0 := 1 + main_#t~post54;havoc main_#t~post54; 1338#L1198-3 [2018-11-18 15:08:36,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:08:36,602 INFO L82 PathProgramCache]: Analyzing trace with hash 15460348, now seen corresponding path program 3 times [2018-11-18 15:08:36,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:08:36,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:08:36,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:08:36,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:08:36,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:08:36,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:08:36,657 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-18 15:08:36,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:08:36,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:08:36,658 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 15:08:36,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:08:36,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1516640295, now seen corresponding path program 1 times [2018-11-18 15:08:36,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:08:36,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:08:36,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:08:36,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:08:36,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:08:36,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:08:36,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:08:37,027 WARN L180 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 154 [2018-11-18 15:08:37,168 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2018-11-18 15:08:37,177 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 15:08:37,178 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 15:08:37,178 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 15:08:37,178 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 15:08:37,178 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 15:08:37,178 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 15:08:37,178 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 15:08:37,178 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 15:08:37,178 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.4_false-unreach-call.1.ufo.BOUNDED-8.pals_true-termination.c_Iteration3_Loop [2018-11-18 15:08:37,178 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 15:08:37,179 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 15:08:37,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:08:37,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:08:37,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:08:37,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:08:37,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:08:37,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:08:37,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:08:37,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:08:37,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:08:37,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:08:37,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-18 15:08:37,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:08:37,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:08:37,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:08:37,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:08:37,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:08:37,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:08:37,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:08:37,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:08:37,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:08:37,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:08:37,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:08:37,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:08:37,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:08:37,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:08:37,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:08:37,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:08:37,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-18 15:08:37,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:08:37,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-18 15:08:37,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:08:37,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:08:37,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:08:37,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:08:37,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:08:37,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:08:37,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:08:37,791 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 15:08:37,792 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e8050446-9f5b-43cd-85a3-931eb834f19c/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-18 15:08:37,807 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 15:08:37,807 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e8050446-9f5b-43cd-85a3-931eb834f19c/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-18 15:08:37,829 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 15:08:37,829 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 15:08:37,937 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 15:08:37,938 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 15:08:37,939 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 15:08:37,939 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 15:08:37,939 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 15:08:37,939 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 15:08:37,939 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 15:08:37,939 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 15:08:37,939 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 15:08:37,939 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.4_false-unreach-call.1.ufo.BOUNDED-8.pals_true-termination.c_Iteration3_Loop [2018-11-18 15:08:37,939 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 15:08:37,939 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 15:08:37,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:08:37,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:08:37,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:08:37,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:08:37,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-18 15:08:37,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:08:37,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:08:37,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-18 15:08:37,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:08:37,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:08:37,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-18 15:08:37,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:08:37,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:08:37,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:08:37,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:08:37,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:08:38,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:08:38,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:08:38,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:08:38,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:08:38,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:08:38,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:08:38,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:08:38,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:08:38,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:08:38,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:08:38,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:08:38,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:08:38,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:08:38,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:08:38,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:08:38,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:08:38,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:08:38,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:08:38,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:08:38,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:08:38,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:08:38,509 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 15:08:38,512 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 15:08:38,513 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-18 15:08:38,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:38,514 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:08:38,515 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:38,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:38,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:38,517 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:08:38,517 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:08:38,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:38,521 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-18 15:08:38,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:38,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:08:38,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:38,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:38,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:38,522 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:08:38,522 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:08:38,524 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:38,524 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-18 15:08:38,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:38,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:38,525 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:38,525 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:38,526 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:08:38,526 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:08:38,528 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:38,528 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-18 15:08:38,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:38,528 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:08:38,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:38,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:38,529 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:38,529 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:08:38,529 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:08:38,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:38,530 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-18 15:08:38,534 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:38,534 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:08:38,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:38,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:38,535 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:38,535 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:08:38,535 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:08:38,536 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:38,536 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-18 15:08:38,536 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:38,536 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:08:38,536 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:38,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:38,537 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:38,537 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:08:38,537 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:08:38,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:38,538 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-18 15:08:38,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:38,538 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:08:38,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:38,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:38,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:38,541 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:08:38,542 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:08:38,542 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:38,543 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-18 15:08:38,543 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:38,543 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:08:38,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:38,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:38,543 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:38,543 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:08:38,544 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:08:38,544 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:38,544 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-18 15:08:38,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:38,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:38,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:38,545 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:38,546 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:08:38,546 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:08:38,552 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:38,552 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-18 15:08:38,552 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:38,552 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:08:38,552 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:38,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:38,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:38,553 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:08:38,553 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:08:38,554 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:38,554 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-18 15:08:38,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:38,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:38,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:38,555 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:38,556 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:08:38,556 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:08:38,558 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:38,562 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-18 15:08:38,563 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:38,563 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:08:38,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:38,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:38,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:38,563 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:08:38,564 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:08:38,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:38,564 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-18 15:08:38,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:38,565 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:08:38,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:38,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:38,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:38,565 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:08:38,565 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:08:38,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:38,567 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-18 15:08:38,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:38,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:38,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:38,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:38,569 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:08:38,569 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:08:38,572 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:38,572 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-18 15:08:38,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:38,573 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:08:38,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:38,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:38,573 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:38,573 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:08:38,573 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:08:38,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:38,574 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-18 15:08:38,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:38,574 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:08:38,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:38,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:38,575 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:38,578 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:08:38,578 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:08:38,581 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:38,581 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-18 15:08:38,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:38,582 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:08:38,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:38,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:38,582 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:38,582 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:08:38,582 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:08:38,583 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:38,583 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-18 15:08:38,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:38,584 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:08:38,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:38,584 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:38,584 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:38,584 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:08:38,584 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:08:38,585 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:38,585 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-18 15:08:38,585 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:38,585 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:08:38,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:38,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:38,586 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:38,586 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:08:38,586 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:08:38,587 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:08:38,587 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-18 15:08:38,587 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:08:38,587 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:08:38,587 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:08:38,587 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:08:38,587 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:08:38,588 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:08:38,588 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:08:38,589 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 15:08:38,596 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 15:08:38,596 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 15:08:38,597 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 15:08:38,597 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 15:08:38,598 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 15:08:38,598 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 15 Supporting invariants [] [2018-11-18 15:08:38,599 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 15:08:38,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:08:38,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:08:38,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:08:38,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:08:38,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:08:38,717 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-18 15:08:38,721 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-18 15:08:38,722 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 371 states and 638 transitions. cyclomatic complexity: 268 Second operand 4 states. [2018-11-18 15:08:38,802 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 371 states and 638 transitions. cyclomatic complexity: 268. Second operand 4 states. Result 563 states and 948 transitions. Complement of second has 6 states. [2018-11-18 15:08:38,803 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-18 15:08:38,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 15:08:38,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 503 transitions. [2018-11-18 15:08:38,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 503 transitions. Stem has 53 letters. Loop has 36 letters. [2018-11-18 15:08:38,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:08:38,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 503 transitions. Stem has 89 letters. Loop has 36 letters. [2018-11-18 15:08:38,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:08:38,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 503 transitions. Stem has 53 letters. Loop has 72 letters. [2018-11-18 15:08:38,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:08:38,808 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 563 states and 948 transitions. [2018-11-18 15:08:38,813 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 15:08:38,813 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 563 states to 0 states and 0 transitions. [2018-11-18 15:08:38,813 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 15:08:38,813 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 15:08:38,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 15:08:38,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:08:38,813 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 15:08:38,813 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 15:08:38,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 15:08:38,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 15:08:38,814 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 4 states. [2018-11-18 15:08:38,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:08:38,814 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-18 15:08:38,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 15:08:38,814 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-18 15:08:38,814 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 15:08:38,814 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 15:08:38,814 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 15:08:38,815 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 15:08:38,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 15:08:38,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:08:38,815 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 15:08:38,815 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 15:08:38,815 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 15:08:38,815 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 15:08:38,815 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 15:08:38,815 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 15:08:38,815 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 15:08:38,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 03:08:38 BoogieIcfgContainer [2018-11-18 15:08:38,820 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 15:08:38,820 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 15:08:38,820 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 15:08:38,821 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 15:08:38,821 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:08:35" (3/4) ... [2018-11-18 15:08:38,823 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 15:08:38,824 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 15:08:38,824 INFO L168 Benchmark]: Toolchain (without parser) took 4247.48 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 297.8 MB). Free memory was 956.4 MB in the beginning and 1.2 GB in the end (delta: -229.2 MB). Peak memory consumption was 68.6 MB. Max. memory is 11.5 GB. [2018-11-18 15:08:38,825 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 15:08:38,825 INFO L168 Benchmark]: CACSL2BoogieTranslator took 348.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -185.6 MB). Peak memory consumption was 42.7 MB. Max. memory is 11.5 GB. [2018-11-18 15:08:38,826 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2018-11-18 15:08:38,826 INFO L168 Benchmark]: Boogie Preprocessor took 36.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2018-11-18 15:08:38,826 INFO L168 Benchmark]: RCFGBuilder took 858.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 102.9 MB). Peak memory consumption was 102.9 MB. Max. memory is 11.5 GB. [2018-11-18 15:08:38,827 INFO L168 Benchmark]: BuchiAutomizer took 2952.57 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 148.9 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -156.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 15:08:38,827 INFO L168 Benchmark]: Witness Printer took 3.22 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 15:08:38,829 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 348.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -185.6 MB). Peak memory consumption was 42.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 858.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 102.9 MB). Peak memory consumption was 102.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2952.57 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 148.9 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -156.2 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 3.22 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 15 and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.9s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.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 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 371 states and ocurred in iteration 2. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1518 SDtfs, 623 SDslu, 2187 SDs, 0 SdLazy, 35 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI2 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital221 mio100 ax121 hnf104 lsp26 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq229 hnf85 smp100 dnf100 smp100 tf101 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 3ms 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...