./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.4_false-unreach-call.1.ufo.BOUNDED-8.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e37522fb-70ae-4fb9-856b-15210f742a15/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e37522fb-70ae-4fb9-856b-15210f742a15/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e37522fb-70ae-4fb9-856b-15210f742a15/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e37522fb-70ae-4fb9-856b-15210f742a15/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.4_false-unreach-call.1.ufo.BOUNDED-8.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_e37522fb-70ae-4fb9-856b-15210f742a15/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e37522fb-70ae-4fb9-856b-15210f742a15/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 188aaf9001adccb91c68b27294cad7318066e2a0 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 06:11:23,216 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:11:23,217 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:11:23,230 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:11:23,231 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:11:23,231 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:11:23,232 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:11:23,233 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:11:23,235 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:11:23,235 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:11:23,236 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:11:23,236 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:11:23,237 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:11:23,237 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:11:23,238 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:11:23,239 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:11:23,239 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:11:23,241 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:11:23,242 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:11:23,243 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:11:23,244 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:11:23,245 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:11:23,247 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:11:23,247 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:11:23,247 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:11:23,248 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:11:23,249 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:11:23,249 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:11:23,250 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:11:23,251 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:11:23,251 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:11:23,251 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:11:23,251 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:11:23,252 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:11:23,252 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:11:23,253 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:11:23,253 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e37522fb-70ae-4fb9-856b-15210f742a15/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-10-27 06:11:23,267 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:11:23,268 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:11:23,269 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:11:23,269 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:11:23,269 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:11:23,269 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:11:23,269 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:11:23,269 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:11:23,270 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:11:23,270 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:11:23,270 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:11:23,270 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:11:23,270 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-27 06:11:23,270 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:11:23,271 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:11:23,271 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-27 06:11:23,271 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:11:23,272 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:11:23,273 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:11:23,273 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:11:23,273 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-27 06:11:23,273 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:11:23,273 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:11:23,273 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:11:23,274 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:11:23,274 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:11:23,274 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:11:23,274 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:11:23,274 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:11:23,274 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:11:23,275 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:11:23,275 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_e37522fb-70ae-4fb9-856b-15210f742a15/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 188aaf9001adccb91c68b27294cad7318066e2a0 [2018-10-27 06:11:23,302 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:11:23,311 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:11:23,314 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:11:23,315 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:11:23,316 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:11:23,317 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e37522fb-70ae-4fb9-856b-15210f742a15/bin-2019/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.4_false-unreach-call.1.ufo.BOUNDED-8.pals_true-termination.c [2018-10-27 06:11:23,359 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e37522fb-70ae-4fb9-856b-15210f742a15/bin-2019/uautomizer/data/505605d79/f58483228f814939bac6c39878388705/FLAGf05e6f05c [2018-10-27 06:11:23,798 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:11:23,799 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e37522fb-70ae-4fb9-856b-15210f742a15/sv-benchmarks/c/seq-mthreaded/pals_floodmax.4_false-unreach-call.1.ufo.BOUNDED-8.pals_true-termination.c [2018-10-27 06:11:23,810 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e37522fb-70ae-4fb9-856b-15210f742a15/bin-2019/uautomizer/data/505605d79/f58483228f814939bac6c39878388705/FLAGf05e6f05c [2018-10-27 06:11:23,822 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e37522fb-70ae-4fb9-856b-15210f742a15/bin-2019/uautomizer/data/505605d79/f58483228f814939bac6c39878388705 [2018-10-27 06:11:23,825 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:11:23,826 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:11:23,827 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:11:23,827 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:11:23,830 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:11:23,831 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:11:23" (1/1) ... [2018-10-27 06:11:23,833 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@198d483c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:23, skipping insertion in model container [2018-10-27 06:11:23,834 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:11:23" (1/1) ... [2018-10-27 06:11:23,842 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:11:23,890 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:11:24,125 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:11:24,132 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:11:24,215 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:11:24,242 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:11:24,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:24 WrapperNode [2018-10-27 06:11:24,243 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:11:24,243 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:11:24,243 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:11:24,243 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:11:24,251 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:24" (1/1) ... [2018-10-27 06:11:24,324 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:24" (1/1) ... [2018-10-27 06:11:24,362 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:11:24,362 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:11:24,362 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:11:24,362 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:11:24,370 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:24" (1/1) ... [2018-10-27 06:11:24,371 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:24" (1/1) ... [2018-10-27 06:11:24,374 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:24" (1/1) ... [2018-10-27 06:11:24,375 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:24" (1/1) ... [2018-10-27 06:11:24,384 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:24" (1/1) ... [2018-10-27 06:11:24,395 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:24" (1/1) ... [2018-10-27 06:11:24,398 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:24" (1/1) ... [2018-10-27 06:11:24,402 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:11:24,402 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:11:24,403 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:11:24,403 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:11:24,403 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e37522fb-70ae-4fb9-856b-15210f742a15/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-10-27 06:11:24,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:11:24,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:11:26,352 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:11:26,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:11:26 BoogieIcfgContainer [2018-10-27 06:11:26,352 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:11:26,353 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:11:26,353 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:11:26,356 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:11:26,356 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:11:26,357 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:11:23" (1/3) ... [2018-10-27 06:11:26,357 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2b18239a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:11:26, skipping insertion in model container [2018-10-27 06:11:26,357 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:11:26,358 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:24" (2/3) ... [2018-10-27 06:11:26,358 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2b18239a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:11:26, skipping insertion in model container [2018-10-27 06:11:26,358 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:11:26,358 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:11:26" (3/3) ... [2018-10-27 06:11:26,359 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_floodmax.4_false-unreach-call.1.ufo.BOUNDED-8.pals_true-termination.c [2018-10-27 06:11:26,402 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:11:26,402 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:11:26,403 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:11:26,403 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:11:26,403 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:11:26,403 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:11:26,403 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:11:26,403 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:11:26,403 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:11:26,420 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 290 states. [2018-10-27 06:11:26,456 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 108 [2018-10-27 06:11:26,459 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:26,460 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:26,468 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:26,468 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:26,468 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:11:26,468 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 290 states. [2018-10-27 06:11:26,478 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 108 [2018-10-27 06:11:26,479 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:26,479 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:26,481 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:26,481 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:26,488 INFO L793 eck$LassoCheckResult]: Stem: 114#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p13~0 := 0;~p14~0 := 0;~p21~0 := 0;~p23~0 := 0;~p24~0 := 0;~p31~0 := 0;~p32~0 := 0;~p34~0 := 0;~p41~0 := 0;~p42~0 := 0;~p43~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset]; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~ret52, main_#t~ret53, main_#t~post54, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet12;havoc main_#t~nondet12;~ep13~0 := main_#t~nondet13;havoc main_#t~nondet13;~ep14~0 := main_#t~nondet14;havoc main_#t~nondet14;~ep21~0 := main_#t~nondet15;havoc main_#t~nondet15;~ep23~0 := main_#t~nondet16;havoc main_#t~nondet16;~ep24~0 := main_#t~nondet17;havoc main_#t~nondet17;~ep31~0 := main_#t~nondet18;havoc main_#t~nondet18;~ep32~0 := main_#t~nondet19;havoc main_#t~nondet19;~ep34~0 := main_#t~nondet20;havoc main_#t~nondet20;~ep41~0 := main_#t~nondet21;havoc main_#t~nondet21;~ep42~0 := main_#t~nondet22;havoc main_#t~nondet22;~ep43~0 := main_#t~nondet23;havoc main_#t~nondet23;~id1~0 := main_#t~nondet24;havoc main_#t~nondet24;~r1~0 := main_#t~nondet25;havoc main_#t~nondet25;~st1~0 := main_#t~nondet26;havoc main_#t~nondet26;~nl1~0 := main_#t~nondet27;havoc main_#t~nondet27;~m1~0 := main_#t~nondet28;havoc main_#t~nondet28;~max1~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode1~0 := main_#t~nondet30;havoc main_#t~nondet30;~id2~0 := main_#t~nondet31;havoc main_#t~nondet31;~r2~0 := main_#t~nondet32;havoc main_#t~nondet32;~st2~0 := main_#t~nondet33;havoc main_#t~nondet33;~nl2~0 := main_#t~nondet34;havoc main_#t~nondet34;~m2~0 := main_#t~nondet35;havoc main_#t~nondet35;~max2~0 := main_#t~nondet36;havoc main_#t~nondet36;~mode2~0 := main_#t~nondet37;havoc main_#t~nondet37;~id3~0 := main_#t~nondet38;havoc main_#t~nondet38;~r3~0 := main_#t~nondet39;havoc main_#t~nondet39;~st3~0 := main_#t~nondet40;havoc main_#t~nondet40;~nl3~0 := main_#t~nondet41;havoc main_#t~nondet41;~m3~0 := main_#t~nondet42;havoc main_#t~nondet42;~max3~0 := main_#t~nondet43;havoc main_#t~nondet43;~mode3~0 := main_#t~nondet44;havoc main_#t~nondet44;~id4~0 := main_#t~nondet45;havoc main_#t~nondet45;~r4~0 := main_#t~nondet46;havoc main_#t~nondet46;~st4~0 := main_#t~nondet47;havoc main_#t~nondet47;~nl4~0 := main_#t~nondet48;havoc main_#t~nondet48;~m4~0 := main_#t~nondet49;havoc main_#t~nondet49;~max4~0 := main_#t~nondet50;havoc main_#t~nondet50;~mode4~0 := main_#t~nondet51;havoc main_#t~nondet51;assume { :begin_inline_init } true;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r141~0, init_~r211~0, init_~r231~0, init_~r241~0, init_~r311~0, init_~r321~0, init_~r341~0, init_~r411~0, init_~r421~0, init_~r431~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r142~0, init_~tmp___1~0, init_~r212~0, init_~tmp___2~0, init_~r232~0, init_~tmp___3~0, init_~r242~0, init_~tmp___4~0, init_~r312~0, init_~tmp___5~0, init_~r322~0, init_~tmp___6~0, init_~r342~0, init_~tmp___7~0, init_~r412~0, init_~tmp___8~0, init_~r422~0, init_~tmp___9~0, init_~r432~0, init_~tmp___10~0, init_~r123~0, init_~tmp___11~0, init_~r133~0, init_~tmp___12~0, init_~r143~0, init_~tmp___13~0, init_~r213~0, init_~tmp___14~0, init_~r233~0, init_~tmp___15~0, init_~r243~0, init_~tmp___16~0, init_~r313~0, init_~tmp___17~0, init_~r323~0, init_~tmp___18~0, init_~r343~0, init_~tmp___19~0, init_~r413~0, init_~tmp___20~0, init_~r423~0, init_~tmp___21~0, init_~r433~0, init_~tmp___22~0, init_~tmp___23~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r141~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r241~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r341~0;havoc init_~r411~0;havoc init_~r421~0;havoc init_~r431~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r142~0;havoc init_~tmp___1~0;havoc init_~r212~0;havoc init_~tmp___2~0;havoc init_~r232~0;havoc init_~tmp___3~0;havoc init_~r242~0;havoc init_~tmp___4~0;havoc init_~r312~0;havoc init_~tmp___5~0;havoc init_~r322~0;havoc init_~tmp___6~0;havoc init_~r342~0;havoc init_~tmp___7~0;havoc init_~r412~0;havoc init_~tmp___8~0;havoc init_~r422~0;havoc init_~tmp___9~0;havoc init_~r432~0;havoc init_~tmp___10~0;havoc init_~r123~0;havoc init_~tmp___11~0;havoc init_~r133~0;havoc init_~tmp___12~0;havoc init_~r143~0;havoc init_~tmp___13~0;havoc init_~r213~0;havoc init_~tmp___14~0;havoc init_~r233~0;havoc init_~tmp___15~0;havoc init_~r243~0;havoc init_~tmp___16~0;havoc init_~r313~0;havoc init_~tmp___17~0;havoc init_~r323~0;havoc init_~tmp___18~0;havoc init_~r343~0;havoc init_~tmp___19~0;havoc init_~r413~0;havoc init_~tmp___20~0;havoc init_~r423~0;havoc init_~tmp___21~0;havoc init_~r433~0;havoc init_~tmp___22~0;havoc init_~tmp___23~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r141~0 := ~ep14~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r241~0 := ~ep24~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0;init_~r341~0 := ~ep34~0;init_~r411~0 := ~ep41~0;init_~r421~0 := ~ep42~0;init_~r431~0 := ~ep43~0; 175#L436true assume init_~r121~0 % 256 != 0;init_~tmp~0 := 1; 197#L447true init_~r122~0 := (if init_~tmp~0 == 0 then 0 else 1); 89#L457true assume init_~r131~0 % 256 != 0;init_~tmp___0~0 := 1; 88#L468true init_~r132~0 := (if init_~tmp___0~0 == 0 then 0 else 1); 142#L478true assume init_~r141~0 % 256 != 0;init_~tmp___1~0 := 1; 140#L489true init_~r142~0 := (if init_~tmp___1~0 == 0 then 0 else 1); 50#L499true assume init_~r211~0 % 256 != 0;init_~tmp___2~0 := 1; 48#L510true init_~r212~0 := (if init_~tmp___2~0 == 0 then 0 else 1); 249#L520true assume init_~r231~0 % 256 != 0;init_~tmp___3~0 := 1; 247#L531true init_~r232~0 := (if init_~tmp___3~0 == 0 then 0 else 1); 166#L541true assume init_~r241~0 % 256 != 0;init_~tmp___4~0 := 1; 165#L552true init_~r242~0 := (if init_~tmp___4~0 == 0 then 0 else 1); 219#L562true assume init_~r311~0 % 256 != 0;init_~tmp___5~0 := 1; 218#L573true init_~r312~0 := (if init_~tmp___5~0 == 0 then 0 else 1); 132#L583true assume init_~r321~0 % 256 != 0;init_~tmp___6~0 := 1; 131#L594true init_~r322~0 := (if init_~tmp___6~0 == 0 then 0 else 1); 33#L604true assume init_~r341~0 % 256 != 0;init_~tmp___7~0 := 1; 32#L615true init_~r342~0 := (if init_~tmp___7~0 == 0 then 0 else 1); 232#L625true assume init_~r411~0 % 256 != 0;init_~tmp___8~0 := 1; 230#L636true init_~r412~0 := (if init_~tmp___8~0 == 0 then 0 else 1); 291#L646true assume init_~r421~0 % 256 != 0;init_~tmp___9~0 := 1; 290#L657true init_~r422~0 := (if init_~tmp___9~0 == 0 then 0 else 1); 205#L667true assume init_~r431~0 % 256 != 0;init_~tmp___10~0 := 1; 204#L678true init_~r432~0 := (if init_~tmp___10~0 == 0 then 0 else 1); 119#L688true assume init_~r122~0 % 256 != 0;init_~tmp___11~0 := 1; 118#L699true init_~r123~0 := (if init_~tmp___11~0 == 0 then 0 else 1); 18#L709true assume init_~r132~0 % 256 != 0;init_~tmp___12~0 := 1; 17#L720true init_~r133~0 := (if init_~tmp___12~0 == 0 then 0 else 1); 80#L730true assume init_~r142~0 % 256 != 0;init_~tmp___13~0 := 1; 78#L741true init_~r143~0 := (if init_~tmp___13~0 == 0 then 0 else 1); 272#L751true assume init_~r212~0 % 256 != 0;init_~tmp___14~0 := 1; 271#L762true init_~r213~0 := (if init_~tmp___14~0 == 0 then 0 else 1); 171#L772true assume init_~r232~0 % 256 != 0;init_~tmp___15~0 := 1; 188#L783true init_~r233~0 := (if init_~tmp___15~0 == 0 then 0 else 1); 84#L793true assume init_~r242~0 % 256 != 0;init_~tmp___16~0 := 1; 83#L804true init_~r243~0 := (if init_~tmp___16~0 == 0 then 0 else 1); 137#L814true assume init_~r312~0 % 256 != 0;init_~tmp___17~0 := 1; 135#L825true init_~r313~0 := (if init_~tmp___17~0 == 0 then 0 else 1); 41#L835true assume init_~r322~0 % 256 != 0;init_~tmp___18~0 := 1; 39#L846true init_~r323~0 := (if init_~tmp___18~0 == 0 then 0 else 1); 239#L856true assume init_~r342~0 % 256 != 0;init_~tmp___19~0 := 1; 238#L867true init_~r343~0 := (if init_~tmp___19~0 == 0 then 0 else 1); 158#L877true assume init_~r412~0 % 256 != 0;init_~tmp___20~0 := 1; 157#L888true init_~r413~0 := (if init_~tmp___20~0 == 0 then 0 else 1); 212#L898true assume init_~r422~0 % 256 != 0;init_~tmp___21~0 := 1; 211#L909true init_~r423~0 := (if init_~tmp___21~0 == 0 then 0 else 1); 126#L919true assume init_~r432~0 % 256 != 0;init_~tmp___22~0 := 1; 125#L930true init_~r433~0 := (if init_~tmp___22~0 == 0 then 0 else 1); 25#L940true assume !(~id1~0 != ~id2~0);init_~tmp___23~0 := 0; 28#L940-1true init_#res := init_~tmp___23~0; 36#L1061true main_#t~ret52 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret52;havoc main_#t~ret52;assume 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;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0 := 0; 65#L1198-3true [2018-10-27 06:11:26,488 INFO L795 eck$LassoCheckResult]: Loop: 65#L1198-3true assume true; 61#L1198-1true assume !!(main_~i2~0 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_#t~ite1, node1_#t~ite2; 265#L151true assume !(~mode1~0 % 256 != 0); 180#L183true assume !(~r1~0 < 3); 177#L183-1true ~mode1~0 := 1; 262#L151-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite3, node2_#t~ite4, node2_#t~ite5; 97#L204true assume !(~mode2~0 % 256 != 0); 149#L236true assume !(~r2~0 < 3); 144#L236-1true ~mode2~0 := 1; 90#L204-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6, node3_#t~ite7, node3_#t~ite8; 53#L257true assume !(~mode3~0 % 256 != 0); 251#L289true assume !(~r3~0 < 3); 248#L289-1true ~mode3~0 := 1; 47#L257-2true assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9, node4_#t~ite10, node4_#t~ite11; 161#L310true assume !(~mode4~0 % 256 != 0); 214#L342true assume !(~r4~0 < 3); 215#L342-1true ~mode4~0 := 1; 286#L310-2true assume { :end_inline_node4 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 191#L1069true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1 := 0; 194#L1069-1true check_#res := check_~tmp~1; 64#L1121true main_#t~ret53 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret53;havoc main_#t~ret53;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 257#L1241true assume !(assert_~arg % 256 == 0); 227#L1236true assume { :end_inline_assert } true;main_#t~post54 := main_~i2~0;main_~i2~0 := main_#t~post54 + 1;havoc main_#t~post54; 65#L1198-3true [2018-10-27 06:11:26,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:26,494 INFO L82 PathProgramCache]: Analyzing trace with hash 15460348, now seen corresponding path program 1 times [2018-10-27 06:11:26,495 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:26,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:26,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:26,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:26,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:26,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:26,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:26,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:11:26,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:11:26,833 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:11:26,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:26,833 INFO L82 PathProgramCache]: Analyzing trace with hash 341808156, now seen corresponding path program 1 times [2018-10-27 06:11:26,833 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:26,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:26,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:26,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:26,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:26,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:26,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:26,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:11:26,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 06:11:26,921 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:11:26,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 06:11:26,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 06:11:26,937 INFO L87 Difference]: Start difference. First operand 290 states. Second operand 5 states. [2018-10-27 06:11:27,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:27,100 INFO L93 Difference]: Finished difference Result 294 states and 520 transitions. [2018-10-27 06:11:27,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 06:11:27,103 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 294 states and 520 transitions. [2018-10-27 06:11:27,108 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 107 [2018-10-27 06:11:27,115 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 294 states to 285 states and 503 transitions. [2018-10-27 06:11:27,116 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 285 [2018-10-27 06:11:27,117 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 285 [2018-10-27 06:11:27,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 285 states and 503 transitions. [2018-10-27 06:11:27,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:11:27,120 INFO L705 BuchiCegarLoop]: Abstraction has 285 states and 503 transitions. [2018-10-27 06:11:27,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states and 503 transitions. [2018-10-27 06:11:27,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2018-10-27 06:11:27,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-10-27 06:11:27,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 503 transitions. [2018-10-27 06:11:27,158 INFO L728 BuchiCegarLoop]: Abstraction has 285 states and 503 transitions. [2018-10-27 06:11:27,158 INFO L608 BuchiCegarLoop]: Abstraction has 285 states and 503 transitions. [2018-10-27 06:11:27,159 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:11:27,159 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 285 states and 503 transitions. [2018-10-27 06:11:27,162 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 107 [2018-10-27 06:11:27,162 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:27,162 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:27,164 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:27,165 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:27,165 INFO L793 eck$LassoCheckResult]: Stem: 806#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p13~0 := 0;~p14~0 := 0;~p21~0 := 0;~p23~0 := 0;~p24~0 := 0;~p31~0 := 0;~p32~0 := 0;~p34~0 := 0;~p41~0 := 0;~p42~0 := 0;~p43~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset]; 617#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~ret52, main_#t~ret53, main_#t~post54, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet12;havoc main_#t~nondet12;~ep13~0 := main_#t~nondet13;havoc main_#t~nondet13;~ep14~0 := main_#t~nondet14;havoc main_#t~nondet14;~ep21~0 := main_#t~nondet15;havoc main_#t~nondet15;~ep23~0 := main_#t~nondet16;havoc main_#t~nondet16;~ep24~0 := main_#t~nondet17;havoc main_#t~nondet17;~ep31~0 := main_#t~nondet18;havoc main_#t~nondet18;~ep32~0 := main_#t~nondet19;havoc main_#t~nondet19;~ep34~0 := main_#t~nondet20;havoc main_#t~nondet20;~ep41~0 := main_#t~nondet21;havoc main_#t~nondet21;~ep42~0 := main_#t~nondet22;havoc main_#t~nondet22;~ep43~0 := main_#t~nondet23;havoc main_#t~nondet23;~id1~0 := main_#t~nondet24;havoc main_#t~nondet24;~r1~0 := main_#t~nondet25;havoc main_#t~nondet25;~st1~0 := main_#t~nondet26;havoc main_#t~nondet26;~nl1~0 := main_#t~nondet27;havoc main_#t~nondet27;~m1~0 := main_#t~nondet28;havoc main_#t~nondet28;~max1~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode1~0 := main_#t~nondet30;havoc main_#t~nondet30;~id2~0 := main_#t~nondet31;havoc main_#t~nondet31;~r2~0 := main_#t~nondet32;havoc main_#t~nondet32;~st2~0 := main_#t~nondet33;havoc main_#t~nondet33;~nl2~0 := main_#t~nondet34;havoc main_#t~nondet34;~m2~0 := main_#t~nondet35;havoc main_#t~nondet35;~max2~0 := main_#t~nondet36;havoc main_#t~nondet36;~mode2~0 := main_#t~nondet37;havoc main_#t~nondet37;~id3~0 := main_#t~nondet38;havoc main_#t~nondet38;~r3~0 := main_#t~nondet39;havoc main_#t~nondet39;~st3~0 := main_#t~nondet40;havoc main_#t~nondet40;~nl3~0 := main_#t~nondet41;havoc main_#t~nondet41;~m3~0 := main_#t~nondet42;havoc main_#t~nondet42;~max3~0 := main_#t~nondet43;havoc main_#t~nondet43;~mode3~0 := main_#t~nondet44;havoc main_#t~nondet44;~id4~0 := main_#t~nondet45;havoc main_#t~nondet45;~r4~0 := main_#t~nondet46;havoc main_#t~nondet46;~st4~0 := main_#t~nondet47;havoc main_#t~nondet47;~nl4~0 := main_#t~nondet48;havoc main_#t~nondet48;~m4~0 := main_#t~nondet49;havoc main_#t~nondet49;~max4~0 := main_#t~nondet50;havoc main_#t~nondet50;~mode4~0 := main_#t~nondet51;havoc main_#t~nondet51;assume { :begin_inline_init } true;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r141~0, init_~r211~0, init_~r231~0, init_~r241~0, init_~r311~0, init_~r321~0, init_~r341~0, init_~r411~0, init_~r421~0, init_~r431~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r142~0, init_~tmp___1~0, init_~r212~0, init_~tmp___2~0, init_~r232~0, init_~tmp___3~0, init_~r242~0, init_~tmp___4~0, init_~r312~0, init_~tmp___5~0, init_~r322~0, init_~tmp___6~0, init_~r342~0, init_~tmp___7~0, init_~r412~0, init_~tmp___8~0, init_~r422~0, init_~tmp___9~0, init_~r432~0, init_~tmp___10~0, init_~r123~0, init_~tmp___11~0, init_~r133~0, init_~tmp___12~0, init_~r143~0, init_~tmp___13~0, init_~r213~0, init_~tmp___14~0, init_~r233~0, init_~tmp___15~0, init_~r243~0, init_~tmp___16~0, init_~r313~0, init_~tmp___17~0, init_~r323~0, init_~tmp___18~0, init_~r343~0, init_~tmp___19~0, init_~r413~0, init_~tmp___20~0, init_~r423~0, init_~tmp___21~0, init_~r433~0, init_~tmp___22~0, init_~tmp___23~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r141~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r241~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r341~0;havoc init_~r411~0;havoc init_~r421~0;havoc init_~r431~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r142~0;havoc init_~tmp___1~0;havoc init_~r212~0;havoc init_~tmp___2~0;havoc init_~r232~0;havoc init_~tmp___3~0;havoc init_~r242~0;havoc init_~tmp___4~0;havoc init_~r312~0;havoc init_~tmp___5~0;havoc init_~r322~0;havoc init_~tmp___6~0;havoc init_~r342~0;havoc init_~tmp___7~0;havoc init_~r412~0;havoc init_~tmp___8~0;havoc init_~r422~0;havoc init_~tmp___9~0;havoc init_~r432~0;havoc init_~tmp___10~0;havoc init_~r123~0;havoc init_~tmp___11~0;havoc init_~r133~0;havoc init_~tmp___12~0;havoc init_~r143~0;havoc init_~tmp___13~0;havoc init_~r213~0;havoc init_~tmp___14~0;havoc init_~r233~0;havoc init_~tmp___15~0;havoc init_~r243~0;havoc init_~tmp___16~0;havoc init_~r313~0;havoc init_~tmp___17~0;havoc init_~r323~0;havoc init_~tmp___18~0;havoc init_~r343~0;havoc init_~tmp___19~0;havoc init_~r413~0;havoc init_~tmp___20~0;havoc init_~r423~0;havoc init_~tmp___21~0;havoc init_~r433~0;havoc init_~tmp___22~0;havoc init_~tmp___23~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r141~0 := ~ep14~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r241~0 := ~ep24~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0;init_~r341~0 := ~ep34~0;init_~r411~0 := ~ep41~0;init_~r421~0 := ~ep42~0;init_~r431~0 := ~ep43~0; 618#L436 assume init_~r121~0 % 256 != 0;init_~tmp~0 := 1; 774#L447 init_~r122~0 := (if init_~tmp~0 == 0 then 0 else 1); 768#L457 assume init_~r131~0 % 256 != 0;init_~tmp___0~0 := 1; 642#L468 init_~r132~0 := (if init_~tmp___0~0 == 0 then 0 else 1); 766#L478 assume init_~r141~0 % 256 != 0;init_~tmp___1~0 := 1; 710#L489 init_~r142~0 := (if init_~tmp___1~0 == 0 then 0 else 1); 706#L499 assume init_~r211~0 % 256 != 0;init_~tmp___2~0 := 1; 616#L510 init_~r212~0 := (if init_~tmp___2~0 == 0 then 0 else 1); 699#L520 assume init_~r231~0 % 256 != 0;init_~tmp___3~0 := 1; 697#L531 init_~r232~0 := (if init_~tmp___3~0 == 0 then 0 else 1); 842#L541 assume init_~r241~0 % 256 != 0;init_~tmp___4~0 := 1; 801#L552 init_~r242~0 := (if init_~tmp___4~0 == 0 then 0 else 1); 841#L562 assume init_~r311~0 % 256 != 0;init_~tmp___5~0 := 1; 607#L573 init_~r312~0 := (if init_~tmp___5~0 == 0 then 0 else 1); 823#L583 assume init_~r321~0 % 256 != 0;init_~tmp___6~0 := 1; 671#L594 init_~r322~0 := (if init_~tmp___6~0 == 0 then 0 else 1); 668#L604 assume init_~r341~0 % 256 != 0;init_~tmp___7~0 := 1; 666#L615 init_~r342~0 := (if init_~tmp___7~0 == 0 then 0 else 1); 667#L625 assume init_~r411~0 % 256 != 0;init_~tmp___8~0 := 1; 665#L636 init_~r412~0 := (if init_~tmp___8~0 == 0 then 0 else 1); 881#L646 assume init_~r421~0 % 256 != 0;init_~tmp___9~0 := 1; 764#L657 init_~r422~0 := (if init_~tmp___9~0 == 0 then 0 else 1); 870#L667 assume init_~r431~0 % 256 != 0;init_~tmp___10~0 := 1; 813#L678 init_~r432~0 := (if init_~tmp___10~0 == 0 then 0 else 1); 810#L688 assume init_~r122~0 % 256 != 0;init_~tmp___11~0 := 1; 637#L699 init_~r123~0 := (if init_~tmp___11~0 == 0 then 0 else 1); 634#L709 assume init_~r132~0 % 256 != 0;init_~tmp___12~0 := 1; 632#L720 init_~r133~0 := (if init_~tmp___12~0 == 0 then 0 else 1); 633#L730 assume init_~r142~0 % 256 != 0;init_~tmp___13~0 := 1; 628#L741 init_~r143~0 := (if init_~tmp___13~0 == 0 then 0 else 1); 751#L751 assume init_~r212~0 % 256 != 0;init_~tmp___14~0 := 1; 750#L762 init_~r213~0 := (if init_~tmp___14~0 == 0 then 0 else 1); 849#L772 assume init_~r232~0 % 256 != 0;init_~tmp___15~0 := 1; 762#L783 init_~r233~0 := (if init_~tmp___15~0 == 0 then 0 else 1); 760#L793 assume init_~r242~0 % 256 != 0;init_~tmp___16~0 := 1; 622#L804 init_~r243~0 := (if init_~tmp___16~0 == 0 then 0 else 1); 757#L814 assume init_~r312~0 % 256 != 0;init_~tmp___17~0 := 1; 691#L825 init_~r313~0 := (if init_~tmp___17~0 == 0 then 0 else 1); 684#L835 assume init_~r322~0 % 256 != 0;init_~tmp___18~0 := 1; 682#L846 init_~r323~0 := (if init_~tmp___18~0 == 0 then 0 else 1); 683#L856 assume init_~r342~0 % 256 != 0;init_~tmp___19~0 := 1; 679#L867 init_~r343~0 := (if init_~tmp___19~0 == 0 then 0 else 1); 835#L877 assume init_~r412~0 % 256 != 0;init_~tmp___20~0 := 1; 786#L888 init_~r413~0 := (if init_~tmp___20~0 == 0 then 0 else 1); 834#L898 assume init_~r422~0 % 256 != 0;init_~tmp___21~0 := 1; 819#L909 init_~r423~0 := (if init_~tmp___21~0 == 0 then 0 else 1); 817#L919 assume init_~r432~0 % 256 != 0;init_~tmp___22~0 := 1; 655#L930 init_~r433~0 := (if init_~tmp___22~0 == 0 then 0 else 1); 652#L940 assume !(~id1~0 != ~id2~0);init_~tmp___23~0 := 0; 645#L940-1 init_#res := init_~tmp___23~0; 659#L1061 main_#t~ret52 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret52;havoc main_#t~ret52;assume 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;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0 := 0; 675#L1198-3 [2018-10-27 06:11:27,165 INFO L795 eck$LassoCheckResult]: Loop: 675#L1198-3 assume true; 728#L1198-1 assume !!(main_~i2~0 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_#t~ite1, node1_#t~ite2; 729#L151 assume !(~mode1~0 % 256 != 0); 856#L183 assume !(~r1~0 < 3); 658#L183-1 ~mode1~0 := 1; 752#L151-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite3, node2_#t~ite4, node2_#t~ite5; 780#L204 assume !(~mode2~0 % 256 != 0); 781#L236 assume !(~r2~0 < 3); 727#L236-1 ~mode2~0 := 1; 770#L204-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6, node3_#t~ite7, node3_#t~ite8; 711#L257 assume !(~mode3~0 % 256 != 0); 713#L289 assume !(~r3~0 < 3); 800#L289-1 ~mode3~0 := 1; 694#L257-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9, node4_#t~ite10, node4_#t~ite11; 695#L310 assume !(~mode4~0 % 256 != 0); 839#L342 assume !(~r4~0 < 3); 745#L342-1 ~mode4~0 := 1; 873#L310-2 assume { :end_inline_node4 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 862#L1069 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 863#L1070 assume ~st1~0 + ~nl1~0 <= 1; 882#L1071 assume ~st2~0 + ~nl2~0 <= 1; 676#L1072 assume ~st3~0 + ~nl3~0 <= 1; 677#L1073 assume ~st4~0 + ~nl4~0 <= 1; 825#L1074 assume ~r1~0 >= 3; 609#L1078 assume ~r1~0 < 3; 610#L1083 assume ~r1~0 >= 3; 673#L1088 assume ~r1~0 < 3;check_~tmp~1 := 1; 739#L1069-1 check_#res := check_~tmp~1; 735#L1121 main_#t~ret53 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret53;havoc main_#t~ret53;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 736#L1241 assume !(assert_~arg % 256 == 0); 879#L1236 assume { :end_inline_assert } true;main_#t~post54 := main_~i2~0;main_~i2~0 := main_#t~post54 + 1;havoc main_#t~post54; 675#L1198-3 [2018-10-27 06:11:27,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:27,166 INFO L82 PathProgramCache]: Analyzing trace with hash 15460348, now seen corresponding path program 2 times [2018-10-27 06:11:27,166 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:27,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:27,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:27,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:27,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:27,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:27,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:27,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:11:27,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:11:27,324 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:11:27,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:27,324 INFO L82 PathProgramCache]: Analyzing trace with hash 448004075, now seen corresponding path program 1 times [2018-10-27 06:11:27,324 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:27,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:27,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:27,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:27,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:27,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:27,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:27,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:11:27,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:11:27,402 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:11:27,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:11:27,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:11:27,402 INFO L87 Difference]: Start difference. First operand 285 states and 503 transitions. cyclomatic complexity: 219 Second operand 3 states. [2018-10-27 06:11:27,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:27,751 INFO L93 Difference]: Finished difference Result 371 states and 638 transitions. [2018-10-27 06:11:27,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:11:27,752 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 371 states and 638 transitions. [2018-10-27 06:11:27,754 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 193 [2018-10-27 06:11:27,756 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 371 states to 371 states and 638 transitions. [2018-10-27 06:11:27,756 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 371 [2018-10-27 06:11:27,757 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 371 [2018-10-27 06:11:27,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 371 states and 638 transitions. [2018-10-27 06:11:27,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:11:27,759 INFO L705 BuchiCegarLoop]: Abstraction has 371 states and 638 transitions. [2018-10-27 06:11:27,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states and 638 transitions. [2018-10-27 06:11:27,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 371. [2018-10-27 06:11:27,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-10-27 06:11:27,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 638 transitions. [2018-10-27 06:11:27,773 INFO L728 BuchiCegarLoop]: Abstraction has 371 states and 638 transitions. [2018-10-27 06:11:27,773 INFO L608 BuchiCegarLoop]: Abstraction has 371 states and 638 transitions. [2018-10-27 06:11:27,773 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:11:27,773 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 371 states and 638 transitions. [2018-10-27 06:11:27,777 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 193 [2018-10-27 06:11:27,777 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:27,777 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:27,779 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:27,779 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-10-27 06:11:27,780 INFO L793 eck$LassoCheckResult]: Stem: 1470#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p13~0 := 0;~p14~0 := 0;~p21~0 := 0;~p23~0 := 0;~p24~0 := 0;~p31~0 := 0;~p32~0 := 0;~p34~0 := 0;~p41~0 := 0;~p42~0 := 0;~p43~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset]; 1280#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~ret52, main_#t~ret53, main_#t~post54, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet12;havoc main_#t~nondet12;~ep13~0 := main_#t~nondet13;havoc main_#t~nondet13;~ep14~0 := main_#t~nondet14;havoc main_#t~nondet14;~ep21~0 := main_#t~nondet15;havoc main_#t~nondet15;~ep23~0 := main_#t~nondet16;havoc main_#t~nondet16;~ep24~0 := main_#t~nondet17;havoc main_#t~nondet17;~ep31~0 := main_#t~nondet18;havoc main_#t~nondet18;~ep32~0 := main_#t~nondet19;havoc main_#t~nondet19;~ep34~0 := main_#t~nondet20;havoc main_#t~nondet20;~ep41~0 := main_#t~nondet21;havoc main_#t~nondet21;~ep42~0 := main_#t~nondet22;havoc main_#t~nondet22;~ep43~0 := main_#t~nondet23;havoc main_#t~nondet23;~id1~0 := main_#t~nondet24;havoc main_#t~nondet24;~r1~0 := main_#t~nondet25;havoc main_#t~nondet25;~st1~0 := main_#t~nondet26;havoc main_#t~nondet26;~nl1~0 := main_#t~nondet27;havoc main_#t~nondet27;~m1~0 := main_#t~nondet28;havoc main_#t~nondet28;~max1~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode1~0 := main_#t~nondet30;havoc main_#t~nondet30;~id2~0 := main_#t~nondet31;havoc main_#t~nondet31;~r2~0 := main_#t~nondet32;havoc main_#t~nondet32;~st2~0 := main_#t~nondet33;havoc main_#t~nondet33;~nl2~0 := main_#t~nondet34;havoc main_#t~nondet34;~m2~0 := main_#t~nondet35;havoc main_#t~nondet35;~max2~0 := main_#t~nondet36;havoc main_#t~nondet36;~mode2~0 := main_#t~nondet37;havoc main_#t~nondet37;~id3~0 := main_#t~nondet38;havoc main_#t~nondet38;~r3~0 := main_#t~nondet39;havoc main_#t~nondet39;~st3~0 := main_#t~nondet40;havoc main_#t~nondet40;~nl3~0 := main_#t~nondet41;havoc main_#t~nondet41;~m3~0 := main_#t~nondet42;havoc main_#t~nondet42;~max3~0 := main_#t~nondet43;havoc main_#t~nondet43;~mode3~0 := main_#t~nondet44;havoc main_#t~nondet44;~id4~0 := main_#t~nondet45;havoc main_#t~nondet45;~r4~0 := main_#t~nondet46;havoc main_#t~nondet46;~st4~0 := main_#t~nondet47;havoc main_#t~nondet47;~nl4~0 := main_#t~nondet48;havoc main_#t~nondet48;~m4~0 := main_#t~nondet49;havoc main_#t~nondet49;~max4~0 := main_#t~nondet50;havoc main_#t~nondet50;~mode4~0 := main_#t~nondet51;havoc main_#t~nondet51;assume { :begin_inline_init } true;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r141~0, init_~r211~0, init_~r231~0, init_~r241~0, init_~r311~0, init_~r321~0, init_~r341~0, init_~r411~0, init_~r421~0, init_~r431~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r142~0, init_~tmp___1~0, init_~r212~0, init_~tmp___2~0, init_~r232~0, init_~tmp___3~0, init_~r242~0, init_~tmp___4~0, init_~r312~0, init_~tmp___5~0, init_~r322~0, init_~tmp___6~0, init_~r342~0, init_~tmp___7~0, init_~r412~0, init_~tmp___8~0, init_~r422~0, init_~tmp___9~0, init_~r432~0, init_~tmp___10~0, init_~r123~0, init_~tmp___11~0, init_~r133~0, init_~tmp___12~0, init_~r143~0, init_~tmp___13~0, init_~r213~0, init_~tmp___14~0, init_~r233~0, init_~tmp___15~0, init_~r243~0, init_~tmp___16~0, init_~r313~0, init_~tmp___17~0, init_~r323~0, init_~tmp___18~0, init_~r343~0, init_~tmp___19~0, init_~r413~0, init_~tmp___20~0, init_~r423~0, init_~tmp___21~0, init_~r433~0, init_~tmp___22~0, init_~tmp___23~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r141~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r241~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r341~0;havoc init_~r411~0;havoc init_~r421~0;havoc init_~r431~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r142~0;havoc init_~tmp___1~0;havoc init_~r212~0;havoc init_~tmp___2~0;havoc init_~r232~0;havoc init_~tmp___3~0;havoc init_~r242~0;havoc init_~tmp___4~0;havoc init_~r312~0;havoc init_~tmp___5~0;havoc init_~r322~0;havoc init_~tmp___6~0;havoc init_~r342~0;havoc init_~tmp___7~0;havoc init_~r412~0;havoc init_~tmp___8~0;havoc init_~r422~0;havoc init_~tmp___9~0;havoc init_~r432~0;havoc init_~tmp___10~0;havoc init_~r123~0;havoc init_~tmp___11~0;havoc init_~r133~0;havoc init_~tmp___12~0;havoc init_~r143~0;havoc init_~tmp___13~0;havoc init_~r213~0;havoc init_~tmp___14~0;havoc init_~r233~0;havoc init_~tmp___15~0;havoc init_~r243~0;havoc init_~tmp___16~0;havoc init_~r313~0;havoc init_~tmp___17~0;havoc init_~r323~0;havoc init_~tmp___18~0;havoc init_~r343~0;havoc init_~tmp___19~0;havoc init_~r413~0;havoc init_~tmp___20~0;havoc init_~r423~0;havoc init_~tmp___21~0;havoc init_~r433~0;havoc init_~tmp___22~0;havoc init_~tmp___23~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r141~0 := ~ep14~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r241~0 := ~ep24~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0;init_~r341~0 := ~ep34~0;init_~r411~0 := ~ep41~0;init_~r421~0 := ~ep42~0;init_~r431~0 := ~ep43~0; 1281#L436 assume init_~r121~0 % 256 != 0;init_~tmp~0 := 1; 1438#L447 init_~r122~0 := (if init_~tmp~0 == 0 then 0 else 1); 1433#L457 assume init_~r131~0 % 256 != 0;init_~tmp___0~0 := 1; 1305#L468 init_~r132~0 := (if init_~tmp___0~0 == 0 then 0 else 1); 1430#L478 assume init_~r141~0 % 256 != 0;init_~tmp___1~0 := 1; 1373#L489 init_~r142~0 := (if init_~tmp___1~0 == 0 then 0 else 1); 1369#L499 assume init_~r211~0 % 256 != 0;init_~tmp___2~0 := 1; 1279#L510 init_~r212~0 := (if init_~tmp___2~0 == 0 then 0 else 1); 1365#L520 assume init_~r231~0 % 256 != 0;init_~tmp___3~0 := 1; 1361#L531 init_~r232~0 := (if init_~tmp___3~0 == 0 then 0 else 1); 1506#L541 assume init_~r241~0 % 256 != 0;init_~tmp___4~0 := 1; 1465#L552 init_~r242~0 := (if init_~tmp___4~0 == 0 then 0 else 1); 1505#L562 assume init_~r311~0 % 256 != 0;init_~tmp___5~0 := 1; 1271#L573 init_~r312~0 := (if init_~tmp___5~0 == 0 then 0 else 1); 1487#L583 assume init_~r321~0 % 256 != 0;init_~tmp___6~0 := 1; 1334#L594 init_~r322~0 := (if init_~tmp___6~0 == 0 then 0 else 1); 1331#L604 assume init_~r341~0 % 256 != 0;init_~tmp___7~0 := 1; 1329#L615 init_~r342~0 := (if init_~tmp___7~0 == 0 then 0 else 1); 1330#L625 assume init_~r411~0 % 256 != 0;init_~tmp___8~0 := 1; 1328#L636 init_~r412~0 := (if init_~tmp___8~0 == 0 then 0 else 1); 1548#L646 assume init_~r421~0 % 256 != 0;init_~tmp___9~0 := 1; 1428#L657 init_~r422~0 := (if init_~tmp___9~0 == 0 then 0 else 1); 1535#L667 assume init_~r431~0 % 256 != 0;init_~tmp___10~0 := 1; 1477#L678 init_~r432~0 := (if init_~tmp___10~0 == 0 then 0 else 1); 1474#L688 assume init_~r122~0 % 256 != 0;init_~tmp___11~0 := 1; 1302#L699 init_~r123~0 := (if init_~tmp___11~0 == 0 then 0 else 1); 1297#L709 assume init_~r132~0 % 256 != 0;init_~tmp___12~0 := 1; 1295#L720 init_~r133~0 := (if init_~tmp___12~0 == 0 then 0 else 1); 1296#L730 assume init_~r142~0 % 256 != 0;init_~tmp___13~0 := 1; 1291#L741 init_~r143~0 := (if init_~tmp___13~0 == 0 then 0 else 1); 1416#L751 assume init_~r212~0 % 256 != 0;init_~tmp___14~0 := 1; 1414#L762 init_~r213~0 := (if init_~tmp___14~0 == 0 then 0 else 1); 1513#L772 assume init_~r232~0 % 256 != 0;init_~tmp___15~0 := 1; 1426#L783 init_~r233~0 := (if init_~tmp___15~0 == 0 then 0 else 1); 1424#L793 assume init_~r242~0 % 256 != 0;init_~tmp___16~0 := 1; 1285#L804 init_~r243~0 := (if init_~tmp___16~0 == 0 then 0 else 1); 1421#L814 assume init_~r312~0 % 256 != 0;init_~tmp___17~0 := 1; 1354#L825 init_~r313~0 := (if init_~tmp___17~0 == 0 then 0 else 1); 1347#L835 assume init_~r322~0 % 256 != 0;init_~tmp___18~0 := 1; 1345#L846 init_~r323~0 := (if init_~tmp___18~0 == 0 then 0 else 1); 1346#L856 assume init_~r342~0 % 256 != 0;init_~tmp___19~0 := 1; 1342#L867 init_~r343~0 := (if init_~tmp___19~0 == 0 then 0 else 1); 1499#L877 assume init_~r412~0 % 256 != 0;init_~tmp___20~0 := 1; 1448#L888 init_~r413~0 := (if init_~tmp___20~0 == 0 then 0 else 1); 1498#L898 assume init_~r422~0 % 256 != 0;init_~tmp___21~0 := 1; 1483#L909 init_~r423~0 := (if init_~tmp___21~0 == 0 then 0 else 1); 1481#L919 assume init_~r432~0 % 256 != 0;init_~tmp___22~0 := 1; 1318#L930 init_~r433~0 := (if init_~tmp___22~0 == 0 then 0 else 1); 1315#L940 assume !(~id1~0 != ~id2~0);init_~tmp___23~0 := 0; 1308#L940-1 init_#res := init_~tmp___23~0; 1322#L1061 main_#t~ret52 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret52;havoc main_#t~ret52;assume 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;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0 := 0; 1338#L1198-3 [2018-10-27 06:11:27,781 INFO L795 eck$LassoCheckResult]: Loop: 1338#L1198-3 assume true; 1573#L1198-1 assume !!(main_~i2~0 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_#t~ite1, node1_#t~ite2; 1570#L151 assume ~mode1~0 % 256 != 0;~r1~0 := (if (~r1~0 + 1) % 256 <= 127 then (~r1~0 + 1) % 256 else (~r1~0 + 1) % 256 - 256); 1299#L153 assume !(~ep21~0 % 256 != 0); 1292#L153-1 assume !(~ep31~0 % 256 != 0); 1294#L160 assume !(~ep41~0 % 256 != 0); 1442#L167 assume !(~r1~0 == 3); 1555#L174 ~mode1~0 := 0; 1611#L151-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite3, node2_#t~ite4, node2_#t~ite5; 1609#L204 assume !(~mode2~0 % 256 != 0); 1610#L236 assume !(~r2~0 < 3); 1595#L236-1 ~mode2~0 := 1; 1594#L204-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6, node3_#t~ite7, node3_#t~ite8; 1592#L257 assume !(~mode3~0 % 256 != 0); 1593#L289 assume !(~r3~0 < 3); 1581#L289-1 ~mode3~0 := 1; 1579#L257-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9, node4_#t~ite10, node4_#t~ite11; 1577#L310 assume !(~mode4~0 % 256 != 0); 1538#L342 assume !(~r4~0 < 3); 1411#L342-1 ~mode4~0 := 1; 1563#L310-2 assume { :end_inline_node4 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 1562#L1069 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 1561#L1070 assume ~st1~0 + ~nl1~0 <= 1; 1560#L1071 assume ~st2~0 + ~nl2~0 <= 1; 1559#L1072 assume ~st3~0 + ~nl3~0 <= 1; 1558#L1073 assume ~st4~0 + ~nl4~0 <= 1; 1557#L1074 assume !(~r1~0 >= 3); 1402#L1077 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 == 0; 1403#L1078 assume ~r1~0 < 3; 1626#L1083 assume !(~r1~0 >= 3); 1552#L1087 assume ~nl1~0 + ~nl2~0 + ~nl3~0 + ~nl4~0 == 0; 1553#L1088 assume ~r1~0 < 3;check_~tmp~1 := 1; 1583#L1069-1 check_#res := check_~tmp~1; 1580#L1121 main_#t~ret53 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret53;havoc main_#t~ret53;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 1578#L1241 assume !(assert_~arg % 256 == 0); 1576#L1236 assume { :end_inline_assert } true;main_#t~post54 := main_~i2~0;main_~i2~0 := main_#t~post54 + 1;havoc main_#t~post54; 1338#L1198-3 [2018-10-27 06:11:27,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:27,781 INFO L82 PathProgramCache]: Analyzing trace with hash 15460348, now seen corresponding path program 3 times [2018-10-27 06:11:27,781 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:27,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:27,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:27,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:27,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:27,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:27,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:27,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:11:27,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:11:27,890 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:11:27,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:27,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1516640295, now seen corresponding path program 1 times [2018-10-27 06:11:27,891 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:27,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:27,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:27,892 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:27,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:27,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:27,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:28,572 WARN L179 SmtUtils]: Spent 606.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 154 [2018-10-27 06:11:28,775 WARN L179 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2018-10-27 06:11:28,805 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:11:28,806 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:11:28,806 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:11:28,806 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:11:28,806 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-10-27 06:11:28,806 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:11:28,806 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:11:28,806 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:11:28,807 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.4_false-unreach-call.1.ufo.BOUNDED-8.pals_true-termination.c_Iteration3_Loop [2018-10-27 06:11:28,807 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:11:28,809 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:11:28,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-10-27 06:11:28,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:28,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-10-27 06:11:28,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-10-27 06:11:28,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-10-27 06:11:28,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:28,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:28,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:28,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:28,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:28,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:28,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:28,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:28,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-10-27 06:11:28,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-10-27 06:11:28,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-10-27 06:11:28,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:28,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:28,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-10-27 06:11:28,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-10-27 06:11:28,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:28,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-10-27 06:11:28,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:28,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:28,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:28,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:28,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:28,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:28,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-10-27 06:11:28,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-10-27 06:11:29,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-10-27 06:11:29,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-10-27 06:11:29,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-10-27 06:11:29,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:29,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:29,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-10-27 06:11:29,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-10-27 06:11:29,467 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2018-10-27 06:11:29,744 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:11:29,744 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e37522fb-70ae-4fb9-856b-15210f742a15/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-10-27 06:11:29,757 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:11:29,757 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e37522fb-70ae-4fb9-856b-15210f742a15/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-10-27 06:11:29,790 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-10-27 06:11:29,790 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:11:29,905 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-10-27 06:11:29,907 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:11:29,907 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:11:29,907 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:11:29,907 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:11:29,907 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:11:29,907 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:11:29,907 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:11:29,907 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:11:29,907 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.4_false-unreach-call.1.ufo.BOUNDED-8.pals_true-termination.c_Iteration3_Loop [2018-10-27 06:11:29,907 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:11:29,908 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:11:29,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:29,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-10-27 06:11:29,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-10-27 06:11:29,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:29,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:29,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:29,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:29,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-10-27 06:11:30,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:30,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:30,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:30,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:30,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-10-27 06:11:30,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-10-27 06:11:30,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-10-27 06:11:30,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:30,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:30,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:30,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:30,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:30,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:30,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:30,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:30,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:30,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:30,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:30,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:30,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:30,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:30,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:30,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:30,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:30,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-10-27 06:11:30,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-10-27 06:11:30,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-10-27 06:11:30,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:30,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:30,564 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2018-10-27 06:11:30,818 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:11:30,822 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:11:30,824 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-10-27 06:11:30,825 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:30,825 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:30,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:30,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:30,826 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:30,829 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:30,829 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:30,834 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:30,835 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-10-27 06:11:30,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:30,837 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:30,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:30,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:30,837 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:30,839 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:30,839 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:30,841 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:30,842 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-10-27 06:11:30,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:30,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:30,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:30,842 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:30,847 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:30,847 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:30,849 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:30,849 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-10-27 06:11:30,849 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:30,850 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:30,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:30,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:30,850 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:30,850 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:30,850 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:30,854 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:30,855 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:30,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:30,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:30,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:30,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:30,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:30,856 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:30,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:30,857 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:30,857 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:30,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:30,857 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:30,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:30,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:30,858 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:30,858 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:30,858 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:30,859 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:30,859 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-10-27 06:11:30,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:30,866 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:30,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:30,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:30,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:30,866 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:30,866 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:30,867 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:30,867 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-10-27 06:11:30,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:30,868 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:30,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:30,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:30,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:30,868 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:30,868 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:30,869 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:30,869 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:30,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:30,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:30,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:30,870 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:30,871 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:30,871 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:30,881 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:30,882 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-10-27 06:11:30,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:30,882 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:30,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:30,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:30,883 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:30,883 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:30,883 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:30,885 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:30,885 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-10-27 06:11:30,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:30,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:30,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:30,886 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:30,886 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:30,887 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:30,897 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:30,897 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-10-27 06:11:30,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:30,897 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:30,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:30,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:30,898 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:30,898 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:30,898 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:30,899 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:30,902 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-10-27 06:11:30,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:30,903 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:30,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:30,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:30,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:30,904 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:30,904 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:30,904 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:30,904 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-10-27 06:11:30,905 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:30,905 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:30,905 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:30,905 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:30,906 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:30,906 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:30,914 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:30,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-10-27 06:11:30,915 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:30,915 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:30,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:30,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:30,916 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:30,916 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:30,916 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:30,916 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:30,917 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-10-27 06:11:30,917 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:30,917 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:30,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:30,917 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:30,917 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:30,926 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:30,926 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:30,930 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:30,930 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-10-27 06:11:30,931 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:30,931 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:30,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:30,933 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:30,934 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:30,934 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:30,934 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:30,935 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:30,935 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-10-27 06:11:30,935 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:30,935 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:30,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:30,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:30,936 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:30,936 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:30,936 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:30,937 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:30,937 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-10-27 06:11:30,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:30,937 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:30,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:30,938 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:30,938 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:30,938 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:30,938 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:30,939 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:30,947 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-10-27 06:11:30,948 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:30,948 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:30,948 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:30,948 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:30,948 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:30,948 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:30,949 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:30,950 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:11:30,956 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:11:30,956 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-10-27 06:11:30,957 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:11:30,958 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-10-27 06:11:30,958 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:11:30,958 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 15 Supporting invariants [] [2018-10-27 06:11:30,959 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-10-27 06:11:31,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:31,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:31,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:31,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:31,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:31,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:31,341 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-10-27 06:11:31,342 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 371 states and 638 transitions. cyclomatic complexity: 268 Second operand 4 states. [2018-10-27 06:11:31,444 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 371 states and 638 transitions. cyclomatic complexity: 268. Second operand 4 states. Result 563 states and 948 transitions. Complement of second has 6 states. [2018-10-27 06:11:31,444 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-10-27 06:11:31,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:11:31,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 503 transitions. [2018-10-27 06:11:31,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 503 transitions. Stem has 53 letters. Loop has 36 letters. [2018-10-27 06:11:31,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:31,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 503 transitions. Stem has 89 letters. Loop has 36 letters. [2018-10-27 06:11:31,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:31,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 503 transitions. Stem has 53 letters. Loop has 72 letters. [2018-10-27 06:11:31,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:31,451 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 563 states and 948 transitions. [2018-10-27 06:11:31,454 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:11:31,454 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 563 states to 0 states and 0 transitions. [2018-10-27 06:11:31,454 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-10-27 06:11:31,454 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-10-27 06:11:31,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-10-27 06:11:31,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:11:31,454 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:11:31,454 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:11:31,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 06:11:31,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 06:11:31,455 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 4 states. [2018-10-27 06:11:31,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:31,455 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-10-27 06:11:31,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-27 06:11:31,460 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-10-27 06:11:31,460 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:11:31,461 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-10-27 06:11:31,461 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-10-27 06:11:31,461 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-10-27 06:11:31,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-10-27 06:11:31,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:11:31,461 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:11:31,461 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:11:31,461 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:11:31,461 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-10-27 06:11:31,461 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:11:31,461 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:11:31,461 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-10-27 06:11:31,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:11:31 BoogieIcfgContainer [2018-10-27 06:11:31,466 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:11:31,466 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:11:31,467 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:11:31,467 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:11:31,467 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:11:26" (3/4) ... [2018-10-27 06:11:31,470 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-27 06:11:31,470 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:11:31,470 INFO L168 Benchmark]: Toolchain (without parser) took 7644.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 199.8 MB). Free memory was 949.0 MB in the beginning and 917.9 MB in the end (delta: 31.1 MB). Peak memory consumption was 230.8 MB. Max. memory is 11.5 GB. [2018-10-27 06:11:31,471 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 977.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:11:31,471 INFO L168 Benchmark]: CACSL2BoogieTranslator took 416.06 ms. Allocated memory is still 1.0 GB. Free memory was 949.0 MB in the beginning and 927.6 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-10-27 06:11:31,472 INFO L168 Benchmark]: Boogie Procedure Inliner took 118.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 927.6 MB in the beginning and 1.1 GB in the end (delta: -219.7 MB). Peak memory consumption was 22.0 MB. Max. memory is 11.5 GB. [2018-10-27 06:11:31,473 INFO L168 Benchmark]: Boogie Preprocessor took 39.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:11:31,473 INFO L168 Benchmark]: RCFGBuilder took 1949.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 95.8 MB). Peak memory consumption was 95.8 MB. Max. memory is 11.5 GB. [2018-10-27 06:11:31,473 INFO L168 Benchmark]: BuchiAutomizer took 5113.57 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 46.1 MB). Free memory was 1.0 GB in the beginning and 917.9 MB in the end (delta: 126.8 MB). Peak memory consumption was 173.0 MB. Max. memory is 11.5 GB. [2018-10-27 06:11:31,474 INFO L168 Benchmark]: Witness Printer took 3.25 ms. Allocated memory is still 1.2 GB. Free memory is still 917.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:11:31,476 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 977.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 416.06 ms. Allocated memory is still 1.0 GB. Free memory was 949.0 MB in the beginning and 927.6 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 118.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 927.6 MB in the beginning and 1.1 GB in the end (delta: -219.7 MB). Peak memory consumption was 22.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1949.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 95.8 MB). Peak memory consumption was 95.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5113.57 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 46.1 MB). Free memory was 1.0 GB in the beginning and 917.9 MB in the end (delta: 126.8 MB). Peak memory consumption was 173.0 MB. Max. memory is 11.5 GB. * Witness Printer took 3.25 ms. Allocated memory is still 1.2 GB. Free memory is still 917.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 15 and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.0s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 3.8s. Construction of modules took 0.4s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 371 states and ocurred in iteration 2. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1518 SDtfs, 623 SDslu, 2187 SDs, 0 SdLazy, 35 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI2 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital221 mio100 ax121 hnf104 lsp26 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq229 hnf85 smp100 dnf100 smp100 tf101 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms 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...