./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/seq-mthreaded/pals_opt-floodmax.4_false-unreach-call.1.ufo.BOUNDED-8.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f 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.4_false-unreach-call.1.ufo.BOUNDED-8.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 73fdf555f3f5e47d818d7f4214b9add97d75e1b5 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 04:48:21,824 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:48:21,826 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:48:21,837 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:48:21,837 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:48:21,838 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:48:21,839 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:48:21,841 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:48:21,843 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:48:21,843 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:48:21,844 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:48:21,845 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:48:21,845 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:48:21,846 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:48:21,847 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:48:21,848 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:48:21,849 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:48:21,851 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:48:21,852 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:48:21,854 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:48:21,855 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:48:21,856 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:48:21,858 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:48:21,859 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:48:21,859 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:48:21,860 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:48:21,861 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:48:21,861 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:48:21,862 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:48:21,863 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:48:21,863 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:48:21,864 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:48:21,864 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:48:21,864 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:48:21,865 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:48:21,866 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:48:21,866 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 04:48:21,882 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:48:21,882 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:48:21,883 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:48:21,884 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:48:21,884 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:48:21,884 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:48:21,884 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:48:21,884 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:48:21,884 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:48:21,885 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:48:21,885 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:48:21,885 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:48:21,886 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:48:21,886 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:48:21,886 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:48:21,886 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:48:21,887 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:48:21,887 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:48:21,887 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:48:21,887 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:48:21,887 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:48:21,887 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:48:21,888 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:48:21,888 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:48:21,888 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:48:21,888 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:48:21,888 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:48:21,889 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:48:21,891 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:48:21,891 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:48:21,891 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:48:21,892 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:48:21,892 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 -> 73fdf555f3f5e47d818d7f4214b9add97d75e1b5 [2019-01-14 04:48:21,936 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:48:21,948 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:48:21,952 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:48:21,954 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:48:21,954 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:48:21,955 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/seq-mthreaded/pals_opt-floodmax.4_false-unreach-call.1.ufo.BOUNDED-8.pals_true-termination.c [2019-01-14 04:48:22,006 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efac0a037/8b231533276b464684b770e84f961c69/FLAG975a1d3ea [2019-01-14 04:48:22,531 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:48:22,531 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/seq-mthreaded/pals_opt-floodmax.4_false-unreach-call.1.ufo.BOUNDED-8.pals_true-termination.c [2019-01-14 04:48:22,550 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efac0a037/8b231533276b464684b770e84f961c69/FLAG975a1d3ea [2019-01-14 04:48:22,835 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efac0a037/8b231533276b464684b770e84f961c69 [2019-01-14 04:48:22,839 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:48:22,841 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:48:22,842 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:48:22,842 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:48:22,847 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:48:22,848 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:48:22" (1/1) ... [2019-01-14 04:48:22,852 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@672937de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:48:22, skipping insertion in model container [2019-01-14 04:48:22,852 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:48:22" (1/1) ... [2019-01-14 04:48:22,861 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:48:22,943 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:48:23,329 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:48:23,342 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:48:23,469 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:48:23,497 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:48:23,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:48:23 WrapperNode [2019-01-14 04:48:23,498 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:48:23,499 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:48:23,499 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:48:23,499 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:48:23,577 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:48:23" (1/1) ... [2019-01-14 04:48:23,599 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:48:23" (1/1) ... [2019-01-14 04:48:23,675 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:48:23,676 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:48:23,676 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:48:23,676 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:48:23,685 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:48:23" (1/1) ... [2019-01-14 04:48:23,686 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:48:23" (1/1) ... [2019-01-14 04:48:23,690 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:48:23" (1/1) ... [2019-01-14 04:48:23,691 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:48:23" (1/1) ... [2019-01-14 04:48:23,717 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:48:23" (1/1) ... [2019-01-14 04:48:23,744 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:48:23" (1/1) ... [2019-01-14 04:48:23,749 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:48:23" (1/1) ... [2019-01-14 04:48:23,765 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:48:23,766 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:48:23,766 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:48:23,766 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:48:23,767 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:48:23" (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-14 04:48:23,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:48:23,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:48:26,328 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:48:26,328 INFO L286 CfgBuilder]: Removed 19 assue(true) statements. [2019-01-14 04:48:26,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:48:26 BoogieIcfgContainer [2019-01-14 04:48:26,330 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:48:26,330 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:48:26,331 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:48:26,334 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:48:26,335 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:48:26,335 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:48:22" (1/3) ... [2019-01-14 04:48:26,336 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6e505415 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:48:26, skipping insertion in model container [2019-01-14 04:48:26,337 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:48:26,337 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:48:23" (2/3) ... [2019-01-14 04:48:26,337 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6e505415 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:48:26, skipping insertion in model container [2019-01-14 04:48:26,337 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:48:26,338 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:48:26" (3/3) ... [2019-01-14 04:48:26,340 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_opt-floodmax.4_false-unreach-call.1.ufo.BOUNDED-8.pals_true-termination.c [2019-01-14 04:48:26,398 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:48:26,399 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:48:26,399 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:48:26,399 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:48:26,400 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:48:26,400 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:48:26,400 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:48:26,400 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:48:26,400 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:48:26,427 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 309 states. [2019-01-14 04:48:26,489 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 123 [2019-01-14 04:48:26,491 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:48:26,492 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:48:26,508 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:48:26,508 INFO L868 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] [2019-01-14 04:48:26,508 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:48:26,509 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 309 states. [2019-01-14 04:48:26,534 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 123 [2019-01-14 04:48:26,536 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:48:26,536 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:48:26,540 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:48:26,540 INFO L868 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] [2019-01-14 04:48:26,551 INFO L794 eck$LassoCheckResult]: Stem: 113#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;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~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;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~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;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~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;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0;~newmax4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset]; 13#L-1true havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~ret56, main_#t~ret57, main_#t~post58, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet12;havoc main_#t~nondet12;~ep13~0 := main_#t~nondet13;havoc main_#t~nondet13;~ep14~0 := main_#t~nondet14;havoc main_#t~nondet14;~ep21~0 := main_#t~nondet15;havoc main_#t~nondet15;~ep23~0 := main_#t~nondet16;havoc main_#t~nondet16;~ep24~0 := main_#t~nondet17;havoc main_#t~nondet17;~ep31~0 := main_#t~nondet18;havoc main_#t~nondet18;~ep32~0 := main_#t~nondet19;havoc main_#t~nondet19;~ep34~0 := main_#t~nondet20;havoc main_#t~nondet20;~ep41~0 := main_#t~nondet21;havoc main_#t~nondet21;~ep42~0 := main_#t~nondet22;havoc main_#t~nondet22;~ep43~0 := main_#t~nondet23;havoc main_#t~nondet23;~id1~0 := main_#t~nondet24;havoc main_#t~nondet24;~r1~0 := main_#t~nondet25;havoc main_#t~nondet25;~st1~0 := main_#t~nondet26;havoc main_#t~nondet26;~nl1~0 := main_#t~nondet27;havoc main_#t~nondet27;~m1~0 := main_#t~nondet28;havoc main_#t~nondet28;~max1~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode1~0 := main_#t~nondet30;havoc main_#t~nondet30;~newmax1~0 := main_#t~nondet31;havoc main_#t~nondet31;~id2~0 := main_#t~nondet32;havoc main_#t~nondet32;~r2~0 := main_#t~nondet33;havoc main_#t~nondet33;~st2~0 := main_#t~nondet34;havoc main_#t~nondet34;~nl2~0 := main_#t~nondet35;havoc main_#t~nondet35;~m2~0 := main_#t~nondet36;havoc main_#t~nondet36;~max2~0 := main_#t~nondet37;havoc main_#t~nondet37;~mode2~0 := main_#t~nondet38;havoc main_#t~nondet38;~newmax2~0 := main_#t~nondet39;havoc main_#t~nondet39;~id3~0 := main_#t~nondet40;havoc main_#t~nondet40;~r3~0 := main_#t~nondet41;havoc main_#t~nondet41;~st3~0 := main_#t~nondet42;havoc main_#t~nondet42;~nl3~0 := main_#t~nondet43;havoc main_#t~nondet43;~m3~0 := main_#t~nondet44;havoc main_#t~nondet44;~max3~0 := main_#t~nondet45;havoc main_#t~nondet45;~mode3~0 := main_#t~nondet46;havoc main_#t~nondet46;~newmax3~0 := main_#t~nondet47;havoc main_#t~nondet47;~id4~0 := main_#t~nondet48;havoc main_#t~nondet48;~r4~0 := main_#t~nondet49;havoc main_#t~nondet49;~st4~0 := main_#t~nondet50;havoc main_#t~nondet50;~nl4~0 := main_#t~nondet51;havoc main_#t~nondet51;~m4~0 := main_#t~nondet52;havoc main_#t~nondet52;~max4~0 := main_#t~nondet53;havoc main_#t~nondet53;~mode4~0 := main_#t~nondet54;havoc main_#t~nondet54;~newmax4~0 := main_#t~nondet55;havoc main_#t~nondet55;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r141~0, init_~r211~0, init_~r231~0, init_~r241~0, init_~r311~0, init_~r321~0, init_~r341~0, init_~r411~0, init_~r421~0, init_~r431~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r142~0, init_~tmp___1~0, init_~r212~0, init_~tmp___2~0, init_~r232~0, init_~tmp___3~0, init_~r242~0, init_~tmp___4~0, init_~r312~0, init_~tmp___5~0, init_~r322~0, init_~tmp___6~0, init_~r342~0, init_~tmp___7~0, init_~r412~0, init_~tmp___8~0, init_~r422~0, init_~tmp___9~0, init_~r432~0, init_~tmp___10~0, init_~r123~0, init_~tmp___11~0, init_~r133~0, init_~tmp___12~0, init_~r143~0, init_~tmp___13~0, init_~r213~0, init_~tmp___14~0, init_~r233~0, init_~tmp___15~0, init_~r243~0, init_~tmp___16~0, init_~r313~0, init_~tmp___17~0, init_~r323~0, init_~tmp___18~0, init_~r343~0, init_~tmp___19~0, init_~r413~0, init_~tmp___20~0, init_~r423~0, init_~tmp___21~0, init_~r433~0, init_~tmp___22~0, init_~tmp___23~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r141~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r241~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r341~0;havoc init_~r411~0;havoc init_~r421~0;havoc init_~r431~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r142~0;havoc init_~tmp___1~0;havoc init_~r212~0;havoc init_~tmp___2~0;havoc init_~r232~0;havoc init_~tmp___3~0;havoc init_~r242~0;havoc init_~tmp___4~0;havoc init_~r312~0;havoc init_~tmp___5~0;havoc init_~r322~0;havoc init_~tmp___6~0;havoc init_~r342~0;havoc init_~tmp___7~0;havoc init_~r412~0;havoc init_~tmp___8~0;havoc init_~r422~0;havoc init_~tmp___9~0;havoc init_~r432~0;havoc init_~tmp___10~0;havoc init_~r123~0;havoc init_~tmp___11~0;havoc init_~r133~0;havoc init_~tmp___12~0;havoc init_~r143~0;havoc init_~tmp___13~0;havoc init_~r213~0;havoc init_~tmp___14~0;havoc init_~r233~0;havoc init_~tmp___15~0;havoc init_~r243~0;havoc init_~tmp___16~0;havoc init_~r313~0;havoc init_~tmp___17~0;havoc init_~r323~0;havoc init_~tmp___18~0;havoc init_~r343~0;havoc init_~tmp___19~0;havoc init_~r413~0;havoc init_~tmp___20~0;havoc init_~r423~0;havoc init_~tmp___21~0;havoc init_~r433~0;havoc init_~tmp___22~0;havoc init_~tmp___23~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r141~0 := ~ep14~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r241~0 := ~ep24~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0;init_~r341~0 := ~ep34~0;init_~r411~0 := ~ep41~0;init_~r421~0 := ~ep42~0;init_~r431~0 := ~ep43~0; 118#L484true assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 130#L495true init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 21#L505true assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 19#L516true init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 236#L526true assume 0 != init_~r141~0 % 256;init_~tmp___1~0 := 1; 235#L537true init_~r142~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 294#L547true assume 0 != init_~r211~0 % 256;init_~tmp___2~0 := 1; 293#L558true init_~r212~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 201#L568true assume 0 != init_~r231~0 % 256;init_~tmp___3~0 := 1; 200#L579true init_~r232~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 99#L589true assume 0 != init_~r241~0 % 256;init_~tmp___4~0 := 1; 98#L600true init_~r242~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 8#L610true assume 0 != init_~r311~0 % 256;init_~tmp___5~0 := 1; 6#L621true init_~r312~0 := (if 0 == init_~tmp___5~0 then 0 else 1); 61#L631true assume 0 != init_~r321~0 % 256;init_~tmp___6~0 := 1; 60#L642true init_~r322~0 := (if 0 == init_~tmp___6~0 then 0 else 1); 279#L652true assume 0 != init_~r341~0 % 256;init_~tmp___7~0 := 1; 278#L663true init_~r342~0 := (if 0 == init_~tmp___7~0 then 0 else 1); 179#L673true assume 0 != init_~r411~0 % 256;init_~tmp___8~0 := 1; 177#L684true init_~r412~0 := (if 0 == init_~tmp___8~0 then 0 else 1); 78#L694true assume 0 != init_~r421~0 % 256;init_~tmp___9~0 := 1; 77#L705true init_~r422~0 := (if 0 == init_~tmp___9~0 then 0 else 1); 138#L715true assume 0 != init_~r431~0 % 256;init_~tmp___10~0 := 1; 137#L726true init_~r432~0 := (if 0 == init_~tmp___10~0 then 0 else 1); 44#L736true assume 0 != init_~r122~0 % 256;init_~tmp___11~0 := 1; 43#L747true init_~r123~0 := (if 0 == init_~tmp___11~0 then 0 else 1); 261#L757true assume 0 != init_~r132~0 % 256;init_~tmp___12~0 := 1; 260#L768true init_~r133~0 := (if 0 == init_~tmp___12~0 then 0 else 1); 167#L778true assume 0 != init_~r142~0 % 256;init_~tmp___13~0 := 1; 166#L789true init_~r143~0 := (if 0 == init_~tmp___13~0 then 0 else 1); 227#L799true assume 0 != init_~r212~0 % 256;init_~tmp___14~0 := 1; 225#L810true init_~r213~0 := (if 0 == init_~tmp___14~0 then 0 else 1); 111#L820true assume 0 != init_~r232~0 % 256;init_~tmp___15~0 := 1; 126#L831true init_~r233~0 := (if 0 == init_~tmp___15~0 then 0 else 1); 15#L841true assume 0 != init_~r242~0 % 256;init_~tmp___16~0 := 1; 14#L852true init_~r243~0 := (if 0 == init_~tmp___16~0 then 0 else 1); 66#L862true assume 0 != init_~r312~0 % 256;init_~tmp___17~0 := 1; 64#L873true init_~r313~0 := (if 0 == init_~tmp___17~0 then 0 else 1); 284#L883true assume 0 != init_~r322~0 % 256;init_~tmp___18~0 := 1; 283#L894true init_~r323~0 := (if 0 == init_~tmp___18~0 then 0 else 1); 185#L904true assume 0 != init_~r342~0 % 256;init_~tmp___19~0 := 1; 184#L915true init_~r343~0 := (if 0 == init_~tmp___19~0 then 0 else 1); 84#L925true assume 0 != init_~r412~0 % 256;init_~tmp___20~0 := 1; 83#L936true init_~r413~0 := (if 0 == init_~tmp___20~0 then 0 else 1); 149#L946true assume 0 != init_~r422~0 % 256;init_~tmp___21~0 := 1; 147#L957true init_~r423~0 := (if 0 == init_~tmp___21~0 then 0 else 1); 53#L967true assume 0 != init_~r432~0 % 256;init_~tmp___22~0 := 1; 51#L978true init_~r433~0 := (if 0 == init_~tmp___22~0 then 0 else 1); 271#L988true assume !(~id1~0 != ~id2~0);init_~tmp___23~0 := 0; 273#L988-1true init_#res := init_~tmp___23~0; 309#L1125true main_#t~ret56 := init_#res;main_~i2~0 := main_#t~ret56;havoc main_#t~ret56;assume 0 != main_~i2~0;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0 := 0; 115#L1266-2true [2019-01-14 04:48:26,557 INFO L796 eck$LassoCheckResult]: Loop: 115#L1266-2true assume !!(main_~i2~0 < 8);havoc node1_#t~ite0, node1_#t~ite1, node1_#t~ite2, node1_~newmax~0;havoc node1_~newmax~0;node1_~newmax~0 := 0; 298#L156true assume !(0 != ~mode1~0 % 256); 145#L192true assume !(~r1~0 < 3); 140#L192-1true ~mode1~0 := 1; 292#L156-2true havoc node2_#t~ite3, node2_#t~ite4, node2_#t~ite5, node2_~newmax~1;havoc node2_~newmax~1;node2_~newmax~1 := 0; 103#L220true assume !(0 != ~mode2~0 % 256); 264#L256true assume !(~r2~0 < 3); 263#L256-1true ~mode2~0 := 1; 94#L220-2true havoc node3_#t~ite6, node3_#t~ite7, node3_#t~ite8, node3_~newmax~2;havoc node3_~newmax~2;node3_~newmax~2 := 0; 62#L284true assume !(0 != ~mode3~0 % 256); 224#L320true assume !(~r3~0 < 3); 228#L320-1true ~mode3~0 := 1; 57#L284-2true havoc node4_#t~ite9, node4_#t~ite10, node4_#t~ite11, node4_~newmax~3;havoc node4_~newmax~3;node4_~newmax~3 := 0; 192#L348true assume !(0 != ~mode4~0 % 256); 28#L384true assume !(~r4~0 < 3); 32#L384-1true ~mode4~0 := 1; 198#L348-2true ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 5#L1133true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1 := 0; 12#L1133-1true check_#res := check_~tmp~1; 178#L1185true main_#t~ret57 := check_#res;main_~c1~0 := main_#t~ret57;havoc main_#t~ret57;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 17#L1309true assume !(0 == assert_~arg % 256); 135#L1304true main_#t~post58 := main_~i2~0;main_~i2~0 := 1 + main_#t~post58;havoc main_#t~post58; 115#L1266-2true [2019-01-14 04:48:26,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:48:26,571 INFO L82 PathProgramCache]: Analyzing trace with hash 15484180, now seen corresponding path program 1 times [2019-01-14 04:48:26,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:48:26,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:48:26,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:48:26,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:48:26,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:48:26,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:48:26,990 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-14 04:48:26,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:48:26,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:48:26,999 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:48:27,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:48:27,000 INFO L82 PathProgramCache]: Analyzing trace with hash -39238187, now seen corresponding path program 1 times [2019-01-14 04:48:27,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:48:27,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:48:27,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:48:27,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:48:27,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:48:27,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:48:27,201 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-14 04:48:27,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:48:27,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:48:27,204 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:48:27,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 04:48:27,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 04:48:27,219 INFO L87 Difference]: Start difference. First operand 309 states. Second operand 5 states. [2019-01-14 04:48:27,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:48:27,374 INFO L93 Difference]: Finished difference Result 313 states and 555 transitions. [2019-01-14 04:48:27,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 04:48:27,379 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 313 states and 555 transitions. [2019-01-14 04:48:27,391 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 122 [2019-01-14 04:48:27,407 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 313 states to 304 states and 538 transitions. [2019-01-14 04:48:27,410 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 304 [2019-01-14 04:48:27,413 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 304 [2019-01-14 04:48:27,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 304 states and 538 transitions. [2019-01-14 04:48:27,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:48:27,422 INFO L706 BuchiCegarLoop]: Abstraction has 304 states and 538 transitions. [2019-01-14 04:48:27,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states and 538 transitions. [2019-01-14 04:48:27,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2019-01-14 04:48:27,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-01-14 04:48:27,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 538 transitions. [2019-01-14 04:48:27,498 INFO L729 BuchiCegarLoop]: Abstraction has 304 states and 538 transitions. [2019-01-14 04:48:27,498 INFO L609 BuchiCegarLoop]: Abstraction has 304 states and 538 transitions. [2019-01-14 04:48:27,498 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:48:27,499 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 304 states and 538 transitions. [2019-01-14 04:48:27,504 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 122 [2019-01-14 04:48:27,504 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:48:27,505 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:48:27,510 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:48:27,511 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:48:27,512 INFO L794 eck$LassoCheckResult]: Stem: 839#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;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~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;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~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;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~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;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0;~newmax4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset]; 661#L-1 havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~ret56, main_#t~ret57, main_#t~post58, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet12;havoc main_#t~nondet12;~ep13~0 := main_#t~nondet13;havoc main_#t~nondet13;~ep14~0 := main_#t~nondet14;havoc main_#t~nondet14;~ep21~0 := main_#t~nondet15;havoc main_#t~nondet15;~ep23~0 := main_#t~nondet16;havoc main_#t~nondet16;~ep24~0 := main_#t~nondet17;havoc main_#t~nondet17;~ep31~0 := main_#t~nondet18;havoc main_#t~nondet18;~ep32~0 := main_#t~nondet19;havoc main_#t~nondet19;~ep34~0 := main_#t~nondet20;havoc main_#t~nondet20;~ep41~0 := main_#t~nondet21;havoc main_#t~nondet21;~ep42~0 := main_#t~nondet22;havoc main_#t~nondet22;~ep43~0 := main_#t~nondet23;havoc main_#t~nondet23;~id1~0 := main_#t~nondet24;havoc main_#t~nondet24;~r1~0 := main_#t~nondet25;havoc main_#t~nondet25;~st1~0 := main_#t~nondet26;havoc main_#t~nondet26;~nl1~0 := main_#t~nondet27;havoc main_#t~nondet27;~m1~0 := main_#t~nondet28;havoc main_#t~nondet28;~max1~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode1~0 := main_#t~nondet30;havoc main_#t~nondet30;~newmax1~0 := main_#t~nondet31;havoc main_#t~nondet31;~id2~0 := main_#t~nondet32;havoc main_#t~nondet32;~r2~0 := main_#t~nondet33;havoc main_#t~nondet33;~st2~0 := main_#t~nondet34;havoc main_#t~nondet34;~nl2~0 := main_#t~nondet35;havoc main_#t~nondet35;~m2~0 := main_#t~nondet36;havoc main_#t~nondet36;~max2~0 := main_#t~nondet37;havoc main_#t~nondet37;~mode2~0 := main_#t~nondet38;havoc main_#t~nondet38;~newmax2~0 := main_#t~nondet39;havoc main_#t~nondet39;~id3~0 := main_#t~nondet40;havoc main_#t~nondet40;~r3~0 := main_#t~nondet41;havoc main_#t~nondet41;~st3~0 := main_#t~nondet42;havoc main_#t~nondet42;~nl3~0 := main_#t~nondet43;havoc main_#t~nondet43;~m3~0 := main_#t~nondet44;havoc main_#t~nondet44;~max3~0 := main_#t~nondet45;havoc main_#t~nondet45;~mode3~0 := main_#t~nondet46;havoc main_#t~nondet46;~newmax3~0 := main_#t~nondet47;havoc main_#t~nondet47;~id4~0 := main_#t~nondet48;havoc main_#t~nondet48;~r4~0 := main_#t~nondet49;havoc main_#t~nondet49;~st4~0 := main_#t~nondet50;havoc main_#t~nondet50;~nl4~0 := main_#t~nondet51;havoc main_#t~nondet51;~m4~0 := main_#t~nondet52;havoc main_#t~nondet52;~max4~0 := main_#t~nondet53;havoc main_#t~nondet53;~mode4~0 := main_#t~nondet54;havoc main_#t~nondet54;~newmax4~0 := main_#t~nondet55;havoc main_#t~nondet55;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r141~0, init_~r211~0, init_~r231~0, init_~r241~0, init_~r311~0, init_~r321~0, init_~r341~0, init_~r411~0, init_~r421~0, init_~r431~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r142~0, init_~tmp___1~0, init_~r212~0, init_~tmp___2~0, init_~r232~0, init_~tmp___3~0, init_~r242~0, init_~tmp___4~0, init_~r312~0, init_~tmp___5~0, init_~r322~0, init_~tmp___6~0, init_~r342~0, init_~tmp___7~0, init_~r412~0, init_~tmp___8~0, init_~r422~0, init_~tmp___9~0, init_~r432~0, init_~tmp___10~0, init_~r123~0, init_~tmp___11~0, init_~r133~0, init_~tmp___12~0, init_~r143~0, init_~tmp___13~0, init_~r213~0, init_~tmp___14~0, init_~r233~0, init_~tmp___15~0, init_~r243~0, init_~tmp___16~0, init_~r313~0, init_~tmp___17~0, init_~r323~0, init_~tmp___18~0, init_~r343~0, init_~tmp___19~0, init_~r413~0, init_~tmp___20~0, init_~r423~0, init_~tmp___21~0, init_~r433~0, init_~tmp___22~0, init_~tmp___23~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r141~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r241~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r341~0;havoc init_~r411~0;havoc init_~r421~0;havoc init_~r431~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r142~0;havoc init_~tmp___1~0;havoc init_~r212~0;havoc init_~tmp___2~0;havoc init_~r232~0;havoc init_~tmp___3~0;havoc init_~r242~0;havoc init_~tmp___4~0;havoc init_~r312~0;havoc init_~tmp___5~0;havoc init_~r322~0;havoc init_~tmp___6~0;havoc init_~r342~0;havoc init_~tmp___7~0;havoc init_~r412~0;havoc init_~tmp___8~0;havoc init_~r422~0;havoc init_~tmp___9~0;havoc init_~r432~0;havoc init_~tmp___10~0;havoc init_~r123~0;havoc init_~tmp___11~0;havoc init_~r133~0;havoc init_~tmp___12~0;havoc init_~r143~0;havoc init_~tmp___13~0;havoc init_~r213~0;havoc init_~tmp___14~0;havoc init_~r233~0;havoc init_~tmp___15~0;havoc init_~r243~0;havoc init_~tmp___16~0;havoc init_~r313~0;havoc init_~tmp___17~0;havoc init_~r323~0;havoc init_~tmp___18~0;havoc init_~r343~0;havoc init_~tmp___19~0;havoc init_~r413~0;havoc init_~tmp___20~0;havoc init_~r423~0;havoc init_~tmp___21~0;havoc init_~r433~0;havoc init_~tmp___22~0;havoc init_~tmp___23~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r141~0 := ~ep14~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r241~0 := ~ep24~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0;init_~r341~0 := ~ep34~0;init_~r411~0 := ~ep41~0;init_~r421~0 := ~ep42~0;init_~r431~0 := ~ep43~0; 662#L484 assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 686#L495 init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 680#L505 assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 678#L516 init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 679#L526 assume 0 != init_~r141~0 % 256;init_~tmp___1~0 := 1; 714#L537 init_~r142~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 930#L547 assume 0 != init_~r211~0 % 256;init_~tmp___2~0 := 1; 913#L558 init_~r212~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 911#L568 assume 0 != init_~r231~0 % 256;init_~tmp___3~0 := 1; 820#L579 init_~r232~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 818#L589 assume 0 != init_~r241~0 % 256;init_~tmp___4~0 := 1; 654#L600 init_~r242~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 651#L610 assume 0 != init_~r311~0 % 256;init_~tmp___5~0 := 1; 649#L621 init_~r312~0 := (if 0 == init_~tmp___5~0 then 0 else 1); 650#L631 assume 0 != init_~r321~0 % 256;init_~tmp___6~0 := 1; 643#L642 init_~r322~0 := (if 0 == init_~tmp___6~0 then 0 else 1); 758#L652 assume 0 != init_~r341~0 % 256;init_~tmp___7~0 := 1; 757#L663 init_~r342~0 := (if 0 == init_~tmp___7~0 then 0 else 1); 902#L673 assume 0 != init_~r411~0 % 256;init_~tmp___8~0 := 1; 789#L684 init_~r412~0 := (if 0 == init_~tmp___8~0 then 0 else 1); 787#L694 assume 0 != init_~r421~0 % 256;init_~tmp___9~0 := 1; 673#L705 init_~r422~0 := (if 0 == init_~tmp___9~0 then 0 else 1); 786#L715 assume 0 != init_~r431~0 % 256;init_~tmp___10~0 := 1; 732#L726 init_~r432~0 := (if 0 == init_~tmp___10~0 then 0 else 1); 728#L736 assume 0 != init_~r122~0 % 256;init_~tmp___11~0 := 1; 726#L747 init_~r123~0 := (if 0 == init_~tmp___11~0 then 0 else 1); 727#L757 assume 0 != init_~r132~0 % 256;init_~tmp___12~0 := 1; 725#L768 init_~r133~0 := (if 0 == init_~tmp___12~0 then 0 else 1); 889#L778 assume 0 != init_~r142~0 % 256;init_~tmp___13~0 := 1; 781#L789 init_~r143~0 := (if 0 == init_~tmp___13~0 then 0 else 1); 888#L799 assume 0 != init_~r212~0 % 256;init_~tmp___14~0 := 1; 837#L810 init_~r213~0 := (if 0 == init_~tmp___14~0 then 0 else 1); 835#L820 assume 0 != init_~r232~0 % 256;init_~tmp___15~0 := 1; 669#L831 init_~r233~0 := (if 0 == init_~tmp___15~0 then 0 else 1); 665#L841 assume 0 != init_~r242~0 % 256;init_~tmp___16~0 := 1; 663#L852 init_~r243~0 := (if 0 == init_~tmp___16~0 then 0 else 1); 664#L862 assume 0 != init_~r312~0 % 256;init_~tmp___17~0 := 1; 704#L873 init_~r313~0 := (if 0 == init_~tmp___17~0 then 0 else 1); 767#L883 assume 0 != init_~r322~0 % 256;init_~tmp___18~0 := 1; 908#L894 init_~r323~0 := (if 0 == init_~tmp___18~0 then 0 else 1); 905#L904 assume 0 != init_~r342~0 % 256;init_~tmp___19~0 := 1; 799#L915 init_~r343~0 := (if 0 == init_~tmp___19~0 then 0 else 1); 796#L925 assume 0 != init_~r412~0 % 256;init_~tmp___20~0 := 1; 690#L936 init_~r413~0 := (if 0 == init_~tmp___20~0 then 0 else 1); 795#L946 assume 0 != init_~r422~0 % 256;init_~tmp___21~0 := 1; 751#L957 init_~r423~0 := (if 0 == init_~tmp___21~0 then 0 else 1); 748#L967 assume 0 != init_~r432~0 % 256;init_~tmp___22~0 := 1; 743#L978 init_~r433~0 := (if 0 == init_~tmp___22~0 then 0 else 1); 744#L988 assume !(~id1~0 != ~id2~0);init_~tmp___23~0 := 0; 676#L988-1 init_#res := init_~tmp___23~0; 938#L1125 main_#t~ret56 := init_#res;main_~i2~0 := main_#t~ret56;havoc main_#t~ret56;assume 0 != main_~i2~0;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0 := 0; 840#L1266-2 [2019-01-14 04:48:27,517 INFO L796 eck$LassoCheckResult]: Loop: 840#L1266-2 assume !!(main_~i2~0 < 8);havoc node1_#t~ite0, node1_#t~ite1, node1_#t~ite2, node1_~newmax~0;havoc node1_~newmax~0;node1_~newmax~0 := 0; 841#L156 assume !(0 != ~mode1~0 % 256); 866#L192 assume !(~r1~0 < 3); 808#L192-1 ~mode1~0 := 1; 864#L156-2 havoc node2_#t~ite3, node2_#t~ite4, node2_#t~ite5, node2_~newmax~1;havoc node2_~newmax~1;node2_~newmax~1 := 0; 822#L220 assume !(0 != ~mode2~0 % 256); 824#L256 assume !(~r2~0 < 3); 746#L256-1 ~mode2~0 := 1; 814#L220-2 havoc node3_#t~ite6, node3_#t~ite7, node3_#t~ite8, node3_~newmax~2;havoc node3_~newmax~2;node3_~newmax~2 := 0; 759#L284 assume !(0 != ~mode3~0 % 256); 761#L320 assume !(~r3~0 < 3); 883#L320-1 ~mode3~0 := 1; 753#L284-2 havoc node4_#t~ite9, node4_#t~ite10, node4_#t~ite11, node4_~newmax~3;havoc node4_~newmax~3;node4_~newmax~3 := 0; 754#L348 assume !(0 != ~mode4~0 % 256); 698#L384 assume !(~r4~0 < 3); 700#L384-1 ~mode4~0 := 1; 705#L348-2 ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 644#L1133 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 645#L1134 assume ~st1~0 + ~nl1~0 <= 1; 816#L1135 assume ~st2~0 + ~nl2~0 <= 1; 922#L1136 assume ~st3~0 + ~nl3~0 <= 1; 935#L1137 assume ~st4~0 + ~nl4~0 <= 1; 706#L1138 assume ~r1~0 >= 3; 707#L1142 assume ~r1~0 < 3; 926#L1147 assume ~r1~0 >= 3; 791#L1152 assume ~r1~0 < 3;check_~tmp~1 := 1; 659#L1133-1 check_#res := check_~tmp~1; 660#L1185 main_#t~ret57 := check_#res;main_~c1~0 := main_#t~ret57;havoc main_#t~ret57;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 670#L1309 assume !(0 == assert_~arg % 256); 671#L1304 main_#t~post58 := main_~i2~0;main_~i2~0 := 1 + main_#t~post58;havoc main_#t~post58; 840#L1266-2 [2019-01-14 04:48:27,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:48:27,521 INFO L82 PathProgramCache]: Analyzing trace with hash 15484180, now seen corresponding path program 2 times [2019-01-14 04:48:27,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:48:27,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:48:27,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:48:27,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:48:27,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:48:27,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:48:27,740 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-14 04:48:27,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:48:27,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:48:27,741 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:48:27,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:48:27,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1893698084, now seen corresponding path program 1 times [2019-01-14 04:48:27,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:48:27,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:48:27,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:48:27,745 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:48:27,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:48:27,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:48:27,823 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-14 04:48:27,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:48:27,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:48:27,824 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:48:27,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:48:27,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:48:27,825 INFO L87 Difference]: Start difference. First operand 304 states and 538 transitions. cyclomatic complexity: 235 Second operand 3 states. [2019-01-14 04:48:28,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:48:28,175 INFO L93 Difference]: Finished difference Result 401 states and 693 transitions. [2019-01-14 04:48:28,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:48:28,177 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 401 states and 693 transitions. [2019-01-14 04:48:28,182 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 219 [2019-01-14 04:48:28,189 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 401 states to 401 states and 693 transitions. [2019-01-14 04:48:28,190 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 401 [2019-01-14 04:48:28,191 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 401 [2019-01-14 04:48:28,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 401 states and 693 transitions. [2019-01-14 04:48:28,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:48:28,199 INFO L706 BuchiCegarLoop]: Abstraction has 401 states and 693 transitions. [2019-01-14 04:48:28,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states and 693 transitions. [2019-01-14 04:48:28,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 401. [2019-01-14 04:48:28,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2019-01-14 04:48:28,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 693 transitions. [2019-01-14 04:48:28,236 INFO L729 BuchiCegarLoop]: Abstraction has 401 states and 693 transitions. [2019-01-14 04:48:28,236 INFO L609 BuchiCegarLoop]: Abstraction has 401 states and 693 transitions. [2019-01-14 04:48:28,236 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:48:28,236 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 401 states and 693 transitions. [2019-01-14 04:48:28,241 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 219 [2019-01-14 04:48:28,241 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:48:28,241 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:48:28,244 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:48:28,244 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:48:28,245 INFO L794 eck$LassoCheckResult]: Stem: 1551#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;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~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;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~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;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~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;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0;~newmax4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset]; 1376#L-1 havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~ret56, main_#t~ret57, main_#t~post58, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet12;havoc main_#t~nondet12;~ep13~0 := main_#t~nondet13;havoc main_#t~nondet13;~ep14~0 := main_#t~nondet14;havoc main_#t~nondet14;~ep21~0 := main_#t~nondet15;havoc main_#t~nondet15;~ep23~0 := main_#t~nondet16;havoc main_#t~nondet16;~ep24~0 := main_#t~nondet17;havoc main_#t~nondet17;~ep31~0 := main_#t~nondet18;havoc main_#t~nondet18;~ep32~0 := main_#t~nondet19;havoc main_#t~nondet19;~ep34~0 := main_#t~nondet20;havoc main_#t~nondet20;~ep41~0 := main_#t~nondet21;havoc main_#t~nondet21;~ep42~0 := main_#t~nondet22;havoc main_#t~nondet22;~ep43~0 := main_#t~nondet23;havoc main_#t~nondet23;~id1~0 := main_#t~nondet24;havoc main_#t~nondet24;~r1~0 := main_#t~nondet25;havoc main_#t~nondet25;~st1~0 := main_#t~nondet26;havoc main_#t~nondet26;~nl1~0 := main_#t~nondet27;havoc main_#t~nondet27;~m1~0 := main_#t~nondet28;havoc main_#t~nondet28;~max1~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode1~0 := main_#t~nondet30;havoc main_#t~nondet30;~newmax1~0 := main_#t~nondet31;havoc main_#t~nondet31;~id2~0 := main_#t~nondet32;havoc main_#t~nondet32;~r2~0 := main_#t~nondet33;havoc main_#t~nondet33;~st2~0 := main_#t~nondet34;havoc main_#t~nondet34;~nl2~0 := main_#t~nondet35;havoc main_#t~nondet35;~m2~0 := main_#t~nondet36;havoc main_#t~nondet36;~max2~0 := main_#t~nondet37;havoc main_#t~nondet37;~mode2~0 := main_#t~nondet38;havoc main_#t~nondet38;~newmax2~0 := main_#t~nondet39;havoc main_#t~nondet39;~id3~0 := main_#t~nondet40;havoc main_#t~nondet40;~r3~0 := main_#t~nondet41;havoc main_#t~nondet41;~st3~0 := main_#t~nondet42;havoc main_#t~nondet42;~nl3~0 := main_#t~nondet43;havoc main_#t~nondet43;~m3~0 := main_#t~nondet44;havoc main_#t~nondet44;~max3~0 := main_#t~nondet45;havoc main_#t~nondet45;~mode3~0 := main_#t~nondet46;havoc main_#t~nondet46;~newmax3~0 := main_#t~nondet47;havoc main_#t~nondet47;~id4~0 := main_#t~nondet48;havoc main_#t~nondet48;~r4~0 := main_#t~nondet49;havoc main_#t~nondet49;~st4~0 := main_#t~nondet50;havoc main_#t~nondet50;~nl4~0 := main_#t~nondet51;havoc main_#t~nondet51;~m4~0 := main_#t~nondet52;havoc main_#t~nondet52;~max4~0 := main_#t~nondet53;havoc main_#t~nondet53;~mode4~0 := main_#t~nondet54;havoc main_#t~nondet54;~newmax4~0 := main_#t~nondet55;havoc main_#t~nondet55;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r141~0, init_~r211~0, init_~r231~0, init_~r241~0, init_~r311~0, init_~r321~0, init_~r341~0, init_~r411~0, init_~r421~0, init_~r431~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r142~0, init_~tmp___1~0, init_~r212~0, init_~tmp___2~0, init_~r232~0, init_~tmp___3~0, init_~r242~0, init_~tmp___4~0, init_~r312~0, init_~tmp___5~0, init_~r322~0, init_~tmp___6~0, init_~r342~0, init_~tmp___7~0, init_~r412~0, init_~tmp___8~0, init_~r422~0, init_~tmp___9~0, init_~r432~0, init_~tmp___10~0, init_~r123~0, init_~tmp___11~0, init_~r133~0, init_~tmp___12~0, init_~r143~0, init_~tmp___13~0, init_~r213~0, init_~tmp___14~0, init_~r233~0, init_~tmp___15~0, init_~r243~0, init_~tmp___16~0, init_~r313~0, init_~tmp___17~0, init_~r323~0, init_~tmp___18~0, init_~r343~0, init_~tmp___19~0, init_~r413~0, init_~tmp___20~0, init_~r423~0, init_~tmp___21~0, init_~r433~0, init_~tmp___22~0, init_~tmp___23~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r141~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r241~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r341~0;havoc init_~r411~0;havoc init_~r421~0;havoc init_~r431~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r142~0;havoc init_~tmp___1~0;havoc init_~r212~0;havoc init_~tmp___2~0;havoc init_~r232~0;havoc init_~tmp___3~0;havoc init_~r242~0;havoc init_~tmp___4~0;havoc init_~r312~0;havoc init_~tmp___5~0;havoc init_~r322~0;havoc init_~tmp___6~0;havoc init_~r342~0;havoc init_~tmp___7~0;havoc init_~r412~0;havoc init_~tmp___8~0;havoc init_~r422~0;havoc init_~tmp___9~0;havoc init_~r432~0;havoc init_~tmp___10~0;havoc init_~r123~0;havoc init_~tmp___11~0;havoc init_~r133~0;havoc init_~tmp___12~0;havoc init_~r143~0;havoc init_~tmp___13~0;havoc init_~r213~0;havoc init_~tmp___14~0;havoc init_~r233~0;havoc init_~tmp___15~0;havoc init_~r243~0;havoc init_~tmp___16~0;havoc init_~r313~0;havoc init_~tmp___17~0;havoc init_~r323~0;havoc init_~tmp___18~0;havoc init_~r343~0;havoc init_~tmp___19~0;havoc init_~r413~0;havoc init_~tmp___20~0;havoc init_~r423~0;havoc init_~tmp___21~0;havoc init_~r433~0;havoc init_~tmp___22~0;havoc init_~tmp___23~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r141~0 := ~ep14~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r241~0 := ~ep24~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0;init_~r341~0 := ~ep34~0;init_~r411~0 := ~ep41~0;init_~r421~0 := ~ep42~0;init_~r431~0 := ~ep43~0; 1377#L484 assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 1399#L495 init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 1393#L505 assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 1391#L516 init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 1392#L526 assume 0 != init_~r141~0 % 256;init_~tmp___1~0 := 1; 1426#L537 init_~r142~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 1650#L547 assume 0 != init_~r211~0 % 256;init_~tmp___2~0 := 1; 1632#L558 init_~r212~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 1629#L568 assume 0 != init_~r231~0 % 256;init_~tmp___3~0 := 1; 1532#L579 init_~r232~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 1530#L589 assume 0 != init_~r241~0 % 256;init_~tmp___4~0 := 1; 1367#L600 init_~r242~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 1364#L610 assume 0 != init_~r311~0 % 256;init_~tmp___5~0 := 1; 1362#L621 init_~r312~0 := (if 0 == init_~tmp___5~0 then 0 else 1); 1363#L631 assume 0 != init_~r321~0 % 256;init_~tmp___6~0 := 1; 1356#L642 init_~r322~0 := (if 0 == init_~tmp___6~0 then 0 else 1); 1470#L652 assume 0 != init_~r341~0 % 256;init_~tmp___7~0 := 1; 1469#L663 init_~r342~0 := (if 0 == init_~tmp___7~0 then 0 else 1); 1615#L673 assume 0 != init_~r411~0 % 256;init_~tmp___8~0 := 1; 1501#L684 init_~r412~0 := (if 0 == init_~tmp___8~0 then 0 else 1); 1499#L694 assume 0 != init_~r421~0 % 256;init_~tmp___9~0 := 1; 1386#L705 init_~r422~0 := (if 0 == init_~tmp___9~0 then 0 else 1); 1498#L715 assume 0 != init_~r431~0 % 256;init_~tmp___10~0 := 1; 1444#L726 init_~r432~0 := (if 0 == init_~tmp___10~0 then 0 else 1); 1440#L736 assume 0 != init_~r122~0 % 256;init_~tmp___11~0 := 1; 1438#L747 init_~r123~0 := (if 0 == init_~tmp___11~0 then 0 else 1); 1439#L757 assume 0 != init_~r132~0 % 256;init_~tmp___12~0 := 1; 1436#L768 init_~r133~0 := (if 0 == init_~tmp___12~0 then 0 else 1); 1602#L778 assume 0 != init_~r142~0 % 256;init_~tmp___13~0 := 1; 1493#L789 init_~r143~0 := (if 0 == init_~tmp___13~0 then 0 else 1); 1601#L799 assume 0 != init_~r212~0 % 256;init_~tmp___14~0 := 1; 1549#L810 init_~r213~0 := (if 0 == init_~tmp___14~0 then 0 else 1); 1547#L820 assume 0 != init_~r232~0 % 256;init_~tmp___15~0 := 1; 1382#L831 init_~r233~0 := (if 0 == init_~tmp___15~0 then 0 else 1); 1378#L841 assume 0 != init_~r242~0 % 256;init_~tmp___16~0 := 1; 1374#L852 init_~r243~0 := (if 0 == init_~tmp___16~0 then 0 else 1); 1375#L862 assume 0 != init_~r312~0 % 256;init_~tmp___17~0 := 1; 1417#L873 init_~r313~0 := (if 0 == init_~tmp___17~0 then 0 else 1); 1477#L883 assume 0 != init_~r322~0 % 256;init_~tmp___18~0 := 1; 1623#L894 init_~r323~0 := (if 0 == init_~tmp___18~0 then 0 else 1); 1619#L904 assume 0 != init_~r342~0 % 256;init_~tmp___19~0 := 1; 1510#L915 init_~r343~0 := (if 0 == init_~tmp___19~0 then 0 else 1); 1508#L925 assume 0 != init_~r412~0 % 256;init_~tmp___20~0 := 1; 1403#L936 init_~r413~0 := (if 0 == init_~tmp___20~0 then 0 else 1); 1507#L946 assume 0 != init_~r422~0 % 256;init_~tmp___21~0 := 1; 1463#L957 init_~r423~0 := (if 0 == init_~tmp___21~0 then 0 else 1); 1457#L967 assume 0 != init_~r432~0 % 256;init_~tmp___22~0 := 1; 1453#L978 init_~r433~0 := (if 0 == init_~tmp___22~0 then 0 else 1); 1454#L988 assume !(~id1~0 != ~id2~0);init_~tmp___23~0 := 0; 1389#L988-1 init_#res := init_~tmp___23~0; 1660#L1125 main_#t~ret56 := init_#res;main_~i2~0 := main_#t~ret56;havoc main_#t~ret56;assume 0 != main_~i2~0;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0 := 0; 1665#L1266-2 [2019-01-14 04:48:28,245 INFO L796 eck$LassoCheckResult]: Loop: 1665#L1266-2 assume !!(main_~i2~0 < 8);havoc node1_#t~ite0, node1_#t~ite1, node1_#t~ite2, node1_~newmax~0;havoc node1_~newmax~0;node1_~newmax~0 := 0; 1668#L156 assume !(0 != ~mode1~0 % 256); 1667#L192 assume ~r1~0 < 3; 1512#L193 assume !(0 != ~ep12~0 % 256); 1504#L193-1 assume !(0 != ~ep13~0 % 256); 1505#L198 assume !(0 != ~ep14~0 % 256); 1517#L192-1 ~mode1~0 := 1; 1730#L156-2 havoc node2_#t~ite3, node2_#t~ite4, node2_#t~ite5, node2_~newmax~1;havoc node2_~newmax~1;node2_~newmax~1 := 0; 1727#L220 assume !(0 != ~mode2~0 % 256); 1723#L256 assume !(~r2~0 < 3); 1718#L256-1 ~mode2~0 := 1; 1716#L220-2 havoc node3_#t~ite6, node3_#t~ite7, node3_#t~ite8, node3_~newmax~2;havoc node3_~newmax~2;node3_~newmax~2 := 0; 1714#L284 assume !(0 != ~mode3~0 % 256); 1715#L320 assume !(~r3~0 < 3); 1648#L320-1 ~mode3~0 := 1; 1465#L284-2 havoc node4_#t~ite9, node4_#t~ite10, node4_#t~ite11, node4_~newmax~3;havoc node4_~newmax~3;node4_~newmax~3 := 0; 1466#L348 assume !(0 != ~mode4~0 % 256); 1411#L384 assume !(~r4~0 < 3); 1413#L384-1 ~mode4~0 := 1; 1418#L348-2 ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 1357#L1133 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 1358#L1134 assume ~st1~0 + ~nl1~0 <= 1; 1528#L1135 assume ~st2~0 + ~nl2~0 <= 1; 1640#L1136 assume ~st3~0 + ~nl3~0 <= 1; 1655#L1137 assume ~st4~0 + ~nl4~0 <= 1; 1656#L1138 assume !(~r1~0 >= 3); 1616#L1141 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; 1617#L1142 assume ~r1~0 < 3; 1666#L1147 assume !(~r1~0 >= 3); 1502#L1151 assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0 + ~nl4~0; 1503#L1152 assume ~r1~0 < 3;check_~tmp~1 := 1; 1672#L1133-1 check_#res := check_~tmp~1; 1671#L1185 main_#t~ret57 := check_#res;main_~c1~0 := main_#t~ret57;havoc main_#t~ret57;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 1670#L1309 assume !(0 == assert_~arg % 256); 1669#L1304 main_#t~post58 := main_~i2~0;main_~i2~0 := 1 + main_#t~post58;havoc main_#t~post58; 1665#L1266-2 [2019-01-14 04:48:28,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:48:28,246 INFO L82 PathProgramCache]: Analyzing trace with hash 15484180, now seen corresponding path program 3 times [2019-01-14 04:48:28,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:48:28,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:48:28,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:48:28,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:48:28,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:48:28,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:48:28,446 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-14 04:48:28,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:48:28,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:48:28,448 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:48:28,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:48:28,449 INFO L82 PathProgramCache]: Analyzing trace with hash 623773262, now seen corresponding path program 1 times [2019-01-14 04:48:28,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:48:28,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:48:28,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:48:28,452 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:48:28,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:48:28,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:48:28,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:48:29,567 WARN L181 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 158 DAG size of output: 152 [2019-01-14 04:48:29,877 WARN L181 SmtUtils]: Spent 309.00 ms on a formula simplification that was a NOOP. DAG size: 152 [2019-01-14 04:48:29,887 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:48:29,888 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:48:29,888 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:48:29,888 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:48:29,889 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:48:29,889 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:48:29,889 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:48:29,889 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:48:29,889 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_opt-floodmax.4_false-unreach-call.1.ufo.BOUNDED-8.pals_true-termination.c_Iteration3_Loop [2019-01-14 04:48:29,889 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:48:29,890 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:48:29,918 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-14 04:48:29,941 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-14 04:48:29,947 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-14 04:48:29,955 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-14 04:48:29,958 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-14 04:48:29,966 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-14 04:48:29,973 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-14 04:48:29,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-14 04:48:29,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-14 04:48:29,987 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-14 04:48:29,991 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-14 04:48:29,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-14 04:48:30,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:48:30,003 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-14 04:48:30,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-14 04:48:30,009 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-14 04:48:30,011 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-14 04:48:30,014 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-14 04:48:30,016 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-14 04:48:30,019 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-14 04:48:30,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:48:30,026 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-14 04:48:30,032 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-14 04:48:30,038 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-14 04:48:30,042 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-14 04:48:30,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-14 04:48:30,077 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-14 04:48:30,091 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-14 04:48:30,103 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-14 04:48:30,107 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-14 04:48:30,111 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-14 04:48:30,122 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-14 04:48:30,206 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-14 04:48:30,212 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-14 04:48:30,215 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-14 04:48:30,219 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-14 04:48:30,225 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-14 04:48:30,237 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-14 04:48:30,243 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-14 04:48:30,249 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-14 04:48:30,260 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-14 04:48:30,845 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-01-14 04:48:31,212 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-01-14 04:48:31,271 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:48:31,272 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-14 04:48:31,288 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:48:31,288 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-14 04:48:31,331 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:48:31,331 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:48:31,468 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:48:31,470 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:48:31,470 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:48:31,470 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:48:31,471 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:48:31,471 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:48:31,471 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:48:31,471 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:48:31,471 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:48:31,471 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_opt-floodmax.4_false-unreach-call.1.ufo.BOUNDED-8.pals_true-termination.c_Iteration3_Loop [2019-01-14 04:48:31,471 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:48:31,471 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:48:31,484 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-14 04:48:31,547 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-14 04:48:31,550 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-14 04:48:31,552 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-14 04:48:31,553 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-14 04:48:31,556 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-14 04:48:31,563 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-14 04:48:31,568 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-14 04:48:31,572 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-14 04:48:31,575 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-14 04:48:31,577 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-14 04:48:31,581 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-14 04:48:31,585 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-14 04:48:31,587 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-14 04:48:31,738 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-01-14 04:48:31,739 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-14 04:48:31,741 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-14 04:48:31,743 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-14 04:48:31,745 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-14 04:48:31,749 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-14 04:48:31,752 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-14 04:48:31,754 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-14 04:48:31,756 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-14 04:48:31,763 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-14 04:48:31,777 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-14 04:48:31,803 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-14 04:48:31,805 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-14 04:48:31,808 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-14 04:48:31,811 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-14 04:48:31,814 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-14 04:48:31,829 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-14 04:48:31,833 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-14 04:48:31,836 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-14 04:48:31,838 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-14 04:48:31,850 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-14 04:48:31,853 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-14 04:48:31,855 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-14 04:48:31,857 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-14 04:48:31,864 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-14 04:48:31,867 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-14 04:48:31,869 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-14 04:48:31,873 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-14 04:48:32,207 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-01-14 04:48:32,448 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 18 [2019-01-14 04:48:32,754 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-01-14 04:48:32,891 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:48:32,897 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:48:32,899 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-14 04:48:32,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:48:32,901 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:48:32,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:48:32,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:48:32,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:48:32,905 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:48:32,905 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:48:32,910 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:48:32,910 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-14 04:48:32,911 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:48:32,911 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:48:32,911 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:48:32,911 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:48:32,916 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:48:32,916 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:48:32,918 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:48:32,918 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-14 04:48:32,918 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:48:32,919 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:48:32,921 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:48:32,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:48:32,921 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:48:32,922 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:48:32,922 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:48:32,924 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:48:32,925 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-14 04:48:32,925 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:48:32,925 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:48:32,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:48:32,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:48:32,926 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:48:32,926 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:48:32,926 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:48:32,927 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:48:32,927 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-14 04:48:32,932 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:48:32,932 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:48:32,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:48:32,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:48:32,933 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:48:32,933 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:48:32,933 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:48:32,934 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:48:32,936 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-14 04:48:32,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:48:32,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:48:32,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:48:32,937 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:48:32,941 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:48:32,941 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:48:32,944 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:48:32,945 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-14 04:48:32,945 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:48:32,945 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:48:32,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:48:32,948 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:48:32,948 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:48:32,949 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:48:32,949 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:48:32,952 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:48:32,953 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-14 04:48:32,953 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:48:32,953 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:48:32,953 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:48:32,954 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:48:32,957 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:48:32,958 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:48:32,960 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:48:32,961 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-14 04:48:32,961 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:48:32,961 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:48:32,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:48:32,964 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:48:32,964 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:48:32,964 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:48:32,965 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:48:32,966 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:48:32,967 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-14 04:48:32,968 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:48:32,968 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:48:32,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:48:32,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:48:32,968 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:48:32,969 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:48:32,969 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:48:32,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:48:32,970 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-14 04:48:32,974 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:48:32,974 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:48:32,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:48:32,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:48:32,974 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:48:32,975 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:48:32,977 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:48:32,978 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:48:32,978 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-14 04:48:32,981 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:48:32,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:48:32,981 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:48:32,981 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:48:32,983 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:48:32,984 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:48:32,987 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:48:32,987 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-14 04:48:32,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:48:32,988 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:48:32,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:48:32,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:48:32,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:48:32,992 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:48:32,992 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:48:32,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:48:32,994 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-14 04:48:32,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:48:32,994 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:48:32,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:48:32,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:48:32,997 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:48:33,003 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:48:33,003 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:48:33,008 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:48:33,009 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:48:33,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:48:33,010 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:48:33,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:48:33,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:48:33,010 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:48:33,010 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:48:33,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:48:33,015 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:48:33,016 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:48:33,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:48:33,016 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:48:33,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:48:33,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:48:33,017 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:48:33,020 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:48:33,020 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:48:33,021 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:48:33,021 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-14 04:48:33,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:48:33,022 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:48:33,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:48:33,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:48:33,025 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:48:33,025 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:48:33,025 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:48:33,026 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:48:33,027 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-14 04:48:33,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:48:33,031 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:48:33,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:48:33,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:48:33,032 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:48:33,032 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:48:33,032 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:48:33,033 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:48:33,034 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-14 04:48:33,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:48:33,037 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:48:33,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:48:33,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:48:33,038 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:48:33,041 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:48:33,041 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:48:33,044 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:48:33,045 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-14 04:48:33,045 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:48:33,045 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:48:33,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:48:33,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:48:33,046 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:48:33,046 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:48:33,047 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:48:33,052 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:48:33,052 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-14 04:48:33,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:48:33,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:48:33,053 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:48:33,053 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:48:33,058 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:48:33,059 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:48:33,064 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:48:33,065 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-14 04:48:33,065 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:48:33,065 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:48:33,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:48:33,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:48:33,068 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:48:33,070 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:48:33,070 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:48:33,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:48:33,074 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-14 04:48:33,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:48:33,076 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:48:33,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:48:33,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:48:33,077 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:48:33,077 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:48:33,077 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:48:33,079 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:48:33,082 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:48:33,082 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 04:48:33,085 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:48:33,085 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:48:33,085 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:48:33,086 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 15 Supporting invariants [] [2019-01-14 04:48:33,088 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:48:33,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:48:33,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:48:33,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:48:33,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:48:33,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:48:33,381 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-14 04:48:33,384 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-14 04:48:33,385 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 401 states and 693 transitions. cyclomatic complexity: 293 Second operand 3 states. [2019-01-14 04:48:33,520 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 401 states and 693 transitions. cyclomatic complexity: 293. Second operand 3 states. Result 619 states and 1050 transitions. Complement of second has 4 states. [2019-01-14 04:48:33,521 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-14 04:48:33,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:48:33,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 538 transitions. [2019-01-14 04:48:33,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 538 transitions. Stem has 53 letters. Loop has 35 letters. [2019-01-14 04:48:33,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:48:33,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 538 transitions. Stem has 88 letters. Loop has 35 letters. [2019-01-14 04:48:33,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:48:33,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 538 transitions. Stem has 53 letters. Loop has 70 letters. [2019-01-14 04:48:33,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:48:33,532 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 619 states and 1050 transitions. [2019-01-14 04:48:33,538 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:48:33,539 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 619 states to 0 states and 0 transitions. [2019-01-14 04:48:33,539 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:48:33,539 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:48:33,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:48:33,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:48:33,539 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:48:33,539 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:48:33,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 04:48:33,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 04:48:33,542 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 4 states. [2019-01-14 04:48:33,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:48:33,542 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-14 04:48:33,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 04:48:33,543 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-14 04:48:33,543 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:48:33,543 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 04:48:33,543 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:48:33,543 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:48:33,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:48:33,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:48:33,544 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:48:33,544 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:48:33,544 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:48:33,544 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 04:48:33,544 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 04:48:33,544 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:48:33,544 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 04:48:33,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:48:33 BoogieIcfgContainer [2019-01-14 04:48:33,555 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:48:33,555 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:48:33,555 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:48:33,555 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:48:33,556 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:48:26" (3/4) ... [2019-01-14 04:48:33,561 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 04:48:33,562 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:48:33,562 INFO L168 Benchmark]: Toolchain (without parser) took 10723.01 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 315.6 MB). Free memory was 952.7 MB in the beginning and 1.2 GB in the end (delta: -238.9 MB). Peak memory consumption was 76.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:48:33,564 INFO L168 Benchmark]: CDTParser took 0.15 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-14 04:48:33,565 INFO L168 Benchmark]: CACSL2BoogieTranslator took 656.39 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 925.9 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2019-01-14 04:48:33,566 INFO L168 Benchmark]: Boogie Procedure Inliner took 176.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 925.9 MB in the beginning and 1.1 GB in the end (delta: -210.3 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. [2019-01-14 04:48:33,568 INFO L168 Benchmark]: Boogie Preprocessor took 89.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-01-14 04:48:33,568 INFO L168 Benchmark]: RCFGBuilder took 2563.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 104.6 MB). Peak memory consumption was 104.6 MB. Max. memory is 11.5 GB. [2019-01-14 04:48:33,570 INFO L168 Benchmark]: BuchiAutomizer took 7224.56 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 167.2 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -166.7 MB). Peak memory consumption was 558.9 kB. Max. memory is 11.5 GB. [2019-01-14 04:48:33,571 INFO L168 Benchmark]: Witness Printer took 6.39 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:48:33,577 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 656.39 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 925.9 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 176.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 925.9 MB in the beginning and 1.1 GB in the end (delta: -210.3 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 89.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2563.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 104.6 MB). Peak memory consumption was 104.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7224.56 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 167.2 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -166.7 MB). Peak memory consumption was 558.9 kB. Max. memory is 11.5 GB. * Witness Printer took 6.39 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 15 and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.1s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 5.8s. Construction of modules took 0.4s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 401 states and ocurred in iteration 2. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1622 SDtfs, 879 SDslu, 2353 SDs, 0 SdLazy, 35 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI2 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital210 mio100 ax122 hnf105 lsp27 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq229 hnf85 smp100 dnf100 smp100 tf101 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...