./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.4.ufo.BOUNDED-6.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.4.ufo.BOUNDED-6.pals_true-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 421c1ce510bb92ff52c2b6487f32b0bc37caaab2 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-02 00:09:32,514 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-02 00:09:32,516 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-02 00:09:32,532 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-02 00:09:32,532 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-02 00:09:32,533 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-02 00:09:32,534 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-02 00:09:32,536 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-02 00:09:32,538 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-02 00:09:32,538 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-02 00:09:32,539 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-02 00:09:32,540 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-02 00:09:32,540 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-02 00:09:32,541 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-02 00:09:32,543 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-02 00:09:32,544 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-02 00:09:32,544 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-02 00:09:32,546 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-02 00:09:32,548 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-02 00:09:32,550 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-02 00:09:32,551 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-02 00:09:32,552 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-02 00:09:32,555 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-02 00:09:32,555 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-02 00:09:32,555 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-02 00:09:32,556 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-02 00:09:32,562 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-02 00:09:32,563 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-02 00:09:32,564 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-02 00:09:32,565 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-02 00:09:32,565 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-02 00:09:32,568 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-02 00:09:32,568 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-02 00:09:32,569 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-02 00:09:32,570 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-02 00:09:32,570 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-02 00:09:32,571 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-02 00:09:32,595 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-02 00:09:32,595 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-02 00:09:32,596 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-02 00:09:32,596 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-02 00:09:32,598 INFO L133 SettingsManager]: * Use SBE=true [2019-01-02 00:09:32,598 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-02 00:09:32,598 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-02 00:09:32,598 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-02 00:09:32,598 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-02 00:09:32,599 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-02 00:09:32,599 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-02 00:09:32,599 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-02 00:09:32,599 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-02 00:09:32,599 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-02 00:09:32,599 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-02 00:09:32,600 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-02 00:09:32,600 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-02 00:09:32,600 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-02 00:09:32,600 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-02 00:09:32,600 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-02 00:09:32,601 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-02 00:09:32,604 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-02 00:09:32,604 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-02 00:09:32,604 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-02 00:09:32,604 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-02 00:09:32,605 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-02 00:09:32,605 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-02 00:09:32,605 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-02 00:09:32,605 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-02 00:09:32,605 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-02 00:09:32,605 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-02 00:09:32,606 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-02 00:09:32,607 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 421c1ce510bb92ff52c2b6487f32b0bc37caaab2 [2019-01-02 00:09:32,643 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-02 00:09:32,656 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-02 00:09:32,660 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-02 00:09:32,661 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-02 00:09:32,662 INFO L276 PluginConnector]: CDTParser initialized [2019-01-02 00:09:32,663 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.4.ufo.BOUNDED-6.pals_true-termination.c [2019-01-02 00:09:32,720 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f384fdc1e/20f2a761a0654fd58988e54c01d34b0b/FLAG7b4245f71 [2019-01-02 00:09:33,166 INFO L307 CDTParser]: Found 1 translation units. [2019-01-02 00:09:33,167 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.4.ufo.BOUNDED-6.pals_true-termination.c [2019-01-02 00:09:33,185 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f384fdc1e/20f2a761a0654fd58988e54c01d34b0b/FLAG7b4245f71 [2019-01-02 00:09:33,534 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f384fdc1e/20f2a761a0654fd58988e54c01d34b0b [2019-01-02 00:09:33,538 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-02 00:09:33,539 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-02 00:09:33,540 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-02 00:09:33,540 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-02 00:09:33,544 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-02 00:09:33,545 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:09:33" (1/1) ... [2019-01-02 00:09:33,549 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75d0e1d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:09:33, skipping insertion in model container [2019-01-02 00:09:33,549 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:09:33" (1/1) ... [2019-01-02 00:09:33,557 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-02 00:09:33,609 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-02 00:09:33,966 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:09:33,983 INFO L191 MainTranslator]: Completed pre-run [2019-01-02 00:09:34,095 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:09:34,116 INFO L195 MainTranslator]: Completed translation [2019-01-02 00:09:34,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:09:34 WrapperNode [2019-01-02 00:09:34,116 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-02 00:09:34,117 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-02 00:09:34,117 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-02 00:09:34,117 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-02 00:09:34,217 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:09:34" (1/1) ... [2019-01-02 00:09:34,229 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:09:34" (1/1) ... [2019-01-02 00:09:34,277 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-02 00:09:34,283 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-02 00:09:34,283 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-02 00:09:34,283 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-02 00:09:34,299 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:09:34" (1/1) ... [2019-01-02 00:09:34,299 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:09:34" (1/1) ... [2019-01-02 00:09:34,311 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:09:34" (1/1) ... [2019-01-02 00:09:34,313 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:09:34" (1/1) ... [2019-01-02 00:09:34,329 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:09:34" (1/1) ... [2019-01-02 00:09:34,346 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:09:34" (1/1) ... [2019-01-02 00:09:34,353 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:09:34" (1/1) ... [2019-01-02 00:09:34,361 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-02 00:09:34,364 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-02 00:09:34,364 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-02 00:09:34,364 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-02 00:09:34,365 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:09:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:09:34,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-02 00:09:34,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-02 00:09:35,717 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-02 00:09:35,717 INFO L280 CfgBuilder]: Removed 17 assue(true) statements. [2019-01-02 00:09:35,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:09:35 BoogieIcfgContainer [2019-01-02 00:09:35,718 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-02 00:09:35,719 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-02 00:09:35,719 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-02 00:09:35,723 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-02 00:09:35,724 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:09:35,724 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.01 12:09:33" (1/3) ... [2019-01-02 00:09:35,725 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@598668f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:09:35, skipping insertion in model container [2019-01-02 00:09:35,726 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:09:35,726 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:09:34" (2/3) ... [2019-01-02 00:09:35,727 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@598668f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:09:35, skipping insertion in model container [2019-01-02 00:09:35,727 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:09:35,728 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:09:35" (3/3) ... [2019-01-02 00:09:35,730 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_opt-floodmax.3_false-unreach-call.4.ufo.BOUNDED-6.pals_true-termination.c [2019-01-02 00:09:35,789 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-02 00:09:35,789 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-02 00:09:35,790 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-02 00:09:35,790 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-02 00:09:35,791 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-02 00:09:35,791 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-02 00:09:35,791 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-02 00:09:35,791 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-02 00:09:35,791 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-02 00:09:35,815 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 140 states. [2019-01-02 00:09:35,851 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2019-01-02 00:09:35,851 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:09:35,851 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:09:35,863 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:09:35,864 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:09:35,864 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-02 00:09:35,864 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 140 states. [2019-01-02 00:09:35,873 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2019-01-02 00:09:35,874 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:09:35,874 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:09:35,878 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:09:35,879 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:09:35,889 INFO L794 eck$LassoCheckResult]: Stem: 101#ULTIMATE.startENTRYtrue ~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~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]; 10#L-1true havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~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~ret36, main_#t~ret37, main_#t~post38, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet6;havoc main_#t~nondet6;~ep13~0 := main_#t~nondet7;havoc main_#t~nondet7;~ep21~0 := main_#t~nondet8;havoc main_#t~nondet8;~ep23~0 := main_#t~nondet9;havoc main_#t~nondet9;~ep31~0 := main_#t~nondet10;havoc main_#t~nondet10;~ep32~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~nl1~0 := main_#t~nondet15;havoc main_#t~nondet15;~m1~0 := main_#t~nondet16;havoc main_#t~nondet16;~max1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~0 := main_#t~nondet18;havoc main_#t~nondet18;~newmax1~0 := main_#t~nondet19;havoc main_#t~nondet19;~id2~0 := main_#t~nondet20;havoc main_#t~nondet20;~r2~0 := main_#t~nondet21;havoc main_#t~nondet21;~st2~0 := main_#t~nondet22;havoc main_#t~nondet22;~nl2~0 := main_#t~nondet23;havoc main_#t~nondet23;~m2~0 := main_#t~nondet24;havoc main_#t~nondet24;~max2~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode2~0 := main_#t~nondet26;havoc main_#t~nondet26;~newmax2~0 := main_#t~nondet27;havoc main_#t~nondet27;~id3~0 := main_#t~nondet28;havoc main_#t~nondet28;~r3~0 := main_#t~nondet29;havoc main_#t~nondet29;~st3~0 := main_#t~nondet30;havoc main_#t~nondet30;~nl3~0 := main_#t~nondet31;havoc main_#t~nondet31;~m3~0 := main_#t~nondet32;havoc main_#t~nondet32;~max3~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode3~0 := main_#t~nondet34;havoc main_#t~nondet34;~newmax3~0 := main_#t~nondet35;havoc main_#t~nondet35;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r211~0, init_~r231~0, init_~r311~0, init_~r321~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r212~0, init_~tmp___1~0, init_~r232~0, init_~tmp___2~0, init_~r312~0, init_~tmp___3~0, init_~r322~0, init_~tmp___4~0, init_~tmp___5~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r212~0;havoc init_~tmp___1~0;havoc init_~r232~0;havoc init_~tmp___2~0;havoc init_~r312~0;havoc init_~tmp___3~0;havoc init_~r322~0;havoc init_~tmp___4~0;havoc init_~tmp___5~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0; 49#L301true assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 33#L304-1true init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 88#L314true assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 62#L317-1true init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 121#L327true assume 0 != init_~r211~0 % 256;init_~tmp___1~0 := 1; 99#L330-1true init_~r212~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 11#L340true assume 0 != init_~r231~0 % 256;init_~tmp___2~0 := 1; 8#L343-1true init_~r232~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 58#L353true assume 0 != init_~r311~0 % 256;init_~tmp___3~0 := 1; 35#L356-1true init_~r312~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 92#L366true assume 0 != init_~r321~0 % 256;init_~tmp___4~0 := 1; 86#L369-1true init_~r322~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 140#L379true assume !(~id1~0 != ~id2~0);init_~tmp___5~0 := 0; 142#L379-1true init_#res := init_~tmp___5~0; 133#L500true main_#t~ret36 := init_#res;main_~i2~0 := main_#t~ret36;havoc main_#t~ret36;assume 0 != main_~i2~0;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0 := 0; 96#L611-2true [2019-01-02 00:09:35,893 INFO L796 eck$LassoCheckResult]: Loop: 96#L611-2true assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_#t~ite1, node1_~newmax~0;havoc node1_~newmax~0;node1_~newmax~0 := 0; 70#L124true assume !(0 != ~mode1~0 % 256); 64#L152true assume !(~r1~0 < 1); 63#L152-1true ~mode1~0 := 1; 67#L124-2true havoc node2_#t~ite2, node2_#t~ite3, node2_~newmax~1;havoc node2_~newmax~1;node2_~newmax~1 := 0; 3#L175true assume !(0 != ~mode2~0 % 256); 136#L203true assume !(~r2~0 < 2); 135#L203-1true ~mode2~0 := 1; 16#L175-2true havoc node3_#t~ite4, node3_#t~ite5, node3_~newmax~2;havoc node3_~newmax~2;node3_~newmax~2 := 0; 85#L226true assume !(0 != ~mode3~0 % 256); 43#L254true assume !(~r3~0 < 2); 42#L254-1true ~mode3~0 := 1; 76#L226-2true ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_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;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 15#L508true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 18#L508-1true check_#res := check_~tmp~1; 95#L556true main_#t~ret37 := check_#res;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 112#L641true assume !(0 == assert_~arg % 256); 83#L636true main_#t~post38 := main_~i2~0;main_~i2~0 := 1 + main_#t~post38;havoc main_#t~post38; 96#L611-2true [2019-01-02 00:09:35,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:09:35,901 INFO L82 PathProgramCache]: Analyzing trace with hash -2018293946, now seen corresponding path program 1 times [2019-01-02 00:09:35,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:09:35,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:09:35,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:35,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:09:35,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:36,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:09:36,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:09:36,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:09:36,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:09:36,276 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:09:36,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:09:36,276 INFO L82 PathProgramCache]: Analyzing trace with hash -752238638, now seen corresponding path program 1 times [2019-01-02 00:09:36,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:09:36,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:09:36,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:36,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:09:36,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:36,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:09:36,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:09:36,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:09:36,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-02 00:09:36,438 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-02 00:09:36,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-02 00:09:36,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-02 00:09:36,458 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 4 states. [2019-01-02 00:09:36,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:09:36,621 INFO L93 Difference]: Finished difference Result 142 states and 243 transitions. [2019-01-02 00:09:36,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-02 00:09:36,624 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 142 states and 243 transitions. [2019-01-02 00:09:36,630 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2019-01-02 00:09:36,637 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 142 states to 135 states and 207 transitions. [2019-01-02 00:09:36,641 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 135 [2019-01-02 00:09:36,642 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 135 [2019-01-02 00:09:36,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 135 states and 207 transitions. [2019-01-02 00:09:36,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:09:36,645 INFO L705 BuchiCegarLoop]: Abstraction has 135 states and 207 transitions. [2019-01-02 00:09:36,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states and 207 transitions. [2019-01-02 00:09:36,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2019-01-02 00:09:36,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-01-02 00:09:36,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 207 transitions. [2019-01-02 00:09:36,685 INFO L728 BuchiCegarLoop]: Abstraction has 135 states and 207 transitions. [2019-01-02 00:09:36,685 INFO L608 BuchiCegarLoop]: Abstraction has 135 states and 207 transitions. [2019-01-02 00:09:36,686 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-02 00:09:36,686 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 135 states and 207 transitions. [2019-01-02 00:09:36,689 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2019-01-02 00:09:36,689 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:09:36,689 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:09:36,692 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] [2019-01-02 00:09:36,692 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:09:36,693 INFO L794 eck$LassoCheckResult]: Stem: 420#ULTIMATE.startENTRY ~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~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]; 314#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~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~ret36, main_#t~ret37, main_#t~post38, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet6;havoc main_#t~nondet6;~ep13~0 := main_#t~nondet7;havoc main_#t~nondet7;~ep21~0 := main_#t~nondet8;havoc main_#t~nondet8;~ep23~0 := main_#t~nondet9;havoc main_#t~nondet9;~ep31~0 := main_#t~nondet10;havoc main_#t~nondet10;~ep32~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~nl1~0 := main_#t~nondet15;havoc main_#t~nondet15;~m1~0 := main_#t~nondet16;havoc main_#t~nondet16;~max1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~0 := main_#t~nondet18;havoc main_#t~nondet18;~newmax1~0 := main_#t~nondet19;havoc main_#t~nondet19;~id2~0 := main_#t~nondet20;havoc main_#t~nondet20;~r2~0 := main_#t~nondet21;havoc main_#t~nondet21;~st2~0 := main_#t~nondet22;havoc main_#t~nondet22;~nl2~0 := main_#t~nondet23;havoc main_#t~nondet23;~m2~0 := main_#t~nondet24;havoc main_#t~nondet24;~max2~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode2~0 := main_#t~nondet26;havoc main_#t~nondet26;~newmax2~0 := main_#t~nondet27;havoc main_#t~nondet27;~id3~0 := main_#t~nondet28;havoc main_#t~nondet28;~r3~0 := main_#t~nondet29;havoc main_#t~nondet29;~st3~0 := main_#t~nondet30;havoc main_#t~nondet30;~nl3~0 := main_#t~nondet31;havoc main_#t~nondet31;~m3~0 := main_#t~nondet32;havoc main_#t~nondet32;~max3~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode3~0 := main_#t~nondet34;havoc main_#t~nondet34;~newmax3~0 := main_#t~nondet35;havoc main_#t~nondet35;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r211~0, init_~r231~0, init_~r311~0, init_~r321~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r212~0, init_~tmp___1~0, init_~r232~0, init_~tmp___2~0, init_~r312~0, init_~tmp___3~0, init_~r322~0, init_~tmp___4~0, init_~tmp___5~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r212~0;havoc init_~tmp___1~0;havoc init_~r232~0;havoc init_~tmp___2~0;havoc init_~r312~0;havoc init_~tmp___3~0;havoc init_~r322~0;havoc init_~tmp___4~0;havoc init_~tmp___5~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0; 315#L301 assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 356#L304-1 init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 358#L314 assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 318#L317-1 init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 396#L327 assume 0 != init_~r211~0 % 256;init_~tmp___1~0 := 1; 393#L330-1 init_~r212~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 316#L340 assume 0 != init_~r231~0 % 256;init_~tmp___2~0 := 1; 306#L343-1 init_~r232~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 307#L353 assume 0 != init_~r311~0 % 256;init_~tmp___3~0 := 1; 361#L356-1 init_~r312~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 362#L366 assume 0 != init_~r321~0 % 256;init_~tmp___4~0 := 1; 349#L369-1 init_~r322~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 414#L379 assume ~id1~0 != ~id2~0; 411#L380 assume ~id1~0 != ~id3~0; 345#L381 assume ~id2~0 != ~id3~0; 346#L382 assume ~id1~0 >= 0; 404#L383 assume ~id2~0 >= 0; 337#L384 assume ~id3~0 >= 0; 338#L385 assume 0 == ~r1~0; 391#L386 assume 0 == ~r2~0; 302#L387 assume 0 == ~r3~0; 303#L388 assume 0 != init_~r122~0 % 256; 384#L389 assume 0 != init_~r132~0 % 256; 385#L390 assume 0 != init_~r212~0 % 256; 407#L391 assume 0 != init_~r232~0 % 256; 343#L392 assume 0 != init_~r312~0 % 256; 344#L393 assume 0 != init_~r322~0 % 256; 403#L394 assume ~max1~0 == ~id1~0; 335#L395 assume ~max2~0 == ~id2~0; 336#L396 assume ~max3~0 == ~id3~0; 390#L397 assume 0 == ~st1~0; 300#L398 assume 0 == ~st2~0; 301#L399 assume 0 == ~st3~0; 382#L400 assume 0 == ~nl1~0; 383#L401 assume 0 == ~nl2~0; 406#L402 assume 0 == ~nl3~0; 341#L403 assume 0 == ~mode1~0 % 256; 342#L404 assume 0 == ~mode2~0 % 256; 402#L405 assume 0 == ~mode3~0 % 256; 333#L406 assume 0 != ~newmax1~0 % 256; 334#L407 assume 0 != ~newmax2~0 % 256; 386#L408 assume 0 != ~newmax3~0 % 256;init_~tmp___5~0 := 1; 387#L379-1 init_#res := init_~tmp___5~0; 431#L500 main_#t~ret36 := init_#res;main_~i2~0 := main_#t~ret36;havoc main_#t~ret36;assume 0 != main_~i2~0;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0 := 0; 410#L611-2 [2019-01-02 00:09:36,693 INFO L796 eck$LassoCheckResult]: Loop: 410#L611-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_#t~ite1, node1_~newmax~0;havoc node1_~newmax~0;node1_~newmax~0 := 0; 400#L124 assume !(0 != ~mode1~0 % 256); 398#L152 assume !(~r1~0 < 1); 326#L152-1 ~mode1~0 := 1; 397#L124-2 havoc node2_#t~ite2, node2_#t~ite3, node2_~newmax~1;havoc node2_~newmax~1;node2_~newmax~1 := 0; 297#L175 assume !(0 != ~mode2~0 % 256); 298#L203 assume !(~r2~0 < 2); 371#L203-1 ~mode2~0 := 1; 322#L175-2 havoc node3_#t~ite4, node3_#t~ite5, node3_~newmax~2;havoc node3_~newmax~2;node3_~newmax~2 := 0; 323#L226 assume !(0 != ~mode3~0 % 256); 374#L254 assume !(~r3~0 < 2); 372#L254-1 ~mode3~0 := 1; 373#L226-2 ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_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;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 320#L508 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 310#L508-1 check_#res := check_~tmp~1; 324#L556 main_#t~ret37 := check_#res;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 418#L641 assume !(0 == assert_~arg % 256); 409#L636 main_#t~post38 := main_~i2~0;main_~i2~0 := 1 + main_#t~post38;havoc main_#t~post38; 410#L611-2 [2019-01-02 00:09:36,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:09:36,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1207151116, now seen corresponding path program 1 times [2019-01-02 00:09:36,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:09:36,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:09:36,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:36,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:09:36,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:36,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:09:36,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:09:36,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:09:36,886 INFO L82 PathProgramCache]: Analyzing trace with hash -752238638, now seen corresponding path program 2 times [2019-01-02 00:09:36,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:09:36,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:09:36,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:36,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:09:36,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:36,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:09:37,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:09:37,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:09:37,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-02 00:09:37,183 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-02 00:09:37,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-02 00:09:37,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-02 00:09:37,184 INFO L87 Difference]: Start difference. First operand 135 states and 207 transitions. cyclomatic complexity: 73 Second operand 5 states. [2019-01-02 00:09:37,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:09:37,432 INFO L93 Difference]: Finished difference Result 138 states and 209 transitions. [2019-01-02 00:09:37,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-02 00:09:37,435 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 138 states and 209 transitions. [2019-01-02 00:09:37,444 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2019-01-02 00:09:37,448 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 138 states to 135 states and 199 transitions. [2019-01-02 00:09:37,452 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 135 [2019-01-02 00:09:37,452 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 135 [2019-01-02 00:09:37,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 135 states and 199 transitions. [2019-01-02 00:09:37,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:09:37,454 INFO L705 BuchiCegarLoop]: Abstraction has 135 states and 199 transitions. [2019-01-02 00:09:37,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states and 199 transitions. [2019-01-02 00:09:37,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2019-01-02 00:09:37,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-01-02 00:09:37,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 199 transitions. [2019-01-02 00:09:37,472 INFO L728 BuchiCegarLoop]: Abstraction has 135 states and 199 transitions. [2019-01-02 00:09:37,473 INFO L608 BuchiCegarLoop]: Abstraction has 135 states and 199 transitions. [2019-01-02 00:09:37,473 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-02 00:09:37,473 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 135 states and 199 transitions. [2019-01-02 00:09:37,476 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2019-01-02 00:09:37,476 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:09:37,476 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:09:37,479 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] [2019-01-02 00:09:37,479 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] [2019-01-02 00:09:37,479 INFO L794 eck$LassoCheckResult]: Stem: 705#ULTIMATE.startENTRY ~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~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]; 598#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~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~ret36, main_#t~ret37, main_#t~post38, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet6;havoc main_#t~nondet6;~ep13~0 := main_#t~nondet7;havoc main_#t~nondet7;~ep21~0 := main_#t~nondet8;havoc main_#t~nondet8;~ep23~0 := main_#t~nondet9;havoc main_#t~nondet9;~ep31~0 := main_#t~nondet10;havoc main_#t~nondet10;~ep32~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~nl1~0 := main_#t~nondet15;havoc main_#t~nondet15;~m1~0 := main_#t~nondet16;havoc main_#t~nondet16;~max1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~0 := main_#t~nondet18;havoc main_#t~nondet18;~newmax1~0 := main_#t~nondet19;havoc main_#t~nondet19;~id2~0 := main_#t~nondet20;havoc main_#t~nondet20;~r2~0 := main_#t~nondet21;havoc main_#t~nondet21;~st2~0 := main_#t~nondet22;havoc main_#t~nondet22;~nl2~0 := main_#t~nondet23;havoc main_#t~nondet23;~m2~0 := main_#t~nondet24;havoc main_#t~nondet24;~max2~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode2~0 := main_#t~nondet26;havoc main_#t~nondet26;~newmax2~0 := main_#t~nondet27;havoc main_#t~nondet27;~id3~0 := main_#t~nondet28;havoc main_#t~nondet28;~r3~0 := main_#t~nondet29;havoc main_#t~nondet29;~st3~0 := main_#t~nondet30;havoc main_#t~nondet30;~nl3~0 := main_#t~nondet31;havoc main_#t~nondet31;~m3~0 := main_#t~nondet32;havoc main_#t~nondet32;~max3~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode3~0 := main_#t~nondet34;havoc main_#t~nondet34;~newmax3~0 := main_#t~nondet35;havoc main_#t~nondet35;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r211~0, init_~r231~0, init_~r311~0, init_~r321~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r212~0, init_~tmp___1~0, init_~r232~0, init_~tmp___2~0, init_~r312~0, init_~tmp___3~0, init_~r322~0, init_~tmp___4~0, init_~tmp___5~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r212~0;havoc init_~tmp___1~0;havoc init_~r232~0;havoc init_~tmp___2~0;havoc init_~r312~0;havoc init_~tmp___3~0;havoc init_~r322~0;havoc init_~tmp___4~0;havoc init_~tmp___5~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0; 599#L301 assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 641#L304-1 init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 643#L314 assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 602#L317-1 init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 681#L327 assume 0 != init_~r211~0 % 256;init_~tmp___1~0 := 1; 678#L330-1 init_~r212~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 600#L340 assume 0 != init_~r231~0 % 256;init_~tmp___2~0 := 1; 591#L343-1 init_~r232~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 592#L353 assume 0 != init_~r311~0 % 256;init_~tmp___3~0 := 1; 646#L356-1 init_~r312~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 651#L366 assume 0 != init_~r321~0 % 256;init_~tmp___4~0 := 1; 634#L369-1 init_~r322~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 699#L379 assume ~id1~0 != ~id2~0; 696#L380 assume ~id1~0 != ~id3~0; 630#L381 assume ~id2~0 != ~id3~0; 631#L382 assume ~id1~0 >= 0; 689#L383 assume ~id2~0 >= 0; 622#L384 assume ~id3~0 >= 0; 623#L385 assume 0 == ~r1~0; 676#L386 assume 0 == ~r2~0; 587#L387 assume 0 == ~r3~0; 588#L388 assume 0 != init_~r122~0 % 256; 669#L389 assume 0 != init_~r132~0 % 256; 670#L390 assume 0 != init_~r212~0 % 256; 693#L391 assume 0 != init_~r232~0 % 256; 628#L392 assume 0 != init_~r312~0 % 256; 629#L393 assume 0 != init_~r322~0 % 256; 688#L394 assume ~max1~0 == ~id1~0; 620#L395 assume ~max2~0 == ~id2~0; 621#L396 assume ~max3~0 == ~id3~0; 675#L397 assume 0 == ~st1~0; 585#L398 assume 0 == ~st2~0; 586#L399 assume 0 == ~st3~0; 667#L400 assume 0 == ~nl1~0; 668#L401 assume 0 == ~nl2~0; 691#L402 assume 0 == ~nl3~0; 626#L403 assume 0 == ~mode1~0 % 256; 627#L404 assume 0 == ~mode2~0 % 256; 687#L405 assume 0 == ~mode3~0 % 256; 618#L406 assume 0 != ~newmax1~0 % 256; 619#L407 assume 0 != ~newmax2~0 % 256; 671#L408 assume 0 != ~newmax3~0 % 256;init_~tmp___5~0 := 1; 672#L379-1 init_#res := init_~tmp___5~0; 716#L500 main_#t~ret36 := init_#res;main_~i2~0 := main_#t~ret36;havoc main_#t~ret36;assume 0 != main_~i2~0;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0 := 0; 695#L611-2 [2019-01-02 00:09:37,480 INFO L796 eck$LassoCheckResult]: Loop: 695#L611-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_#t~ite1, node1_~newmax~0;havoc node1_~newmax~0;node1_~newmax~0 := 0; 685#L124 assume !(0 != ~mode1~0 % 256); 683#L152 assume !(~r1~0 < 1); 611#L152-1 ~mode1~0 := 1; 682#L124-2 havoc node2_#t~ite2, node2_#t~ite3, node2_~newmax~1;havoc node2_~newmax~1;node2_~newmax~1 := 0; 582#L175 assume !(0 != ~mode2~0 % 256); 583#L203 assume !(~r2~0 < 2); 656#L203-1 ~mode2~0 := 1; 607#L175-2 havoc node3_#t~ite4, node3_#t~ite5, node3_~newmax~2;havoc node3_~newmax~2;node3_~newmax~2 := 0; 608#L226 assume !(0 != ~mode3~0 % 256); 659#L254 assume !(~r3~0 < 2); 657#L254-1 ~mode3~0 := 1; 658#L226-2 ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_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;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 605#L508 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 606#L509 assume ~st1~0 + ~nl1~0 <= 1; 663#L510 assume ~st2~0 + ~nl2~0 <= 1; 593#L511 assume ~st3~0 + ~nl3~0 <= 1; 594#L512 assume ~r1~0 >= 2; 615#L516 assume ~r1~0 < 2; 616#L521 assume ~r1~0 >= 2; 661#L526 assume ~r1~0 < 2;check_~tmp~1 := 1; 604#L508-1 check_#res := check_~tmp~1; 609#L556 main_#t~ret37 := check_#res;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 703#L641 assume !(0 == assert_~arg % 256); 694#L636 main_#t~post38 := main_~i2~0;main_~i2~0 := 1 + main_#t~post38;havoc main_#t~post38; 695#L611-2 [2019-01-02 00:09:37,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:09:37,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1207151116, now seen corresponding path program 2 times [2019-01-02 00:09:37,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:09:37,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:09:37,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:37,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:09:37,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:37,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:09:37,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:09:37,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:09:37,571 INFO L82 PathProgramCache]: Analyzing trace with hash 803863027, now seen corresponding path program 1 times [2019-01-02 00:09:37,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:09:37,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:09:37,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:37,574 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:09:37,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:37,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:09:37,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:09:37,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:09:37,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:09:37,617 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-02 00:09:37,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-02 00:09:37,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-02 00:09:37,618 INFO L87 Difference]: Start difference. First operand 135 states and 199 transitions. cyclomatic complexity: 65 Second operand 3 states. [2019-01-02 00:09:37,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:09:37,716 INFO L93 Difference]: Finished difference Result 193 states and 286 transitions. [2019-01-02 00:09:37,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-02 00:09:37,717 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 193 states and 286 transitions. [2019-01-02 00:09:37,720 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 135 [2019-01-02 00:09:37,722 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 193 states to 193 states and 286 transitions. [2019-01-02 00:09:37,722 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 193 [2019-01-02 00:09:37,723 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 193 [2019-01-02 00:09:37,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 193 states and 286 transitions. [2019-01-02 00:09:37,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:09:37,725 INFO L705 BuchiCegarLoop]: Abstraction has 193 states and 286 transitions. [2019-01-02 00:09:37,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states and 286 transitions. [2019-01-02 00:09:37,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2019-01-02 00:09:37,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-01-02 00:09:37,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 286 transitions. [2019-01-02 00:09:37,737 INFO L728 BuchiCegarLoop]: Abstraction has 193 states and 286 transitions. [2019-01-02 00:09:37,737 INFO L608 BuchiCegarLoop]: Abstraction has 193 states and 286 transitions. [2019-01-02 00:09:37,738 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-02 00:09:37,738 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 193 states and 286 transitions. [2019-01-02 00:09:37,740 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 135 [2019-01-02 00:09:37,740 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:09:37,740 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:09:37,742 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] [2019-01-02 00:09:37,742 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] [2019-01-02 00:09:37,743 INFO L794 eck$LassoCheckResult]: Stem: 1044#ULTIMATE.startENTRY ~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~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]; 929#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~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~ret36, main_#t~ret37, main_#t~post38, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet6;havoc main_#t~nondet6;~ep13~0 := main_#t~nondet7;havoc main_#t~nondet7;~ep21~0 := main_#t~nondet8;havoc main_#t~nondet8;~ep23~0 := main_#t~nondet9;havoc main_#t~nondet9;~ep31~0 := main_#t~nondet10;havoc main_#t~nondet10;~ep32~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~nl1~0 := main_#t~nondet15;havoc main_#t~nondet15;~m1~0 := main_#t~nondet16;havoc main_#t~nondet16;~max1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~0 := main_#t~nondet18;havoc main_#t~nondet18;~newmax1~0 := main_#t~nondet19;havoc main_#t~nondet19;~id2~0 := main_#t~nondet20;havoc main_#t~nondet20;~r2~0 := main_#t~nondet21;havoc main_#t~nondet21;~st2~0 := main_#t~nondet22;havoc main_#t~nondet22;~nl2~0 := main_#t~nondet23;havoc main_#t~nondet23;~m2~0 := main_#t~nondet24;havoc main_#t~nondet24;~max2~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode2~0 := main_#t~nondet26;havoc main_#t~nondet26;~newmax2~0 := main_#t~nondet27;havoc main_#t~nondet27;~id3~0 := main_#t~nondet28;havoc main_#t~nondet28;~r3~0 := main_#t~nondet29;havoc main_#t~nondet29;~st3~0 := main_#t~nondet30;havoc main_#t~nondet30;~nl3~0 := main_#t~nondet31;havoc main_#t~nondet31;~m3~0 := main_#t~nondet32;havoc main_#t~nondet32;~max3~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode3~0 := main_#t~nondet34;havoc main_#t~nondet34;~newmax3~0 := main_#t~nondet35;havoc main_#t~nondet35;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r211~0, init_~r231~0, init_~r311~0, init_~r321~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r212~0, init_~tmp___1~0, init_~r232~0, init_~tmp___2~0, init_~r312~0, init_~tmp___3~0, init_~r322~0, init_~tmp___4~0, init_~tmp___5~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r212~0;havoc init_~tmp___1~0;havoc init_~r232~0;havoc init_~tmp___2~0;havoc init_~r312~0;havoc init_~tmp___3~0;havoc init_~r322~0;havoc init_~tmp___4~0;havoc init_~tmp___5~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0; 930#L301 assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 975#L304-1 init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 977#L314 assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 936#L317-1 init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 1015#L327 assume 0 != init_~r211~0 % 256;init_~tmp___1~0 := 1; 1012#L330-1 init_~r212~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 931#L340 assume 0 != init_~r231~0 % 256;init_~tmp___2~0 := 1; 925#L343-1 init_~r232~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 926#L353 assume 0 != init_~r311~0 % 256;init_~tmp___3~0 := 1; 980#L356-1 init_~r312~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 981#L366 assume 0 != init_~r321~0 % 256;init_~tmp___4~0 := 1; 967#L369-1 init_~r322~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 1035#L379 assume ~id1~0 != ~id2~0; 1030#L380 assume ~id1~0 != ~id3~0; 964#L381 assume ~id2~0 != ~id3~0; 965#L382 assume ~id1~0 >= 0; 1025#L383 assume ~id2~0 >= 0; 956#L384 assume ~id3~0 >= 0; 957#L385 assume 0 == ~r1~0; 1010#L386 assume 0 == ~r2~0; 921#L387 assume 0 == ~r3~0; 922#L388 assume 0 != init_~r122~0 % 256; 1003#L389 assume 0 != init_~r132~0 % 256; 1004#L390 assume 0 != init_~r212~0 % 256; 1028#L391 assume 0 != init_~r232~0 % 256; 962#L392 assume 0 != init_~r312~0 % 256; 963#L393 assume 0 != init_~r322~0 % 256; 1024#L394 assume ~max1~0 == ~id1~0; 954#L395 assume ~max2~0 == ~id2~0; 955#L396 assume ~max3~0 == ~id3~0; 1007#L397 assume 0 == ~st1~0; 919#L398 assume 0 == ~st2~0; 920#L399 assume 0 == ~st3~0; 1001#L400 assume 0 == ~nl1~0; 1002#L401 assume 0 == ~nl2~0; 1027#L402 assume 0 == ~nl3~0; 960#L403 assume 0 == ~mode1~0 % 256; 961#L404 assume 0 == ~mode2~0 % 256; 1023#L405 assume 0 == ~mode3~0 % 256; 952#L406 assume 0 != ~newmax1~0 % 256; 953#L407 assume 0 != ~newmax2~0 % 256; 1005#L408 assume 0 != ~newmax3~0 % 256;init_~tmp___5~0 := 1; 1006#L379-1 init_#res := init_~tmp___5~0; 1059#L500 main_#t~ret36 := init_#res;main_~i2~0 := main_#t~ret36;havoc main_#t~ret36;assume 0 != main_~i2~0;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0 := 0; 1041#L611-2 [2019-01-02 00:09:37,743 INFO L796 eck$LassoCheckResult]: Loop: 1041#L611-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_#t~ite1, node1_~newmax~0;havoc node1_~newmax~0;node1_~newmax~0 := 0; 1042#L124 assume !(0 != ~mode1~0 % 256); 1060#L152 assume !(~r1~0 < 1); 944#L152-1 ~mode1~0 := 1; 1016#L124-2 havoc node2_#t~ite2, node2_#t~ite3, node2_~newmax~1;havoc node2_~newmax~1;node2_~newmax~1 := 0; 916#L175 assume !(0 != ~mode2~0 % 256); 917#L203 assume !(~r2~0 < 2); 990#L203-1 ~mode2~0 := 1; 941#L175-2 havoc node3_#t~ite4, node3_#t~ite5, node3_~newmax~2;havoc node3_~newmax~2;node3_~newmax~2 := 0; 942#L226 assume !(0 != ~mode3~0 % 256); 993#L254 assume !(~r3~0 < 2); 991#L254-1 ~mode3~0 := 1; 992#L226-2 ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_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;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 939#L508 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 940#L509 assume ~st1~0 + ~nl1~0 <= 1; 1063#L510 assume ~st2~0 + ~nl2~0 <= 1; 1062#L511 assume ~st3~0 + ~nl3~0 <= 1; 1061#L512 assume !(~r1~0 >= 2); 1019#L515 assume 0 == ~st1~0 + ~st2~0 + ~st3~0; 1020#L516 assume ~r1~0 < 2; 1107#L521 assume !(~r1~0 >= 2); 1056#L525 assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; 1057#L526 assume ~r1~0 < 2;check_~tmp~1 := 1; 946#L508-1 check_#res := check_~tmp~1; 947#L556 main_#t~ret37 := check_#res;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 1040#L641 assume !(0 == assert_~arg % 256); 1106#L636 main_#t~post38 := main_~i2~0;main_~i2~0 := 1 + main_#t~post38;havoc main_#t~post38; 1041#L611-2 [2019-01-02 00:09:37,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:09:37,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1207151116, now seen corresponding path program 3 times [2019-01-02 00:09:37,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:09:37,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:09:37,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:37,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:09:37,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:37,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:09:37,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:09:37,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:09:37,854 INFO L82 PathProgramCache]: Analyzing trace with hash 533897331, now seen corresponding path program 1 times [2019-01-02 00:09:37,854 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:09:37,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:09:37,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:37,856 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:09:37,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:37,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:09:37,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:09:37,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:09:37,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1612707960, now seen corresponding path program 1 times [2019-01-02 00:09:37,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:09:37,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:09:37,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:37,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:09:37,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:37,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:09:38,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:09:38,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:09:38,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:09:38,597 WARN L181 SmtUtils]: Spent 549.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 102 [2019-01-02 00:09:38,807 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-01-02 00:09:38,827 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:09:38,828 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:09:38,828 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:09:38,828 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:09:38,828 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-02 00:09:38,828 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:09:38,829 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:09:38,829 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:09:38,829 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_opt-floodmax.3_false-unreach-call.4.ufo.BOUNDED-6.pals_true-termination.c_Iteration4_Loop [2019-01-02 00:09:38,829 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:09:38,829 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:09:38,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:38,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:38,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:38,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:38,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:38,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:38,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:38,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:38,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:38,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:38,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:38,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:38,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:38,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:38,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:39,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:39,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:39,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:39,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:39,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:39,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:39,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:39,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:39,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:39,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:39,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:39,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:39,696 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:09:39,697 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:09:39,706 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:09:39,707 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:09:39,768 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-02 00:09:39,768 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:09:39,884 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-02 00:09:39,886 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:09:39,887 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:09:39,887 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:09:39,887 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:09:39,887 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:09:39,887 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:09:39,887 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:09:39,887 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:09:39,887 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_opt-floodmax.3_false-unreach-call.4.ufo.BOUNDED-6.pals_true-termination.c_Iteration4_Loop [2019-01-02 00:09:39,888 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:09:39,888 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:09:39,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:39,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:39,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:39,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:39,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:39,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:39,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:39,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:39,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:39,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:39,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:39,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:39,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:39,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:39,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:39,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:39,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:40,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:40,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:40,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:40,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:40,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:40,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:40,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:40,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:40,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:40,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:40,314 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2019-01-02 00:09:40,820 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-02 00:09:41,239 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-02 00:09:41,316 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:09:41,322 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:09:41,324 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 [2019-01-02 00:09:41,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:41,327 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:41,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:41,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:41,329 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:41,332 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:41,332 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:41,335 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:41,336 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 [2019-01-02 00:09:41,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:41,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:41,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:41,337 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:41,339 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:09:41,339 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:09:41,341 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:41,342 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 [2019-01-02 00:09:41,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:41,342 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:41,343 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:41,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:41,343 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:41,344 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:41,344 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:41,345 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:41,346 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 [2019-01-02 00:09:41,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:41,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:41,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:41,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:41,348 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:09:41,348 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:09:41,351 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:41,351 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 [2019-01-02 00:09:41,351 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:41,352 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:41,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:41,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:41,352 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:41,353 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:41,353 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:41,355 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:41,355 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 [2019-01-02 00:09:41,355 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:41,356 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:41,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:41,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:41,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:41,356 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:41,357 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:41,357 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:41,358 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 [2019-01-02 00:09:41,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:41,358 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:41,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:41,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:41,358 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:41,359 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:41,359 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:41,360 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:41,360 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 [2019-01-02 00:09:41,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:41,361 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:41,361 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:41,361 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:41,361 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:41,361 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:41,362 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:41,362 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:41,363 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 [2019-01-02 00:09:41,363 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:41,363 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:41,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:41,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:41,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:41,364 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:41,364 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:41,365 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:41,365 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 [2019-01-02 00:09:41,365 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:41,365 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:41,365 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:41,366 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:41,366 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:41,366 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:41,366 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:41,367 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:41,367 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 [2019-01-02 00:09:41,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:41,368 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:41,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:41,368 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:41,368 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:41,368 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:41,369 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:41,369 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:41,370 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 [2019-01-02 00:09:41,370 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:41,370 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:41,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:41,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:41,370 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:41,371 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:41,371 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:41,372 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:41,372 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 [2019-01-02 00:09:41,372 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:41,373 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:41,373 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:41,373 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:41,375 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:09:41,375 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:09:41,377 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:41,378 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 [2019-01-02 00:09:41,378 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:41,378 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:41,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:41,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:41,379 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:41,382 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:41,382 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:41,384 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:41,385 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 [2019-01-02 00:09:41,385 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:41,385 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:41,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:41,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:41,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:41,386 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:41,386 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:41,391 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:09:41,396 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-02 00:09:41,400 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-02 00:09:41,403 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:09:41,403 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-02 00:09:41,403 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:09:41,404 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 11 Supporting invariants [] [2019-01-02 00:09:41,405 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-02 00:09:41,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:09:41,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:09:41,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:09:41,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:09:41,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:09:41,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:09:41,656 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 [2019-01-02 00:09:41,657 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 193 states and 286 transitions. cyclomatic complexity: 94 Second operand 3 states. [2019-01-02 00:09:41,761 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 193 states and 286 transitions. cyclomatic complexity: 94. Second operand 3 states. Result 327 states and 496 transitions. Complement of second has 4 states. [2019-01-02 00:09:41,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-02 00:09:41,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-02 00:09:41,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 199 transitions. [2019-01-02 00:09:41,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 199 transitions. Stem has 46 letters. Loop has 27 letters. [2019-01-02 00:09:41,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:09:41,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 199 transitions. Stem has 73 letters. Loop has 27 letters. [2019-01-02 00:09:41,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:09:41,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 199 transitions. Stem has 46 letters. Loop has 54 letters. [2019-01-02 00:09:41,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:09:41,769 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 327 states and 496 transitions. [2019-01-02 00:09:41,773 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:09:41,774 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 327 states to 0 states and 0 transitions. [2019-01-02 00:09:41,774 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-02 00:09:41,774 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-02 00:09:41,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-02 00:09:41,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:09:41,774 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:09:41,774 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:09:41,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-02 00:09:41,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-02 00:09:41,775 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2019-01-02 00:09:41,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:09:41,775 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-02 00:09:41,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-02 00:09:41,776 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-02 00:09:41,776 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:09:41,776 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-02 00:09:41,776 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-02 00:09:41,776 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-02 00:09:41,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-02 00:09:41,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:09:41,776 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:09:41,776 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:09:41,776 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:09:41,777 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-02 00:09:41,777 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-02 00:09:41,777 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:09:41,777 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-02 00:09:41,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.01 12:09:41 BoogieIcfgContainer [2019-01-02 00:09:41,784 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-02 00:09:41,785 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-02 00:09:41,785 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-02 00:09:41,785 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-02 00:09:41,785 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:09:35" (3/4) ... [2019-01-02 00:09:41,789 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-02 00:09:41,789 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-02 00:09:41,790 INFO L168 Benchmark]: Toolchain (without parser) took 8251.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 212.9 MB). Free memory was 952.7 MB in the beginning and 1.0 GB in the end (delta: -54.4 MB). Peak memory consumption was 158.5 MB. Max. memory is 11.5 GB. [2019-01-02 00:09:41,791 INFO L168 Benchmark]: CDTParser took 0.41 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:09:41,792 INFO L168 Benchmark]: CACSL2BoogieTranslator took 576.63 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 931.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-01-02 00:09:41,793 INFO L168 Benchmark]: Boogie Procedure Inliner took 165.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -195.1 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2019-01-02 00:09:41,794 INFO L168 Benchmark]: Boogie Preprocessor took 80.49 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:09:41,794 INFO L168 Benchmark]: RCFGBuilder took 1354.43 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: 58.9 MB). Peak memory consumption was 58.9 MB. Max. memory is 11.5 GB. [2019-01-02 00:09:41,795 INFO L168 Benchmark]: BuchiAutomizer took 6065.29 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 75.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.3 MB). Peak memory consumption was 135.3 MB. Max. memory is 11.5 GB. [2019-01-02 00:09:41,796 INFO L168 Benchmark]: Witness Printer took 4.58 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:09:41,805 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.41 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 576.63 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 931.2 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 165.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -195.1 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 80.49 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1354.43 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: 58.9 MB). Peak memory consumption was 58.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6065.29 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 75.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.3 MB). Peak memory consumption was 135.3 MB. Max. memory is 11.5 GB. * Witness Printer took 4.58 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 11 and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.0s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 4.8s. Construction of modules took 0.3s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 193 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 917 SDtfs, 410 SDslu, 1351 SDs, 0 SdLazy, 40 SolverSat, 46 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital142 mio100 ax125 hnf104 lsp20 ukn100 mio100 lsp100 div128 bol100 ite100 ukn100 eq175 hnf86 smp100 dnf100 smp100 tf102 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms 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...