./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.5_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_cc840421-dcfa-487e-9eae-5de5add533df/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_cc840421-dcfa-487e-9eae-5de5add533df/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_cc840421-dcfa-487e-9eae-5de5add533df/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_cc840421-dcfa-487e-9eae-5de5add533df/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.5_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_cc840421-dcfa-487e-9eae-5de5add533df/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_cc840421-dcfa-487e-9eae-5de5add533df/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 48707c3273ef5764ebaefbb6bce07d310caf11a9 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-09 22:44:50,407 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-09 22:44:50,408 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-09 22:44:50,416 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-09 22:44:50,416 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-09 22:44:50,417 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-09 22:44:50,417 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-09 22:44:50,418 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-09 22:44:50,419 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-09 22:44:50,420 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-09 22:44:50,421 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-09 22:44:50,421 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-09 22:44:50,421 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-09 22:44:50,422 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-09 22:44:50,423 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-09 22:44:50,423 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-09 22:44:50,424 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-09 22:44:50,425 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-09 22:44:50,426 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-09 22:44:50,427 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-09 22:44:50,428 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-09 22:44:50,429 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-09 22:44:50,430 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-09 22:44:50,431 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-09 22:44:50,431 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-09 22:44:50,431 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-09 22:44:50,432 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-09 22:44:50,433 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-09 22:44:50,433 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-09 22:44:50,434 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-09 22:44:50,434 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-09 22:44:50,435 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-09 22:44:50,435 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-09 22:44:50,435 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-09 22:44:50,435 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-09 22:44:50,436 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-09 22:44:50,436 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_cc840421-dcfa-487e-9eae-5de5add533df/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-09 22:44:50,443 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-09 22:44:50,444 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-09 22:44:50,445 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-09 22:44:50,445 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-09 22:44:50,445 INFO L133 SettingsManager]: * Use SBE=true [2018-11-09 22:44:50,445 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-09 22:44:50,445 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-09 22:44:50,445 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-09 22:44:50,445 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-09 22:44:50,446 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-09 22:44:50,446 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-09 22:44:50,446 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-09 22:44:50,446 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-09 22:44:50,446 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-09 22:44:50,446 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-09 22:44:50,446 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-09 22:44:50,446 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-09 22:44:50,447 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-09 22:44:50,447 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-09 22:44:50,447 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-09 22:44:50,447 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-09 22:44:50,447 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-09 22:44:50,447 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-09 22:44:50,447 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-09 22:44:50,448 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-09 22:44:50,448 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-09 22:44:50,448 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-09 22:44:50,448 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-09 22:44:50,448 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-09 22:44:50,448 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-09 22:44:50,449 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-09 22:44:50,449 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_cc840421-dcfa-487e-9eae-5de5add533df/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 -> 48707c3273ef5764ebaefbb6bce07d310caf11a9 [2018-11-09 22:44:50,470 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-09 22:44:50,479 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-09 22:44:50,481 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-09 22:44:50,482 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-09 22:44:50,482 INFO L276 PluginConnector]: CDTParser initialized [2018-11-09 22:44:50,483 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_cc840421-dcfa-487e-9eae-5de5add533df/bin-2019/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.5_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c [2018-11-09 22:44:50,526 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cc840421-dcfa-487e-9eae-5de5add533df/bin-2019/uautomizer/data/774e4f7d0/9f1d5d5feb724d98995f4da8b90b83df/FLAG3544e9b5c [2018-11-09 22:44:51,012 INFO L298 CDTParser]: Found 1 translation units. [2018-11-09 22:44:51,013 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_cc840421-dcfa-487e-9eae-5de5add533df/sv-benchmarks/c/seq-mthreaded/pals_floodmax.5_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c [2018-11-09 22:44:51,024 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cc840421-dcfa-487e-9eae-5de5add533df/bin-2019/uautomizer/data/774e4f7d0/9f1d5d5feb724d98995f4da8b90b83df/FLAG3544e9b5c [2018-11-09 22:44:51,033 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_cc840421-dcfa-487e-9eae-5de5add533df/bin-2019/uautomizer/data/774e4f7d0/9f1d5d5feb724d98995f4da8b90b83df [2018-11-09 22:44:51,035 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-09 22:44:51,036 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-09 22:44:51,037 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-09 22:44:51,037 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-09 22:44:51,040 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-09 22:44:51,041 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:44:51" (1/1) ... [2018-11-09 22:44:51,042 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4441de1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:44:51, skipping insertion in model container [2018-11-09 22:44:51,042 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:44:51" (1/1) ... [2018-11-09 22:44:51,048 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-09 22:44:51,088 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-09 22:44:51,342 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-09 22:44:51,349 INFO L189 MainTranslator]: Completed pre-run [2018-11-09 22:44:51,424 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-09 22:44:51,435 INFO L193 MainTranslator]: Completed translation [2018-11-09 22:44:51,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:44:51 WrapperNode [2018-11-09 22:44:51,436 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-09 22:44:51,436 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-09 22:44:51,436 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-09 22:44:51,436 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-09 22:44:51,494 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:44:51" (1/1) ... [2018-11-09 22:44:51,508 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:44:51" (1/1) ... [2018-11-09 22:44:51,543 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-09 22:44:51,544 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-09 22:44:51,544 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-09 22:44:51,544 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-09 22:44:51,552 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:44:51" (1/1) ... [2018-11-09 22:44:51,552 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:44:51" (1/1) ... [2018-11-09 22:44:51,557 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:44:51" (1/1) ... [2018-11-09 22:44:51,557 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:44:51" (1/1) ... [2018-11-09 22:44:51,573 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:44:51" (1/1) ... [2018-11-09 22:44:51,593 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:44:51" (1/1) ... [2018-11-09 22:44:51,598 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:44:51" (1/1) ... [2018-11-09 22:44:51,606 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-09 22:44:51,606 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-09 22:44:51,606 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-09 22:44:51,606 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-09 22:44:51,607 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:44:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cc840421-dcfa-487e-9eae-5de5add533df/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-09 22:44:51,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-09 22:44:51,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-09 22:44:52,942 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-09 22:44:52,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:44:52 BoogieIcfgContainer [2018-11-09 22:44:52,942 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-09 22:44:52,943 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-09 22:44:52,943 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-09 22:44:52,946 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-09 22:44:52,946 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-09 22:44:52,946 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.11 10:44:51" (1/3) ... [2018-11-09 22:44:52,947 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@72b0c71d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 10:44:52, skipping insertion in model container [2018-11-09 22:44:52,947 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-09 22:44:52,947 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:44:51" (2/3) ... [2018-11-09 22:44:52,948 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@72b0c71d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 10:44:52, skipping insertion in model container [2018-11-09 22:44:52,948 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-09 22:44:52,948 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:44:52" (3/3) ... [2018-11-09 22:44:52,949 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_floodmax.5_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c [2018-11-09 22:44:52,990 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-09 22:44:52,990 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-09 22:44:52,990 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-09 22:44:52,991 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-09 22:44:52,991 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-09 22:44:52,991 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-09 22:44:52,991 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-09 22:44:52,991 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-09 22:44:52,991 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-09 22:44:53,014 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 684 states. [2018-11-09 22:44:53,055 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 156 [2018-11-09 22:44:53,055 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 22:44:53,056 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 22:44:53,067 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 22:44:53,068 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:44:53,068 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-09 22:44:53,068 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 684 states. [2018-11-09 22:44:53,078 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 156 [2018-11-09 22:44:53,078 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 22:44:53,078 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 22:44:53,082 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 22:44:53,082 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:44:53,090 INFO L793 eck$LassoCheckResult]: Stem: 476#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;~p15_old~0 := 0;~p15_new~0 := 0;~ep15~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;~p25_old~0 := 0;~p25_new~0 := 0;~ep25~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;~p35_old~0 := 0;~p35_new~0 := 0;~ep35~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;~p45_old~0 := 0;~p45_new~0 := 0;~ep45~0 := 0;~p51_old~0 := 0;~p51_new~0 := 0;~ep51~0 := 0;~p52_old~0 := 0;~p52_new~0 := 0;~ep52~0 := 0;~p53_old~0 := 0;~p53_new~0 := 0;~ep53~0 := 0;~p54_old~0 := 0;~p54_new~0 := 0;~ep54~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;~id5~0 := 0;~r5~0 := 0;~st5~0 := 0;~nl5~0 := 0;~m5~0 := 0;~max5~0 := 0;~mode5~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p13~0 := 0;~p14~0 := 0;~p15~0 := 0;~p21~0 := 0;~p23~0 := 0;~p24~0 := 0;~p25~0 := 0;~p31~0 := 0;~p32~0 := 0;~p34~0 := 0;~p35~0 := 0;~p41~0 := 0;~p42~0 := 0;~p43~0 := 0;~p45~0 := 0;~p51~0 := 0;~p52~0 := 0;~p53~0 := 0;~p54~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; 354#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc 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~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~nondet57, main_#t~nondet58, main_#t~nondet59, main_#t~nondet60, main_#t~nondet61, main_#t~nondet62, main_#t~nondet63, main_#t~nondet64, main_#t~nondet65, main_#t~nondet66, main_#t~nondet67, main_#t~nondet68, main_#t~nondet69, main_#t~nondet70, main_#t~nondet71, main_#t~nondet72, main_#t~nondet73, main_#t~nondet74, main_#t~ret75, main_#t~ret76, main_#t~post77, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet20;havoc main_#t~nondet20;~ep13~0 := main_#t~nondet21;havoc main_#t~nondet21;~ep14~0 := main_#t~nondet22;havoc main_#t~nondet22;~ep15~0 := main_#t~nondet23;havoc main_#t~nondet23;~ep21~0 := main_#t~nondet24;havoc main_#t~nondet24;~ep23~0 := main_#t~nondet25;havoc main_#t~nondet25;~ep24~0 := main_#t~nondet26;havoc main_#t~nondet26;~ep25~0 := main_#t~nondet27;havoc main_#t~nondet27;~ep31~0 := main_#t~nondet28;havoc main_#t~nondet28;~ep32~0 := main_#t~nondet29;havoc main_#t~nondet29;~ep34~0 := main_#t~nondet30;havoc main_#t~nondet30;~ep35~0 := main_#t~nondet31;havoc main_#t~nondet31;~ep41~0 := main_#t~nondet32;havoc main_#t~nondet32;~ep42~0 := main_#t~nondet33;havoc main_#t~nondet33;~ep43~0 := main_#t~nondet34;havoc main_#t~nondet34;~ep45~0 := main_#t~nondet35;havoc main_#t~nondet35;~ep51~0 := main_#t~nondet36;havoc main_#t~nondet36;~ep52~0 := main_#t~nondet37;havoc main_#t~nondet37;~ep53~0 := main_#t~nondet38;havoc main_#t~nondet38;~ep54~0 := main_#t~nondet39;havoc main_#t~nondet39;~id1~0 := main_#t~nondet40;havoc main_#t~nondet40;~r1~0 := main_#t~nondet41;havoc main_#t~nondet41;~st1~0 := main_#t~nondet42;havoc main_#t~nondet42;~nl1~0 := main_#t~nondet43;havoc main_#t~nondet43;~m1~0 := main_#t~nondet44;havoc main_#t~nondet44;~max1~0 := main_#t~nondet45;havoc main_#t~nondet45;~mode1~0 := main_#t~nondet46;havoc main_#t~nondet46;~id2~0 := main_#t~nondet47;havoc main_#t~nondet47;~r2~0 := main_#t~nondet48;havoc main_#t~nondet48;~st2~0 := main_#t~nondet49;havoc main_#t~nondet49;~nl2~0 := main_#t~nondet50;havoc main_#t~nondet50;~m2~0 := main_#t~nondet51;havoc main_#t~nondet51;~max2~0 := main_#t~nondet52;havoc main_#t~nondet52;~mode2~0 := main_#t~nondet53;havoc main_#t~nondet53;~id3~0 := main_#t~nondet54;havoc main_#t~nondet54;~r3~0 := main_#t~nondet55;havoc main_#t~nondet55;~st3~0 := main_#t~nondet56;havoc main_#t~nondet56;~nl3~0 := main_#t~nondet57;havoc main_#t~nondet57;~m3~0 := main_#t~nondet58;havoc main_#t~nondet58;~max3~0 := main_#t~nondet59;havoc main_#t~nondet59;~mode3~0 := main_#t~nondet60;havoc main_#t~nondet60;~id4~0 := main_#t~nondet61;havoc main_#t~nondet61;~r4~0 := main_#t~nondet62;havoc main_#t~nondet62;~st4~0 := main_#t~nondet63;havoc main_#t~nondet63;~nl4~0 := main_#t~nondet64;havoc main_#t~nondet64;~m4~0 := main_#t~nondet65;havoc main_#t~nondet65;~max4~0 := main_#t~nondet66;havoc main_#t~nondet66;~mode4~0 := main_#t~nondet67;havoc main_#t~nondet67;~id5~0 := main_#t~nondet68;havoc main_#t~nondet68;~r5~0 := main_#t~nondet69;havoc main_#t~nondet69;~st5~0 := main_#t~nondet70;havoc main_#t~nondet70;~nl5~0 := main_#t~nondet71;havoc main_#t~nondet71;~m5~0 := main_#t~nondet72;havoc main_#t~nondet72;~max5~0 := main_#t~nondet73;havoc main_#t~nondet73;~mode5~0 := main_#t~nondet74;havoc main_#t~nondet74;assume { :begin_inline_init } true;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r141~0, init_~r151~0, init_~r211~0, init_~r231~0, init_~r241~0, init_~r251~0, init_~r311~0, init_~r321~0, init_~r341~0, init_~r351~0, init_~r411~0, init_~r421~0, init_~r431~0, init_~r451~0, init_~r511~0, init_~r521~0, init_~r531~0, init_~r541~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r142~0, init_~tmp___1~0, init_~r152~0, init_~tmp___2~0, init_~r212~0, init_~tmp___3~0, init_~r232~0, init_~tmp___4~0, init_~r242~0, init_~tmp___5~0, init_~r252~0, init_~tmp___6~0, init_~r312~0, init_~tmp___7~0, init_~r322~0, init_~tmp___8~0, init_~r342~0, init_~tmp___9~0, init_~r352~0, init_~tmp___10~0, init_~r412~0, init_~tmp___11~0, init_~r422~0, init_~tmp___12~0, init_~r432~0, init_~tmp___13~0, init_~r452~0, init_~tmp___14~0, init_~r512~0, init_~tmp___15~0, init_~r522~0, init_~tmp___16~0, init_~r532~0, init_~tmp___17~0, init_~r542~0, init_~tmp___18~0, init_~r123~0, init_~tmp___19~0, init_~r133~0, init_~tmp___20~0, init_~r143~0, init_~tmp___21~0, init_~r153~0, init_~tmp___22~0, init_~r213~0, init_~tmp___23~0, init_~r233~0, init_~tmp___24~0, init_~r243~0, init_~tmp___25~0, init_~r253~0, init_~tmp___26~0, init_~r313~0, init_~tmp___27~0, init_~r323~0, init_~tmp___28~0, init_~r343~0, init_~tmp___29~0, init_~r353~0, init_~tmp___30~0, init_~r413~0, init_~tmp___31~0, init_~r423~0, init_~tmp___32~0, init_~r433~0, init_~tmp___33~0, init_~r453~0, init_~tmp___34~0, init_~r513~0, init_~tmp___35~0, init_~r523~0, init_~tmp___36~0, init_~r533~0, init_~tmp___37~0, init_~r543~0, init_~tmp___38~0, init_~r124~0, init_~tmp___39~0, init_~r134~0, init_~tmp___40~0, init_~r144~0, init_~tmp___41~0, init_~r154~0, init_~tmp___42~0, init_~r214~0, init_~tmp___43~0, init_~r234~0, init_~tmp___44~0, init_~r244~0, init_~tmp___45~0, init_~r254~0, init_~tmp___46~0, init_~r314~0, init_~tmp___47~0, init_~r324~0, init_~tmp___48~0, init_~r344~0, init_~tmp___49~0, init_~r354~0, init_~tmp___50~0, init_~r414~0, init_~tmp___51~0, init_~r424~0, init_~tmp___52~0, init_~r434~0, init_~tmp___53~0, init_~r454~0, init_~tmp___54~0, init_~r514~0, init_~tmp___55~0, init_~r524~0, init_~tmp___56~0, init_~r534~0, init_~tmp___57~0, init_~r544~0, init_~tmp___58~0, init_~tmp___59~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r141~0;havoc init_~r151~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r241~0;havoc init_~r251~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r341~0;havoc init_~r351~0;havoc init_~r411~0;havoc init_~r421~0;havoc init_~r431~0;havoc init_~r451~0;havoc init_~r511~0;havoc init_~r521~0;havoc init_~r531~0;havoc init_~r541~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_~r152~0;havoc init_~tmp___2~0;havoc init_~r212~0;havoc init_~tmp___3~0;havoc init_~r232~0;havoc init_~tmp___4~0;havoc init_~r242~0;havoc init_~tmp___5~0;havoc init_~r252~0;havoc init_~tmp___6~0;havoc init_~r312~0;havoc init_~tmp___7~0;havoc init_~r322~0;havoc init_~tmp___8~0;havoc init_~r342~0;havoc init_~tmp___9~0;havoc init_~r352~0;havoc init_~tmp___10~0;havoc init_~r412~0;havoc init_~tmp___11~0;havoc init_~r422~0;havoc init_~tmp___12~0;havoc init_~r432~0;havoc init_~tmp___13~0;havoc init_~r452~0;havoc init_~tmp___14~0;havoc init_~r512~0;havoc init_~tmp___15~0;havoc init_~r522~0;havoc init_~tmp___16~0;havoc init_~r532~0;havoc init_~tmp___17~0;havoc init_~r542~0;havoc init_~tmp___18~0;havoc init_~r123~0;havoc init_~tmp___19~0;havoc init_~r133~0;havoc init_~tmp___20~0;havoc init_~r143~0;havoc init_~tmp___21~0;havoc init_~r153~0;havoc init_~tmp___22~0;havoc init_~r213~0;havoc init_~tmp___23~0;havoc init_~r233~0;havoc init_~tmp___24~0;havoc init_~r243~0;havoc init_~tmp___25~0;havoc init_~r253~0;havoc init_~tmp___26~0;havoc init_~r313~0;havoc init_~tmp___27~0;havoc init_~r323~0;havoc init_~tmp___28~0;havoc init_~r343~0;havoc init_~tmp___29~0;havoc init_~r353~0;havoc init_~tmp___30~0;havoc init_~r413~0;havoc init_~tmp___31~0;havoc init_~r423~0;havoc init_~tmp___32~0;havoc init_~r433~0;havoc init_~tmp___33~0;havoc init_~r453~0;havoc init_~tmp___34~0;havoc init_~r513~0;havoc init_~tmp___35~0;havoc init_~r523~0;havoc init_~tmp___36~0;havoc init_~r533~0;havoc init_~tmp___37~0;havoc init_~r543~0;havoc init_~tmp___38~0;havoc init_~r124~0;havoc init_~tmp___39~0;havoc init_~r134~0;havoc init_~tmp___40~0;havoc init_~r144~0;havoc init_~tmp___41~0;havoc init_~r154~0;havoc init_~tmp___42~0;havoc init_~r214~0;havoc init_~tmp___43~0;havoc init_~r234~0;havoc init_~tmp___44~0;havoc init_~r244~0;havoc init_~tmp___45~0;havoc init_~r254~0;havoc init_~tmp___46~0;havoc init_~r314~0;havoc init_~tmp___47~0;havoc init_~r324~0;havoc init_~tmp___48~0;havoc init_~r344~0;havoc init_~tmp___49~0;havoc init_~r354~0;havoc init_~tmp___50~0;havoc init_~r414~0;havoc init_~tmp___51~0;havoc init_~r424~0;havoc init_~tmp___52~0;havoc init_~r434~0;havoc init_~tmp___53~0;havoc init_~r454~0;havoc init_~tmp___54~0;havoc init_~r514~0;havoc init_~tmp___55~0;havoc init_~r524~0;havoc init_~tmp___56~0;havoc init_~r534~0;havoc init_~tmp___57~0;havoc init_~r544~0;havoc init_~tmp___58~0;havoc init_~tmp___59~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r141~0 := ~ep14~0;init_~r151~0 := ~ep15~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r241~0 := ~ep24~0;init_~r251~0 := ~ep25~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0;init_~r341~0 := ~ep34~0;init_~r351~0 := ~ep35~0;init_~r411~0 := ~ep41~0;init_~r421~0 := ~ep42~0;init_~r431~0 := ~ep43~0;init_~r451~0 := ~ep45~0;init_~r511~0 := ~ep51~0;init_~r521~0 := ~ep52~0;init_~r531~0 := ~ep53~0;init_~r541~0 := ~ep54~0; 582#L667true assume init_~r121~0 % 256 != 0;init_~tmp~0 := 1; 63#L686true init_~r122~0 := (if init_~tmp~0 == 0 then 0 else 1); 311#L696true assume init_~r131~0 % 256 != 0;init_~tmp___0~0 := 1; 515#L715true init_~r132~0 := (if init_~tmp___0~0 == 0 then 0 else 1); 399#L725true assume init_~r141~0 % 256 != 0;init_~tmp___1~0 := 1; 580#L744true init_~r142~0 := (if init_~tmp___1~0 == 0 then 0 else 1); 114#L754true assume init_~r151~0 % 256 != 0;init_~tmp___2~0 := 1; 322#L773true init_~r152~0 := (if init_~tmp___2~0 == 0 then 0 else 1); 218#L783true assume init_~r211~0 % 256 != 0;init_~tmp___3~0 := 1; 395#L802true init_~r212~0 := (if init_~tmp___3~0 == 0 then 0 else 1); 622#L812true assume init_~r231~0 % 256 != 0;init_~tmp___4~0 := 1; 130#L831true init_~r232~0 := (if init_~tmp___4~0 == 0 then 0 else 1); 8#L841true assume init_~r241~0 % 256 != 0;init_~tmp___5~0 := 1; 215#L860true init_~r242~0 := (if init_~tmp___5~0 == 0 then 0 else 1); 453#L870true assume init_~r251~0 % 256 != 0;init_~tmp___6~0 := 1; 618#L889true init_~r252~0 := (if init_~tmp___6~0 == 0 then 0 else 1); 527#L899true assume init_~r311~0 % 256 != 0;init_~tmp___7~0 := 1; 23#L918true init_~r312~0 := (if init_~tmp___7~0 == 0 then 0 else 1); 268#L928true assume init_~r321~0 % 256 != 0;init_~tmp___8~0 := 1; 451#L947true init_~r322~0 := (if init_~tmp___8~0 == 0 then 0 else 1); 518#L957true assume init_~r341~0 % 256 != 0;init_~tmp___9~0 := 1; 541#L976true init_~r342~0 := (if init_~tmp___9~0 == 0 then 0 else 1); 598#L986true assume init_~r351~0 % 256 != 0;init_~tmp___10~0 := 1; 262#L1005true init_~r352~0 := (if init_~tmp___10~0 == 0 then 0 else 1); 327#L1015true assume init_~r411~0 % 256 != 0;init_~tmp___11~0 := 1; 352#L1034true init_~r412~0 := (if init_~tmp___11~0 == 0 then 0 else 1); 403#L1044true assume init_~r421~0 % 256 != 0;init_~tmp___12~0 := 1; 595#L1063true init_~r422~0 := (if init_~tmp___12~0 == 0 then 0 else 1); 135#L1073true assume init_~r431~0 % 256 != 0;init_~tmp___13~0 := 1; 324#L1092true init_~r432~0 := (if init_~tmp___13~0 == 0 then 0 else 1); 220#L1102true assume init_~r451~0 % 256 != 0;init_~tmp___14~0 := 1; 421#L1121true init_~r452~0 := (if init_~tmp___14~0 == 0 then 0 else 1); 647#L1131true assume init_~r511~0 % 256 != 0;init_~tmp___15~0 := 1; 132#L1150true init_~r512~0 := (if init_~tmp___15~0 == 0 then 0 else 1); 29#L1160true assume init_~r521~0 % 256 != 0;init_~tmp___16~0 := 1; 237#L1179true init_~r522~0 := (if init_~tmp___16~0 == 0 then 0 else 1); 481#L1189true assume init_~r531~0 % 256 != 0;init_~tmp___17~0 := 1; 643#L1208true init_~r532~0 := (if init_~tmp___17~0 == 0 then 0 else 1); 545#L1218true assume init_~r541~0 % 256 != 0;init_~tmp___18~0 := 1; 43#L1237true init_~r542~0 := (if init_~tmp___18~0 == 0 then 0 else 1); 295#L1247true assume init_~r122~0 % 256 != 0;init_~tmp___19~0 := 1; 478#L1266true init_~r123~0 := (if init_~tmp___19~0 == 0 then 0 else 1); 363#L1276true assume init_~r132~0 % 256 != 0;init_~tmp___20~0 := 1; 567#L1295true init_~r133~0 := (if init_~tmp___20~0 == 0 then 0 else 1); 78#L1305true assume init_~r142~0 % 256 != 0;init_~tmp___21~0 := 1; 292#L1324true init_~r143~0 := (if init_~tmp___21~0 == 0 then 0 else 1); 188#L1334true assume init_~r152~0 % 256 != 0;init_~tmp___22~0 := 1; 355#L1353true init_~r153~0 := (if init_~tmp___22~0 == 0 then 0 else 1); 427#L1363true assume init_~r212~0 % 256 != 0;init_~tmp___23~0 := 1; 98#L1382true init_~r213~0 := (if init_~tmp___23~0 == 0 then 0 else 1); 166#L1392true assume init_~r232~0 % 256 != 0;init_~tmp___24~0 := 1; 178#L1411true init_~r233~0 := (if init_~tmp___24~0 == 0 then 0 else 1); 243#L1421true assume init_~r242~0 % 256 != 0;init_~tmp___25~0 := 1; 608#L1440true init_~r243~0 := (if init_~tmp___25~0 == 0 then 0 else 1); 678#L1450true assume init_~r252~0 % 256 != 0;init_~tmp___26~0 := 1; 155#L1469true init_~r253~0 := (if init_~tmp___26~0 == 0 then 0 else 1); 50#L1479true assume init_~r312~0 % 256 != 0;init_~tmp___27~0 := 1; 259#L1498true init_~r313~0 := (if init_~tmp___27~0 == 0 then 0 else 1); 485#L1508true assume init_~r322~0 % 256 != 0;init_~tmp___28~0 := 1; 670#L1527true init_~r323~0 := (if init_~tmp___28~0 == 0 then 0 else 1); 572#L1537true assume init_~r342~0 % 256 != 0;init_~tmp___29~0 := 1; 45#L1556true init_~r343~0 := (if init_~tmp___29~0 == 0 then 0 else 1); 301#L1566true assume init_~r352~0 % 256 != 0;init_~tmp___30~0 := 1; 504#L1585true init_~r353~0 := (if init_~tmp___30~0 == 0 then 0 else 1); 388#L1595true assume init_~r412~0 % 256 != 0;init_~tmp___31~0 := 1; 570#L1614true init_~r413~0 := (if init_~tmp___31~0 == 0 then 0 else 1); 108#L1624true assume init_~r422~0 % 256 != 0;init_~tmp___32~0 := 1; 314#L1643true init_~r423~0 := (if init_~tmp___32~0 == 0 then 0 else 1); 207#L1653true assume init_~r432~0 % 256 != 0;init_~tmp___33~0 := 1; 386#L1672true init_~r433~0 := (if init_~tmp___33~0 == 0 then 0 else 1); 613#L1682true assume init_~r452~0 % 256 != 0;init_~tmp___34~0 := 1; 119#L1701true init_~r453~0 := (if init_~tmp___34~0 == 0 then 0 else 1); 15#L1711true assume init_~r512~0 % 256 != 0;init_~tmp___35~0 := 1; 203#L1730true init_~r513~0 := (if init_~tmp___35~0 == 0 then 0 else 1); 444#L1740true assume init_~r522~0 % 256 != 0;init_~tmp___36~0 := 1; 625#L1759true init_~r523~0 := (if init_~tmp___36~0 == 0 then 0 else 1); 682#L1769true assume init_~r532~0 % 256 != 0;init_~tmp___37~0 := 1; 14#L1788true init_~r533~0 := (if init_~tmp___37~0 == 0 then 0 else 1); 73#L1798true assume init_~r542~0 % 256 != 0;init_~tmp___38~0 := 1; 441#L1817true init_~r543~0 := (if init_~tmp___38~0 == 0 then 0 else 1); 508#L1827true assume init_~r123~0 % 256 != 0;init_~tmp___39~0 := 1; 530#L1846true init_~r124~0 := (if init_~tmp___39~0 == 0 then 0 else 1); 590#L1856true assume init_~r133~0 % 256 != 0;init_~tmp___40~0 := 1; 69#L1875true init_~r134~0 := (if init_~tmp___40~0 == 0 then 0 else 1); 319#L1885true assume init_~r143~0 % 256 != 0;init_~tmp___41~0 := 1; 524#L1904true init_~r144~0 := (if init_~tmp___41~0 == 0 then 0 else 1); 409#L1914true assume init_~r153~0 % 256 != 0;init_~tmp___42~0 := 1; 587#L1933true init_~r154~0 := (if init_~tmp___42~0 == 0 then 0 else 1); 123#L1943true assume init_~r213~0 % 256 != 0;init_~tmp___43~0 := 1; 331#L1962true init_~r214~0 := (if init_~tmp___43~0 == 0 then 0 else 1); 210#L1972true assume init_~r233~0 % 256 != 0;init_~tmp___44~0 := 1; 405#L1991true init_~r234~0 := (if init_~tmp___44~0 == 0 then 0 else 1); 635#L2001true assume init_~r243~0 % 256 != 0;init_~tmp___45~0 := 1; 122#L2020true init_~r244~0 := (if init_~tmp___45~0 == 0 then 0 else 1); 18#L2030true assume init_~r253~0 % 256 != 0;init_~tmp___46~0 := 1; 227#L2049true init_~r254~0 := (if init_~tmp___46~0 == 0 then 0 else 1); 468#L2059true assume init_~r313~0 % 256 != 0;init_~tmp___47~0 := 1; 628#L2078true init_~r314~0 := (if init_~tmp___47~0 == 0 then 0 else 1); 536#L2088true assume init_~r323~0 % 256 != 0;init_~tmp___48~0 := 1; 31#L2107true init_~r324~0 := (if init_~tmp___48~0 == 0 then 0 else 1); 279#L2117true assume init_~r343~0 % 256 != 0;init_~tmp___49~0 := 1; 463#L2136true init_~r344~0 := (if init_~tmp___49~0 == 0 then 0 else 1); 345#L2146true assume init_~r353~0 % 256 != 0;init_~tmp___50~0 := 1; 550#L2165true init_~r354~0 := (if init_~tmp___50~0 == 0 then 0 else 1); 86#L2175true assume init_~r413~0 % 256 != 0;init_~tmp___51~0 := 1; 272#L2194true init_~r414~0 := (if init_~tmp___51~0 == 0 then 0 else 1); 339#L2204true assume init_~r423~0 % 256 != 0;init_~tmp___52~0 := 1; 365#L2223true init_~r424~0 := (if init_~tmp___52~0 == 0 then 0 else 1); 415#L2233true assume init_~r433~0 % 256 != 0;init_~tmp___53~0 := 1; 85#L2252true init_~r434~0 := (if init_~tmp___53~0 == 0 then 0 else 1); 147#L2262true assume init_~r453~0 % 256 != 0;init_~tmp___54~0 := 1; 336#L2281true init_~r454~0 := (if init_~tmp___54~0 == 0 then 0 else 1); 231#L2291true assume init_~r513~0 % 256 != 0;init_~tmp___55~0 := 1; 433#L2310true init_~r514~0 := (if init_~tmp___55~0 == 0 then 0 else 1); 664#L2320true assume init_~r523~0 % 256 != 0;init_~tmp___56~0 := 1; 141#L2339true init_~r524~0 := (if init_~tmp___56~0 == 0 then 0 else 1); 40#L2349true assume init_~r533~0 % 256 != 0;init_~tmp___57~0 := 1; 254#L2368true init_~r534~0 := (if init_~tmp___57~0 == 0 then 0 else 1); 499#L2378true assume init_~r543~0 % 256 != 0;init_~tmp___58~0 := 1; 657#L2397true init_~r544~0 := (if init_~tmp___58~0 == 0 then 0 else 1); 553#L2407true assume !(~id1~0 != ~id2~0);init_~tmp___59~0 := 0; 559#L2407-1true init_#res := init_~tmp___59~0; 303#L2568true main_#t~ret75 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret75;havoc main_#t~ret75;assume main_~i2~0 != 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;~p15_old~0 := ~nomsg~0;~p15_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;~p25_old~0 := ~nomsg~0;~p25_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;~p35_old~0 := ~nomsg~0;~p35_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;~p45_old~0 := ~nomsg~0;~p45_new~0 := ~nomsg~0;~p51_old~0 := ~nomsg~0;~p51_new~0 := ~nomsg~0;~p52_old~0 := ~nomsg~0;~p52_new~0 := ~nomsg~0;~p53_old~0 := ~nomsg~0;~p53_new~0 := ~nomsg~0;~p54_old~0 := ~nomsg~0;~p54_new~0 := ~nomsg~0;main_~i2~0 := 0; 389#L2740-3true [2018-11-09 22:44:53,092 INFO L795 eck$LassoCheckResult]: Loop: 389#L2740-3true assume true; 383#L2740-1true assume !!(main_~i2~0 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_#t~ite1, node1_#t~ite2, node1_#t~ite3; 270#L190true assume !(~mode1~0 % 256 != 0); 414#L229true assume !(~r1~0 < 4); 439#L229-1true ~mode1~0 := 1; 264#L190-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite4, node2_#t~ite5, node2_#t~ite6, node2_#t~ite7; 471#L253true assume !(~mode2~0 % 256 != 0); 105#L292true assume !(~r2~0 < 4); 102#L292-1true ~mode2~0 := 1; 461#L253-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8, node3_#t~ite9, node3_#t~ite10, node3_#t~ite11; 658#L316true assume !(~mode3~0 % 256 != 0); 285#L355true assume !(~r3~0 < 4); 288#L355-1true ~mode3~0 := 1; 665#L316-2true assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite12, node4_#t~ite13, node4_#t~ite14, node4_#t~ite15; 164#L379true assume !(~mode4~0 % 256 != 0); 491#L418true assume !(~r4~0 < 4); 494#L418-1true ~mode4~0 := 1; 142#L379-2true assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite16, node5_#t~ite17, node5_#t~ite18, node5_#t~ite19; 200#L442true assume !(~mode5~0 % 256 != 0); 672#L481true assume !(~r5~0 < 4); 674#L481-1true ~mode5~0 := 1; 180#L442-2true assume { :end_inline_node5 } 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;~p15_old~0 := ~p15_new~0;~p15_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;~p25_old~0 := ~p25_new~0;~p25_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;~p35_old~0 := ~p35_new~0;~p35_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;~p45_old~0 := ~p45_new~0;~p45_new~0 := ~nomsg~0;~p51_old~0 := ~p51_new~0;~p51_new~0 := ~nomsg~0;~p52_old~0 := ~p52_new~0;~p52_new~0 := ~nomsg~0;~p53_old~0 := ~p53_new~0;~p53_new~0 := ~nomsg~0;~p54_old~0 := ~p54_new~0;~p54_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 507#L2576true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1 := 0; 506#L2576-1true check_#res := check_~tmp~1; 256#L2632true main_#t~ret76 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret76;havoc main_#t~ret76;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 77#L2800true assume !(assert_~arg % 256 == 0); 397#L2795true assume { :end_inline_assert } true;main_#t~post77 := main_~i2~0;main_~i2~0 := main_#t~post77 + 1;havoc main_#t~post77; 389#L2740-3true [2018-11-09 22:44:53,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:44:53,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1740322780, now seen corresponding path program 1 times [2018-11-09 22:44:53,105 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:44:53,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:44:53,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:44:53,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:44:53,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:44:53,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:44:53,446 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-09 22:44:53,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:44:53,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:44:53,452 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-09 22:44:53,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:44:53,453 INFO L82 PathProgramCache]: Analyzing trace with hash -951412230, now seen corresponding path program 1 times [2018-11-09 22:44:53,453 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:44:53,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:44:53,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:44:53,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:44:53,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:44:53,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:44:53,516 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-09 22:44:53,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:44:53,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-09 22:44:53,518 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-09 22:44:53,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-09 22:44:53,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-09 22:44:53,529 INFO L87 Difference]: Start difference. First operand 684 states. Second operand 5 states. [2018-11-09 22:44:53,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:44:53,630 INFO L93 Difference]: Finished difference Result 688 states and 1261 transitions. [2018-11-09 22:44:53,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-09 22:44:53,633 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 688 states and 1261 transitions. [2018-11-09 22:44:53,639 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 155 [2018-11-09 22:44:53,647 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 688 states to 679 states and 1243 transitions. [2018-11-09 22:44:53,649 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 679 [2018-11-09 22:44:53,650 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 679 [2018-11-09 22:44:53,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 679 states and 1243 transitions. [2018-11-09 22:44:53,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-09 22:44:53,654 INFO L705 BuchiCegarLoop]: Abstraction has 679 states and 1243 transitions. [2018-11-09 22:44:53,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states and 1243 transitions. [2018-11-09 22:44:53,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 679. [2018-11-09 22:44:53,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 679 states. [2018-11-09 22:44:53,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 1243 transitions. [2018-11-09 22:44:53,704 INFO L728 BuchiCegarLoop]: Abstraction has 679 states and 1243 transitions. [2018-11-09 22:44:53,704 INFO L608 BuchiCegarLoop]: Abstraction has 679 states and 1243 transitions. [2018-11-09 22:44:53,704 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-09 22:44:53,704 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 679 states and 1243 transitions. [2018-11-09 22:44:53,708 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 155 [2018-11-09 22:44:53,708 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 22:44:53,708 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 22:44:53,710 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 22:44:53,711 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-09 22:44:53,711 INFO L793 eck$LassoCheckResult]: Stem: 2014#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;~p15_old~0 := 0;~p15_new~0 := 0;~ep15~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;~p25_old~0 := 0;~p25_new~0 := 0;~ep25~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;~p35_old~0 := 0;~p35_new~0 := 0;~ep35~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;~p45_old~0 := 0;~p45_new~0 := 0;~ep45~0 := 0;~p51_old~0 := 0;~p51_new~0 := 0;~ep51~0 := 0;~p52_old~0 := 0;~p52_new~0 := 0;~ep52~0 := 0;~p53_old~0 := 0;~p53_new~0 := 0;~ep53~0 := 0;~p54_old~0 := 0;~p54_new~0 := 0;~ep54~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;~id5~0 := 0;~r5~0 := 0;~st5~0 := 0;~nl5~0 := 0;~m5~0 := 0;~max5~0 := 0;~mode5~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p13~0 := 0;~p14~0 := 0;~p15~0 := 0;~p21~0 := 0;~p23~0 := 0;~p24~0 := 0;~p25~0 := 0;~p31~0 := 0;~p32~0 := 0;~p34~0 := 0;~p35~0 := 0;~p41~0 := 0;~p42~0 := 0;~p43~0 := 0;~p45~0 := 0;~p51~0 := 0;~p52~0 := 0;~p53~0 := 0;~p54~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; 1918#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc 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~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~nondet57, main_#t~nondet58, main_#t~nondet59, main_#t~nondet60, main_#t~nondet61, main_#t~nondet62, main_#t~nondet63, main_#t~nondet64, main_#t~nondet65, main_#t~nondet66, main_#t~nondet67, main_#t~nondet68, main_#t~nondet69, main_#t~nondet70, main_#t~nondet71, main_#t~nondet72, main_#t~nondet73, main_#t~nondet74, main_#t~ret75, main_#t~ret76, main_#t~post77, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet20;havoc main_#t~nondet20;~ep13~0 := main_#t~nondet21;havoc main_#t~nondet21;~ep14~0 := main_#t~nondet22;havoc main_#t~nondet22;~ep15~0 := main_#t~nondet23;havoc main_#t~nondet23;~ep21~0 := main_#t~nondet24;havoc main_#t~nondet24;~ep23~0 := main_#t~nondet25;havoc main_#t~nondet25;~ep24~0 := main_#t~nondet26;havoc main_#t~nondet26;~ep25~0 := main_#t~nondet27;havoc main_#t~nondet27;~ep31~0 := main_#t~nondet28;havoc main_#t~nondet28;~ep32~0 := main_#t~nondet29;havoc main_#t~nondet29;~ep34~0 := main_#t~nondet30;havoc main_#t~nondet30;~ep35~0 := main_#t~nondet31;havoc main_#t~nondet31;~ep41~0 := main_#t~nondet32;havoc main_#t~nondet32;~ep42~0 := main_#t~nondet33;havoc main_#t~nondet33;~ep43~0 := main_#t~nondet34;havoc main_#t~nondet34;~ep45~0 := main_#t~nondet35;havoc main_#t~nondet35;~ep51~0 := main_#t~nondet36;havoc main_#t~nondet36;~ep52~0 := main_#t~nondet37;havoc main_#t~nondet37;~ep53~0 := main_#t~nondet38;havoc main_#t~nondet38;~ep54~0 := main_#t~nondet39;havoc main_#t~nondet39;~id1~0 := main_#t~nondet40;havoc main_#t~nondet40;~r1~0 := main_#t~nondet41;havoc main_#t~nondet41;~st1~0 := main_#t~nondet42;havoc main_#t~nondet42;~nl1~0 := main_#t~nondet43;havoc main_#t~nondet43;~m1~0 := main_#t~nondet44;havoc main_#t~nondet44;~max1~0 := main_#t~nondet45;havoc main_#t~nondet45;~mode1~0 := main_#t~nondet46;havoc main_#t~nondet46;~id2~0 := main_#t~nondet47;havoc main_#t~nondet47;~r2~0 := main_#t~nondet48;havoc main_#t~nondet48;~st2~0 := main_#t~nondet49;havoc main_#t~nondet49;~nl2~0 := main_#t~nondet50;havoc main_#t~nondet50;~m2~0 := main_#t~nondet51;havoc main_#t~nondet51;~max2~0 := main_#t~nondet52;havoc main_#t~nondet52;~mode2~0 := main_#t~nondet53;havoc main_#t~nondet53;~id3~0 := main_#t~nondet54;havoc main_#t~nondet54;~r3~0 := main_#t~nondet55;havoc main_#t~nondet55;~st3~0 := main_#t~nondet56;havoc main_#t~nondet56;~nl3~0 := main_#t~nondet57;havoc main_#t~nondet57;~m3~0 := main_#t~nondet58;havoc main_#t~nondet58;~max3~0 := main_#t~nondet59;havoc main_#t~nondet59;~mode3~0 := main_#t~nondet60;havoc main_#t~nondet60;~id4~0 := main_#t~nondet61;havoc main_#t~nondet61;~r4~0 := main_#t~nondet62;havoc main_#t~nondet62;~st4~0 := main_#t~nondet63;havoc main_#t~nondet63;~nl4~0 := main_#t~nondet64;havoc main_#t~nondet64;~m4~0 := main_#t~nondet65;havoc main_#t~nondet65;~max4~0 := main_#t~nondet66;havoc main_#t~nondet66;~mode4~0 := main_#t~nondet67;havoc main_#t~nondet67;~id5~0 := main_#t~nondet68;havoc main_#t~nondet68;~r5~0 := main_#t~nondet69;havoc main_#t~nondet69;~st5~0 := main_#t~nondet70;havoc main_#t~nondet70;~nl5~0 := main_#t~nondet71;havoc main_#t~nondet71;~m5~0 := main_#t~nondet72;havoc main_#t~nondet72;~max5~0 := main_#t~nondet73;havoc main_#t~nondet73;~mode5~0 := main_#t~nondet74;havoc main_#t~nondet74;assume { :begin_inline_init } true;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r141~0, init_~r151~0, init_~r211~0, init_~r231~0, init_~r241~0, init_~r251~0, init_~r311~0, init_~r321~0, init_~r341~0, init_~r351~0, init_~r411~0, init_~r421~0, init_~r431~0, init_~r451~0, init_~r511~0, init_~r521~0, init_~r531~0, init_~r541~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r142~0, init_~tmp___1~0, init_~r152~0, init_~tmp___2~0, init_~r212~0, init_~tmp___3~0, init_~r232~0, init_~tmp___4~0, init_~r242~0, init_~tmp___5~0, init_~r252~0, init_~tmp___6~0, init_~r312~0, init_~tmp___7~0, init_~r322~0, init_~tmp___8~0, init_~r342~0, init_~tmp___9~0, init_~r352~0, init_~tmp___10~0, init_~r412~0, init_~tmp___11~0, init_~r422~0, init_~tmp___12~0, init_~r432~0, init_~tmp___13~0, init_~r452~0, init_~tmp___14~0, init_~r512~0, init_~tmp___15~0, init_~r522~0, init_~tmp___16~0, init_~r532~0, init_~tmp___17~0, init_~r542~0, init_~tmp___18~0, init_~r123~0, init_~tmp___19~0, init_~r133~0, init_~tmp___20~0, init_~r143~0, init_~tmp___21~0, init_~r153~0, init_~tmp___22~0, init_~r213~0, init_~tmp___23~0, init_~r233~0, init_~tmp___24~0, init_~r243~0, init_~tmp___25~0, init_~r253~0, init_~tmp___26~0, init_~r313~0, init_~tmp___27~0, init_~r323~0, init_~tmp___28~0, init_~r343~0, init_~tmp___29~0, init_~r353~0, init_~tmp___30~0, init_~r413~0, init_~tmp___31~0, init_~r423~0, init_~tmp___32~0, init_~r433~0, init_~tmp___33~0, init_~r453~0, init_~tmp___34~0, init_~r513~0, init_~tmp___35~0, init_~r523~0, init_~tmp___36~0, init_~r533~0, init_~tmp___37~0, init_~r543~0, init_~tmp___38~0, init_~r124~0, init_~tmp___39~0, init_~r134~0, init_~tmp___40~0, init_~r144~0, init_~tmp___41~0, init_~r154~0, init_~tmp___42~0, init_~r214~0, init_~tmp___43~0, init_~r234~0, init_~tmp___44~0, init_~r244~0, init_~tmp___45~0, init_~r254~0, init_~tmp___46~0, init_~r314~0, init_~tmp___47~0, init_~r324~0, init_~tmp___48~0, init_~r344~0, init_~tmp___49~0, init_~r354~0, init_~tmp___50~0, init_~r414~0, init_~tmp___51~0, init_~r424~0, init_~tmp___52~0, init_~r434~0, init_~tmp___53~0, init_~r454~0, init_~tmp___54~0, init_~r514~0, init_~tmp___55~0, init_~r524~0, init_~tmp___56~0, init_~r534~0, init_~tmp___57~0, init_~r544~0, init_~tmp___58~0, init_~tmp___59~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r141~0;havoc init_~r151~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r241~0;havoc init_~r251~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r341~0;havoc init_~r351~0;havoc init_~r411~0;havoc init_~r421~0;havoc init_~r431~0;havoc init_~r451~0;havoc init_~r511~0;havoc init_~r521~0;havoc init_~r531~0;havoc init_~r541~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_~r152~0;havoc init_~tmp___2~0;havoc init_~r212~0;havoc init_~tmp___3~0;havoc init_~r232~0;havoc init_~tmp___4~0;havoc init_~r242~0;havoc init_~tmp___5~0;havoc init_~r252~0;havoc init_~tmp___6~0;havoc init_~r312~0;havoc init_~tmp___7~0;havoc init_~r322~0;havoc init_~tmp___8~0;havoc init_~r342~0;havoc init_~tmp___9~0;havoc init_~r352~0;havoc init_~tmp___10~0;havoc init_~r412~0;havoc init_~tmp___11~0;havoc init_~r422~0;havoc init_~tmp___12~0;havoc init_~r432~0;havoc init_~tmp___13~0;havoc init_~r452~0;havoc init_~tmp___14~0;havoc init_~r512~0;havoc init_~tmp___15~0;havoc init_~r522~0;havoc init_~tmp___16~0;havoc init_~r532~0;havoc init_~tmp___17~0;havoc init_~r542~0;havoc init_~tmp___18~0;havoc init_~r123~0;havoc init_~tmp___19~0;havoc init_~r133~0;havoc init_~tmp___20~0;havoc init_~r143~0;havoc init_~tmp___21~0;havoc init_~r153~0;havoc init_~tmp___22~0;havoc init_~r213~0;havoc init_~tmp___23~0;havoc init_~r233~0;havoc init_~tmp___24~0;havoc init_~r243~0;havoc init_~tmp___25~0;havoc init_~r253~0;havoc init_~tmp___26~0;havoc init_~r313~0;havoc init_~tmp___27~0;havoc init_~r323~0;havoc init_~tmp___28~0;havoc init_~r343~0;havoc init_~tmp___29~0;havoc init_~r353~0;havoc init_~tmp___30~0;havoc init_~r413~0;havoc init_~tmp___31~0;havoc init_~r423~0;havoc init_~tmp___32~0;havoc init_~r433~0;havoc init_~tmp___33~0;havoc init_~r453~0;havoc init_~tmp___34~0;havoc init_~r513~0;havoc init_~tmp___35~0;havoc init_~r523~0;havoc init_~tmp___36~0;havoc init_~r533~0;havoc init_~tmp___37~0;havoc init_~r543~0;havoc init_~tmp___38~0;havoc init_~r124~0;havoc init_~tmp___39~0;havoc init_~r134~0;havoc init_~tmp___40~0;havoc init_~r144~0;havoc init_~tmp___41~0;havoc init_~r154~0;havoc init_~tmp___42~0;havoc init_~r214~0;havoc init_~tmp___43~0;havoc init_~r234~0;havoc init_~tmp___44~0;havoc init_~r244~0;havoc init_~tmp___45~0;havoc init_~r254~0;havoc init_~tmp___46~0;havoc init_~r314~0;havoc init_~tmp___47~0;havoc init_~r324~0;havoc init_~tmp___48~0;havoc init_~r344~0;havoc init_~tmp___49~0;havoc init_~r354~0;havoc init_~tmp___50~0;havoc init_~r414~0;havoc init_~tmp___51~0;havoc init_~r424~0;havoc init_~tmp___52~0;havoc init_~r434~0;havoc init_~tmp___53~0;havoc init_~r454~0;havoc init_~tmp___54~0;havoc init_~r514~0;havoc init_~tmp___55~0;havoc init_~r524~0;havoc init_~tmp___56~0;havoc init_~r534~0;havoc init_~tmp___57~0;havoc init_~r544~0;havoc init_~tmp___58~0;havoc init_~tmp___59~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r141~0 := ~ep14~0;init_~r151~0 := ~ep15~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r241~0 := ~ep24~0;init_~r251~0 := ~ep25~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0;init_~r341~0 := ~ep34~0;init_~r351~0 := ~ep35~0;init_~r411~0 := ~ep41~0;init_~r421~0 := ~ep42~0;init_~r431~0 := ~ep43~0;init_~r451~0 := ~ep45~0;init_~r511~0 := ~ep51~0;init_~r521~0 := ~ep52~0;init_~r531~0 := ~ep53~0;init_~r541~0 := ~ep54~0; 1919#L667 assume init_~r121~0 % 256 != 0;init_~tmp~0 := 1; 1428#L686 init_~r122~0 := (if init_~tmp~0 == 0 then 0 else 1); 1548#L696 assume init_~r131~0 % 256 != 0;init_~tmp___0~0 := 1; 1546#L715 init_~r132~0 := (if init_~tmp___0~0 == 0 then 0 else 1); 1965#L725 assume init_~r141~0 % 256 != 0;init_~tmp___1~0 := 1; 1650#L744 init_~r142~0 := (if init_~tmp___1~0 == 0 then 0 else 1); 1646#L754 assume init_~r151~0 % 256 != 0;init_~tmp___2~0 := 1; 1575#L773 init_~r152~0 := (if init_~tmp___2~0 == 0 then 0 else 1); 1794#L783 assume init_~r211~0 % 256 != 0;init_~tmp___3~0 := 1; 1645#L802 init_~r212~0 := (if init_~tmp___3~0 == 0 then 0 else 1); 1961#L812 assume init_~r231~0 % 256 != 0;init_~tmp___4~0 := 1; 1409#L831 init_~r232~0 := (if init_~tmp___4~0 == 0 then 0 else 1); 1402#L841 assume init_~r241~0 % 256 != 0;init_~tmp___5~0 := 1; 1403#L860 init_~r242~0 := (if init_~tmp___5~0 == 0 then 0 else 1); 1790#L870 assume init_~r251~0 % 256 != 0;init_~tmp___6~0 := 1; 1449#L889 init_~r252~0 := (if init_~tmp___6~0 == 0 then 0 else 1); 2029#L899 assume init_~r311~0 % 256 != 0;init_~tmp___7~0 := 1; 1443#L918 init_~r312~0 := (if init_~tmp___7~0 == 0 then 0 else 1); 1444#L928 assume init_~r321~0 % 256 != 0;init_~tmp___8~0 := 1; 1441#L947 init_~r322~0 := (if init_~tmp___8~0 == 0 then 0 else 1); 2003#L957 assume init_~r341~0 % 256 != 0;init_~tmp___9~0 := 1; 1856#L976 init_~r342~0 := (if init_~tmp___9~0 == 0 then 0 else 1); 2036#L986 assume init_~r351~0 % 256 != 0;init_~tmp___10~0 := 1; 1436#L1005 init_~r352~0 := (if init_~tmp___10~0 == 0 then 0 else 1); 1851#L1015 assume init_~r411~0 % 256 != 0;init_~tmp___11~0 := 1; 1850#L1034 init_~r412~0 := (if init_~tmp___11~0 == 0 then 0 else 1); 1917#L1044 assume init_~r421~0 % 256 != 0;init_~tmp___12~0 := 1; 1686#L1063 init_~r422~0 := (if init_~tmp___12~0 == 0 then 0 else 1); 1680#L1073 assume init_~r431~0 % 256 != 0;init_~tmp___13~0 := 1; 1681#L1092 init_~r432~0 := (if init_~tmp___13~0 == 0 then 0 else 1); 1797#L1102 assume init_~r451~0 % 256 != 0;init_~tmp___14~0 := 1; 1679#L1121 init_~r452~0 := (if init_~tmp___14~0 == 0 then 0 else 1); 1984#L1131 assume init_~r511~0 % 256 != 0;init_~tmp___15~0 := 1; 1458#L1150 init_~r512~0 := (if init_~tmp___15~0 == 0 then 0 else 1); 1459#L1160 assume init_~r521~0 % 256 != 0;init_~tmp___16~0 := 1; 1461#L1179 init_~r522~0 := (if init_~tmp___16~0 == 0 then 0 else 1); 1826#L1189 assume init_~r531~0 % 256 != 0;init_~tmp___17~0 := 1; 1452#L1208 init_~r532~0 := (if init_~tmp___17~0 == 0 then 0 else 1); 2039#L1218 assume init_~r541~0 % 256 != 0;init_~tmp___18~0 := 1; 1498#L1237 init_~r542~0 := (if init_~tmp___18~0 == 0 then 0 else 1); 1499#L1247 assume init_~r122~0 % 256 != 0;init_~tmp___19~0 := 1; 1496#L1266 init_~r123~0 := (if init_~tmp___19~0 == 0 then 0 else 1); 1926#L1276 assume init_~r132~0 % 256 != 0;init_~tmp___20~0 := 1; 1585#L1295 init_~r133~0 := (if init_~tmp___20~0 == 0 then 0 else 1); 1581#L1305 assume init_~r142~0 % 256 != 0;init_~tmp___21~0 := 1; 1486#L1324 init_~r143~0 := (if init_~tmp___21~0 == 0 then 0 else 1); 1755#L1334 assume init_~r152~0 % 256 != 0;init_~tmp___22~0 := 1; 1629#L1353 init_~r153~0 := (if init_~tmp___22~0 == 0 then 0 else 1); 1920#L1363 assume init_~r212~0 % 256 != 0;init_~tmp___23~0 := 1; 1620#L1382 init_~r213~0 := (if init_~tmp___23~0 == 0 then 0 else 1); 1621#L1392 assume init_~r232~0 % 256 != 0;init_~tmp___24~0 := 1; 1611#L1411 init_~r233~0 := (if init_~tmp___24~0 == 0 then 0 else 1); 1740#L1421 assume init_~r242~0 % 256 != 0;init_~tmp___25~0 := 1; 1718#L1440 init_~r243~0 := (if init_~tmp___25~0 == 0 then 0 else 1); 2061#L1450 assume init_~r252~0 % 256 != 0;init_~tmp___26~0 := 1; 1526#L1469 init_~r253~0 := (if init_~tmp___26~0 == 0 then 0 else 1); 1513#L1479 assume init_~r312~0 % 256 != 0;init_~tmp___27~0 := 1; 1514#L1498 init_~r313~0 := (if init_~tmp___27~0 == 0 then 0 else 1); 1848#L1508 assume init_~r322~0 % 256 != 0;init_~tmp___28~0 := 1; 1512#L1527 init_~r323~0 := (if init_~tmp___28~0 == 0 then 0 else 1); 2049#L1537 assume init_~r342~0 % 256 != 0;init_~tmp___29~0 := 1; 1399#L1556 init_~r343~0 := (if init_~tmp___29~0 == 0 then 0 else 1); 1505#L1566 assume init_~r352~0 % 256 != 0;init_~tmp___30~0 := 1; 1559#L1585 init_~r353~0 := (if init_~tmp___30~0 == 0 then 0 else 1); 1957#L1595 assume init_~r412~0 % 256 != 0;init_~tmp___31~0 := 1; 1634#L1614 init_~r413~0 := (if init_~tmp___31~0 == 0 then 0 else 1); 1635#L1624 assume init_~r422~0 % 256 != 0;init_~tmp___32~0 := 1; 1553#L1643 init_~r423~0 := (if init_~tmp___32~0 == 0 then 0 else 1); 1781#L1653 assume init_~r432~0 % 256 != 0;init_~tmp___33~0 := 1; 1631#L1672 init_~r433~0 := (if init_~tmp___33~0 == 0 then 0 else 1); 1955#L1682 assume init_~r452~0 % 256 != 0;init_~tmp___34~0 := 1; 1391#L1701 init_~r453~0 := (if init_~tmp___34~0 == 0 then 0 else 1); 1421#L1711 assume init_~r512~0 % 256 != 0;init_~tmp___35~0 := 1; 1422#L1730 init_~r513~0 := (if init_~tmp___35~0 == 0 then 0 else 1); 1776#L1740 assume init_~r522~0 % 256 != 0;init_~tmp___36~0 := 1; 1426#L1759 init_~r523~0 := (if init_~tmp___36~0 == 0 then 0 else 1); 2063#L1769 assume init_~r532~0 % 256 != 0;init_~tmp___37~0 := 1; 1419#L1788 init_~r533~0 := (if init_~tmp___37~0 == 0 then 0 else 1); 1420#L1798 assume init_~r542~0 % 256 != 0;init_~tmp___38~0 := 1; 1412#L1817 init_~r543~0 := (if init_~tmp___38~0 == 0 then 0 else 1); 1998#L1827 assume init_~r123~0 % 256 != 0;init_~tmp___39~0 := 1; 1569#L1846 init_~r124~0 := (if init_~tmp___39~0 == 0 then 0 else 1); 2031#L1856 assume init_~r133~0 % 256 != 0;init_~tmp___40~0 := 1; 1406#L1875 init_~r134~0 := (if init_~tmp___40~0 == 0 then 0 else 1); 1560#L1885 assume init_~r143~0 % 256 != 0;init_~tmp___41~0 := 1; 1563#L1904 init_~r144~0 := (if init_~tmp___41~0 == 0 then 0 else 1); 1976#L1914 assume init_~r153~0 % 256 != 0;init_~tmp___42~0 := 1; 1667#L1933 init_~r154~0 := (if init_~tmp___42~0 == 0 then 0 else 1); 1660#L1943 assume init_~r213~0 % 256 != 0;init_~tmp___43~0 := 1; 1661#L1962 init_~r214~0 := (if init_~tmp___43~0 == 0 then 0 else 1); 1783#L1972 assume init_~r233~0 % 256 != 0;init_~tmp___44~0 := 1; 1663#L1991 init_~r234~0 := (if init_~tmp___44~0 == 0 then 0 else 1); 1969#L2001 assume init_~r243~0 % 256 != 0;init_~tmp___45~0 := 1; 1433#L2020 init_~r244~0 := (if init_~tmp___45~0 == 0 then 0 else 1); 1429#L2030 assume init_~r253~0 % 256 != 0;init_~tmp___46~0 := 1; 1430#L2049 init_~r254~0 := (if init_~tmp___46~0 == 0 then 0 else 1); 1807#L2059 assume init_~r313~0 % 256 != 0;init_~tmp___47~0 := 1; 1474#L2078 init_~r314~0 := (if init_~tmp___47~0 == 0 then 0 else 1); 2034#L2088 assume init_~r323~0 % 256 != 0;init_~tmp___48~0 := 1; 1465#L2107 init_~r324~0 := (if init_~tmp___48~0 == 0 then 0 else 1); 1466#L2117 assume init_~r343~0 % 256 != 0;init_~tmp___49~0 := 1; 1471#L2136 init_~r344~0 := (if init_~tmp___49~0 == 0 then 0 else 1); 1907#L2146 assume init_~r353~0 % 256 != 0;init_~tmp___50~0 := 1; 1868#L2165 init_~r354~0 := (if init_~tmp___50~0 == 0 then 0 else 1); 1595#L2175 assume init_~r413~0 % 256 != 0;init_~tmp___51~0 := 1; 1455#L2194 init_~r414~0 := (if init_~tmp___51~0 == 0 then 0 else 1); 1864#L2204 assume init_~r423~0 % 256 != 0;init_~tmp___52~0 := 1; 1599#L2223 init_~r424~0 := (if init_~tmp___52~0 == 0 then 0 else 1); 1929#L2233 assume init_~r433~0 % 256 != 0;init_~tmp___53~0 := 1; 1593#L2252 init_~r434~0 := (if init_~tmp___53~0 == 0 then 0 else 1); 1594#L2262 assume init_~r453~0 % 256 != 0;init_~tmp___54~0 := 1; 1586#L2281 init_~r454~0 := (if init_~tmp___54~0 == 0 then 0 else 1); 1814#L2291 assume init_~r513~0 % 256 != 0;init_~tmp___55~0 := 1; 1701#L2310 init_~r514~0 := (if init_~tmp___55~0 == 0 then 0 else 1); 1994#L2320 assume init_~r523~0 % 256 != 0;init_~tmp___56~0 := 1; 1483#L2339 init_~r524~0 := (if init_~tmp___56~0 == 0 then 0 else 1); 1489#L2349 assume init_~r533~0 % 256 != 0;init_~tmp___57~0 := 1; 1490#L2368 init_~r534~0 := (if init_~tmp___57~0 == 0 then 0 else 1); 1842#L2378 assume init_~r543~0 % 256 != 0;init_~tmp___58~0 := 1; 1477#L2397 init_~r544~0 := (if init_~tmp___58~0 == 0 then 0 else 1); 2042#L2407 assume !(~id1~0 != ~id2~0);init_~tmp___59~0 := 0; 1530#L2407-1 init_#res := init_~tmp___59~0; 1882#L2568 main_#t~ret75 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret75;havoc main_#t~ret75;assume main_~i2~0 != 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;~p15_old~0 := ~nomsg~0;~p15_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;~p25_old~0 := ~nomsg~0;~p25_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;~p35_old~0 := ~nomsg~0;~p35_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;~p45_old~0 := ~nomsg~0;~p45_new~0 := ~nomsg~0;~p51_old~0 := ~nomsg~0;~p51_new~0 := ~nomsg~0;~p52_old~0 := ~nomsg~0;~p52_new~0 := ~nomsg~0;~p53_old~0 := ~nomsg~0;~p53_new~0 := ~nomsg~0;~p54_old~0 := ~nomsg~0;~p54_new~0 := ~nomsg~0;main_~i2~0 := 0; 1883#L2740-3 [2018-11-09 22:44:53,711 INFO L795 eck$LassoCheckResult]: Loop: 1883#L2740-3 assume true; 1951#L2740-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_#t~ite1, node1_#t~ite2, node1_#t~ite3; 1861#L190 assume !(~mode1~0 % 256 != 0); 1862#L229 assume !(~r1~0 < 4); 1715#L229-1 ~mode1~0 := 1; 1853#L190-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite4, node2_#t~ite5, node2_#t~ite6, node2_#t~ite7; 1854#L253 assume !(~mode2~0 % 256 != 0); 1626#L292 assume !(~r2~0 < 4); 1613#L292-1 ~mode2~0 := 1; 1622#L253-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8, node3_#t~ite9, node3_#t~ite10, node3_#t~ite11; 2009#L316 assume !(~mode3~0 % 256 != 0); 1874#L355 assume !(~r3~0 < 4); 1875#L355-1 ~mode3~0 := 1; 1728#L316-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite12, node4_#t~ite13, node4_#t~ite14, node4_#t~ite15; 1722#L379 assume !(~mode4~0 % 256 != 0); 1723#L418 assume !(~r4~0 < 4); 2018#L418-1 ~mode4~0 := 1; 1693#L379-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite16, node5_#t~ite17, node5_#t~ite18, node5_#t~ite19; 1694#L442 assume !(~mode5~0 % 256 != 0); 1772#L481 assume !(~r5~0 < 4); 1518#L481-1 ~mode5~0 := 1; 1741#L442-2 assume { :end_inline_node5 } 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;~p15_old~0 := ~p15_new~0;~p15_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;~p25_old~0 := ~p25_new~0;~p25_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;~p35_old~0 := ~p35_new~0;~p35_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;~p45_old~0 := ~p45_new~0;~p45_new~0 := ~nomsg~0;~p51_old~0 := ~p51_new~0;~p51_new~0 := ~nomsg~0;~p52_old~0 := ~p52_new~0;~p52_new~0 := ~nomsg~0;~p53_old~0 := ~p53_new~0;~p53_new~0 := ~nomsg~0;~p54_old~0 := ~p54_new~0;~p54_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 1742#L2576 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; 1845#L2577 assume ~st1~0 + ~nl1~0 <= 1; 1766#L2578 assume ~st2~0 + ~nl2~0 <= 1; 1767#L2579 assume ~st3~0 + ~nl3~0 <= 1; 1509#L2580 assume ~st4~0 + ~nl4~0 <= 1; 1400#L2581 assume ~st5~0 + ~nl5~0 <= 1; 1401#L2582 assume ~r1~0 >= 4; 1640#L2586 assume ~r1~0 < 4; 1554#L2591 assume ~r1~0 >= 4; 1556#L2596 assume ~r1~0 < 4;check_~tmp~1 := 1; 1769#L2576-1 check_#res := check_~tmp~1; 1843#L2632 main_#t~ret76 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret76;havoc main_#t~ret76;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 1577#L2800 assume !(assert_~arg % 256 == 0); 1578#L2795 assume { :end_inline_assert } true;main_#t~post77 := main_~i2~0;main_~i2~0 := main_#t~post77 + 1;havoc main_#t~post77; 1883#L2740-3 [2018-11-09 22:44:53,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:44:53,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1740322780, now seen corresponding path program 2 times [2018-11-09 22:44:53,712 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:44:53,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:44:53,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:44:53,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:44:53,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:44:53,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:44:53,823 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-09 22:44:53,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:44:53,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:44:53,824 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-09 22:44:53,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:44:53,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1383242610, now seen corresponding path program 1 times [2018-11-09 22:44:53,825 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:44:53,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:44:53,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:44:53,826 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-09 22:44:53,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:44:53,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:44:53,855 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-09 22:44:53,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:44:53,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:44:53,855 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-09 22:44:53,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 22:44:53,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:44:53,856 INFO L87 Difference]: Start difference. First operand 679 states and 1243 transitions. cyclomatic complexity: 565 Second operand 3 states. [2018-11-09 22:44:53,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:44:53,942 INFO L93 Difference]: Finished difference Result 808 states and 1453 transitions. [2018-11-09 22:44:53,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 22:44:53,943 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 808 states and 1453 transitions. [2018-11-09 22:44:53,949 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 284 [2018-11-09 22:44:53,954 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 808 states to 808 states and 1453 transitions. [2018-11-09 22:44:53,954 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 808 [2018-11-09 22:44:53,955 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 808 [2018-11-09 22:44:53,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 808 states and 1453 transitions. [2018-11-09 22:44:53,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-09 22:44:53,957 INFO L705 BuchiCegarLoop]: Abstraction has 808 states and 1453 transitions. [2018-11-09 22:44:53,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states and 1453 transitions. [2018-11-09 22:44:53,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 808. [2018-11-09 22:44:53,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2018-11-09 22:44:53,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1453 transitions. [2018-11-09 22:44:53,972 INFO L728 BuchiCegarLoop]: Abstraction has 808 states and 1453 transitions. [2018-11-09 22:44:53,972 INFO L608 BuchiCegarLoop]: Abstraction has 808 states and 1453 transitions. [2018-11-09 22:44:53,972 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-09 22:44:53,972 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 808 states and 1453 transitions. [2018-11-09 22:44:53,976 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 284 [2018-11-09 22:44:53,977 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 22:44:53,977 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 22:44:53,979 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 22:44:53,979 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, 1, 1, 1, 1, 1, 1] [2018-11-09 22:44:53,979 INFO L793 eck$LassoCheckResult]: Stem: 3510#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;~p15_old~0 := 0;~p15_new~0 := 0;~ep15~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;~p25_old~0 := 0;~p25_new~0 := 0;~ep25~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;~p35_old~0 := 0;~p35_new~0 := 0;~ep35~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;~p45_old~0 := 0;~p45_new~0 := 0;~ep45~0 := 0;~p51_old~0 := 0;~p51_new~0 := 0;~ep51~0 := 0;~p52_old~0 := 0;~p52_new~0 := 0;~ep52~0 := 0;~p53_old~0 := 0;~p53_new~0 := 0;~ep53~0 := 0;~p54_old~0 := 0;~p54_new~0 := 0;~ep54~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;~id5~0 := 0;~r5~0 := 0;~st5~0 := 0;~nl5~0 := 0;~m5~0 := 0;~max5~0 := 0;~mode5~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p13~0 := 0;~p14~0 := 0;~p15~0 := 0;~p21~0 := 0;~p23~0 := 0;~p24~0 := 0;~p25~0 := 0;~p31~0 := 0;~p32~0 := 0;~p34~0 := 0;~p35~0 := 0;~p41~0 := 0;~p42~0 := 0;~p43~0 := 0;~p45~0 := 0;~p51~0 := 0;~p52~0 := 0;~p53~0 := 0;~p54~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; 3412#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc 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~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~nondet57, main_#t~nondet58, main_#t~nondet59, main_#t~nondet60, main_#t~nondet61, main_#t~nondet62, main_#t~nondet63, main_#t~nondet64, main_#t~nondet65, main_#t~nondet66, main_#t~nondet67, main_#t~nondet68, main_#t~nondet69, main_#t~nondet70, main_#t~nondet71, main_#t~nondet72, main_#t~nondet73, main_#t~nondet74, main_#t~ret75, main_#t~ret76, main_#t~post77, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet20;havoc main_#t~nondet20;~ep13~0 := main_#t~nondet21;havoc main_#t~nondet21;~ep14~0 := main_#t~nondet22;havoc main_#t~nondet22;~ep15~0 := main_#t~nondet23;havoc main_#t~nondet23;~ep21~0 := main_#t~nondet24;havoc main_#t~nondet24;~ep23~0 := main_#t~nondet25;havoc main_#t~nondet25;~ep24~0 := main_#t~nondet26;havoc main_#t~nondet26;~ep25~0 := main_#t~nondet27;havoc main_#t~nondet27;~ep31~0 := main_#t~nondet28;havoc main_#t~nondet28;~ep32~0 := main_#t~nondet29;havoc main_#t~nondet29;~ep34~0 := main_#t~nondet30;havoc main_#t~nondet30;~ep35~0 := main_#t~nondet31;havoc main_#t~nondet31;~ep41~0 := main_#t~nondet32;havoc main_#t~nondet32;~ep42~0 := main_#t~nondet33;havoc main_#t~nondet33;~ep43~0 := main_#t~nondet34;havoc main_#t~nondet34;~ep45~0 := main_#t~nondet35;havoc main_#t~nondet35;~ep51~0 := main_#t~nondet36;havoc main_#t~nondet36;~ep52~0 := main_#t~nondet37;havoc main_#t~nondet37;~ep53~0 := main_#t~nondet38;havoc main_#t~nondet38;~ep54~0 := main_#t~nondet39;havoc main_#t~nondet39;~id1~0 := main_#t~nondet40;havoc main_#t~nondet40;~r1~0 := main_#t~nondet41;havoc main_#t~nondet41;~st1~0 := main_#t~nondet42;havoc main_#t~nondet42;~nl1~0 := main_#t~nondet43;havoc main_#t~nondet43;~m1~0 := main_#t~nondet44;havoc main_#t~nondet44;~max1~0 := main_#t~nondet45;havoc main_#t~nondet45;~mode1~0 := main_#t~nondet46;havoc main_#t~nondet46;~id2~0 := main_#t~nondet47;havoc main_#t~nondet47;~r2~0 := main_#t~nondet48;havoc main_#t~nondet48;~st2~0 := main_#t~nondet49;havoc main_#t~nondet49;~nl2~0 := main_#t~nondet50;havoc main_#t~nondet50;~m2~0 := main_#t~nondet51;havoc main_#t~nondet51;~max2~0 := main_#t~nondet52;havoc main_#t~nondet52;~mode2~0 := main_#t~nondet53;havoc main_#t~nondet53;~id3~0 := main_#t~nondet54;havoc main_#t~nondet54;~r3~0 := main_#t~nondet55;havoc main_#t~nondet55;~st3~0 := main_#t~nondet56;havoc main_#t~nondet56;~nl3~0 := main_#t~nondet57;havoc main_#t~nondet57;~m3~0 := main_#t~nondet58;havoc main_#t~nondet58;~max3~0 := main_#t~nondet59;havoc main_#t~nondet59;~mode3~0 := main_#t~nondet60;havoc main_#t~nondet60;~id4~0 := main_#t~nondet61;havoc main_#t~nondet61;~r4~0 := main_#t~nondet62;havoc main_#t~nondet62;~st4~0 := main_#t~nondet63;havoc main_#t~nondet63;~nl4~0 := main_#t~nondet64;havoc main_#t~nondet64;~m4~0 := main_#t~nondet65;havoc main_#t~nondet65;~max4~0 := main_#t~nondet66;havoc main_#t~nondet66;~mode4~0 := main_#t~nondet67;havoc main_#t~nondet67;~id5~0 := main_#t~nondet68;havoc main_#t~nondet68;~r5~0 := main_#t~nondet69;havoc main_#t~nondet69;~st5~0 := main_#t~nondet70;havoc main_#t~nondet70;~nl5~0 := main_#t~nondet71;havoc main_#t~nondet71;~m5~0 := main_#t~nondet72;havoc main_#t~nondet72;~max5~0 := main_#t~nondet73;havoc main_#t~nondet73;~mode5~0 := main_#t~nondet74;havoc main_#t~nondet74;assume { :begin_inline_init } true;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r141~0, init_~r151~0, init_~r211~0, init_~r231~0, init_~r241~0, init_~r251~0, init_~r311~0, init_~r321~0, init_~r341~0, init_~r351~0, init_~r411~0, init_~r421~0, init_~r431~0, init_~r451~0, init_~r511~0, init_~r521~0, init_~r531~0, init_~r541~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r142~0, init_~tmp___1~0, init_~r152~0, init_~tmp___2~0, init_~r212~0, init_~tmp___3~0, init_~r232~0, init_~tmp___4~0, init_~r242~0, init_~tmp___5~0, init_~r252~0, init_~tmp___6~0, init_~r312~0, init_~tmp___7~0, init_~r322~0, init_~tmp___8~0, init_~r342~0, init_~tmp___9~0, init_~r352~0, init_~tmp___10~0, init_~r412~0, init_~tmp___11~0, init_~r422~0, init_~tmp___12~0, init_~r432~0, init_~tmp___13~0, init_~r452~0, init_~tmp___14~0, init_~r512~0, init_~tmp___15~0, init_~r522~0, init_~tmp___16~0, init_~r532~0, init_~tmp___17~0, init_~r542~0, init_~tmp___18~0, init_~r123~0, init_~tmp___19~0, init_~r133~0, init_~tmp___20~0, init_~r143~0, init_~tmp___21~0, init_~r153~0, init_~tmp___22~0, init_~r213~0, init_~tmp___23~0, init_~r233~0, init_~tmp___24~0, init_~r243~0, init_~tmp___25~0, init_~r253~0, init_~tmp___26~0, init_~r313~0, init_~tmp___27~0, init_~r323~0, init_~tmp___28~0, init_~r343~0, init_~tmp___29~0, init_~r353~0, init_~tmp___30~0, init_~r413~0, init_~tmp___31~0, init_~r423~0, init_~tmp___32~0, init_~r433~0, init_~tmp___33~0, init_~r453~0, init_~tmp___34~0, init_~r513~0, init_~tmp___35~0, init_~r523~0, init_~tmp___36~0, init_~r533~0, init_~tmp___37~0, init_~r543~0, init_~tmp___38~0, init_~r124~0, init_~tmp___39~0, init_~r134~0, init_~tmp___40~0, init_~r144~0, init_~tmp___41~0, init_~r154~0, init_~tmp___42~0, init_~r214~0, init_~tmp___43~0, init_~r234~0, init_~tmp___44~0, init_~r244~0, init_~tmp___45~0, init_~r254~0, init_~tmp___46~0, init_~r314~0, init_~tmp___47~0, init_~r324~0, init_~tmp___48~0, init_~r344~0, init_~tmp___49~0, init_~r354~0, init_~tmp___50~0, init_~r414~0, init_~tmp___51~0, init_~r424~0, init_~tmp___52~0, init_~r434~0, init_~tmp___53~0, init_~r454~0, init_~tmp___54~0, init_~r514~0, init_~tmp___55~0, init_~r524~0, init_~tmp___56~0, init_~r534~0, init_~tmp___57~0, init_~r544~0, init_~tmp___58~0, init_~tmp___59~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r141~0;havoc init_~r151~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r241~0;havoc init_~r251~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r341~0;havoc init_~r351~0;havoc init_~r411~0;havoc init_~r421~0;havoc init_~r431~0;havoc init_~r451~0;havoc init_~r511~0;havoc init_~r521~0;havoc init_~r531~0;havoc init_~r541~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_~r152~0;havoc init_~tmp___2~0;havoc init_~r212~0;havoc init_~tmp___3~0;havoc init_~r232~0;havoc init_~tmp___4~0;havoc init_~r242~0;havoc init_~tmp___5~0;havoc init_~r252~0;havoc init_~tmp___6~0;havoc init_~r312~0;havoc init_~tmp___7~0;havoc init_~r322~0;havoc init_~tmp___8~0;havoc init_~r342~0;havoc init_~tmp___9~0;havoc init_~r352~0;havoc init_~tmp___10~0;havoc init_~r412~0;havoc init_~tmp___11~0;havoc init_~r422~0;havoc init_~tmp___12~0;havoc init_~r432~0;havoc init_~tmp___13~0;havoc init_~r452~0;havoc init_~tmp___14~0;havoc init_~r512~0;havoc init_~tmp___15~0;havoc init_~r522~0;havoc init_~tmp___16~0;havoc init_~r532~0;havoc init_~tmp___17~0;havoc init_~r542~0;havoc init_~tmp___18~0;havoc init_~r123~0;havoc init_~tmp___19~0;havoc init_~r133~0;havoc init_~tmp___20~0;havoc init_~r143~0;havoc init_~tmp___21~0;havoc init_~r153~0;havoc init_~tmp___22~0;havoc init_~r213~0;havoc init_~tmp___23~0;havoc init_~r233~0;havoc init_~tmp___24~0;havoc init_~r243~0;havoc init_~tmp___25~0;havoc init_~r253~0;havoc init_~tmp___26~0;havoc init_~r313~0;havoc init_~tmp___27~0;havoc init_~r323~0;havoc init_~tmp___28~0;havoc init_~r343~0;havoc init_~tmp___29~0;havoc init_~r353~0;havoc init_~tmp___30~0;havoc init_~r413~0;havoc init_~tmp___31~0;havoc init_~r423~0;havoc init_~tmp___32~0;havoc init_~r433~0;havoc init_~tmp___33~0;havoc init_~r453~0;havoc init_~tmp___34~0;havoc init_~r513~0;havoc init_~tmp___35~0;havoc init_~r523~0;havoc init_~tmp___36~0;havoc init_~r533~0;havoc init_~tmp___37~0;havoc init_~r543~0;havoc init_~tmp___38~0;havoc init_~r124~0;havoc init_~tmp___39~0;havoc init_~r134~0;havoc init_~tmp___40~0;havoc init_~r144~0;havoc init_~tmp___41~0;havoc init_~r154~0;havoc init_~tmp___42~0;havoc init_~r214~0;havoc init_~tmp___43~0;havoc init_~r234~0;havoc init_~tmp___44~0;havoc init_~r244~0;havoc init_~tmp___45~0;havoc init_~r254~0;havoc init_~tmp___46~0;havoc init_~r314~0;havoc init_~tmp___47~0;havoc init_~r324~0;havoc init_~tmp___48~0;havoc init_~r344~0;havoc init_~tmp___49~0;havoc init_~r354~0;havoc init_~tmp___50~0;havoc init_~r414~0;havoc init_~tmp___51~0;havoc init_~r424~0;havoc init_~tmp___52~0;havoc init_~r434~0;havoc init_~tmp___53~0;havoc init_~r454~0;havoc init_~tmp___54~0;havoc init_~r514~0;havoc init_~tmp___55~0;havoc init_~r524~0;havoc init_~tmp___56~0;havoc init_~r534~0;havoc init_~tmp___57~0;havoc init_~r544~0;havoc init_~tmp___58~0;havoc init_~tmp___59~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r141~0 := ~ep14~0;init_~r151~0 := ~ep15~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r241~0 := ~ep24~0;init_~r251~0 := ~ep25~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0;init_~r341~0 := ~ep34~0;init_~r351~0 := ~ep35~0;init_~r411~0 := ~ep41~0;init_~r421~0 := ~ep42~0;init_~r431~0 := ~ep43~0;init_~r451~0 := ~ep45~0;init_~r511~0 := ~ep51~0;init_~r521~0 := ~ep52~0;init_~r531~0 := ~ep53~0;init_~r541~0 := ~ep54~0; 3413#L667 assume init_~r121~0 % 256 != 0;init_~tmp~0 := 1; 2923#L686 init_~r122~0 := (if init_~tmp~0 == 0 then 0 else 1); 3043#L696 assume init_~r131~0 % 256 != 0;init_~tmp___0~0 := 1; 3041#L715 init_~r132~0 := (if init_~tmp___0~0 == 0 then 0 else 1); 3460#L725 assume init_~r141~0 % 256 != 0;init_~tmp___1~0 := 1; 3143#L744 init_~r142~0 := (if init_~tmp___1~0 == 0 then 0 else 1); 3139#L754 assume init_~r151~0 % 256 != 0;init_~tmp___2~0 := 1; 3069#L773 init_~r152~0 := (if init_~tmp___2~0 == 0 then 0 else 1); 3287#L783 assume init_~r211~0 % 256 != 0;init_~tmp___3~0 := 1; 3138#L802 init_~r212~0 := (if init_~tmp___3~0 == 0 then 0 else 1); 3456#L812 assume init_~r231~0 % 256 != 0;init_~tmp___4~0 := 1; 2902#L831 init_~r232~0 := (if init_~tmp___4~0 == 0 then 0 else 1); 2897#L841 assume init_~r241~0 % 256 != 0;init_~tmp___5~0 := 1; 2898#L860 init_~r242~0 := (if init_~tmp___5~0 == 0 then 0 else 1); 3283#L870 assume init_~r251~0 % 256 != 0;init_~tmp___6~0 := 1; 2944#L889 init_~r252~0 := (if init_~tmp___6~0 == 0 then 0 else 1); 3525#L899 assume init_~r311~0 % 256 != 0;init_~tmp___7~0 := 1; 2938#L918 init_~r312~0 := (if init_~tmp___7~0 == 0 then 0 else 1); 2939#L928 assume init_~r321~0 % 256 != 0;init_~tmp___8~0 := 1; 2936#L947 init_~r322~0 := (if init_~tmp___8~0 == 0 then 0 else 1); 3499#L957 assume init_~r341~0 % 256 != 0;init_~tmp___9~0 := 1; 3350#L976 init_~r342~0 := (if init_~tmp___9~0 == 0 then 0 else 1); 3532#L986 assume init_~r351~0 % 256 != 0;init_~tmp___10~0 := 1; 2931#L1005 init_~r352~0 := (if init_~tmp___10~0 == 0 then 0 else 1); 3345#L1015 assume init_~r411~0 % 256 != 0;init_~tmp___11~0 := 1; 3344#L1034 init_~r412~0 := (if init_~tmp___11~0 == 0 then 0 else 1); 3411#L1044 assume init_~r421~0 % 256 != 0;init_~tmp___12~0 := 1; 3179#L1063 init_~r422~0 := (if init_~tmp___12~0 == 0 then 0 else 1); 3173#L1073 assume init_~r431~0 % 256 != 0;init_~tmp___13~0 := 1; 3174#L1092 init_~r432~0 := (if init_~tmp___13~0 == 0 then 0 else 1); 3289#L1102 assume init_~r451~0 % 256 != 0;init_~tmp___14~0 := 1; 3172#L1121 init_~r452~0 := (if init_~tmp___14~0 == 0 then 0 else 1); 3480#L1131 assume init_~r511~0 % 256 != 0;init_~tmp___15~0 := 1; 2953#L1150 init_~r512~0 := (if init_~tmp___15~0 == 0 then 0 else 1); 2954#L1160 assume init_~r521~0 % 256 != 0;init_~tmp___16~0 := 1; 2956#L1179 init_~r522~0 := (if init_~tmp___16~0 == 0 then 0 else 1); 3317#L1189 assume init_~r531~0 % 256 != 0;init_~tmp___17~0 := 1; 2947#L1208 init_~r532~0 := (if init_~tmp___17~0 == 0 then 0 else 1); 3535#L1218 assume init_~r541~0 % 256 != 0;init_~tmp___18~0 := 1; 2993#L1237 init_~r542~0 := (if init_~tmp___18~0 == 0 then 0 else 1); 2994#L1247 assume init_~r122~0 % 256 != 0;init_~tmp___19~0 := 1; 2991#L1266 init_~r123~0 := (if init_~tmp___19~0 == 0 then 0 else 1); 3420#L1276 assume init_~r132~0 % 256 != 0;init_~tmp___20~0 := 1; 3079#L1295 init_~r133~0 := (if init_~tmp___20~0 == 0 then 0 else 1); 3073#L1305 assume init_~r142~0 % 256 != 0;init_~tmp___21~0 := 1; 2978#L1324 init_~r143~0 := (if init_~tmp___21~0 == 0 then 0 else 1); 3247#L1334 assume init_~r152~0 % 256 != 0;init_~tmp___22~0 := 1; 3121#L1353 init_~r153~0 := (if init_~tmp___22~0 == 0 then 0 else 1); 3414#L1363 assume init_~r212~0 % 256 != 0;init_~tmp___23~0 := 1; 3108#L1382 init_~r213~0 := (if init_~tmp___23~0 == 0 then 0 else 1); 3109#L1392 assume init_~r232~0 % 256 != 0;init_~tmp___24~0 := 1; 3105#L1411 init_~r233~0 := (if init_~tmp___24~0 == 0 then 0 else 1); 3231#L1421 assume init_~r242~0 % 256 != 0;init_~tmp___25~0 := 1; 3211#L1440 init_~r243~0 := (if init_~tmp___25~0 == 0 then 0 else 1); 3558#L1450 assume init_~r252~0 % 256 != 0;init_~tmp___26~0 := 1; 3021#L1469 init_~r253~0 := (if init_~tmp___26~0 == 0 then 0 else 1); 3008#L1479 assume init_~r312~0 % 256 != 0;init_~tmp___27~0 := 1; 3009#L1498 init_~r313~0 := (if init_~tmp___27~0 == 0 then 0 else 1); 3342#L1508 assume init_~r322~0 % 256 != 0;init_~tmp___28~0 := 1; 3007#L1527 init_~r323~0 := (if init_~tmp___28~0 == 0 then 0 else 1); 3545#L1537 assume init_~r342~0 % 256 != 0;init_~tmp___29~0 := 1; 2894#L1556 init_~r343~0 := (if init_~tmp___29~0 == 0 then 0 else 1); 2998#L1566 assume init_~r352~0 % 256 != 0;init_~tmp___30~0 := 1; 3053#L1585 init_~r353~0 := (if init_~tmp___30~0 == 0 then 0 else 1); 3451#L1595 assume init_~r412~0 % 256 != 0;init_~tmp___31~0 := 1; 3128#L1614 init_~r413~0 := (if init_~tmp___31~0 == 0 then 0 else 1); 3129#L1624 assume init_~r422~0 % 256 != 0;init_~tmp___32~0 := 1; 3048#L1643 init_~r423~0 := (if init_~tmp___32~0 == 0 then 0 else 1); 3274#L1653 assume init_~r432~0 % 256 != 0;init_~tmp___33~0 := 1; 3125#L1672 init_~r433~0 := (if init_~tmp___33~0 == 0 then 0 else 1); 3449#L1682 assume init_~r452~0 % 256 != 0;init_~tmp___34~0 := 1; 2886#L1701 init_~r453~0 := (if init_~tmp___34~0 == 0 then 0 else 1); 2916#L1711 assume init_~r512~0 % 256 != 0;init_~tmp___35~0 := 1; 2917#L1730 init_~r513~0 := (if init_~tmp___35~0 == 0 then 0 else 1); 3269#L1740 assume init_~r522~0 % 256 != 0;init_~tmp___36~0 := 1; 2921#L1759 init_~r523~0 := (if init_~tmp___36~0 == 0 then 0 else 1); 3561#L1769 assume init_~r532~0 % 256 != 0;init_~tmp___37~0 := 1; 2914#L1788 init_~r533~0 := (if init_~tmp___37~0 == 0 then 0 else 1); 2915#L1798 assume init_~r542~0 % 256 != 0;init_~tmp___38~0 := 1; 2907#L1817 init_~r543~0 := (if init_~tmp___38~0 == 0 then 0 else 1); 3494#L1827 assume init_~r123~0 % 256 != 0;init_~tmp___39~0 := 1; 3063#L1846 init_~r124~0 := (if init_~tmp___39~0 == 0 then 0 else 1); 3527#L1856 assume init_~r133~0 % 256 != 0;init_~tmp___40~0 := 1; 2904#L1875 init_~r134~0 := (if init_~tmp___40~0 == 0 then 0 else 1); 3055#L1885 assume init_~r143~0 % 256 != 0;init_~tmp___41~0 := 1; 3060#L1904 init_~r144~0 := (if init_~tmp___41~0 == 0 then 0 else 1); 3471#L1914 assume init_~r153~0 % 256 != 0;init_~tmp___42~0 := 1; 3160#L1933 init_~r154~0 := (if init_~tmp___42~0 == 0 then 0 else 1); 3153#L1943 assume init_~r213~0 % 256 != 0;init_~tmp___43~0 := 1; 3154#L1962 init_~r214~0 := (if init_~tmp___43~0 == 0 then 0 else 1); 3276#L1972 assume init_~r233~0 % 256 != 0;init_~tmp___44~0 := 1; 3156#L1991 init_~r234~0 := (if init_~tmp___44~0 == 0 then 0 else 1); 3466#L2001 assume init_~r243~0 % 256 != 0;init_~tmp___45~0 := 1; 2928#L2020 init_~r244~0 := (if init_~tmp___45~0 == 0 then 0 else 1); 2924#L2030 assume init_~r253~0 % 256 != 0;init_~tmp___46~0 := 1; 2925#L2049 init_~r254~0 := (if init_~tmp___46~0 == 0 then 0 else 1); 3301#L2059 assume init_~r313~0 % 256 != 0;init_~tmp___47~0 := 1; 2969#L2078 init_~r314~0 := (if init_~tmp___47~0 == 0 then 0 else 1); 3530#L2088 assume init_~r323~0 % 256 != 0;init_~tmp___48~0 := 1; 2960#L2107 init_~r324~0 := (if init_~tmp___48~0 == 0 then 0 else 1); 2961#L2117 assume init_~r343~0 % 256 != 0;init_~tmp___49~0 := 1; 2966#L2136 init_~r344~0 := (if init_~tmp___49~0 == 0 then 0 else 1); 3401#L2146 assume init_~r353~0 % 256 != 0;init_~tmp___50~0 := 1; 3362#L2165 init_~r354~0 := (if init_~tmp___50~0 == 0 then 0 else 1); 3089#L2175 assume init_~r413~0 % 256 != 0;init_~tmp___51~0 := 1; 2950#L2194 init_~r414~0 := (if init_~tmp___51~0 == 0 then 0 else 1); 3358#L2204 assume init_~r423~0 % 256 != 0;init_~tmp___52~0 := 1; 3093#L2223 init_~r424~0 := (if init_~tmp___52~0 == 0 then 0 else 1); 3423#L2233 assume init_~r433~0 % 256 != 0;init_~tmp___53~0 := 1; 3087#L2252 init_~r434~0 := (if init_~tmp___53~0 == 0 then 0 else 1); 3088#L2262 assume init_~r453~0 % 256 != 0;init_~tmp___54~0 := 1; 3080#L2281 init_~r454~0 := (if init_~tmp___54~0 == 0 then 0 else 1); 3308#L2291 assume init_~r513~0 % 256 != 0;init_~tmp___55~0 := 1; 3194#L2310 init_~r514~0 := (if init_~tmp___55~0 == 0 then 0 else 1); 3490#L2320 assume init_~r523~0 % 256 != 0;init_~tmp___56~0 := 1; 2980#L2339 init_~r524~0 := (if init_~tmp___56~0 == 0 then 0 else 1); 2984#L2349 assume init_~r533~0 % 256 != 0;init_~tmp___57~0 := 1; 2985#L2368 init_~r534~0 := (if init_~tmp___57~0 == 0 then 0 else 1); 3336#L2378 assume init_~r543~0 % 256 != 0;init_~tmp___58~0 := 1; 2972#L2397 init_~r544~0 := (if init_~tmp___58~0 == 0 then 0 else 1); 3538#L2407 assume !(~id1~0 != ~id2~0);init_~tmp___59~0 := 0; 3028#L2407-1 init_#res := init_~tmp___59~0; 3376#L2568 main_#t~ret75 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret75;havoc main_#t~ret75;assume main_~i2~0 != 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;~p15_old~0 := ~nomsg~0;~p15_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;~p25_old~0 := ~nomsg~0;~p25_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;~p35_old~0 := ~nomsg~0;~p35_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;~p45_old~0 := ~nomsg~0;~p45_new~0 := ~nomsg~0;~p51_old~0 := ~nomsg~0;~p51_new~0 := ~nomsg~0;~p52_old~0 := ~nomsg~0;~p52_new~0 := ~nomsg~0;~p53_old~0 := ~nomsg~0;~p53_new~0 := ~nomsg~0;~p54_old~0 := ~nomsg~0;~p54_new~0 := ~nomsg~0;main_~i2~0 := 0; 3377#L2740-3 [2018-11-09 22:44:53,980 INFO L795 eck$LassoCheckResult]: Loop: 3377#L2740-3 assume true; 3687#L2740-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_#t~ite1, node1_#t~ite2, node1_#t~ite3; 3686#L190 assume ~mode1~0 % 256 != 0;~r1~0 := (if (~r1~0 + 1) % 256 <= 127 then (~r1~0 + 1) % 256 else (~r1~0 + 1) % 256 - 256); 3205#L192 assume !(~ep21~0 % 256 != 0); 3200#L192-1 assume !(~ep31~0 % 256 != 0); 3000#L199 assume !(~ep41~0 % 256 != 0); 3299#L206 assume !(~ep51~0 % 256 != 0); 3001#L213 assume !(~r1~0 == 4); 3002#L220 ~mode1~0 := 0; 3684#L190-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite4, node2_#t~ite5, node2_#t~ite6, node2_#t~ite7; 3683#L253 assume !(~mode2~0 % 256 != 0); 3662#L292 assume !(~r2~0 < 4); 3658#L292-1 ~mode2~0 := 1; 3657#L253-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8, node3_#t~ite9, node3_#t~ite10, node3_#t~ite11; 3656#L316 assume !(~mode3~0 % 256 != 0); 3635#L355 assume !(~r3~0 < 4); 3631#L355-1 ~mode3~0 := 1; 3630#L316-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite12, node4_#t~ite13, node4_#t~ite14, node4_#t~ite15; 3629#L379 assume !(~mode4~0 % 256 != 0); 3608#L418 assume !(~r4~0 < 4); 3604#L418-1 ~mode4~0 := 1; 3603#L379-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite16, node5_#t~ite17, node5_#t~ite18, node5_#t~ite19; 3602#L442 assume !(~mode5~0 % 256 != 0); 3581#L481 assume !(~r5~0 < 4); 3577#L481-1 ~mode5~0 := 1; 3576#L442-2 assume { :end_inline_node5 } 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;~p15_old~0 := ~p15_new~0;~p15_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;~p25_old~0 := ~p25_new~0;~p25_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;~p35_old~0 := ~p35_new~0;~p35_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;~p45_old~0 := ~p45_new~0;~p45_new~0 := ~nomsg~0;~p51_old~0 := ~p51_new~0;~p51_new~0 := ~nomsg~0;~p52_old~0 := ~p52_new~0;~p52_new~0 := ~nomsg~0;~p53_old~0 := ~p53_new~0;~p53_new~0 := ~nomsg~0;~p54_old~0 := ~p54_new~0;~p54_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 3575#L2576 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; 3574#L2577 assume ~st1~0 + ~nl1~0 <= 1; 3573#L2578 assume ~st2~0 + ~nl2~0 <= 1; 3572#L2579 assume ~st3~0 + ~nl3~0 <= 1; 3571#L2580 assume ~st4~0 + ~nl4~0 <= 1; 3570#L2581 assume ~st5~0 + ~nl5~0 <= 1; 3569#L2582 assume !(~r1~0 >= 4); 3554#L2585 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 == 0; 3555#L2586 assume ~r1~0 < 4; 3568#L2591 assume !(~r1~0 >= 4); 3565#L2595 assume ~nl1~0 + ~nl2~0 + ~nl3~0 + ~nl4~0 + ~nl5~0 == 0; 3566#L2596 assume ~r1~0 < 4;check_~tmp~1 := 1; 3691#L2576-1 check_#res := check_~tmp~1; 3690#L2632 main_#t~ret76 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret76;havoc main_#t~ret76;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 3689#L2800 assume !(assert_~arg % 256 == 0); 3688#L2795 assume { :end_inline_assert } true;main_#t~post77 := main_~i2~0;main_~i2~0 := main_#t~post77 + 1;havoc main_#t~post77; 3377#L2740-3 [2018-11-09 22:44:53,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:44:53,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1740322780, now seen corresponding path program 3 times [2018-11-09 22:44:53,980 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:44:53,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:44:53,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:44:53,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:44:53,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:44:54,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:44:54,060 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-09 22:44:54,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:44:54,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:44:54,061 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-09 22:44:54,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:44:54,061 INFO L82 PathProgramCache]: Analyzing trace with hash 533620569, now seen corresponding path program 1 times [2018-11-09 22:44:54,062 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:44:54,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:44:54,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:44:54,063 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-09 22:44:54,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:44:54,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:44:54,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:44:54,591 WARN L179 SmtUtils]: Spent 487.00 ms on a formula simplification. DAG size of input: 217 DAG size of output: 210 [2018-11-09 22:44:54,780 WARN L179 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 210 [2018-11-09 22:44:54,789 INFO L214 LassoAnalysis]: Preferences: [2018-11-09 22:44:54,790 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-09 22:44:54,790 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-09 22:44:54,790 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-09 22:44:54,790 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-09 22:44:54,790 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 22:44:54,790 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-09 22:44:54,791 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-09 22:44:54,791 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.5_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c_Iteration3_Loop [2018-11-09 22:44:54,791 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-09 22:44:54,791 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-09 22:44:54,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:54,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:54,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:54,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:54,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:54,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:54,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:54,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:54,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:54,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:54,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:54,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:54,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:54,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:54,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:54,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:54,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:54,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:54,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:54,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:54,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:54,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:54,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:54,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:54,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:54,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:54,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:54,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:54,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:54,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:54,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:54,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:54,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:54,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:54,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:54,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:54,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:54,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:54,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:54,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:54,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:54,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:54,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:54,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:54,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-09 22:44:54,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-09 22:44:54,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-09 22:44:54,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-09 22:44:54,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-09 22:44:54,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-09 22:44:55,305 WARN L179 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 142 [2018-11-09 22:44:55,695 WARN L179 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 142 [2018-11-09 22:44:55,822 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-09 22:44:55,822 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cc840421-dcfa-487e-9eae-5de5add533df/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-09 22:44:55,830 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-09 22:44:55,830 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cc840421-dcfa-487e-9eae-5de5add533df/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-09 22:44:55,855 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-09 22:44:55,855 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-09 22:44:55,959 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-09 22:44:55,961 INFO L214 LassoAnalysis]: Preferences: [2018-11-09 22:44:55,961 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-09 22:44:55,961 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-09 22:44:55,961 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-09 22:44:55,961 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-09 22:44:55,961 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 22:44:55,961 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-09 22:44:55,961 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-09 22:44:55,961 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.5_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c_Iteration3_Loop [2018-11-09 22:44:55,961 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-09 22:44:55,961 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-09 22:44:55,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:55,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:55,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:55,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:55,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:55,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:55,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:55,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:55,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:56,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-09 22:44:56,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-09 22:44:56,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:56,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:56,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-09 22:44:56,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-09 22:44:56,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:56,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-09 22:44:56,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:56,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:56,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:56,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-09 22:44:56,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:56,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-09 22:44:56,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-09 22:44:56,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-09 22:44:56,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:56,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:56,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:56,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:56,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:56,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:56,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:56,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:56,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:56,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:56,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:56,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:56,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:56,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:56,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:56,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:56,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:56,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:56,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:56,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:56,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:56,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:56,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:56,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:56,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:44:56,524 WARN L179 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 142 [2018-11-09 22:44:56,842 WARN L179 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 142 [2018-11-09 22:44:56,909 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-09 22:44:56,914 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-09 22:44:56,915 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-09 22:44:56,917 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:44:56,917 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:44:56,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:44:56,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:44:56,918 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:44:56,920 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:44:56,920 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:44:56,923 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:44:56,923 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-09 22:44:56,924 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:44:56,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:44:56,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:44:56,924 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:44:56,930 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:44:56,930 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:44:56,931 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:44:56,932 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-09 22:44:56,932 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:44:56,932 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:44:56,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:44:56,933 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:44:56,933 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:44:56,933 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:44:56,933 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:44:56,938 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:44:56,938 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-09 22:44:56,938 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:44:56,939 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:44:56,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:44:56,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:44:56,939 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:44:56,939 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:44:56,939 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:44:56,940 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:44:56,940 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-09 22:44:56,941 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:44:56,941 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:44:56,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:44:56,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:44:56,941 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:44:56,941 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:44:56,941 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:44:56,942 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:44:56,942 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-09 22:44:56,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:44:56,943 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:44:56,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:44:56,943 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:44:56,943 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:44:56,943 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:44:56,943 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:44:56,944 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:44:56,944 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-09 22:44:56,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:44:56,945 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:44:56,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:44:56,945 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:44:56,949 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:44:56,950 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:44:56,951 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:44:56,952 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-09 22:44:56,952 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:44:56,952 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:44:56,952 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:44:56,952 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:44:56,952 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:44:56,953 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:44:56,953 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:44:56,953 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:44:56,954 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-09 22:44:56,954 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:44:56,954 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:44:56,954 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:44:56,954 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:44:56,955 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:44:56,955 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:44:56,957 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:44:56,957 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-09 22:44:56,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:44:56,958 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:44:56,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:44:56,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:44:56,958 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:44:56,958 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:44:56,958 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:44:56,959 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:44:56,959 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-09 22:44:56,959 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:44:56,959 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:44:56,960 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:44:56,960 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:44:56,960 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:44:56,960 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:44:56,962 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:44:56,962 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-09 22:44:56,963 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:44:56,963 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:44:56,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:44:56,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:44:56,963 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:44:56,963 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:44:56,964 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:44:56,964 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:44:56,964 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-09 22:44:56,965 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:44:56,965 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:44:56,965 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:44:56,965 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:44:56,965 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:44:56,965 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:44:56,965 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:44:56,966 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:44:56,966 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-09 22:44:56,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:44:56,967 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:44:56,967 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:44:56,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:44:56,967 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:44:56,967 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:44:56,967 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:44:56,969 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:44:56,969 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-09 22:44:56,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:44:56,970 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:44:56,970 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:44:56,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:44:56,970 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:44:56,970 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:44:56,970 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:44:56,971 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:44:56,971 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-09 22:44:56,971 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:44:56,971 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:44:56,972 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:44:56,972 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:44:56,972 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:44:56,972 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:44:56,972 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:44:56,973 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:44:56,973 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-09 22:44:56,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:44:56,973 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:44:56,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:44:56,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:44:56,974 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:44:56,974 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:44:56,974 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:44:56,975 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:44:56,975 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-09 22:44:56,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:44:56,975 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:44:56,975 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:44:56,975 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:44:56,976 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:44:56,976 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:44:56,976 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:44:56,976 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:44:56,977 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-09 22:44:56,977 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:44:56,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:44:56,977 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:44:56,977 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:44:56,978 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:44:56,978 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:44:56,980 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:44:56,980 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-09 22:44:56,980 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:44:56,981 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:44:56,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:44:56,981 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:44:56,981 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:44:56,981 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:44:56,981 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:44:56,982 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:44:56,982 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-09 22:44:56,983 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:44:56,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:44:56,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:44:56,983 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:44:56,984 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:44:56,984 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:44:56,985 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:44:56,986 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-09 22:44:56,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:44:56,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:44:56,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:44:56,986 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:44:56,987 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:44:56,987 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:44:56,989 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:44:56,989 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-09 22:44:56,990 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:44:56,990 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:44:56,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:44:56,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:44:56,990 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:44:56,990 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:44:56,990 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:44:56,991 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:44:56,991 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-09 22:44:56,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:44:56,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:44:56,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:44:56,992 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:44:56,992 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:44:56,993 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:44:56,994 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:44:56,995 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-09 22:44:56,995 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:44:56,995 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:44:56,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:44:56,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:44:56,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:44:56,996 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:44:56,996 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:44:56,996 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:44:56,997 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-09 22:44:56,997 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:44:56,997 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:44:56,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:44:56,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:44:56,997 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:44:56,997 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:44:56,998 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:44:56,998 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:44:56,998 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-09 22:44:56,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:44:56,999 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:44:56,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:44:56,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:44:56,999 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:44:56,999 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:44:56,999 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:44:57,001 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:44:57,001 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-09 22:44:57,002 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:44:57,002 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:44:57,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:44:57,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:44:57,002 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:44:57,002 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:44:57,002 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:44:57,003 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:44:57,003 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-09 22:44:57,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:44:57,003 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:44:57,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:44:57,004 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:44:57,004 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:44:57,004 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:44:57,004 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:44:57,004 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:44:57,005 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-09 22:44:57,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:44:57,005 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:44:57,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:44:57,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:44:57,005 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:44:57,006 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:44:57,006 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:44:57,006 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:44:57,006 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-09 22:44:57,007 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:44:57,007 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:44:57,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:44:57,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:44:57,007 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:44:57,007 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:44:57,007 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:44:57,009 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:44:57,009 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-09 22:44:57,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:44:57,010 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:44:57,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:44:57,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:44:57,010 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:44:57,010 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:44:57,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:44:57,012 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:44:57,012 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-09 22:44:57,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:44:57,012 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:44:57,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:44:57,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:44:57,013 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:44:57,013 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:44:57,013 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:44:57,013 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:44:57,014 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-09 22:44:57,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:44:57,014 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:44:57,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:44:57,014 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:44:57,014 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:44:57,015 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:44:57,015 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:44:57,015 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:44:57,016 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-09 22:44:57,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:44:57,016 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:44:57,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:44:57,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:44:57,016 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:44:57,016 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:44:57,017 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:44:57,017 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:44:57,017 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-09 22:44:57,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:44:57,018 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:44:57,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:44:57,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:44:57,018 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:44:57,024 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:44:57,024 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:44:57,029 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:44:57,029 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-09 22:44:57,030 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:44:57,030 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:44:57,030 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:44:57,030 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:44:57,030 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:44:57,031 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:44:57,031 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:44:57,032 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-09 22:44:57,034 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-09 22:44:57,034 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-09 22:44:57,036 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-09 22:44:57,036 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-09 22:44:57,036 INFO L517 LassoAnalysis]: Proved termination. [2018-11-09 22:44:57,037 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 19 Supporting invariants [] [2018-11-09 22:44:57,038 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-09 22:44:57,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:44:57,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:44:57,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 22:44:57,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:44:57,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 22:44:57,271 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-09 22:44:57,275 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-09 22:44:57,275 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 808 states and 1453 transitions. cyclomatic complexity: 646 Second operand 4 states. [2018-11-09 22:44:57,358 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 808 states and 1453 transitions. cyclomatic complexity: 646. Second operand 4 states. Result 1091 states and 1922 transitions. Complement of second has 6 states. [2018-11-09 22:44:57,359 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-09 22:44:57,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-09 22:44:57,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1243 transitions. [2018-11-09 22:44:57,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 1243 transitions. Stem has 125 letters. Loop has 42 letters. [2018-11-09 22:44:57,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 22:44:57,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 1243 transitions. Stem has 167 letters. Loop has 42 letters. [2018-11-09 22:44:57,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 22:44:57,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 1243 transitions. Stem has 125 letters. Loop has 84 letters. [2018-11-09 22:44:57,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 22:44:57,367 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1091 states and 1922 transitions. [2018-11-09 22:44:57,375 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-09 22:44:57,375 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1091 states to 0 states and 0 transitions. [2018-11-09 22:44:57,375 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-09 22:44:57,375 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-09 22:44:57,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-09 22:44:57,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-09 22:44:57,375 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-09 22:44:57,375 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-09 22:44:57,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-09 22:44:57,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-09 22:44:57,376 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 4 states. [2018-11-09 22:44:57,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:44:57,376 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-09 22:44:57,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-09 22:44:57,376 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-09 22:44:57,376 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-09 22:44:57,376 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-09 22:44:57,376 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-09 22:44:57,376 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-09 22:44:57,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-09 22:44:57,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-09 22:44:57,377 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-09 22:44:57,377 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-09 22:44:57,377 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-09 22:44:57,377 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-09 22:44:57,377 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-09 22:44:57,377 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-09 22:44:57,377 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-09 22:44:57,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.11 10:44:57 BoogieIcfgContainer [2018-11-09 22:44:57,382 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-09 22:44:57,383 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-09 22:44:57,383 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-09 22:44:57,383 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-09 22:44:57,383 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:44:52" (3/4) ... [2018-11-09 22:44:57,386 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-09 22:44:57,387 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-09 22:44:57,387 INFO L168 Benchmark]: Toolchain (without parser) took 6351.33 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 266.9 MB). Free memory was 957.6 MB in the beginning and 1.0 GB in the end (delta: -49.0 MB). Peak memory consumption was 217.9 MB. Max. memory is 11.5 GB. [2018-11-09 22:44:57,388 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-09 22:44:57,388 INFO L168 Benchmark]: CACSL2BoogieTranslator took 398.80 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 909.0 MB in the end (delta: 48.6 MB). Peak memory consumption was 48.6 MB. Max. memory is 11.5 GB. [2018-11-09 22:44:57,389 INFO L168 Benchmark]: Boogie Procedure Inliner took 107.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 909.0 MB in the beginning and 1.1 GB in the end (delta: -210.1 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. [2018-11-09 22:44:57,389 INFO L168 Benchmark]: Boogie Preprocessor took 62.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: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2018-11-09 22:44:57,390 INFO L168 Benchmark]: RCFGBuilder took 1336.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 902.8 MB in the end (delta: 208.2 MB). Peak memory consumption was 208.2 MB. Max. memory is 11.5 GB. [2018-11-09 22:44:57,390 INFO L168 Benchmark]: BuchiAutomizer took 4439.54 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 131.6 MB). Free memory was 902.8 MB in the beginning and 1.0 GB in the end (delta: -103.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. [2018-11-09 22:44:57,391 INFO L168 Benchmark]: Witness Printer took 3.81 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-09 22:44:57,393 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 398.80 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 909.0 MB in the end (delta: 48.6 MB). Peak memory consumption was 48.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 107.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 909.0 MB in the beginning and 1.1 GB in the end (delta: -210.1 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 62.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: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1336.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 902.8 MB in the end (delta: 208.2 MB). Peak memory consumption was 208.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4439.54 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 131.6 MB). Free memory was 902.8 MB in the beginning and 1.0 GB in the end (delta: -103.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.81 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 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 + 19 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 4.4s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 3.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. 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 808 states and ocurred in iteration 2. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 3739 SDtfs, 1690 SDslu, 5233 SDs, 0 SdLazy, 35 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI2 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital294 mio100 ax120 hnf104 lsp33 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq231 hnf85 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms 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...