./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6_false-unreach-call.1.ufo.BOUNDED-12.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_35e65368-b4e2-4e55-a54f-0647c12e0055/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_35e65368-b4e2-4e55-a54f-0647c12e0055/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_35e65368-b4e2-4e55-a54f-0647c12e0055/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_35e65368-b4e2-4e55-a54f-0647c12e0055/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6_false-unreach-call.1.ufo.BOUNDED-12.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_35e65368-b4e2-4e55-a54f-0647c12e0055/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_35e65368-b4e2-4e55-a54f-0647c12e0055/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 5564e2866529becd702f0ed3cd0d2d94f195a7b8 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 17:17:12,998 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 17:17:12,999 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 17:17:13,006 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 17:17:13,007 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 17:17:13,007 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 17:17:13,008 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 17:17:13,009 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 17:17:13,010 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 17:17:13,010 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 17:17:13,011 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 17:17:13,011 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 17:17:13,012 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 17:17:13,012 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 17:17:13,013 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 17:17:13,014 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 17:17:13,015 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 17:17:13,016 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 17:17:13,017 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 17:17:13,019 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 17:17:13,019 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 17:17:13,020 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 17:17:13,022 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 17:17:13,022 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 17:17:13,022 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 17:17:13,023 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 17:17:13,023 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 17:17:13,024 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 17:17:13,024 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 17:17:13,025 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 17:17:13,025 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 17:17:13,026 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 17:17:13,026 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 17:17:13,026 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 17:17:13,027 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 17:17:13,027 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 17:17:13,028 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_35e65368-b4e2-4e55-a54f-0647c12e0055/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 17:17:13,037 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 17:17:13,038 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 17:17:13,038 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 17:17:13,039 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 17:17:13,039 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 17:17:13,039 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 17:17:13,039 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 17:17:13,039 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 17:17:13,039 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 17:17:13,039 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 17:17:13,040 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 17:17:13,040 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 17:17:13,040 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 17:17:13,040 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 17:17:13,040 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 17:17:13,040 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 17:17:13,040 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 17:17:13,040 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 17:17:13,041 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 17:17:13,041 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 17:17:13,041 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 17:17:13,041 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 17:17:13,041 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 17:17:13,041 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 17:17:13,041 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 17:17:13,043 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 17:17:13,043 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 17:17:13,043 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 17:17:13,043 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 17:17:13,043 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 17:17:13,043 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 17:17:13,044 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 17:17:13,044 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_35e65368-b4e2-4e55-a54f-0647c12e0055/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 -> 5564e2866529becd702f0ed3cd0d2d94f195a7b8 [2018-11-18 17:17:13,066 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 17:17:13,075 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 17:17:13,077 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 17:17:13,078 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 17:17:13,078 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 17:17:13,079 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_35e65368-b4e2-4e55-a54f-0647c12e0055/bin-2019/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6_false-unreach-call.1.ufo.BOUNDED-12.pals_true-termination.c [2018-11-18 17:17:13,114 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_35e65368-b4e2-4e55-a54f-0647c12e0055/bin-2019/uautomizer/data/a8b38d458/4ba3a24524354059983a433fedaf165c/FLAGb54ab42a2 [2018-11-18 17:17:13,556 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 17:17:13,557 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_35e65368-b4e2-4e55-a54f-0647c12e0055/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6_false-unreach-call.1.ufo.BOUNDED-12.pals_true-termination.c [2018-11-18 17:17:13,564 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_35e65368-b4e2-4e55-a54f-0647c12e0055/bin-2019/uautomizer/data/a8b38d458/4ba3a24524354059983a433fedaf165c/FLAGb54ab42a2 [2018-11-18 17:17:13,576 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_35e65368-b4e2-4e55-a54f-0647c12e0055/bin-2019/uautomizer/data/a8b38d458/4ba3a24524354059983a433fedaf165c [2018-11-18 17:17:13,578 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 17:17:13,579 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 17:17:13,580 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 17:17:13,580 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 17:17:13,583 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 17:17:13,584 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:17:13" (1/1) ... [2018-11-18 17:17:13,586 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c8ce82e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:17:13, skipping insertion in model container [2018-11-18 17:17:13,586 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:17:13" (1/1) ... [2018-11-18 17:17:13,595 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 17:17:13,625 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 17:17:13,786 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 17:17:13,796 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 17:17:13,876 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 17:17:13,890 INFO L195 MainTranslator]: Completed translation [2018-11-18 17:17:13,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:17:13 WrapperNode [2018-11-18 17:17:13,890 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 17:17:13,891 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 17:17:13,891 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 17:17:13,891 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 17:17:13,896 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:17:13" (1/1) ... [2018-11-18 17:17:13,902 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:17:13" (1/1) ... [2018-11-18 17:17:13,921 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 17:17:13,921 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 17:17:13,921 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 17:17:13,921 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 17:17:13,927 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:17:13" (1/1) ... [2018-11-18 17:17:13,927 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:17:13" (1/1) ... [2018-11-18 17:17:13,928 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:17:13" (1/1) ... [2018-11-18 17:17:13,929 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:17:13" (1/1) ... [2018-11-18 17:17:13,933 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:17:13" (1/1) ... [2018-11-18 17:17:13,939 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:17:13" (1/1) ... [2018-11-18 17:17:13,940 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:17:13" (1/1) ... [2018-11-18 17:17:13,942 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 17:17:13,943 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 17:17:13,943 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 17:17:13,943 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 17:17:13,943 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:17:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_35e65368-b4e2-4e55-a54f-0647c12e0055/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-18 17:17:13,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 17:17:13,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 17:17:14,429 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 17:17:14,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:17:14 BoogieIcfgContainer [2018-11-18 17:17:14,430 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 17:17:14,430 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 17:17:14,430 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 17:17:14,432 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 17:17:14,433 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 17:17:14,433 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 05:17:13" (1/3) ... [2018-11-18 17:17:14,434 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@163ee787 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 05:17:14, skipping insertion in model container [2018-11-18 17:17:14,434 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 17:17:14,434 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:17:13" (2/3) ... [2018-11-18 17:17:14,434 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@163ee787 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 05:17:14, skipping insertion in model container [2018-11-18 17:17:14,434 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 17:17:14,434 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:17:14" (3/3) ... [2018-11-18 17:17:14,436 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.6_false-unreach-call.1.ufo.BOUNDED-12.pals_true-termination.c [2018-11-18 17:17:14,468 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 17:17:14,469 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 17:17:14,469 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 17:17:14,469 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 17:17:14,469 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 17:17:14,469 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 17:17:14,469 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 17:17:14,469 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 17:17:14,469 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 17:17:14,482 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 143 states. [2018-11-18 17:17:14,503 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2018-11-18 17:17:14,503 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 17:17:14,503 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 17:17:14,509 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 17:17:14,509 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:17:14,510 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 17:17:14,510 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 143 states. [2018-11-18 17:17:14,515 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2018-11-18 17:17:14,515 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 17:17:14,515 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 17:17:14,516 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 17:17:14,516 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:17:14,522 INFO L794 eck$LassoCheckResult]: Stem: 106#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;~r1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~mode6~0 := 0;~alive6~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;~p5~0 := 0;~send5~0 := 0;~p6~0 := 0;~send6~0 := 0;~nodes~0.base, ~nodes~0.offset := ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.base(), ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.offset();~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; 14#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~ret43, main_#t~ret44, main_#t~post45, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~send1~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode1~0 := main_#t~nondet16;havoc main_#t~nondet16;~alive1~0 := main_#t~nondet17;havoc main_#t~nondet17;~id2~0 := main_#t~nondet18;havoc main_#t~nondet18;~st2~0 := main_#t~nondet19;havoc main_#t~nondet19;~send2~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode2~0 := main_#t~nondet21;havoc main_#t~nondet21;~alive2~0 := main_#t~nondet22;havoc main_#t~nondet22;~id3~0 := main_#t~nondet23;havoc main_#t~nondet23;~st3~0 := main_#t~nondet24;havoc main_#t~nondet24;~send3~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode3~0 := main_#t~nondet26;havoc main_#t~nondet26;~alive3~0 := main_#t~nondet27;havoc main_#t~nondet27;~id4~0 := main_#t~nondet28;havoc main_#t~nondet28;~st4~0 := main_#t~nondet29;havoc main_#t~nondet29;~send4~0 := main_#t~nondet30;havoc main_#t~nondet30;~mode4~0 := main_#t~nondet31;havoc main_#t~nondet31;~alive4~0 := main_#t~nondet32;havoc main_#t~nondet32;~id5~0 := main_#t~nondet33;havoc main_#t~nondet33;~st5~0 := main_#t~nondet34;havoc main_#t~nondet34;~send5~0 := main_#t~nondet35;havoc main_#t~nondet35;~mode5~0 := main_#t~nondet36;havoc main_#t~nondet36;~alive5~0 := main_#t~nondet37;havoc main_#t~nondet37;~id6~0 := main_#t~nondet38;havoc main_#t~nondet38;~st6~0 := main_#t~nondet39;havoc main_#t~nondet39;~send6~0 := main_#t~nondet40;havoc main_#t~nondet40;~mode6~0 := main_#t~nondet41;havoc main_#t~nondet41;~alive6~0 := main_#t~nondet42;havoc main_#t~nondet42;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 43#L334true assume !(0 == ~r1~0);init_~tmp~0 := 0; 45#L334-1true init_#res := init_~tmp~0; 51#L499true main_#t~ret43 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret43;havoc main_#t~ret43;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;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; 108#L575-3true [2018-11-18 17:17:14,523 INFO L796 eck$LassoCheckResult]: Loop: 108#L575-3true assume true; 105#L575-1true assume !!(main_~i2~0 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 119#L126true 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 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 71#L130true assume !(node1_~m1~0 != ~nomsg~0); 69#L130-1true ~mode1~0 := 0; 113#L126-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 75#L163true assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 46#L166true assume !(node2_~m2~0 != ~nomsg~0); 44#L166-1true ~mode2~0 := 0; 70#L163-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 4#L197true assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 134#L200true assume !(node3_~m3~0 != ~nomsg~0); 133#L200-1true ~mode3~0 := 0; 21#L197-2true assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 102#L231true assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 104#L234true assume !(node4_~m4~0 != ~nomsg~0); 83#L234-1true ~mode4~0 := 0; 97#L231-2true assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8, node5_#t~ite9, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 48#L265true assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 54#L268true assume !(node5_~m5~0 != ~nomsg~0); 53#L268-1true ~mode5~0 := 0; 47#L265-2true assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10, node6_#t~ite11, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 17#L299true assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 143#L302true assume !(node6_~m6~0 != ~nomsg~0); 140#L302-1true ~mode6~0 := 0; 135#L299-2true assume { :end_inline_node6 } true;~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;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 74#L507true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1 := 0; 77#L507-1true check_#res := check_~tmp~1; 18#L519true main_#t~ret44 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret44;havoc main_#t~ret44;assume { :begin_inline_assert } true;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 118#L608true assume !(0 == assert_~arg % 256); 93#L603true assume { :end_inline_assert } true;main_#t~post45 := main_~i2~0;main_~i2~0 := 1 + main_#t~post45;havoc main_#t~post45; 108#L575-3true [2018-11-18 17:17:14,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:17:14,527 INFO L82 PathProgramCache]: Analyzing trace with hash 28934070, now seen corresponding path program 1 times [2018-11-18 17:17:14,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:17:14,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:17:14,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:14,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:17:14,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:14,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:17:14,667 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-18 17:17:14,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:17:14,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:17:14,673 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 17:17:14,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:17:14,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1608705424, now seen corresponding path program 1 times [2018-11-18 17:17:14,674 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:17:14,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:17:14,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:14,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:17:14,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:14,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:17:14,754 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-18 17:17:14,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:17:14,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 17:17:14,756 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 17:17:14,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 17:17:14,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 17:17:14,768 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 4 states. [2018-11-18 17:17:14,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:17:14,851 INFO L93 Difference]: Finished difference Result 145 states and 242 transitions. [2018-11-18 17:17:14,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 17:17:14,853 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 145 states and 242 transitions. [2018-11-18 17:17:14,855 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2018-11-18 17:17:14,860 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 145 states to 138 states and 195 transitions. [2018-11-18 17:17:14,861 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 138 [2018-11-18 17:17:14,861 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 138 [2018-11-18 17:17:14,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 138 states and 195 transitions. [2018-11-18 17:17:14,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 17:17:14,863 INFO L705 BuchiCegarLoop]: Abstraction has 138 states and 195 transitions. [2018-11-18 17:17:14,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states and 195 transitions. [2018-11-18 17:17:14,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-11-18 17:17:14,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-11-18 17:17:14,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 195 transitions. [2018-11-18 17:17:14,892 INFO L728 BuchiCegarLoop]: Abstraction has 138 states and 195 transitions. [2018-11-18 17:17:14,892 INFO L608 BuchiCegarLoop]: Abstraction has 138 states and 195 transitions. [2018-11-18 17:17:14,892 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 17:17:14,892 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 138 states and 195 transitions. [2018-11-18 17:17:14,894 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2018-11-18 17:17:14,894 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 17:17:14,894 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 17:17:14,895 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:17:14,895 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:17:14,896 INFO L794 eck$LassoCheckResult]: Stem: 433#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~r1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~mode6~0 := 0;~alive6~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;~p5~0 := 0;~send5~0 := 0;~p6~0 := 0;~send6~0 := 0;~nodes~0.base, ~nodes~0.offset := ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.base(), ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.offset();~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; 323#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~ret43, main_#t~ret44, main_#t~post45, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~send1~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode1~0 := main_#t~nondet16;havoc main_#t~nondet16;~alive1~0 := main_#t~nondet17;havoc main_#t~nondet17;~id2~0 := main_#t~nondet18;havoc main_#t~nondet18;~st2~0 := main_#t~nondet19;havoc main_#t~nondet19;~send2~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode2~0 := main_#t~nondet21;havoc main_#t~nondet21;~alive2~0 := main_#t~nondet22;havoc main_#t~nondet22;~id3~0 := main_#t~nondet23;havoc main_#t~nondet23;~st3~0 := main_#t~nondet24;havoc main_#t~nondet24;~send3~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode3~0 := main_#t~nondet26;havoc main_#t~nondet26;~alive3~0 := main_#t~nondet27;havoc main_#t~nondet27;~id4~0 := main_#t~nondet28;havoc main_#t~nondet28;~st4~0 := main_#t~nondet29;havoc main_#t~nondet29;~send4~0 := main_#t~nondet30;havoc main_#t~nondet30;~mode4~0 := main_#t~nondet31;havoc main_#t~nondet31;~alive4~0 := main_#t~nondet32;havoc main_#t~nondet32;~id5~0 := main_#t~nondet33;havoc main_#t~nondet33;~st5~0 := main_#t~nondet34;havoc main_#t~nondet34;~send5~0 := main_#t~nondet35;havoc main_#t~nondet35;~mode5~0 := main_#t~nondet36;havoc main_#t~nondet36;~alive5~0 := main_#t~nondet37;havoc main_#t~nondet37;~id6~0 := main_#t~nondet38;havoc main_#t~nondet38;~st6~0 := main_#t~nondet39;havoc main_#t~nondet39;~send6~0 := main_#t~nondet40;havoc main_#t~nondet40;~mode6~0 := main_#t~nondet41;havoc main_#t~nondet41;~alive6~0 := main_#t~nondet42;havoc main_#t~nondet42;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 324#L334 assume 0 == ~r1~0; 374#L335 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; 427#L336 assume ~id1~0 >= 0; 364#L337 assume 0 == ~st1~0; 365#L338 assume ~send1~0 == ~id1~0; 405#L339 assume 0 == ~mode1~0 % 256; 325#L340 assume ~id2~0 >= 0; 326#L341 assume 0 == ~st2~0; 399#L342 assume ~send2~0 == ~id2~0; 315#L343 assume 0 == ~mode2~0 % 256; 316#L344 assume ~id3~0 >= 0; 372#L345 assume 0 == ~st3~0; 373#L346 assume ~send3~0 == ~id3~0; 425#L347 assume 0 == ~mode3~0 % 256; 361#L348 assume ~id4~0 >= 0; 362#L349 assume 0 == ~st4~0; 404#L350 assume ~send4~0 == ~id4~0; 348#L351 assume 0 == ~mode4~0 % 256; 349#L352 assume ~id5~0 >= 0; 398#L353 assume 0 == ~st5~0; 312#L354 assume ~send5~0 == ~id5~0; 313#L355 assume 0 == ~mode5~0 % 256; 370#L356 assume ~id6~0 >= 0; 371#L357 assume 0 == ~st6~0; 423#L358 assume ~send6~0 == ~id6~0; 358#L359 assume 0 == ~mode6~0 % 256; 359#L360 assume ~id1~0 != ~id2~0; 403#L361 assume ~id1~0 != ~id3~0; 346#L362 assume ~id1~0 != ~id4~0; 347#L363 assume ~id1~0 != ~id5~0; 397#L364 assume ~id1~0 != ~id6~0; 310#L365 assume ~id2~0 != ~id3~0; 311#L366 assume ~id2~0 != ~id4~0; 391#L367 assume ~id2~0 != ~id5~0; 392#L368 assume ~id2~0 != ~id6~0; 422#L369 assume ~id3~0 != ~id4~0; 356#L370 assume ~id3~0 != ~id5~0; 357#L371 assume ~id3~0 != ~id6~0; 402#L372 assume ~id4~0 != ~id5~0; 344#L373 assume ~id4~0 != ~id6~0; 345#L374 assume ~id5~0 != ~id6~0;init_~tmp~0 := 1; 376#L334-1 init_#res := init_~tmp~0; 377#L499 main_#t~ret43 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret43;havoc main_#t~ret43;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;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; 385#L575-3 [2018-11-18 17:17:14,896 INFO L796 eck$LassoCheckResult]: Loop: 385#L575-3 assume true; 431#L575-1 assume !!(main_~i2~0 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 432#L126 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 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 408#L130 assume !(node1_~m1~0 != ~nomsg~0); 336#L130-1 ~mode1~0 := 0; 401#L126-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 411#L163 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 378#L166 assume !(node2_~m2~0 != ~nomsg~0); 375#L166-1 ~mode2~0 := 0; 354#L163-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 305#L197 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 307#L200 assume !(node3_~m3~0 != ~nomsg~0); 367#L200-1 ~mode3~0 := 0; 338#L197-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 339#L231 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 430#L234 assume !(node4_~m4~0 != ~nomsg~0); 387#L234-1 ~mode4~0 := 0; 412#L231-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8, node5_#t~ite9, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 380#L265 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 381#L268 assume !(node5_~m5~0 != ~nomsg~0); 389#L268-1 ~mode5~0 := 0; 309#L265-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10, node6_#t~ite11, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 329#L299 assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 331#L302 assume !(node6_~m6~0 != ~nomsg~0); 328#L302-1 ~mode6~0 := 0; 434#L299-2 assume { :end_inline_node6 } true;~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;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 409#L507 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1 := 0; 320#L507-1 check_#res := check_~tmp~1; 332#L519 main_#t~ret44 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret44;havoc main_#t~ret44;assume { :begin_inline_assert } true;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 333#L608 assume !(0 == assert_~arg % 256); 424#L603 assume { :end_inline_assert } true;main_#t~post45 := main_~i2~0;main_~i2~0 := 1 + main_#t~post45;havoc main_#t~post45; 385#L575-3 [2018-11-18 17:17:14,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:17:14,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1302395264, now seen corresponding path program 1 times [2018-11-18 17:17:14,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:17:14,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:17:14,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:14,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:17:14,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:14,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:17:14,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:17:14,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:17:14,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1608705424, now seen corresponding path program 2 times [2018-11-18 17:17:14,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:17:14,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:17:14,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:14,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:17:14,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:14,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:17:15,048 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-18 17:17:15,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:17:15,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 17:17:15,049 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 17:17:15,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 17:17:15,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 17:17:15,049 INFO L87 Difference]: Start difference. First operand 138 states and 195 transitions. cyclomatic complexity: 58 Second operand 5 states. [2018-11-18 17:17:15,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:17:15,124 INFO L93 Difference]: Finished difference Result 141 states and 197 transitions. [2018-11-18 17:17:15,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 17:17:15,126 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 141 states and 197 transitions. [2018-11-18 17:17:15,127 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2018-11-18 17:17:15,128 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 141 states to 138 states and 193 transitions. [2018-11-18 17:17:15,128 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 138 [2018-11-18 17:17:15,129 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 138 [2018-11-18 17:17:15,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 138 states and 193 transitions. [2018-11-18 17:17:15,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 17:17:15,132 INFO L705 BuchiCegarLoop]: Abstraction has 138 states and 193 transitions. [2018-11-18 17:17:15,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states and 193 transitions. [2018-11-18 17:17:15,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-11-18 17:17:15,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-11-18 17:17:15,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 193 transitions. [2018-11-18 17:17:15,138 INFO L728 BuchiCegarLoop]: Abstraction has 138 states and 193 transitions. [2018-11-18 17:17:15,138 INFO L608 BuchiCegarLoop]: Abstraction has 138 states and 193 transitions. [2018-11-18 17:17:15,138 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 17:17:15,138 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 138 states and 193 transitions. [2018-11-18 17:17:15,139 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2018-11-18 17:17:15,139 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 17:17:15,140 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 17:17:15,141 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:17:15,141 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:17:15,141 INFO L794 eck$LassoCheckResult]: Stem: 724#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~r1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~mode6~0 := 0;~alive6~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;~p5~0 := 0;~send5~0 := 0;~p6~0 := 0;~send6~0 := 0;~nodes~0.base, ~nodes~0.offset := ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.base(), ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.offset();~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; 614#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~ret43, main_#t~ret44, main_#t~post45, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~send1~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode1~0 := main_#t~nondet16;havoc main_#t~nondet16;~alive1~0 := main_#t~nondet17;havoc main_#t~nondet17;~id2~0 := main_#t~nondet18;havoc main_#t~nondet18;~st2~0 := main_#t~nondet19;havoc main_#t~nondet19;~send2~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode2~0 := main_#t~nondet21;havoc main_#t~nondet21;~alive2~0 := main_#t~nondet22;havoc main_#t~nondet22;~id3~0 := main_#t~nondet23;havoc main_#t~nondet23;~st3~0 := main_#t~nondet24;havoc main_#t~nondet24;~send3~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode3~0 := main_#t~nondet26;havoc main_#t~nondet26;~alive3~0 := main_#t~nondet27;havoc main_#t~nondet27;~id4~0 := main_#t~nondet28;havoc main_#t~nondet28;~st4~0 := main_#t~nondet29;havoc main_#t~nondet29;~send4~0 := main_#t~nondet30;havoc main_#t~nondet30;~mode4~0 := main_#t~nondet31;havoc main_#t~nondet31;~alive4~0 := main_#t~nondet32;havoc main_#t~nondet32;~id5~0 := main_#t~nondet33;havoc main_#t~nondet33;~st5~0 := main_#t~nondet34;havoc main_#t~nondet34;~send5~0 := main_#t~nondet35;havoc main_#t~nondet35;~mode5~0 := main_#t~nondet36;havoc main_#t~nondet36;~alive5~0 := main_#t~nondet37;havoc main_#t~nondet37;~id6~0 := main_#t~nondet38;havoc main_#t~nondet38;~st6~0 := main_#t~nondet39;havoc main_#t~nondet39;~send6~0 := main_#t~nondet40;havoc main_#t~nondet40;~mode6~0 := main_#t~nondet41;havoc main_#t~nondet41;~alive6~0 := main_#t~nondet42;havoc main_#t~nondet42;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 615#L334 assume 0 == ~r1~0; 666#L335 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; 718#L336 assume ~id1~0 >= 0; 655#L337 assume 0 == ~st1~0; 656#L338 assume ~send1~0 == ~id1~0; 696#L339 assume 0 == ~mode1~0 % 256; 616#L340 assume ~id2~0 >= 0; 617#L341 assume 0 == ~st2~0; 690#L342 assume ~send2~0 == ~id2~0; 606#L343 assume 0 == ~mode2~0 % 256; 607#L344 assume ~id3~0 >= 0; 663#L345 assume 0 == ~st3~0; 664#L346 assume ~send3~0 == ~id3~0; 717#L347 assume 0 == ~mode3~0 % 256; 653#L348 assume ~id4~0 >= 0; 654#L349 assume 0 == ~st4~0; 695#L350 assume ~send4~0 == ~id4~0; 642#L351 assume 0 == ~mode4~0 % 256; 643#L352 assume ~id5~0 >= 0; 689#L353 assume 0 == ~st5~0; 603#L354 assume ~send5~0 == ~id5~0; 604#L355 assume 0 == ~mode5~0 % 256; 661#L356 assume ~id6~0 >= 0; 662#L357 assume 0 == ~st6~0; 714#L358 assume ~send6~0 == ~id6~0; 649#L359 assume 0 == ~mode6~0 % 256; 650#L360 assume ~id1~0 != ~id2~0; 694#L361 assume ~id1~0 != ~id3~0; 637#L362 assume ~id1~0 != ~id4~0; 638#L363 assume ~id1~0 != ~id5~0; 688#L364 assume ~id1~0 != ~id6~0; 601#L365 assume ~id2~0 != ~id3~0; 602#L366 assume ~id2~0 != ~id4~0; 682#L367 assume ~id2~0 != ~id5~0; 683#L368 assume ~id2~0 != ~id6~0; 713#L369 assume ~id3~0 != ~id4~0; 647#L370 assume ~id3~0 != ~id5~0; 648#L371 assume ~id3~0 != ~id6~0; 693#L372 assume ~id4~0 != ~id5~0; 635#L373 assume ~id4~0 != ~id6~0; 636#L374 assume ~id5~0 != ~id6~0;init_~tmp~0 := 1; 667#L334-1 init_#res := init_~tmp~0; 668#L499 main_#t~ret43 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret43;havoc main_#t~ret43;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;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; 676#L575-3 [2018-11-18 17:17:15,141 INFO L796 eck$LassoCheckResult]: Loop: 676#L575-3 assume true; 722#L575-1 assume !!(main_~i2~0 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 723#L126 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 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 699#L130 assume !(node1_~m1~0 != ~nomsg~0); 629#L130-1 ~mode1~0 := 0; 692#L126-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 702#L163 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 669#L166 assume !(node2_~m2~0 != ~nomsg~0); 665#L166-1 ~mode2~0 := 0; 645#L163-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 596#L197 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 598#L200 assume !(node3_~m3~0 != ~nomsg~0); 658#L200-1 ~mode3~0 := 0; 626#L197-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 627#L231 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 721#L234 assume !(node4_~m4~0 != ~nomsg~0); 678#L234-1 ~mode4~0 := 0; 703#L231-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8, node5_#t~ite9, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 671#L265 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 672#L268 assume !(node5_~m5~0 != ~nomsg~0); 680#L268-1 ~mode5~0 := 0; 600#L265-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10, node6_#t~ite11, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 620#L299 assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 622#L302 assume !(node6_~m6~0 != ~nomsg~0); 619#L302-1 ~mode6~0 := 0; 725#L299-2 assume { :end_inline_node6 } true;~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;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 701#L507 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; 625#L508 assume ~r1~0 < 6;check_~tmp~1 := 1; 611#L507-1 check_#res := check_~tmp~1; 623#L519 main_#t~ret44 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret44;havoc main_#t~ret44;assume { :begin_inline_assert } true;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 624#L608 assume !(0 == assert_~arg % 256); 716#L603 assume { :end_inline_assert } true;main_#t~post45 := main_~i2~0;main_~i2~0 := 1 + main_#t~post45;havoc main_#t~post45; 676#L575-3 [2018-11-18 17:17:15,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:17:15,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1302395264, now seen corresponding path program 2 times [2018-11-18 17:17:15,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:17:15,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:17:15,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:15,143 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 17:17:15,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:15,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:17:15,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:17:15,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:17:15,185 INFO L82 PathProgramCache]: Analyzing trace with hash -2053066356, now seen corresponding path program 1 times [2018-11-18 17:17:15,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:17:15,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:17:15,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:15,186 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 17:17:15,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:15,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:17:15,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:17:15,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:17:15,209 INFO L82 PathProgramCache]: Analyzing trace with hash 2020473867, now seen corresponding path program 1 times [2018-11-18 17:17:15,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:17:15,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:17:15,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:15,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:17:15,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:17:15,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:17:15,269 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-18 17:17:15,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:17:15,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:17:15,621 WARN L180 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 157 [2018-11-18 17:17:16,261 WARN L180 SmtUtils]: Spent 629.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 134 [2018-11-18 17:17:16,269 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 17:17:16,270 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 17:17:16,270 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 17:17:16,270 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 17:17:16,270 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 17:17:16,270 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 17:17:16,270 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 17:17:16,270 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 17:17:16,270 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.6_false-unreach-call.1.ufo.BOUNDED-12.pals_true-termination.c_Iteration3_Loop [2018-11-18 17:17:16,271 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 17:17:16,271 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 17:17:16,294 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-18 17:17:16,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:17:16,304 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-18 17:17:16,322 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-18 17:17:16,323 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-18 17:17:16,329 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-18 17:17:16,331 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-18 17:17:16,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-18 17:17:16,353 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-18 17:17:16,354 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-18 17:17:16,357 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-18 17:17:16,358 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-18 17:17:16,360 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-18 17:17:16,361 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-18 17:17:16,367 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-18 17:17:16,368 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-18 17:17:16,370 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-18 17:17:16,374 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-18 17:17:16,375 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-18 17:17:16,376 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-18 17:17:16,380 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-18 17:17:16,407 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-18 17:17:16,410 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-18 17:17:16,411 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-18 17:17:16,412 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-18 17:17:16,414 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-18 17:17:16,415 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-18 17:17:16,416 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-18 17:17:16,418 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-18 17:17:16,420 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-18 17:17:16,421 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-18 17:17:16,422 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-18 17:17:16,425 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-18 17:17:16,426 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-18 17:17:16,429 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-18 17:17:16,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-18 17:17:16,432 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-18 17:17:16,433 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-18 17:17:16,883 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 17:17:16,883 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_35e65368-b4e2-4e55-a54f-0647c12e0055/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-18 17:17:16,888 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 17:17:16,888 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_35e65368-b4e2-4e55-a54f-0647c12e0055/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-18 17:17:16,909 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 17:17:16,909 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 17:17:17,018 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 17:17:17,020 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 17:17:17,020 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 17:17:17,020 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 17:17:17,020 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 17:17:17,020 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 17:17:17,021 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 17:17:17,021 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 17:17:17,021 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 17:17:17,021 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.6_false-unreach-call.1.ufo.BOUNDED-12.pals_true-termination.c_Iteration3_Loop [2018-11-18 17:17:17,021 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 17:17:17,021 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 17:17:17,028 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-18 17:17:17,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:17:17,034 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-18 17:17:17,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:17:17,037 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-18 17:17:17,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:17:17,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:17:17,044 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-18 17:17:17,065 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-18 17:17:17,066 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-18 17:17:17,069 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-18 17:17:17,071 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-18 17:17:17,072 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-18 17:17:17,074 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-18 17:17:17,075 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-18 17:17:17,078 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-18 17:17:17,079 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-18 17:17:17,081 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-18 17:17:17,082 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-18 17:17:17,085 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-18 17:17:17,086 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-18 17:17:17,087 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-18 17:17:17,088 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-18 17:17:17,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:17:17,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:17:17,097 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-18 17:17:17,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:17:17,103 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-18 17:17:17,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:17:17,105 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-18 17:17:17,140 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-18 17:17:17,142 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-18 17:17:17,143 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-18 17:17:17,146 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-18 17:17:17,150 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-18 17:17:17,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:17:17,153 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-18 17:17:17,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:17:17,609 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 17:17:17,613 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 17:17:17,614 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-18 17:17:17,616 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:17:17,616 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:17:17,616 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:17:17,617 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:17:17,617 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:17:17,619 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:17:17,619 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:17:17,621 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:17:17,621 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-18 17:17:17,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:17:17,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:17:17,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:17:17,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:17:17,624 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 17:17:17,624 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 17:17:17,625 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:17:17,626 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-18 17:17:17,626 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:17:17,626 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:17:17,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:17:17,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:17:17,627 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:17:17,627 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:17:17,627 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:17:17,627 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:17:17,628 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-18 17:17:17,628 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:17:17,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:17:17,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:17:17,628 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:17:17,629 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 17:17:17,629 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 17:17:17,631 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:17:17,634 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-18 17:17:17,634 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:17:17,634 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:17:17,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:17:17,634 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:17:17,634 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:17:17,635 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:17:17,635 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:17:17,636 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:17:17,637 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-18 17:17:17,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:17:17,637 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:17:17,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:17:17,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:17:17,642 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:17:17,642 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:17:17,642 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:17:17,643 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:17:17,643 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-18 17:17:17,643 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:17:17,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:17:17,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:17:17,644 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:17:17,645 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 17:17:17,645 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 17:17:17,650 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:17:17,650 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-18 17:17:17,651 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:17:17,651 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:17:17,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:17:17,651 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 17:17:17,651 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:17:17,652 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:17:17,652 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:17:17,655 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:17:17,655 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-18 17:17:17,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:17:17,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:17:17,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:17:17,656 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:17:17,657 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 17:17:17,657 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 17:17:17,658 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:17:17,659 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-18 17:17:17,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:17:17,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:17:17,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:17:17,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:17:17,659 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:17:17,660 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:17:17,660 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:17:17,661 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:17:17,662 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-18 17:17:17,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:17:17,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:17:17,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:17:17,662 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:17:17,663 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 17:17:17,663 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 17:17:17,665 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:17:17,665 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-18 17:17:17,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:17:17,666 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:17:17,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:17:17,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:17:17,666 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:17:17,666 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:17:17,666 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:17:17,667 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:17:17,667 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-18 17:17:17,667 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:17:17,667 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:17:17,668 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:17:17,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:17:17,668 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:17:17,668 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:17:17,668 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:17:17,669 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:17:17,669 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-18 17:17:17,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:17:17,670 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:17:17,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:17:17,670 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:17:17,670 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:17:17,670 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:17:17,670 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:17:17,671 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:17:17,671 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-18 17:17:17,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:17:17,671 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:17:17,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:17:17,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:17:17,672 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:17:17,672 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:17:17,672 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:17:17,673 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 17:17:17,676 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 17:17:17,676 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 17:17:17,677 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 17:17:17,678 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 17:17:17,678 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 17:17:17,678 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 23 Supporting invariants [] [2018-11-18 17:17:17,679 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 17:17:17,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:17:17,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:17:17,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:17:17,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:17:17,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:17:17,781 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-18 17:17:17,784 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-18 17:17:17,784 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 138 states and 193 transitions. cyclomatic complexity: 56 Second operand 4 states. [2018-11-18 17:17:17,835 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 138 states and 193 transitions. cyclomatic complexity: 56. Second operand 4 states. Result 231 states and 342 transitions. Complement of second has 6 states. [2018-11-18 17:17:17,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 17:17:17,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 17:17:17,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 193 transitions. [2018-11-18 17:17:17,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 193 transitions. Stem has 45 letters. Loop has 32 letters. [2018-11-18 17:17:17,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 17:17:17,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 193 transitions. Stem has 77 letters. Loop has 32 letters. [2018-11-18 17:17:17,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 17:17:17,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 193 transitions. Stem has 45 letters. Loop has 64 letters. [2018-11-18 17:17:17,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 17:17:17,840 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 231 states and 342 transitions. [2018-11-18 17:17:17,842 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 17:17:17,843 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 231 states to 0 states and 0 transitions. [2018-11-18 17:17:17,843 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 17:17:17,843 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 17:17:17,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 17:17:17,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 17:17:17,843 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 17:17:17,843 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 17:17:17,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:17:17,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:17:17,843 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2018-11-18 17:17:17,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:17:17,844 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-18 17:17:17,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 17:17:17,844 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-18 17:17:17,844 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 17:17:17,844 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 17:17:17,844 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 17:17:17,844 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 17:17:17,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 17:17:17,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 17:17:17,844 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 17:17:17,844 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 17:17:17,844 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 17:17:17,845 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 17:17:17,845 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 17:17:17,845 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 17:17:17,845 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 17:17:17,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 05:17:17 BoogieIcfgContainer [2018-11-18 17:17:17,850 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 17:17:17,850 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 17:17:17,850 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 17:17:17,851 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 17:17:17,851 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:17:14" (3/4) ... [2018-11-18 17:17:17,854 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 17:17:17,854 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 17:17:17,855 INFO L168 Benchmark]: Toolchain (without parser) took 4276.11 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 332.4 MB). Free memory was 959.1 MB in the beginning and 1.1 GB in the end (delta: -190.7 MB). Peak memory consumption was 141.7 MB. Max. memory is 11.5 GB. [2018-11-18 17:17:17,855 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 17:17:17,856 INFO L168 Benchmark]: CACSL2BoogieTranslator took 310.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -172.7 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. [2018-11-18 17:17:17,856 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-18 17:17:17,856 INFO L168 Benchmark]: Boogie Preprocessor took 21.60 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 17:17:17,857 INFO L168 Benchmark]: RCFGBuilder took 487.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 61.9 MB). Peak memory consumption was 61.9 MB. Max. memory is 11.5 GB. [2018-11-18 17:17:17,857 INFO L168 Benchmark]: BuchiAutomizer took 3420.11 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 194.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -86.0 MB). Peak memory consumption was 108.5 MB. Max. memory is 11.5 GB. [2018-11-18 17:17:17,858 INFO L168 Benchmark]: Witness Printer took 3.64 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 17:17:17,860 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 310.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -172.7 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.60 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 487.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 61.9 MB). Peak memory consumption was 61.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3420.11 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 194.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -86.0 MB). Peak memory consumption was 108.5 MB. Max. memory is 11.5 GB. * Witness Printer took 3.64 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 23 and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.3s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 138 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 624 SDtfs, 340 SDslu, 1155 SDs, 0 SdLazy, 22 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital347 mio100 ax121 hnf105 lsp16 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq229 hnf85 smp100 dnf100 smp100 tf101 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 4ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...