./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.4_false-unreach-call.1.ufo.BOUNDED-8.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_60dfd476-28df-4ad3-9675-2ed4479f3f02/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_60dfd476-28df-4ad3-9675-2ed4479f3f02/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_60dfd476-28df-4ad3-9675-2ed4479f3f02/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_60dfd476-28df-4ad3-9675-2ed4479f3f02/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.4_false-unreach-call.1.ufo.BOUNDED-8.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_60dfd476-28df-4ad3-9675-2ed4479f3f02/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_60dfd476-28df-4ad3-9675-2ed4479f3f02/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 8044e0aeebe72762497fc5ccaff76a34eb4c9821 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 03:07:57,594 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 03:07:57,595 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 03:07:57,602 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 03:07:57,603 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 03:07:57,603 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 03:07:57,604 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 03:07:57,605 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 03:07:57,606 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 03:07:57,607 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 03:07:57,608 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 03:07:57,608 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 03:07:57,608 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 03:07:57,609 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 03:07:57,610 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 03:07:57,611 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 03:07:57,611 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 03:07:57,613 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 03:07:57,614 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 03:07:57,615 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 03:07:57,616 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 03:07:57,617 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 03:07:57,619 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 03:07:57,619 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 03:07:57,619 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 03:07:57,620 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 03:07:57,621 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 03:07:57,621 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 03:07:57,622 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 03:07:57,623 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 03:07:57,623 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 03:07:57,623 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 03:07:57,624 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 03:07:57,624 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 03:07:57,624 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 03:07:57,625 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 03:07:57,625 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_60dfd476-28df-4ad3-9675-2ed4479f3f02/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-23 03:07:57,636 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 03:07:57,637 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 03:07:57,637 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 03:07:57,638 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 03:07:57,638 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 03:07:57,638 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 03:07:57,638 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 03:07:57,638 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 03:07:57,638 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 03:07:57,638 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 03:07:57,639 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 03:07:57,639 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 03:07:57,639 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 03:07:57,639 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 03:07:57,639 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 03:07:57,639 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 03:07:57,639 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 03:07:57,640 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 03:07:57,640 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 03:07:57,640 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 03:07:57,640 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 03:07:57,640 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 03:07:57,640 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 03:07:57,640 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 03:07:57,641 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 03:07:57,641 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 03:07:57,641 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 03:07:57,641 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 03:07:57,641 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 03:07:57,641 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 03:07:57,641 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 03:07:57,642 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 03:07:57,642 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_60dfd476-28df-4ad3-9675-2ed4479f3f02/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 -> 8044e0aeebe72762497fc5ccaff76a34eb4c9821 [2018-11-23 03:07:57,665 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 03:07:57,673 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 03:07:57,675 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 03:07:57,676 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 03:07:57,677 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 03:07:57,677 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_60dfd476-28df-4ad3-9675-2ed4479f3f02/bin-2019/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_lcr.4_false-unreach-call.1.ufo.BOUNDED-8.pals_true-termination.c [2018-11-23 03:07:57,714 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_60dfd476-28df-4ad3-9675-2ed4479f3f02/bin-2019/uautomizer/data/43c24091c/ab9c44c7776445e4b2696fdcd4432b5c/FLAGb4160737b [2018-11-23 03:07:58,172 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 03:07:58,172 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_60dfd476-28df-4ad3-9675-2ed4479f3f02/sv-benchmarks/c/seq-mthreaded/pals_lcr.4_false-unreach-call.1.ufo.BOUNDED-8.pals_true-termination.c [2018-11-23 03:07:58,180 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_60dfd476-28df-4ad3-9675-2ed4479f3f02/bin-2019/uautomizer/data/43c24091c/ab9c44c7776445e4b2696fdcd4432b5c/FLAGb4160737b [2018-11-23 03:07:58,192 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_60dfd476-28df-4ad3-9675-2ed4479f3f02/bin-2019/uautomizer/data/43c24091c/ab9c44c7776445e4b2696fdcd4432b5c [2018-11-23 03:07:58,195 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 03:07:58,196 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 03:07:58,197 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 03:07:58,197 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 03:07:58,200 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 03:07:58,201 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:07:58" (1/1) ... [2018-11-23 03:07:58,203 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15c458f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:07:58, skipping insertion in model container [2018-11-23 03:07:58,203 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:07:58" (1/1) ... [2018-11-23 03:07:58,212 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 03:07:58,238 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 03:07:58,396 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:07:58,401 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 03:07:58,429 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:07:58,482 INFO L195 MainTranslator]: Completed translation [2018-11-23 03:07:58,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:07:58 WrapperNode [2018-11-23 03:07:58,483 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 03:07:58,483 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 03:07:58,483 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 03:07:58,484 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 03:07:58,489 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:07:58" (1/1) ... [2018-11-23 03:07:58,495 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:07:58" (1/1) ... [2018-11-23 03:07:58,515 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 03:07:58,515 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 03:07:58,515 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 03:07:58,516 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 03:07:58,522 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:07:58" (1/1) ... [2018-11-23 03:07:58,522 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:07:58" (1/1) ... [2018-11-23 03:07:58,523 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:07:58" (1/1) ... [2018-11-23 03:07:58,524 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:07:58" (1/1) ... [2018-11-23 03:07:58,528 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:07:58" (1/1) ... [2018-11-23 03:07:58,534 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:07:58" (1/1) ... [2018-11-23 03:07:58,535 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:07:58" (1/1) ... [2018-11-23 03:07:58,537 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 03:07:58,538 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 03:07:58,538 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 03:07:58,538 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 03:07:58,539 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:07:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_60dfd476-28df-4ad3-9675-2ed4479f3f02/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:07:58,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 03:07:58,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 03:07:58,905 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 03:07:58,905 INFO L280 CfgBuilder]: Removed 19 assue(true) statements. [2018-11-23 03:07:58,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:07:58 BoogieIcfgContainer [2018-11-23 03:07:58,906 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 03:07:58,906 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 03:07:58,906 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 03:07:58,909 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 03:07:58,910 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 03:07:58,910 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 03:07:58" (1/3) ... [2018-11-23 03:07:58,911 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@120912d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:07:58, skipping insertion in model container [2018-11-23 03:07:58,911 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 03:07:58,911 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:07:58" (2/3) ... [2018-11-23 03:07:58,912 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@120912d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:07:58, skipping insertion in model container [2018-11-23 03:07:58,912 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 03:07:58,912 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:07:58" (3/3) ... [2018-11-23 03:07:58,913 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_lcr.4_false-unreach-call.1.ufo.BOUNDED-8.pals_true-termination.c [2018-11-23 03:07:58,949 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 03:07:58,949 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 03:07:58,949 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 03:07:58,949 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 03:07:58,949 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 03:07:58,949 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 03:07:58,949 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 03:07:58,950 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 03:07:58,950 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 03:07:58,960 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states. [2018-11-23 03:07:58,979 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2018-11-23 03:07:58,979 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:07:58,979 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:07:58,985 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 03:07:58,986 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] [2018-11-23 03:07:58,986 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 03:07:58,986 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states. [2018-11-23 03:07:58,989 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2018-11-23 03:07:58,990 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:07:58,990 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:07:58,990 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 03:07:58,991 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] [2018-11-23 03:07:58,996 INFO L794 eck$LassoCheckResult]: Stem: 33#ULTIMATE.startENTRYtrue ~r1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~mode1~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~mode2~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~mode3~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~mode4~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~0 := 0;~p4~0 := 0;~send4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset]; 10#L-1true havoc main_#res;havoc main_#t~nondet4, main_#t~nondet5, 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~ret21, main_#t~ret22, main_#t~post23, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet4;havoc main_#t~nondet4;~id1~0 := main_#t~nondet5;havoc main_#t~nondet5;~st1~0 := main_#t~nondet6;havoc main_#t~nondet6;~send1~0 := main_#t~nondet7;havoc main_#t~nondet7;~mode1~0 := main_#t~nondet8;havoc main_#t~nondet8;~id2~0 := main_#t~nondet9;havoc main_#t~nondet9;~st2~0 := main_#t~nondet10;havoc main_#t~nondet10;~send2~0 := main_#t~nondet11;havoc main_#t~nondet11;~mode2~0 := main_#t~nondet12;havoc main_#t~nondet12;~id3~0 := main_#t~nondet13;havoc main_#t~nondet13;~st3~0 := main_#t~nondet14;havoc main_#t~nondet14;~send3~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode3~0 := main_#t~nondet16;havoc main_#t~nondet16;~id4~0 := main_#t~nondet17;havoc main_#t~nondet17;~st4~0 := main_#t~nondet18;havoc main_#t~nondet18;~send4~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode4~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 22#L209true assume !(0 == ~r1~0);init_~tmp~0 := 0; 20#L209-1true init_#res := init_~tmp~0; 75#L302true main_#t~ret21 := init_#res;main_~i2~0 := main_#t~ret21;havoc main_#t~ret21;assume 0 != main_~i2~0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0 := 0; 62#L368-2true [2018-11-23 03:07:58,996 INFO L796 eck$LassoCheckResult]: Loop: 62#L368-2true assume !!(main_~i2~0 < 8);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 31#L106true assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 39#L110true assume !(node1_~m1~0 != ~nomsg~0); 35#L110-1true ~mode1~0 := 0; 7#L106-2true havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 65#L134true assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 48#L137true assume !(node2_~m2~0 != ~nomsg~0); 47#L137-1true ~mode2~0 := 0; 76#L134-2true havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 69#L159true assume !(0 != ~mode3~0 % 256); 34#L172true assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite2 := ~send3~0; 32#L172-2true ~p3_new~0 := (if node3_#t~ite2 % 256 <= 127 then node3_#t~ite2 % 256 else node3_#t~ite2 % 256 - 256);havoc node3_#t~ite2;~mode3~0 := 1; 46#L159-2true havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 58#L184true assume !(0 != ~mode4~0 % 256); 3#L197true assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite3 := ~send4~0; 16#L197-2true ~p4_new~0 := (if node4_#t~ite3 % 256 <= 127 then node4_#t~ite3 % 256 else node4_#t~ite3 % 256 - 256);havoc node4_#t~ite3;~mode4~0 := 1; 54#L184-2true ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 6#L310true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1 := 0; 8#L310-1true check_#res := check_~tmp~1; 49#L330true main_#t~ret22 := check_#res;main_~c1~0 := main_#t~ret22;havoc main_#t~ret22;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 28#L395true assume !(0 == assert_~arg % 256); 73#L390true main_#t~post23 := main_~i2~0;main_~i2~0 := 1 + main_#t~post23;havoc main_#t~post23; 62#L368-2true [2018-11-23 03:07:59,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:07:59,001 INFO L82 PathProgramCache]: Analyzing trace with hash 28826826, now seen corresponding path program 1 times [2018-11-23 03:07:59,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:07:59,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:07:59,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:07:59,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:07:59,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:07:59,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:07:59,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:07:59,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:07:59,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:07:59,123 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 03:07:59,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:07:59,124 INFO L82 PathProgramCache]: Analyzing trace with hash -293702655, now seen corresponding path program 1 times [2018-11-23 03:07:59,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:07:59,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:07:59,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:07:59,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:07:59,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:07:59,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:07:59,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:07:59,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:07:59,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 03:07:59,212 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 03:07:59,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 03:07:59,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 03:07:59,224 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 4 states. [2018-11-23 03:07:59,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:07:59,284 INFO L93 Difference]: Finished difference Result 76 states and 123 transitions. [2018-11-23 03:07:59,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 03:07:59,286 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 123 transitions. [2018-11-23 03:07:59,289 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2018-11-23 03:07:59,293 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 69 states and 94 transitions. [2018-11-23 03:07:59,294 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2018-11-23 03:07:59,294 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2018-11-23 03:07:59,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 94 transitions. [2018-11-23 03:07:59,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 03:07:59,295 INFO L705 BuchiCegarLoop]: Abstraction has 69 states and 94 transitions. [2018-11-23 03:07:59,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 94 transitions. [2018-11-23 03:07:59,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-11-23 03:07:59,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-23 03:07:59,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 94 transitions. [2018-11-23 03:07:59,321 INFO L728 BuchiCegarLoop]: Abstraction has 69 states and 94 transitions. [2018-11-23 03:07:59,321 INFO L608 BuchiCegarLoop]: Abstraction has 69 states and 94 transitions. [2018-11-23 03:07:59,321 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 03:07:59,321 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 94 transitions. [2018-11-23 03:07:59,322 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2018-11-23 03:07:59,322 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:07:59,322 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:07:59,323 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] [2018-11-23 03:07:59,323 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] [2018-11-23 03:07:59,323 INFO L794 eck$LassoCheckResult]: Stem: 212#ULTIMATE.startENTRY ~r1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~mode1~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~mode2~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~mode3~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~mode4~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~0 := 0;~p4~0 := 0;~send4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset]; 179#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~nondet5, 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~ret21, main_#t~ret22, main_#t~post23, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet4;havoc main_#t~nondet4;~id1~0 := main_#t~nondet5;havoc main_#t~nondet5;~st1~0 := main_#t~nondet6;havoc main_#t~nondet6;~send1~0 := main_#t~nondet7;havoc main_#t~nondet7;~mode1~0 := main_#t~nondet8;havoc main_#t~nondet8;~id2~0 := main_#t~nondet9;havoc main_#t~nondet9;~st2~0 := main_#t~nondet10;havoc main_#t~nondet10;~send2~0 := main_#t~nondet11;havoc main_#t~nondet11;~mode2~0 := main_#t~nondet12;havoc main_#t~nondet12;~id3~0 := main_#t~nondet13;havoc main_#t~nondet13;~st3~0 := main_#t~nondet14;havoc main_#t~nondet14;~send3~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode3~0 := main_#t~nondet16;havoc main_#t~nondet16;~id4~0 := main_#t~nondet17;havoc main_#t~nondet17;~st4~0 := main_#t~nondet18;havoc main_#t~nondet18;~send4~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode4~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 180#L209 assume 0 == ~r1~0; 198#L210 assume ~id1~0 >= 0; 222#L211 assume 0 == ~st1~0; 177#L212 assume ~send1~0 == ~id1~0; 178#L213 assume 0 == ~mode1~0 % 256; 226#L214 assume ~id2~0 >= 0; 184#L215 assume 0 == ~st2~0; 185#L216 assume ~send2~0 == ~id2~0; 215#L217 assume 0 == ~mode2~0 % 256; 230#L218 assume ~id3~0 >= 0; 167#L219 assume 0 == ~st3~0; 168#L220 assume ~send3~0 == ~id3~0; 199#L221 assume 0 == ~mode3~0 % 256; 224#L222 assume ~id4~0 >= 0; 205#L223 assume 0 == ~st4~0; 206#L224 assume ~send4~0 == ~id4~0; 227#L225 assume 0 == ~mode4~0 % 256; 186#L226 assume ~id1~0 != ~id2~0; 187#L227 assume ~id1~0 != ~id3~0; 216#L228 assume ~id1~0 != ~id4~0; 231#L229 assume ~id2~0 != ~id3~0; 169#L230 assume ~id2~0 != ~id4~0; 170#L231 assume ~id3~0 != ~id4~0;init_~tmp~0 := 1; 192#L209-1 init_#res := init_~tmp~0; 193#L302 main_#t~ret21 := init_#res;main_~i2~0 := main_#t~ret21;havoc main_#t~ret21;assume 0 != main_~i2~0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0 := 0; 232#L368-2 [2018-11-23 03:07:59,323 INFO L796 eck$LassoCheckResult]: Loop: 232#L368-2 assume !!(main_~i2~0 < 8);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 209#L106 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 210#L110 assume !(node1_~m1~0 != ~nomsg~0); 201#L110-1 ~mode1~0 := 0; 174#L106-2 havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 175#L134 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 225#L137 assume !(node2_~m2~0 != ~nomsg~0); 182#L137-1 ~mode2~0 := 0; 197#L134-2 havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 233#L159 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 228#L162 assume !(node3_~m3~0 != ~nomsg~0); 220#L162-1 ~mode3~0 := 0; 208#L159-2 havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 223#L184 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 194#L187 assume !(node4_~m4~0 != ~nomsg~0); 191#L187-1 ~mode4~0 := 0; 188#L184-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 171#L310 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1 := 0; 172#L310-1 check_#res := check_~tmp~1; 176#L330 main_#t~ret22 := check_#res;main_~c1~0 := main_#t~ret22;havoc main_#t~ret22;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 202#L395 assume !(0 == assert_~arg % 256); 203#L390 main_#t~post23 := main_~i2~0;main_~i2~0 := 1 + main_#t~post23;havoc main_#t~post23; 232#L368-2 [2018-11-23 03:07:59,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:07:59,323 INFO L82 PathProgramCache]: Analyzing trace with hash 370924325, now seen corresponding path program 1 times [2018-11-23 03:07:59,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:07:59,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:07:59,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:07:59,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:07:59,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:07:59,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:07:59,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:07:59,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:07:59,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1849481195, now seen corresponding path program 1 times [2018-11-23 03:07:59,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:07:59,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:07:59,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:07:59,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:07:59,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:07:59,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:07:59,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:07:59,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:07:59,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 03:07:59,444 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 03:07:59,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 03:07:59,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 03:07:59,444 INFO L87 Difference]: Start difference. First operand 69 states and 94 transitions. cyclomatic complexity: 26 Second operand 5 states. [2018-11-23 03:07:59,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:07:59,477 INFO L93 Difference]: Finished difference Result 72 states and 96 transitions. [2018-11-23 03:07:59,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 03:07:59,478 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 96 transitions. [2018-11-23 03:07:59,480 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2018-11-23 03:07:59,481 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 69 states and 91 transitions. [2018-11-23 03:07:59,482 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2018-11-23 03:07:59,482 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2018-11-23 03:07:59,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 91 transitions. [2018-11-23 03:07:59,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 03:07:59,483 INFO L705 BuchiCegarLoop]: Abstraction has 69 states and 91 transitions. [2018-11-23 03:07:59,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 91 transitions. [2018-11-23 03:07:59,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-11-23 03:07:59,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-23 03:07:59,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2018-11-23 03:07:59,486 INFO L728 BuchiCegarLoop]: Abstraction has 69 states and 91 transitions. [2018-11-23 03:07:59,487 INFO L608 BuchiCegarLoop]: Abstraction has 69 states and 91 transitions. [2018-11-23 03:07:59,487 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 03:07:59,487 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 91 transitions. [2018-11-23 03:07:59,488 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2018-11-23 03:07:59,488 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:07:59,488 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:07:59,489 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] [2018-11-23 03:07:59,489 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] [2018-11-23 03:07:59,489 INFO L794 eck$LassoCheckResult]: Stem: 365#ULTIMATE.startENTRY ~r1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~mode1~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~mode2~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~mode3~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~mode4~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~0 := 0;~p4~0 := 0;~send4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset]; 332#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~nondet5, 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~ret21, main_#t~ret22, main_#t~post23, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet4;havoc main_#t~nondet4;~id1~0 := main_#t~nondet5;havoc main_#t~nondet5;~st1~0 := main_#t~nondet6;havoc main_#t~nondet6;~send1~0 := main_#t~nondet7;havoc main_#t~nondet7;~mode1~0 := main_#t~nondet8;havoc main_#t~nondet8;~id2~0 := main_#t~nondet9;havoc main_#t~nondet9;~st2~0 := main_#t~nondet10;havoc main_#t~nondet10;~send2~0 := main_#t~nondet11;havoc main_#t~nondet11;~mode2~0 := main_#t~nondet12;havoc main_#t~nondet12;~id3~0 := main_#t~nondet13;havoc main_#t~nondet13;~st3~0 := main_#t~nondet14;havoc main_#t~nondet14;~send3~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode3~0 := main_#t~nondet16;havoc main_#t~nondet16;~id4~0 := main_#t~nondet17;havoc main_#t~nondet17;~st4~0 := main_#t~nondet18;havoc main_#t~nondet18;~send4~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode4~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 333#L209 assume 0 == ~r1~0; 351#L210 assume ~id1~0 >= 0; 375#L211 assume 0 == ~st1~0; 330#L212 assume ~send1~0 == ~id1~0; 331#L213 assume 0 == ~mode1~0 % 256; 379#L214 assume ~id2~0 >= 0; 337#L215 assume 0 == ~st2~0; 338#L216 assume ~send2~0 == ~id2~0; 368#L217 assume 0 == ~mode2~0 % 256; 383#L218 assume ~id3~0 >= 0; 320#L219 assume 0 == ~st3~0; 321#L220 assume ~send3~0 == ~id3~0; 352#L221 assume 0 == ~mode3~0 % 256; 376#L222 assume ~id4~0 >= 0; 358#L223 assume 0 == ~st4~0; 359#L224 assume ~send4~0 == ~id4~0; 380#L225 assume 0 == ~mode4~0 % 256; 339#L226 assume ~id1~0 != ~id2~0; 340#L227 assume ~id1~0 != ~id3~0; 369#L228 assume ~id1~0 != ~id4~0; 384#L229 assume ~id2~0 != ~id3~0; 322#L230 assume ~id2~0 != ~id4~0; 323#L231 assume ~id3~0 != ~id4~0;init_~tmp~0 := 1; 345#L209-1 init_#res := init_~tmp~0; 346#L302 main_#t~ret21 := init_#res;main_~i2~0 := main_#t~ret21;havoc main_#t~ret21;assume 0 != main_~i2~0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0 := 0; 385#L368-2 [2018-11-23 03:07:59,489 INFO L796 eck$LassoCheckResult]: Loop: 385#L368-2 assume !!(main_~i2~0 < 8);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 360#L106 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 361#L110 assume !(node1_~m1~0 != ~nomsg~0); 354#L110-1 ~mode1~0 := 0; 326#L106-2 havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 327#L134 assume !(0 != ~mode2~0 % 256); 357#L147 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; 349#L147-2 ~p2_new~0 := (if node2_#t~ite1 % 256 <= 127 then node2_#t~ite1 % 256 else node2_#t~ite1 % 256 - 256);havoc node2_#t~ite1;~mode2~0 := 1; 350#L134-2 havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 386#L159 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 381#L162 assume !(node3_~m3~0 != ~nomsg~0); 373#L162-1 ~mode3~0 := 0; 364#L159-2 havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 377#L184 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 347#L187 assume !(node4_~m4~0 != ~nomsg~0); 344#L187-1 ~mode4~0 := 0; 341#L184-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 324#L310 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 325#L311 assume ~r1~0 >= 4; 343#L315 assume ~r1~0 < 4;check_~tmp~1 := 1; 328#L310-1 check_#res := check_~tmp~1; 329#L330 main_#t~ret22 := check_#res;main_~c1~0 := main_#t~ret22;havoc main_#t~ret22;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 355#L395 assume !(0 == assert_~arg % 256); 356#L390 main_#t~post23 := main_~i2~0;main_~i2~0 := 1 + main_#t~post23;havoc main_#t~post23; 385#L368-2 [2018-11-23 03:07:59,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:07:59,490 INFO L82 PathProgramCache]: Analyzing trace with hash 370924325, now seen corresponding path program 2 times [2018-11-23 03:07:59,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:07:59,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:07:59,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:07:59,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:07:59,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:07:59,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:07:59,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:07:59,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:07:59,519 INFO L82 PathProgramCache]: Analyzing trace with hash 544955963, now seen corresponding path program 1 times [2018-11-23 03:07:59,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:07:59,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:07:59,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:07:59,521 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:07:59,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:07:59,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:07:59,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:07:59,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:07:59,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:07:59,542 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 03:07:59,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:07:59,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:07:59,543 INFO L87 Difference]: Start difference. First operand 69 states and 91 transitions. cyclomatic complexity: 23 Second operand 3 states. [2018-11-23 03:07:59,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:07:59,557 INFO L93 Difference]: Finished difference Result 105 states and 144 transitions. [2018-11-23 03:07:59,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:07:59,557 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 144 transitions. [2018-11-23 03:07:59,559 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2018-11-23 03:07:59,560 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 105 states and 144 transitions. [2018-11-23 03:07:59,560 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 105 [2018-11-23 03:07:59,560 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 105 [2018-11-23 03:07:59,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 144 transitions. [2018-11-23 03:07:59,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 03:07:59,561 INFO L705 BuchiCegarLoop]: Abstraction has 105 states and 144 transitions. [2018-11-23 03:07:59,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 144 transitions. [2018-11-23 03:07:59,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-11-23 03:07:59,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-23 03:07:59,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 144 transitions. [2018-11-23 03:07:59,565 INFO L728 BuchiCegarLoop]: Abstraction has 105 states and 144 transitions. [2018-11-23 03:07:59,565 INFO L608 BuchiCegarLoop]: Abstraction has 105 states and 144 transitions. [2018-11-23 03:07:59,565 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 03:07:59,565 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 105 states and 144 transitions. [2018-11-23 03:07:59,566 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2018-11-23 03:07:59,566 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:07:59,566 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:07:59,567 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] [2018-11-23 03:07:59,567 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-11-23 03:07:59,567 INFO L794 eck$LassoCheckResult]: Stem: 546#ULTIMATE.startENTRY ~r1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~mode1~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~mode2~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~mode3~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~mode4~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~0 := 0;~p4~0 := 0;~send4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset]; 512#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~nondet5, 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~ret21, main_#t~ret22, main_#t~post23, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet4;havoc main_#t~nondet4;~id1~0 := main_#t~nondet5;havoc main_#t~nondet5;~st1~0 := main_#t~nondet6;havoc main_#t~nondet6;~send1~0 := main_#t~nondet7;havoc main_#t~nondet7;~mode1~0 := main_#t~nondet8;havoc main_#t~nondet8;~id2~0 := main_#t~nondet9;havoc main_#t~nondet9;~st2~0 := main_#t~nondet10;havoc main_#t~nondet10;~send2~0 := main_#t~nondet11;havoc main_#t~nondet11;~mode2~0 := main_#t~nondet12;havoc main_#t~nondet12;~id3~0 := main_#t~nondet13;havoc main_#t~nondet13;~st3~0 := main_#t~nondet14;havoc main_#t~nondet14;~send3~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode3~0 := main_#t~nondet16;havoc main_#t~nondet16;~id4~0 := main_#t~nondet17;havoc main_#t~nondet17;~st4~0 := main_#t~nondet18;havoc main_#t~nondet18;~send4~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode4~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 513#L209 assume 0 == ~r1~0; 529#L210 assume ~id1~0 >= 0; 556#L211 assume 0 == ~st1~0; 510#L212 assume ~send1~0 == ~id1~0; 511#L213 assume 0 == ~mode1~0 % 256; 561#L214 assume ~id2~0 >= 0; 517#L215 assume 0 == ~st2~0; 518#L216 assume ~send2~0 == ~id2~0; 548#L217 assume 0 == ~mode2~0 % 256; 565#L218 assume ~id3~0 >= 0; 500#L219 assume 0 == ~st3~0; 501#L220 assume ~send3~0 == ~id3~0; 532#L221 assume 0 == ~mode3~0 % 256; 557#L222 assume ~id4~0 >= 0; 539#L223 assume 0 == ~st4~0; 540#L224 assume ~send4~0 == ~id4~0; 562#L225 assume 0 == ~mode4~0 % 256; 519#L226 assume ~id1~0 != ~id2~0; 520#L227 assume ~id1~0 != ~id3~0; 550#L228 assume ~id1~0 != ~id4~0; 566#L229 assume ~id2~0 != ~id3~0; 502#L230 assume ~id2~0 != ~id4~0; 503#L231 assume ~id3~0 != ~id4~0;init_~tmp~0 := 1; 525#L209-1 init_#res := init_~tmp~0; 526#L302 main_#t~ret21 := init_#res;main_~i2~0 := main_#t~ret21;havoc main_#t~ret21;assume 0 != main_~i2~0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0 := 0; 567#L368-2 [2018-11-23 03:07:59,567 INFO L796 eck$LassoCheckResult]: Loop: 567#L368-2 assume !!(main_~i2~0 < 8);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 541#L106 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 542#L110 assume !(node1_~m1~0 != ~nomsg~0); 535#L110-1 ~mode1~0 := 0; 506#L106-2 havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 507#L134 assume !(0 != ~mode2~0 % 256); 538#L147 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; 530#L147-2 ~p2_new~0 := (if node2_#t~ite1 % 256 <= 127 then node2_#t~ite1 % 256 else node2_#t~ite1 % 256 - 256);havoc node2_#t~ite1;~mode2~0 := 1; 531#L134-2 havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 568#L159 assume !(0 != ~mode3~0 % 256); 569#L172 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite2 := ~send3~0; 582#L172-2 ~p3_new~0 := (if node3_#t~ite2 % 256 <= 127 then node3_#t~ite2 % 256 else node3_#t~ite2 % 256 - 256);havoc node3_#t~ite2;~mode3~0 := 1; 581#L159-2 havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 580#L184 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 578#L187 assume !(node4_~m4~0 != ~nomsg~0); 574#L187-1 ~mode4~0 := 0; 573#L184-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 572#L310 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 571#L311 assume !(~r1~0 >= 4); 522#L314 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; 523#L315 assume ~r1~0 < 4;check_~tmp~1 := 1; 508#L310-1 check_#res := check_~tmp~1; 509#L330 main_#t~ret22 := check_#res;main_~c1~0 := main_#t~ret22;havoc main_#t~ret22;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 536#L395 assume !(0 == assert_~arg % 256); 537#L390 main_#t~post23 := main_~i2~0;main_~i2~0 := 1 + main_#t~post23;havoc main_#t~post23; 567#L368-2 [2018-11-23 03:07:59,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:07:59,567 INFO L82 PathProgramCache]: Analyzing trace with hash 370924325, now seen corresponding path program 3 times [2018-11-23 03:07:59,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:07:59,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:07:59,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:07:59,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:07:59,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:07:59,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:07:59,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:07:59,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:07:59,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1447456360, now seen corresponding path program 1 times [2018-11-23 03:07:59,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:07:59,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:07:59,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:07:59,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:07:59,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:07:59,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:07:59,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:07:59,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:07:59,616 INFO L82 PathProgramCache]: Analyzing trace with hash -248077372, now seen corresponding path program 1 times [2018-11-23 03:07:59,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:07:59,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:07:59,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:07:59,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:07:59,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:07:59,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:07:59,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:07:59,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:07:59,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:07:59,918 WARN L180 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 128 [2018-11-23 03:08:01,199 WARN L180 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 132 DAG size of output: 121 [2018-11-23 03:08:01,208 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:08:01,209 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:08:01,209 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:08:01,209 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:08:01,209 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 03:08:01,209 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:08:01,209 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:08:01,210 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:08:01,210 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr.4_false-unreach-call.1.ufo.BOUNDED-8.pals_true-termination.c_Iteration4_Loop [2018-11-23 03:08:01,210 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:08:01,210 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:08:01,222 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-11-23 03:08:01,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-11-23 03:08:01,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:08:01,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:08:01,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:08:01,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:08:01,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:08:01,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:08:01,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:08:01,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:08:01,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:08:01,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:08:01,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:08:01,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:08:01,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:08:01,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:08:01,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:08:01,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:08:01,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:08:01,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:08:01,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:08:01,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:08:01,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:08:01,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:08:01,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:08:01,677 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-23 03:08:04,281 WARN L180 SmtUtils]: Spent 2.55 s on a formula simplification. DAG size of input: 156 DAG size of output: 108 [2018-11-23 03:08:04,332 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:08:04,333 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_60dfd476-28df-4ad3-9675-2ed4479f3f02/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:08:04,336 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:08:04,336 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_60dfd476-28df-4ad3-9675-2ed4479f3f02/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:08:04,357 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 03:08:04,357 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:08:04,453 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 03:08:04,454 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:08:04,454 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:08:04,454 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:08:04,454 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:08:04,454 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 03:08:04,454 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:08:04,454 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:08:04,455 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:08:04,455 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr.4_false-unreach-call.1.ufo.BOUNDED-8.pals_true-termination.c_Iteration4_Loop [2018-11-23 03:08:04,455 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:08:04,455 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:08:04,457 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-11-23 03:08:04,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:08:04,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:08:04,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:08:04,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:08:04,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:08:04,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:08:04,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:08:04,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:08:04,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:08:04,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:08:04,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:08:04,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:08:04,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:08:04,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:08:04,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:08:04,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:08:04,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:08:04,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:08:04,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:08:04,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:08:04,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:08:04,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:08:04,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:08:04,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:08:04,840 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2018-11-23 03:08:04,863 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-23 03:08:07,471 WARN L180 SmtUtils]: Spent 2.53 s on a formula simplification. DAG size of input: 156 DAG size of output: 108 [2018-11-23 03:08:07,494 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:08:07,497 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 03:08:07,498 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:08:07,499 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:08:07,499 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:08:07,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:08:07,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:08:07,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:08:07,501 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:08:07,502 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:08:07,504 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:08:07,505 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:08:07,505 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:08:07,505 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:08:07,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:08:07,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:08:07,505 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:08:07,506 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:08:07,506 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:08:07,509 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:08:07,509 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:08:07,509 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:08:07,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:08:07,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:08:07,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:08:07,511 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:08:07,511 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:08:07,513 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:08:07,513 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:08:07,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:08:07,514 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:08:07,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:08:07,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:08:07,514 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:08:07,515 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:08:07,515 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:08:07,515 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:08:07,515 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:08:07,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:08:07,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:08:07,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:08:07,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:08:07,516 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:08:07,521 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:08:07,521 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:08:07,521 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:08:07,522 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:08:07,522 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:08:07,522 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:08:07,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:08:07,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:08:07,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:08:07,523 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:08:07,523 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:08:07,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:08:07,524 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:08:07,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:08:07,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:08:07,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:08:07,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:08:07,525 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:08:07,525 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:08:07,527 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:08:07,527 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:08:07,527 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:08:07,527 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:08:07,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:08:07,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:08:07,527 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:08:07,527 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:08:07,528 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:08:07,528 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:08:07,528 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:08:07,529 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:08:07,529 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:08:07,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:08:07,530 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:08:07,530 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:08:07,531 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:08:07,531 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:08:07,534 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:08:07,534 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:08:07,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:08:07,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:08:07,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:08:07,535 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:08:07,536 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:08:07,536 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:08:07,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:08:07,538 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:08:07,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:08:07,538 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:08:07,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:08:07,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:08:07,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:08:07,539 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:08:07,539 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:08:07,540 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:08:07,541 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:08:07,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:08:07,541 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:08:07,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:08:07,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:08:07,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:08:07,542 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:08:07,542 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:08:07,544 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:08:07,544 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:08:07,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:08:07,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:08:07,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:08:07,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:08:07,550 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:08:07,550 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:08:07,551 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:08:07,552 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:08:07,552 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:08:07,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:08:07,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:08:07,554 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:08:07,554 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:08:07,555 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:08:07,556 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:08:07,557 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:08:07,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:08:07,557 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:08:07,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:08:07,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:08:07,557 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:08:07,558 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:08:07,558 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:08:07,558 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:08:07,559 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:08:07,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:08:07,559 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:08:07,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:08:07,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:08:07,559 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:08:07,559 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:08:07,560 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:08:07,560 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:08:07,560 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:08:07,561 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:08:07,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:08:07,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:08:07,561 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:08:07,562 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:08:07,562 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:08:07,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:08:07,564 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:08:07,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:08:07,564 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:08:07,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:08:07,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:08:07,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:08:07,565 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:08:07,565 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:08:07,566 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:08:07,566 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:08:07,566 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:08:07,566 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:08:07,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:08:07,567 INFO L206 nArgumentSynthesizer]: 16 loop disjuncts [2018-11-23 03:08:07,567 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:08:07,590 INFO L402 nArgumentSynthesizer]: We have 32 Motzkin's Theorem applications. [2018-11-23 03:08:07,590 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:08:07,666 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:08:07,666 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:08:07,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:08:07,666 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:08:07,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:08:07,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:08:07,667 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:08:07,667 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:08:07,667 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:08:07,672 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:08:07,672 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:08:07,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:08:07,672 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:08:07,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:08:07,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:08:07,673 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:08:07,673 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:08:07,673 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:08:07,674 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:08:07,675 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:08:07,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:08:07,675 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:08:07,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:08:07,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:08:07,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:08:07,676 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:08:07,676 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:08:07,677 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 03:08:07,679 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 03:08:07,679 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 03:08:07,681 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 03:08:07,681 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 03:08:07,681 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 03:08:07,681 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 15 Supporting invariants [] [2018-11-23 03:08:07,682 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 03:08:07,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:08:07,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:08:07,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:08:07,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:08:07,754 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:08:07,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:08:07,767 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 03:08:07,768 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 105 states and 144 transitions. cyclomatic complexity: 40 Second operand 3 states. [2018-11-23 03:08:07,802 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 105 states and 144 transitions. cyclomatic complexity: 40. Second operand 3 states. Result 182 states and 261 transitions. Complement of second has 4 states. [2018-11-23 03:08:07,803 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-11-23 03:08:07,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 03:08:07,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2018-11-23 03:08:07,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 91 transitions. Stem has 27 letters. Loop has 25 letters. [2018-11-23 03:08:07,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:08:07,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 91 transitions. Stem has 52 letters. Loop has 25 letters. [2018-11-23 03:08:07,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:08:07,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 91 transitions. Stem has 27 letters. Loop has 50 letters. [2018-11-23 03:08:07,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:08:07,809 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 182 states and 261 transitions. [2018-11-23 03:08:07,810 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 03:08:07,811 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 182 states to 0 states and 0 transitions. [2018-11-23 03:08:07,811 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 03:08:07,811 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 03:08:07,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 03:08:07,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 03:08:07,811 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 03:08:07,811 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 03:08:07,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:08:07,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:08:07,811 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2018-11-23 03:08:07,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:08:07,812 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 03:08:07,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 03:08:07,812 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-23 03:08:07,812 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 03:08:07,812 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 03:08:07,812 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 03:08:07,812 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 03:08:07,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 03:08:07,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 03:08:07,816 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 03:08:07,816 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 03:08:07,816 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 03:08:07,816 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 03:08:07,816 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 03:08:07,817 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 03:08:07,817 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 03:08:07,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 03:08:07 BoogieIcfgContainer [2018-11-23 03:08:07,821 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 03:08:07,821 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 03:08:07,821 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 03:08:07,821 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 03:08:07,822 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:07:58" (3/4) ... [2018-11-23 03:08:07,824 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 03:08:07,824 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 03:08:07,825 INFO L168 Benchmark]: Toolchain (without parser) took 9629.76 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 413.7 MB). Free memory was 961.1 MB in the beginning and 918.4 MB in the end (delta: 42.8 MB). Peak memory consumption was 456.4 MB. Max. memory is 11.5 GB. [2018-11-23 03:08:07,825 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:08:07,826 INFO L168 Benchmark]: CACSL2BoogieTranslator took 286.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.4 MB). Free memory was 961.1 MB in the beginning and 1.2 GB in the end (delta: -196.2 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. [2018-11-23 03:08:07,826 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-23 03:08:07,827 INFO L168 Benchmark]: Boogie Preprocessor took 22.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-23 03:08:07,827 INFO L168 Benchmark]: RCFGBuilder took 368.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 41.7 MB). Peak memory consumption was 41.7 MB. Max. memory is 11.5 GB. [2018-11-23 03:08:07,827 INFO L168 Benchmark]: BuchiAutomizer took 8914.68 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 254.3 MB). Free memory was 1.1 GB in the beginning and 918.4 MB in the end (delta: 190.6 MB). Peak memory consumption was 444.9 MB. Max. memory is 11.5 GB. [2018-11-23 03:08:07,828 INFO L168 Benchmark]: Witness Printer took 2.99 ms. Allocated memory is still 1.4 GB. Free memory is still 918.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:08:07,831 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 286.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.4 MB). Free memory was 961.1 MB in the beginning and 1.2 GB in the end (delta: -196.2 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 368.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 41.7 MB). Peak memory consumption was 41.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8914.68 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 254.3 MB). Free memory was 1.1 GB in the beginning and 918.4 MB in the end (delta: 190.6 MB). Peak memory consumption was 444.9 MB. Max. memory is 11.5 GB. * Witness Printer took 2.99 ms. Allocated memory is still 1.4 GB. Free memory is still 918.4 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 + 15 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 8.8s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 8.5s. 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 105 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 438 SDtfs, 207 SDslu, 628 SDs, 0 SdLazy, 32 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital1210 mio100 ax104 hnf100 lsp11 ukn67 mio100 lsp100 div165 bol100 ite100 ukn100 eq169 hnf68 smp100 dnf5114 smp24 tf100 neg98 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 99ms VariablesStem: 0 VariablesLoop: 25 DisjunctsStem: 1 DisjunctsLoop: 16 SupportingInvariants: 0 MotzkinApplications: 32 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...