./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9a750b57-3ce2-4c64-961d-51f8ca4e7863/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9a750b57-3ce2-4c64-961d-51f8ca4e7863/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9a750b57-3ce2-4c64-961d-51f8ca4e7863/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9a750b57-3ce2-4c64-961d-51f8ca4e7863/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_9a750b57-3ce2-4c64-961d-51f8ca4e7863/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9a750b57-3ce2-4c64-961d-51f8ca4e7863/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3381374679dc4a7458d725215e8a6e295cc6e6a1 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-01 20:12:31,695 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 20:12:31,696 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 20:12:31,704 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 20:12:31,704 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 20:12:31,705 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 20:12:31,705 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 20:12:31,706 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 20:12:31,707 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 20:12:31,707 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 20:12:31,707 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 20:12:31,708 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 20:12:31,708 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 20:12:31,708 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 20:12:31,709 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 20:12:31,709 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 20:12:31,710 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 20:12:31,711 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 20:12:31,712 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 20:12:31,713 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 20:12:31,713 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 20:12:31,714 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 20:12:31,715 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 20:12:31,715 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 20:12:31,715 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 20:12:31,716 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 20:12:31,716 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 20:12:31,717 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 20:12:31,717 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 20:12:31,717 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 20:12:31,718 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 20:12:31,718 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 20:12:31,718 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 20:12:31,718 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 20:12:31,718 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 20:12:31,719 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 20:12:31,719 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9a750b57-3ce2-4c64-961d-51f8ca4e7863/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-01 20:12:31,729 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 20:12:31,729 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 20:12:31,730 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 20:12:31,730 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 20:12:31,730 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 20:12:31,731 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-01 20:12:31,731 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-01 20:12:31,731 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-01 20:12:31,731 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-01 20:12:31,731 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-01 20:12:31,731 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-01 20:12:31,731 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 20:12:31,732 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 20:12:31,732 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-01 20:12:31,732 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 20:12:31,732 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 20:12:31,732 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 20:12:31,732 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-01 20:12:31,732 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-01 20:12:31,732 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-01 20:12:31,733 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 20:12:31,733 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 20:12:31,733 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-01 20:12:31,733 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 20:12:31,733 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-01 20:12:31,733 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 20:12:31,734 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 20:12:31,734 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-01 20:12:31,734 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 20:12:31,734 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 20:12:31,734 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-01 20:12:31,735 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-01 20:12:31,735 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_9a750b57-3ce2-4c64-961d-51f8ca4e7863/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3381374679dc4a7458d725215e8a6e295cc6e6a1 [2018-12-01 20:12:31,757 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 20:12:31,765 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 20:12:31,767 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 20:12:31,768 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 20:12:31,768 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 20:12:31,769 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9a750b57-3ce2-4c64-961d-51f8ca4e7863/bin-2019/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c [2018-12-01 20:12:31,805 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9a750b57-3ce2-4c64-961d-51f8ca4e7863/bin-2019/uautomizer/data/e19acc722/4fe17260bd98499dbe9229a2c5ea6c89/FLAGf99a4a1c8 [2018-12-01 20:12:32,248 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 20:12:32,248 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9a750b57-3ce2-4c64-961d-51f8ca4e7863/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c [2018-12-01 20:12:32,255 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9a750b57-3ce2-4c64-961d-51f8ca4e7863/bin-2019/uautomizer/data/e19acc722/4fe17260bd98499dbe9229a2c5ea6c89/FLAGf99a4a1c8 [2018-12-01 20:12:32,266 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9a750b57-3ce2-4c64-961d-51f8ca4e7863/bin-2019/uautomizer/data/e19acc722/4fe17260bd98499dbe9229a2c5ea6c89 [2018-12-01 20:12:32,268 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 20:12:32,269 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 20:12:32,270 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 20:12:32,270 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 20:12:32,272 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 20:12:32,272 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 08:12:32" (1/1) ... [2018-12-01 20:12:32,274 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cc82c98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:12:32, skipping insertion in model container [2018-12-01 20:12:32,274 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 08:12:32" (1/1) ... [2018-12-01 20:12:32,279 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 20:12:32,304 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 20:12:32,436 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 20:12:32,442 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 20:12:32,503 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 20:12:32,513 INFO L195 MainTranslator]: Completed translation [2018-12-01 20:12:32,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:12:32 WrapperNode [2018-12-01 20:12:32,514 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 20:12:32,514 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 20:12:32,514 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 20:12:32,514 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 20:12:32,519 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:12:32" (1/1) ... [2018-12-01 20:12:32,525 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:12:32" (1/1) ... [2018-12-01 20:12:32,541 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 20:12:32,542 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 20:12:32,542 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 20:12:32,542 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 20:12:32,547 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:12:32" (1/1) ... [2018-12-01 20:12:32,547 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:12:32" (1/1) ... [2018-12-01 20:12:32,549 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:12:32" (1/1) ... [2018-12-01 20:12:32,549 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:12:32" (1/1) ... [2018-12-01 20:12:32,552 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:12:32" (1/1) ... [2018-12-01 20:12:32,557 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:12:32" (1/1) ... [2018-12-01 20:12:32,558 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:12:32" (1/1) ... [2018-12-01 20:12:32,560 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 20:12:32,560 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 20:12:32,560 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 20:12:32,560 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 20:12:32,561 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:12:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a750b57-3ce2-4c64-961d-51f8ca4e7863/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 20:12:32,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 20:12:32,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 20:12:32,891 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 20:12:32,891 INFO L280 CfgBuilder]: Removed 17 assue(true) statements. [2018-12-01 20:12:32,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 08:12:32 BoogieIcfgContainer [2018-12-01 20:12:32,892 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 20:12:32,892 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-01 20:12:32,892 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-01 20:12:32,895 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-01 20:12:32,895 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 20:12:32,896 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.12 08:12:32" (1/3) ... [2018-12-01 20:12:32,896 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@57ae63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 08:12:32, skipping insertion in model container [2018-12-01 20:12:32,896 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 20:12:32,897 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 08:12:32" (2/3) ... [2018-12-01 20:12:32,897 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@57ae63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 08:12:32, skipping insertion in model container [2018-12-01 20:12:32,897 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 20:12:32,897 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 08:12:32" (3/3) ... [2018-12-01 20:12:32,898 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_floodmax.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c [2018-12-01 20:12:32,929 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 20:12:32,929 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-01 20:12:32,929 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-01 20:12:32,929 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-01 20:12:32,929 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 20:12:32,929 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 20:12:32,929 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-01 20:12:32,930 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 20:12:32,930 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-01 20:12:32,939 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states. [2018-12-01 20:12:32,954 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2018-12-01 20:12:32,955 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 20:12:32,955 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 20:12:32,960 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 20:12:32,960 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 20:12:32,960 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-01 20:12:32,960 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states. [2018-12-01 20:12:32,963 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2018-12-01 20:12:32,963 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 20:12:32,963 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 20:12:32,964 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 20:12:32,964 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 20:12:32,969 INFO L794 eck$LassoCheckResult]: Stem: 86#ULTIMATE.startENTRYtrue ~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~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]; 12#L-1true havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~ret33, main_#t~ret34, main_#t~post35, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet6;havoc main_#t~nondet6;~ep13~0 := main_#t~nondet7;havoc main_#t~nondet7;~ep21~0 := main_#t~nondet8;havoc main_#t~nondet8;~ep23~0 := main_#t~nondet9;havoc main_#t~nondet9;~ep31~0 := main_#t~nondet10;havoc main_#t~nondet10;~ep32~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~nl1~0 := main_#t~nondet15;havoc main_#t~nondet15;~m1~0 := main_#t~nondet16;havoc main_#t~nondet16;~max1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~0 := main_#t~nondet18;havoc main_#t~nondet18;~id2~0 := main_#t~nondet19;havoc main_#t~nondet19;~r2~0 := main_#t~nondet20;havoc main_#t~nondet20;~st2~0 := main_#t~nondet21;havoc main_#t~nondet21;~nl2~0 := main_#t~nondet22;havoc main_#t~nondet22;~m2~0 := main_#t~nondet23;havoc main_#t~nondet23;~max2~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode2~0 := main_#t~nondet25;havoc main_#t~nondet25;~id3~0 := main_#t~nondet26;havoc main_#t~nondet26;~r3~0 := main_#t~nondet27;havoc main_#t~nondet27;~st3~0 := main_#t~nondet28;havoc main_#t~nondet28;~nl3~0 := main_#t~nondet29;havoc main_#t~nondet29;~m3~0 := main_#t~nondet30;havoc main_#t~nondet30;~max3~0 := main_#t~nondet31;havoc main_#t~nondet31;~mode3~0 := main_#t~nondet32;havoc main_#t~nondet32;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r211~0, init_~r231~0, init_~r311~0, init_~r321~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r212~0, init_~tmp___1~0, init_~r232~0, init_~tmp___2~0, init_~r312~0, init_~tmp___3~0, init_~r322~0, init_~tmp___4~0, init_~tmp___5~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r212~0;havoc init_~tmp___1~0;havoc init_~r232~0;havoc init_~tmp___2~0;havoc init_~r312~0;havoc init_~tmp___3~0;havoc init_~r322~0;havoc init_~tmp___4~0;havoc init_~tmp___5~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0; 9#L274true assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 116#L277-1true init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 50#L287true assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 40#L290-1true init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 88#L300true assume 0 != init_~r211~0 % 256;init_~tmp___1~0 := 1; 77#L303-1true init_~r212~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 105#L313true assume 0 != init_~r231~0 % 256;init_~tmp___2~0 := 1; 103#L316-1true init_~r232~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 29#L326true assume 0 != init_~r311~0 % 256;init_~tmp___3~0 := 1; 15#L329-1true init_~r312~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 53#L339true assume 0 != init_~r321~0 % 256;init_~tmp___4~0 := 1; 49#L342-1true init_~r322~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 93#L352true assume !(~id1~0 != ~id2~0);init_~tmp___5~0 := 0; 96#L352-1true init_#res := init_~tmp___5~0; 113#L437true main_#t~ret33 := init_#res;main_~i2~0 := main_#t~ret33;havoc main_#t~ret33;assume 0 != main_~i2~0;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0 := 0; 84#L545-2true [2018-12-01 20:12:32,970 INFO L796 eck$LassoCheckResult]: Loop: 84#L545-2true assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_#t~ite1; 17#L120true assume !(0 != ~mode1~0 % 256); 108#L145true assume !(~r1~0 < 2); 106#L145-1true ~mode1~0 := 1; 16#L120-2true havoc node2_#t~ite2, node2_#t~ite3; 56#L163true assume !(0 != ~mode2~0 % 256); 36#L188true assume !(~r2~0 < 2); 34#L188-1true ~mode2~0 := 1; 55#L163-2true havoc node3_#t~ite4, node3_#t~ite5; 104#L206true assume !(0 != ~mode3~0 % 256); 83#L231true assume !(~r3~0 < 2); 82#L231-1true ~mode3~0 := 1; 101#L206-2true ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 119#L445true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 121#L445-1true check_#res := check_~tmp~1; 60#L493true main_#t~ret34 := check_#res;main_~c1~0 := main_#t~ret34;havoc main_#t~ret34;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 97#L575true assume !(0 == assert_~arg % 256); 78#L570true main_#t~post35 := main_~i2~0;main_~i2~0 := 1 + main_#t~post35;havoc main_#t~post35; 84#L545-2true [2018-12-01 20:12:32,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:12:32,973 INFO L82 PathProgramCache]: Analyzing trace with hash -2018347568, now seen corresponding path program 1 times [2018-12-01 20:12:32,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:12:32,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:12:33,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:12:33,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 20:12:33,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:12:33,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 20:12:33,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 20:12:33,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 20:12:33,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 20:12:33,094 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-01 20:12:33,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:12:33,094 INFO L82 PathProgramCache]: Analyzing trace with hash 980302415, now seen corresponding path program 1 times [2018-12-01 20:12:33,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:12:33,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:12:33,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:12:33,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 20:12:33,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:12:33,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 20:12:33,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 20:12:33,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 20:12:33,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 20:12:33,128 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-01 20:12:33,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 20:12:33,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 20:12:33,138 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 4 states. [2018-12-01 20:12:33,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 20:12:33,189 INFO L93 Difference]: Finished difference Result 124 states and 210 transitions. [2018-12-01 20:12:33,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 20:12:33,191 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 210 transitions. [2018-12-01 20:12:33,193 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2018-12-01 20:12:33,197 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 117 states and 183 transitions. [2018-12-01 20:12:33,197 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 117 [2018-12-01 20:12:33,198 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 117 [2018-12-01 20:12:33,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 117 states and 183 transitions. [2018-12-01 20:12:33,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 20:12:33,199 INFO L705 BuchiCegarLoop]: Abstraction has 117 states and 183 transitions. [2018-12-01 20:12:33,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states and 183 transitions. [2018-12-01 20:12:33,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-12-01 20:12:33,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-12-01 20:12:33,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 183 transitions. [2018-12-01 20:12:33,219 INFO L728 BuchiCegarLoop]: Abstraction has 117 states and 183 transitions. [2018-12-01 20:12:33,219 INFO L608 BuchiCegarLoop]: Abstraction has 117 states and 183 transitions. [2018-12-01 20:12:33,219 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-01 20:12:33,220 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states and 183 transitions. [2018-12-01 20:12:33,220 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2018-12-01 20:12:33,221 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 20:12:33,221 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 20:12:33,221 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 20:12:33,221 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 20:12:33,222 INFO L794 eck$LassoCheckResult]: Stem: 371#ULTIMATE.startENTRY ~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~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]; 279#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~ret33, main_#t~ret34, main_#t~post35, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet6;havoc main_#t~nondet6;~ep13~0 := main_#t~nondet7;havoc main_#t~nondet7;~ep21~0 := main_#t~nondet8;havoc main_#t~nondet8;~ep23~0 := main_#t~nondet9;havoc main_#t~nondet9;~ep31~0 := main_#t~nondet10;havoc main_#t~nondet10;~ep32~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~nl1~0 := main_#t~nondet15;havoc main_#t~nondet15;~m1~0 := main_#t~nondet16;havoc main_#t~nondet16;~max1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~0 := main_#t~nondet18;havoc main_#t~nondet18;~id2~0 := main_#t~nondet19;havoc main_#t~nondet19;~r2~0 := main_#t~nondet20;havoc main_#t~nondet20;~st2~0 := main_#t~nondet21;havoc main_#t~nondet21;~nl2~0 := main_#t~nondet22;havoc main_#t~nondet22;~m2~0 := main_#t~nondet23;havoc main_#t~nondet23;~max2~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode2~0 := main_#t~nondet25;havoc main_#t~nondet25;~id3~0 := main_#t~nondet26;havoc main_#t~nondet26;~r3~0 := main_#t~nondet27;havoc main_#t~nondet27;~st3~0 := main_#t~nondet28;havoc main_#t~nondet28;~nl3~0 := main_#t~nondet29;havoc main_#t~nondet29;~m3~0 := main_#t~nondet30;havoc main_#t~nondet30;~max3~0 := main_#t~nondet31;havoc main_#t~nondet31;~mode3~0 := main_#t~nondet32;havoc main_#t~nondet32;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r211~0, init_~r231~0, init_~r311~0, init_~r321~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r212~0, init_~tmp___1~0, init_~r232~0, init_~tmp___2~0, init_~r312~0, init_~tmp___3~0, init_~r322~0, init_~tmp___4~0, init_~tmp___5~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r212~0;havoc init_~tmp___1~0;havoc init_~r232~0;havoc init_~tmp___2~0;havoc init_~r312~0;havoc init_~tmp___3~0;havoc init_~r322~0;havoc init_~tmp___4~0;havoc init_~tmp___5~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0; 274#L274 assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 275#L277-1 init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 340#L287 assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 327#L290-1 init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 328#L300 assume 0 != init_~r211~0 % 256;init_~tmp___1~0 := 1; 310#L303-1 init_~r212~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 366#L313 assume 0 != init_~r231~0 % 256;init_~tmp___2~0 := 1; 345#L316-1 init_~r232~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 308#L326 assume 0 != init_~r311~0 % 256;init_~tmp___3~0 := 1; 282#L329-1 init_~r312~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 284#L339 assume 0 != init_~r321~0 % 256;init_~tmp___4~0 := 1; 273#L342-1 init_~r322~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 339#L352 assume ~id1~0 != ~id2~0; 337#L353 assume ~id1~0 != ~id3~0; 270#L354 assume ~id2~0 != ~id3~0; 271#L355 assume ~id1~0 >= 0; 311#L356 assume ~id2~0 >= 0; 312#L357 assume ~id3~0 >= 0; 365#L358 assume 0 == ~r1~0; 306#L359 assume 0 == ~r2~0; 307#L360 assume 0 == ~r3~0; 343#L361 assume ~max1~0 == ~id1~0; 299#L362 assume ~max2~0 == ~id2~0; 300#L363 assume ~max3~0 == ~id3~0; 336#L364 assume 0 == ~st1~0; 268#L365 assume 0 == ~st2~0; 269#L366 assume 0 == ~st3~0; 333#L367 assume 0 == ~nl1~0; 334#L368 assume 0 == ~nl2~0; 364#L369 assume 0 == ~nl3~0; 304#L370 assume 0 == ~mode1~0 % 256; 305#L371 assume 0 == ~mode2~0 % 256; 341#L372 assume 0 == ~mode3~0 % 256;init_~tmp___5~0 := 1; 342#L352-1 init_#res := init_~tmp___5~0; 373#L437 main_#t~ret33 := init_#res;main_~i2~0 := main_#t~ret33;havoc main_#t~ret33;assume 0 != main_~i2~0;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0 := 0; 368#L545-2 [2018-12-01 20:12:33,222 INFO L796 eck$LassoCheckResult]: Loop: 368#L545-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_#t~ite1; 287#L120 assume !(0 != ~mode1~0 % 256); 288#L145 assume !(~r1~0 < 2); 278#L145-1 ~mode1~0 := 1; 285#L120-2 havoc node2_#t~ite2, node2_#t~ite3; 286#L163 assume !(0 != ~mode2~0 % 256); 318#L188 assume !(~r2~0 < 2); 313#L188-1 ~mode2~0 := 1; 314#L163-2 havoc node3_#t~ite4, node3_#t~ite5; 346#L206 assume !(0 != ~mode3~0 % 256); 370#L231 assume !(~r3~0 < 2); 317#L231-1 ~mode3~0 := 1; 369#L206-2 ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 374#L445 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 325#L445-1 check_#res := check_~tmp~1; 350#L493 main_#t~ret34 := check_#res;main_~c1~0 := main_#t~ret34;havoc main_#t~ret34;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 351#L575 assume !(0 == assert_~arg % 256); 367#L570 main_#t~post35 := main_~i2~0;main_~i2~0 := 1 + main_#t~post35;havoc main_#t~post35; 368#L545-2 [2018-12-01 20:12:33,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:12:33,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1347795084, now seen corresponding path program 1 times [2018-12-01 20:12:33,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:12:33,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:12:33,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:12:33,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 20:12:33,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:12:33,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:12:33,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:12:33,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:12:33,279 INFO L82 PathProgramCache]: Analyzing trace with hash 980302415, now seen corresponding path program 2 times [2018-12-01 20:12:33,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:12:33,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:12:33,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:12:33,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 20:12:33,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:12:33,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 20:12:33,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 20:12:33,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 20:12:33,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 20:12:33,312 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-01 20:12:33,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 20:12:33,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 20:12:33,313 INFO L87 Difference]: Start difference. First operand 117 states and 183 transitions. cyclomatic complexity: 67 Second operand 5 states. [2018-12-01 20:12:33,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 20:12:33,348 INFO L93 Difference]: Finished difference Result 120 states and 185 transitions. [2018-12-01 20:12:33,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 20:12:33,349 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 185 transitions. [2018-12-01 20:12:33,350 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2018-12-01 20:12:33,350 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 117 states and 175 transitions. [2018-12-01 20:12:33,350 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 117 [2018-12-01 20:12:33,350 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 117 [2018-12-01 20:12:33,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 117 states and 175 transitions. [2018-12-01 20:12:33,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 20:12:33,351 INFO L705 BuchiCegarLoop]: Abstraction has 117 states and 175 transitions. [2018-12-01 20:12:33,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states and 175 transitions. [2018-12-01 20:12:33,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-12-01 20:12:33,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-12-01 20:12:33,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 175 transitions. [2018-12-01 20:12:33,354 INFO L728 BuchiCegarLoop]: Abstraction has 117 states and 175 transitions. [2018-12-01 20:12:33,354 INFO L608 BuchiCegarLoop]: Abstraction has 117 states and 175 transitions. [2018-12-01 20:12:33,354 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-01 20:12:33,354 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states and 175 transitions. [2018-12-01 20:12:33,355 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2018-12-01 20:12:33,355 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 20:12:33,355 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 20:12:33,356 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 20:12:33,356 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 20:12:33,356 INFO L794 eck$LassoCheckResult]: Stem: 620#ULTIMATE.startENTRY ~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~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]; 528#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~ret33, main_#t~ret34, main_#t~post35, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet6;havoc main_#t~nondet6;~ep13~0 := main_#t~nondet7;havoc main_#t~nondet7;~ep21~0 := main_#t~nondet8;havoc main_#t~nondet8;~ep23~0 := main_#t~nondet9;havoc main_#t~nondet9;~ep31~0 := main_#t~nondet10;havoc main_#t~nondet10;~ep32~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~nl1~0 := main_#t~nondet15;havoc main_#t~nondet15;~m1~0 := main_#t~nondet16;havoc main_#t~nondet16;~max1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~0 := main_#t~nondet18;havoc main_#t~nondet18;~id2~0 := main_#t~nondet19;havoc main_#t~nondet19;~r2~0 := main_#t~nondet20;havoc main_#t~nondet20;~st2~0 := main_#t~nondet21;havoc main_#t~nondet21;~nl2~0 := main_#t~nondet22;havoc main_#t~nondet22;~m2~0 := main_#t~nondet23;havoc main_#t~nondet23;~max2~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode2~0 := main_#t~nondet25;havoc main_#t~nondet25;~id3~0 := main_#t~nondet26;havoc main_#t~nondet26;~r3~0 := main_#t~nondet27;havoc main_#t~nondet27;~st3~0 := main_#t~nondet28;havoc main_#t~nondet28;~nl3~0 := main_#t~nondet29;havoc main_#t~nondet29;~m3~0 := main_#t~nondet30;havoc main_#t~nondet30;~max3~0 := main_#t~nondet31;havoc main_#t~nondet31;~mode3~0 := main_#t~nondet32;havoc main_#t~nondet32;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r211~0, init_~r231~0, init_~r311~0, init_~r321~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r212~0, init_~tmp___1~0, init_~r232~0, init_~tmp___2~0, init_~r312~0, init_~tmp___3~0, init_~r322~0, init_~tmp___4~0, init_~tmp___5~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r212~0;havoc init_~tmp___1~0;havoc init_~r232~0;havoc init_~tmp___2~0;havoc init_~r312~0;havoc init_~tmp___3~0;havoc init_~r322~0;havoc init_~tmp___4~0;havoc init_~tmp___5~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0; 523#L274 assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 524#L277-1 init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 588#L287 assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 575#L290-1 init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 576#L300 assume 0 != init_~r211~0 % 256;init_~tmp___1~0 := 1; 559#L303-1 init_~r212~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 615#L313 assume 0 != init_~r231~0 % 256;init_~tmp___2~0 := 1; 593#L316-1 init_~r232~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 557#L326 assume 0 != init_~r311~0 % 256;init_~tmp___3~0 := 1; 531#L329-1 init_~r312~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 533#L339 assume 0 != init_~r321~0 % 256;init_~tmp___4~0 := 1; 522#L342-1 init_~r322~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 587#L352 assume ~id1~0 != ~id2~0; 585#L353 assume ~id1~0 != ~id3~0; 519#L354 assume ~id2~0 != ~id3~0; 520#L355 assume ~id1~0 >= 0; 560#L356 assume ~id2~0 >= 0; 561#L357 assume ~id3~0 >= 0; 614#L358 assume 0 == ~r1~0; 555#L359 assume 0 == ~r2~0; 556#L360 assume 0 == ~r3~0; 591#L361 assume ~max1~0 == ~id1~0; 548#L362 assume ~max2~0 == ~id2~0; 549#L363 assume ~max3~0 == ~id3~0; 584#L364 assume 0 == ~st1~0; 517#L365 assume 0 == ~st2~0; 518#L366 assume 0 == ~st3~0; 581#L367 assume 0 == ~nl1~0; 582#L368 assume 0 == ~nl2~0; 613#L369 assume 0 == ~nl3~0; 553#L370 assume 0 == ~mode1~0 % 256; 554#L371 assume 0 == ~mode2~0 % 256; 589#L372 assume 0 == ~mode3~0 % 256;init_~tmp___5~0 := 1; 590#L352-1 init_#res := init_~tmp___5~0; 622#L437 main_#t~ret33 := init_#res;main_~i2~0 := main_#t~ret33;havoc main_#t~ret33;assume 0 != main_~i2~0;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0 := 0; 617#L545-2 [2018-12-01 20:12:33,356 INFO L796 eck$LassoCheckResult]: Loop: 617#L545-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_#t~ite1; 536#L120 assume !(0 != ~mode1~0 % 256); 537#L145 assume !(~r1~0 < 2); 527#L145-1 ~mode1~0 := 1; 534#L120-2 havoc node2_#t~ite2, node2_#t~ite3; 535#L163 assume !(0 != ~mode2~0 % 256); 567#L188 assume !(~r2~0 < 2); 562#L188-1 ~mode2~0 := 1; 563#L163-2 havoc node3_#t~ite4, node3_#t~ite5; 594#L206 assume !(0 != ~mode3~0 % 256); 619#L231 assume !(~r3~0 < 2); 566#L231-1 ~mode3~0 := 1; 618#L206-2 ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 623#L445 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 609#L446 assume ~st1~0 + ~nl1~0 <= 1; 573#L447 assume ~st2~0 + ~nl2~0 <= 1; 574#L448 assume ~st3~0 + ~nl3~0 <= 1; 604#L449 assume ~r1~0 >= 2; 539#L453 assume ~r1~0 < 2; 540#L458 assume ~r1~0 >= 2; 571#L463 assume ~r1~0 < 2;check_~tmp~1 := 1; 596#L445-1 check_#res := check_~tmp~1; 599#L493 main_#t~ret34 := check_#res;main_~c1~0 := main_#t~ret34;havoc main_#t~ret34;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 600#L575 assume !(0 == assert_~arg % 256); 616#L570 main_#t~post35 := main_~i2~0;main_~i2~0 := 1 + main_#t~post35;havoc main_#t~post35; 617#L545-2 [2018-12-01 20:12:33,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:12:33,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1347795084, now seen corresponding path program 2 times [2018-12-01 20:12:33,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:12:33,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:12:33,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:12:33,357 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 20:12:33,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:12:33,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:12:33,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:12:33,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:12:33,387 INFO L82 PathProgramCache]: Analyzing trace with hash 14333785, now seen corresponding path program 1 times [2018-12-01 20:12:33,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:12:33,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:12:33,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:12:33,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 20:12:33,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:12:33,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 20:12:33,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 20:12:33,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 20:12:33,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 20:12:33,405 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-01 20:12:33,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 20:12:33,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 20:12:33,405 INFO L87 Difference]: Start difference. First operand 117 states and 175 transitions. cyclomatic complexity: 59 Second operand 3 states. [2018-12-01 20:12:33,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 20:12:33,435 INFO L93 Difference]: Finished difference Result 169 states and 252 transitions. [2018-12-01 20:12:33,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 20:12:33,435 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 169 states and 252 transitions. [2018-12-01 20:12:33,436 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 120 [2018-12-01 20:12:33,437 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 169 states to 169 states and 252 transitions. [2018-12-01 20:12:33,437 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 169 [2018-12-01 20:12:33,438 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 169 [2018-12-01 20:12:33,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 169 states and 252 transitions. [2018-12-01 20:12:33,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 20:12:33,439 INFO L705 BuchiCegarLoop]: Abstraction has 169 states and 252 transitions. [2018-12-01 20:12:33,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states and 252 transitions. [2018-12-01 20:12:33,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-12-01 20:12:33,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-12-01 20:12:33,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 252 transitions. [2018-12-01 20:12:33,446 INFO L728 BuchiCegarLoop]: Abstraction has 169 states and 252 transitions. [2018-12-01 20:12:33,446 INFO L608 BuchiCegarLoop]: Abstraction has 169 states and 252 transitions. [2018-12-01 20:12:33,446 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-01 20:12:33,446 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 169 states and 252 transitions. [2018-12-01 20:12:33,447 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 120 [2018-12-01 20:12:33,447 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 20:12:33,448 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 20:12:33,449 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 20:12:33,449 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 20:12:33,449 INFO L794 eck$LassoCheckResult]: Stem: 912#ULTIMATE.startENTRY ~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~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]; 821#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~ret33, main_#t~ret34, main_#t~post35, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet6;havoc main_#t~nondet6;~ep13~0 := main_#t~nondet7;havoc main_#t~nondet7;~ep21~0 := main_#t~nondet8;havoc main_#t~nondet8;~ep23~0 := main_#t~nondet9;havoc main_#t~nondet9;~ep31~0 := main_#t~nondet10;havoc main_#t~nondet10;~ep32~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~nl1~0 := main_#t~nondet15;havoc main_#t~nondet15;~m1~0 := main_#t~nondet16;havoc main_#t~nondet16;~max1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~0 := main_#t~nondet18;havoc main_#t~nondet18;~id2~0 := main_#t~nondet19;havoc main_#t~nondet19;~r2~0 := main_#t~nondet20;havoc main_#t~nondet20;~st2~0 := main_#t~nondet21;havoc main_#t~nondet21;~nl2~0 := main_#t~nondet22;havoc main_#t~nondet22;~m2~0 := main_#t~nondet23;havoc main_#t~nondet23;~max2~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode2~0 := main_#t~nondet25;havoc main_#t~nondet25;~id3~0 := main_#t~nondet26;havoc main_#t~nondet26;~r3~0 := main_#t~nondet27;havoc main_#t~nondet27;~st3~0 := main_#t~nondet28;havoc main_#t~nondet28;~nl3~0 := main_#t~nondet29;havoc main_#t~nondet29;~m3~0 := main_#t~nondet30;havoc main_#t~nondet30;~max3~0 := main_#t~nondet31;havoc main_#t~nondet31;~mode3~0 := main_#t~nondet32;havoc main_#t~nondet32;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r211~0, init_~r231~0, init_~r311~0, init_~r321~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r212~0, init_~tmp___1~0, init_~r232~0, init_~tmp___2~0, init_~r312~0, init_~tmp___3~0, init_~r322~0, init_~tmp___4~0, init_~tmp___5~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r212~0;havoc init_~tmp___1~0;havoc init_~r232~0;havoc init_~tmp___2~0;havoc init_~r312~0;havoc init_~tmp___3~0;havoc init_~r322~0;havoc init_~tmp___4~0;havoc init_~tmp___5~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0; 816#L274 assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 817#L277-1 init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 881#L287 assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 867#L290-1 init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 868#L300 assume 0 != init_~r211~0 % 256;init_~tmp___1~0 := 1; 851#L303-1 init_~r212~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 907#L313 assume 0 != init_~r231~0 % 256;init_~tmp___2~0 := 1; 886#L316-1 init_~r232~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 849#L326 assume 0 != init_~r311~0 % 256;init_~tmp___3~0 := 1; 824#L329-1 init_~r312~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 826#L339 assume 0 != init_~r321~0 % 256;init_~tmp___4~0 := 1; 815#L342-1 init_~r322~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 880#L352 assume ~id1~0 != ~id2~0; 878#L353 assume ~id1~0 != ~id3~0; 812#L354 assume ~id2~0 != ~id3~0; 813#L355 assume ~id1~0 >= 0; 852#L356 assume ~id2~0 >= 0; 853#L357 assume ~id3~0 >= 0; 906#L358 assume 0 == ~r1~0; 847#L359 assume 0 == ~r2~0; 848#L360 assume 0 == ~r3~0; 884#L361 assume ~max1~0 == ~id1~0; 840#L362 assume ~max2~0 == ~id2~0; 841#L363 assume ~max3~0 == ~id3~0; 877#L364 assume 0 == ~st1~0; 810#L365 assume 0 == ~st2~0; 811#L366 assume 0 == ~st3~0; 873#L367 assume 0 == ~nl1~0; 874#L368 assume 0 == ~nl2~0; 905#L369 assume 0 == ~nl3~0; 845#L370 assume 0 == ~mode1~0 % 256; 846#L371 assume 0 == ~mode2~0 % 256; 882#L372 assume 0 == ~mode3~0 % 256;init_~tmp___5~0 := 1; 883#L352-1 init_#res := init_~tmp___5~0; 917#L437 main_#t~ret33 := init_#res;main_~i2~0 := main_#t~ret33;havoc main_#t~ret33;assume 0 != main_~i2~0;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0 := 0; 923#L545-2 [2018-12-01 20:12:33,449 INFO L796 eck$LassoCheckResult]: Loop: 923#L545-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_#t~ite1; 965#L120 assume !(0 != ~mode1~0 % 256); 964#L145 assume ~r1~0 < 2; 896#L146 assume !(0 != ~ep12~0 % 256); 835#L146-2 assume !(0 != ~ep13~0 % 256); 820#L145-1 ~mode1~0 := 1; 827#L120-2 havoc node2_#t~ite2, node2_#t~ite3; 828#L163 assume !(0 != ~mode2~0 % 256); 859#L188 assume !(~r2~0 < 2); 854#L188-1 ~mode2~0 := 1; 855#L163-2 havoc node3_#t~ite4, node3_#t~ite5; 887#L206 assume !(0 != ~mode3~0 % 256); 920#L231 assume !(~r3~0 < 2); 936#L231-1 ~mode3~0 := 1; 934#L206-2 ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 932#L445 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 931#L446 assume ~st1~0 + ~nl1~0 <= 1; 930#L447 assume ~st2~0 + ~nl2~0 <= 1; 929#L448 assume ~st3~0 + ~nl3~0 <= 1; 928#L449 assume !(~r1~0 >= 2); 875#L452 assume 0 == ~st1~0 + ~st2~0 + ~st3~0; 876#L453 assume ~r1~0 < 2; 933#L458 assume !(~r1~0 >= 2); 913#L462 assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; 914#L463 assume ~r1~0 < 2;check_~tmp~1 := 1; 969#L445-1 check_#res := check_~tmp~1; 968#L493 main_#t~ret34 := check_#res;main_~c1~0 := main_#t~ret34;havoc main_#t~ret34;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 967#L575 assume !(0 == assert_~arg % 256); 966#L570 main_#t~post35 := main_~i2~0;main_~i2~0 := 1 + main_#t~post35;havoc main_#t~post35; 923#L545-2 [2018-12-01 20:12:33,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:12:33,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1347795084, now seen corresponding path program 3 times [2018-12-01 20:12:33,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:12:33,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:12:33,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:12:33,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 20:12:33,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:12:33,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:12:33,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:12:33,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:12:33,489 INFO L82 PathProgramCache]: Analyzing trace with hash -67119798, now seen corresponding path program 1 times [2018-12-01 20:12:33,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:12:33,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:12:33,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:12:33,490 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 20:12:33,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:12:33,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:12:33,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 20:12:33,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:12:33,506 INFO L82 PathProgramCache]: Analyzing trace with hash -708835657, now seen corresponding path program 1 times [2018-12-01 20:12:33,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 20:12:33,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 20:12:33,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:12:33,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 20:12:33,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 20:12:33,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 20:12:33,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 20:12:33,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 20:12:33,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 20:12:33,711 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 100 [2018-12-01 20:12:33,782 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 20:12:33,782 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 20:12:33,782 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 20:12:33,783 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 20:12:33,783 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-01 20:12:33,783 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 20:12:33,783 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 20:12:33,783 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 20:12:33,783 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c_Iteration4_Loop [2018-12-01 20:12:33,783 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 20:12:33,783 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 20:12:33,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:12:33,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:12:33,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:12:33,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:12:33,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:12:33,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:12:33,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:12:33,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:12:33,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:12:33,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:12:33,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:12:33,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:12:33,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:12:33,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:12:33,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:12:33,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:12:33,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:12:33,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:12:33,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:12:33,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:12:33,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:12:33,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:12:33,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:12:33,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:12:33,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:12:33,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:12:34,121 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 20:12:34,122 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a750b57-3ce2-4c64-961d-51f8ca4e7863/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 20:12:34,125 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 20:12:34,125 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 20:12:34,135 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 20:12:34,136 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~ep12~0=-256} Honda state: {~ep12~0=-256} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a750b57-3ce2-4c64-961d-51f8ca4e7863/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 20:12:34,152 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 20:12:34,152 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a750b57-3ce2-4c64-961d-51f8ca4e7863/bin-2019/uautomizer/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 20:12:34,168 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-01 20:12:34,168 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 20:12:34,244 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-01 20:12:34,245 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 20:12:34,245 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 20:12:34,245 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 20:12:34,245 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 20:12:34,246 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 20:12:34,246 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 20:12:34,246 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 20:12:34,246 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 20:12:34,246 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c_Iteration4_Loop [2018-12-01 20:12:34,246 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 20:12:34,246 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 20:12:34,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:12:34,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:12:34,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:12:34,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:12:34,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:12:34,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:12:34,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:12:34,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:12:34,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:12:34,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:12:34,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:12:34,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:12:34,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:12:34,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:12:34,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:12:34,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:12:34,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:12:34,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:12:34,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:12:34,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:12:34,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:12:34,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:12:34,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:12:34,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:12:34,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:12:34,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 20:12:34,567 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 20:12:34,570 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 20:12:34,571 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 20:12:34,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:12:34,573 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 20:12:34,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:12:34,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:12:34,573 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:12:34,575 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 20:12:34,575 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 20:12:34,576 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:12:34,577 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 20:12:34,577 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:12:34,577 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 20:12:34,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:12:34,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:12:34,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:12:34,577 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 20:12:34,578 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 20:12:34,579 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:12:34,580 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 20:12:34,580 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:12:34,580 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:12:34,580 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:12:34,580 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:12:34,582 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 20:12:34,582 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:12:34,584 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:12:34,584 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 20:12:34,585 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:12:34,585 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 20:12:34,585 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:12:34,585 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:12:34,585 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:12:34,586 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 20:12:34,586 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 20:12:34,587 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:12:34,588 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 20:12:34,588 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:12:34,588 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 20:12:34,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:12:34,588 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:12:34,588 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:12:34,589 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 20:12:34,589 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 20:12:34,589 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:12:34,590 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 20:12:34,590 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:12:34,590 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 20:12:34,590 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:12:34,590 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:12:34,590 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:12:34,590 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 20:12:34,590 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 20:12:34,591 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:12:34,591 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 20:12:34,591 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:12:34,591 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 20:12:34,591 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:12:34,591 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:12:34,592 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:12:34,592 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 20:12:34,592 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 20:12:34,592 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:12:34,593 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 20:12:34,593 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:12:34,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:12:34,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:12:34,593 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:12:34,594 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 20:12:34,594 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:12:34,596 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:12:34,597 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 20:12:34,597 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:12:34,597 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 20:12:34,597 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:12:34,597 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:12:34,597 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:12:34,598 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 20:12:34,598 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 20:12:34,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:12:34,600 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 20:12:34,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:12:34,600 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 20:12:34,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:12:34,601 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:12:34,601 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:12:34,601 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 20:12:34,601 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 20:12:34,602 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:12:34,602 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 20:12:34,602 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:12:34,603 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 20:12:34,603 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:12:34,603 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:12:34,603 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:12:34,603 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 20:12:34,603 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 20:12:34,604 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:12:34,605 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 20:12:34,605 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:12:34,605 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 20:12:34,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:12:34,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:12:34,605 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:12:34,606 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 20:12:34,606 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 20:12:34,606 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:12:34,607 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 20:12:34,607 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:12:34,607 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 20:12:34,607 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:12:34,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:12:34,608 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:12:34,608 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 20:12:34,608 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 20:12:34,609 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:12:34,609 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 20:12:34,609 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:12:34,609 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:12:34,609 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:12:34,610 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:12:34,611 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 20:12:34,611 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 20:12:34,612 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:12:34,613 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 20:12:34,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:12:34,613 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 20:12:34,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:12:34,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:12:34,613 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:12:34,614 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 20:12:34,614 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 20:12:34,615 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 20:12:34,615 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 20:12:34,616 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 20:12:34,616 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 20:12:34,616 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 20:12:34,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 20:12:34,616 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 20:12:34,616 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 20:12:34,616 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 20:12:34,618 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 20:12:34,619 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-01 20:12:34,620 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-01 20:12:34,621 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 20:12:34,621 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-01 20:12:34,621 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 20:12:34,622 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 11 Supporting invariants [] [2018-12-01 20:12:34,622 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-01 20:12:34,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 20:12:34,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 20:12:34,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 20:12:34,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 20:12:34,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 20:12:34,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 20:12:34,707 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-01 20:12:34,708 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 169 states and 252 transitions. cyclomatic complexity: 84 Second operand 3 states. [2018-12-01 20:12:34,739 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 169 states and 252 transitions. cyclomatic complexity: 84. Second operand 3 states. Result 288 states and 437 transitions. Complement of second has 4 states. [2018-12-01 20:12:34,739 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 [2018-12-01 20:12:34,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 20:12:34,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 175 transitions. [2018-12-01 20:12:34,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 175 transitions. Stem has 37 letters. Loop has 29 letters. [2018-12-01 20:12:34,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 20:12:34,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 175 transitions. Stem has 66 letters. Loop has 29 letters. [2018-12-01 20:12:34,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 20:12:34,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 175 transitions. Stem has 37 letters. Loop has 58 letters. [2018-12-01 20:12:34,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 20:12:34,744 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 288 states and 437 transitions. [2018-12-01 20:12:34,746 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-01 20:12:34,746 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 288 states to 0 states and 0 transitions. [2018-12-01 20:12:34,746 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-01 20:12:34,746 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-01 20:12:34,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-01 20:12:34,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 20:12:34,746 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 20:12:34,746 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 20:12:34,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 20:12:34,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 20:12:34,747 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2018-12-01 20:12:34,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 20:12:34,747 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-12-01 20:12:34,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-01 20:12:34,747 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-12-01 20:12:34,747 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-01 20:12:34,748 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-12-01 20:12:34,748 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-01 20:12:34,748 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-01 20:12:34,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-01 20:12:34,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 20:12:34,748 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 20:12:34,748 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 20:12:34,748 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 20:12:34,748 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-01 20:12:34,748 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-01 20:12:34,748 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-01 20:12:34,749 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-01 20:12:34,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.12 08:12:34 BoogieIcfgContainer [2018-12-01 20:12:34,753 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-01 20:12:34,753 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 20:12:34,753 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 20:12:34,753 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 20:12:34,754 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 08:12:32" (3/4) ... [2018-12-01 20:12:34,757 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-01 20:12:34,757 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 20:12:34,757 INFO L168 Benchmark]: Toolchain (without parser) took 2488.67 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.3 MB). Free memory was 954.4 MB in the beginning and 868.9 MB in the end (delta: 85.4 MB). Peak memory consumption was 200.8 MB. Max. memory is 11.5 GB. [2018-12-01 20:12:34,758 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 20:12:34,758 INFO L168 Benchmark]: CACSL2BoogieTranslator took 244.12 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.3 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -158.7 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. [2018-12-01 20:12:34,759 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.14 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-01 20:12:34,759 INFO L168 Benchmark]: Boogie Preprocessor took 18.58 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-01 20:12:34,760 INFO L168 Benchmark]: RCFGBuilder took 331.53 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 11.5 GB. [2018-12-01 20:12:34,760 INFO L168 Benchmark]: BuchiAutomizer took 1860.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 868.9 MB in the end (delta: 186.8 MB). Peak memory consumption was 186.8 MB. Max. memory is 11.5 GB. [2018-12-01 20:12:34,761 INFO L168 Benchmark]: Witness Printer took 3.53 ms. Allocated memory is still 1.1 GB. Free memory is still 868.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 20:12:34,763 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 244.12 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.3 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -158.7 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.14 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.58 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 331.53 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1860.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 868.9 MB in the end (delta: 186.8 MB). Peak memory consumption was 186.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.53 ms. Allocated memory is still 1.1 GB. Free memory is still 868.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 11 and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.8s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 169 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 736 SDtfs, 347 SDslu, 1183 SDs, 0 SdLazy, 39 SolverSat, 38 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital139 mio100 ax125 hnf105 lsp20 ukn100 mio100 lsp100 div128 bol100 ite100 ukn100 eq175 hnf86 smp100 dnf100 smp100 tf102 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 4ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 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...