./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.4_true-unreach-call.ufo.BOUNDED-8.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3ed3b688-ed85-4cda-a730-91be95021f04/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3ed3b688-ed85-4cda-a730-91be95021f04/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3ed3b688-ed85-4cda-a730-91be95021f04/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3ed3b688-ed85-4cda-a730-91be95021f04/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.4_true-unreach-call.ufo.BOUNDED-8.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_3ed3b688-ed85-4cda-a730-91be95021f04/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3ed3b688-ed85-4cda-a730-91be95021f04/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 b48447b6a7618cb0e36862bcd70ec2f51928799c ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 05:10:06,110 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 05:10:06,111 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 05:10:06,120 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 05:10:06,120 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 05:10:06,120 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 05:10:06,121 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 05:10:06,122 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 05:10:06,124 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 05:10:06,124 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 05:10:06,125 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 05:10:06,125 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 05:10:06,126 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 05:10:06,126 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 05:10:06,127 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 05:10:06,128 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 05:10:06,128 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 05:10:06,130 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 05:10:06,131 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 05:10:06,132 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 05:10:06,133 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 05:10:06,134 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 05:10:06,136 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 05:10:06,136 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 05:10:06,136 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 05:10:06,137 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 05:10:06,137 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 05:10:06,138 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 05:10:06,139 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 05:10:06,139 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 05:10:06,140 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 05:10:06,140 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 05:10:06,140 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 05:10:06,140 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 05:10:06,141 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 05:10:06,141 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 05:10:06,141 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3ed3b688-ed85-4cda-a730-91be95021f04/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 05:10:06,151 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 05:10:06,151 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 05:10:06,152 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 05:10:06,152 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 05:10:06,152 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 05:10:06,153 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 05:10:06,153 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 05:10:06,153 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 05:10:06,153 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 05:10:06,153 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 05:10:06,153 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 05:10:06,154 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 05:10:06,154 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 05:10:06,154 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 05:10:06,154 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 05:10:06,154 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 05:10:06,154 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 05:10:06,154 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 05:10:06,155 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 05:10:06,155 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 05:10:06,155 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 05:10:06,155 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 05:10:06,155 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 05:10:06,155 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 05:10:06,155 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 05:10:06,156 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 05:10:06,156 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 05:10:06,156 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 05:10:06,156 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 05:10:06,156 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 05:10:06,157 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 05:10:06,157 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_3ed3b688-ed85-4cda-a730-91be95021f04/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 -> b48447b6a7618cb0e36862bcd70ec2f51928799c [2018-11-10 05:10:06,184 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 05:10:06,194 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 05:10:06,196 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 05:10:06,198 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 05:10:06,198 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 05:10:06,198 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3ed3b688-ed85-4cda-a730-91be95021f04/bin-2019/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_lcr.4_true-unreach-call.ufo.BOUNDED-8.pals_true-termination.c [2018-11-10 05:10:06,244 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3ed3b688-ed85-4cda-a730-91be95021f04/bin-2019/uautomizer/data/d2a577655/a8806c38fa034babb9bf4a883d1498b5/FLAGeabe47ffd [2018-11-10 05:10:06,616 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 05:10:06,616 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3ed3b688-ed85-4cda-a730-91be95021f04/sv-benchmarks/c/seq-mthreaded/pals_lcr.4_true-unreach-call.ufo.BOUNDED-8.pals_true-termination.c [2018-11-10 05:10:06,624 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3ed3b688-ed85-4cda-a730-91be95021f04/bin-2019/uautomizer/data/d2a577655/a8806c38fa034babb9bf4a883d1498b5/FLAGeabe47ffd [2018-11-10 05:10:06,639 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3ed3b688-ed85-4cda-a730-91be95021f04/bin-2019/uautomizer/data/d2a577655/a8806c38fa034babb9bf4a883d1498b5 [2018-11-10 05:10:06,642 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 05:10:06,643 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 05:10:06,644 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 05:10:06,644 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 05:10:06,648 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 05:10:06,649 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:10:06" (1/1) ... [2018-11-10 05:10:06,651 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4749697 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:10:06, skipping insertion in model container [2018-11-10 05:10:06,651 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:10:06" (1/1) ... [2018-11-10 05:10:06,660 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 05:10:06,690 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 05:10:06,857 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:10:06,863 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 05:10:06,891 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:10:06,901 INFO L193 MainTranslator]: Completed translation [2018-11-10 05:10:06,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:10:06 WrapperNode [2018-11-10 05:10:06,901 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 05:10:06,902 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 05:10:06,902 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 05:10:06,902 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 05:10:06,909 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:10:06" (1/1) ... [2018-11-10 05:10:06,915 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:10:06" (1/1) ... [2018-11-10 05:10:06,933 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 05:10:06,933 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 05:10:06,933 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 05:10:06,933 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 05:10:06,986 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:10:06" (1/1) ... [2018-11-10 05:10:06,986 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:10:06" (1/1) ... [2018-11-10 05:10:06,988 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:10:06" (1/1) ... [2018-11-10 05:10:06,988 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:10:06" (1/1) ... [2018-11-10 05:10:06,992 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:10:06" (1/1) ... [2018-11-10 05:10:06,999 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:10:06" (1/1) ... [2018-11-10 05:10:07,000 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:10:06" (1/1) ... [2018-11-10 05:10:07,007 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 05:10:07,007 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 05:10:07,007 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 05:10:07,007 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 05:10:07,008 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:10:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3ed3b688-ed85-4cda-a730-91be95021f04/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-10 05:10:07,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 05:10:07,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 05:10:07,394 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 05:10:07,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:10:07 BoogieIcfgContainer [2018-11-10 05:10:07,395 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 05:10:07,396 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 05:10:07,396 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 05:10:07,399 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 05:10:07,400 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:10:07,400 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 05:10:06" (1/3) ... [2018-11-10 05:10:07,401 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@157c1ea2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 05:10:07, skipping insertion in model container [2018-11-10 05:10:07,401 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:10:07,401 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:10:06" (2/3) ... [2018-11-10 05:10:07,401 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@157c1ea2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 05:10:07, skipping insertion in model container [2018-11-10 05:10:07,401 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:10:07,402 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:10:07" (3/3) ... [2018-11-10 05:10:07,403 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_lcr.4_true-unreach-call.ufo.BOUNDED-8.pals_true-termination.c [2018-11-10 05:10:07,452 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 05:10:07,453 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 05:10:07,453 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 05:10:07,453 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 05:10:07,453 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 05:10:07,453 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 05:10:07,453 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 05:10:07,453 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 05:10:07,454 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 05:10:07,467 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states. [2018-11-10 05:10:07,488 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2018-11-10 05:10:07,488 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:10:07,488 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:10:07,494 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 05:10:07,494 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] [2018-11-10 05:10:07,494 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 05:10:07,494 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states. [2018-11-10 05:10:07,498 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2018-11-10 05:10:07,498 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:10:07,499 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:10:07,499 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 05:10:07,499 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] [2018-11-10 05:10:07,505 INFO L793 eck$LassoCheckResult]: Stem: 35#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;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~mode2~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~mode3~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~mode4~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~0 := 0;~p4~0 := 0;~send4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset]; 12#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21, main_#t~ret22, main_#t~post23, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet4;havoc main_#t~nondet4;~id1~0 := main_#t~nondet5;havoc main_#t~nondet5;~st1~0 := main_#t~nondet6;havoc main_#t~nondet6;~send1~0 := main_#t~nondet7;havoc main_#t~nondet7;~mode1~0 := main_#t~nondet8;havoc main_#t~nondet8;~id2~0 := main_#t~nondet9;havoc main_#t~nondet9;~st2~0 := main_#t~nondet10;havoc main_#t~nondet10;~send2~0 := main_#t~nondet11;havoc main_#t~nondet11;~mode2~0 := main_#t~nondet12;havoc main_#t~nondet12;~id3~0 := main_#t~nondet13;havoc main_#t~nondet13;~st3~0 := main_#t~nondet14;havoc main_#t~nondet14;~send3~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode3~0 := main_#t~nondet16;havoc main_#t~nondet16;~id4~0 := main_#t~nondet17;havoc main_#t~nondet17;~st4~0 := main_#t~nondet18;havoc main_#t~nondet18;~send4~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode4~0 := main_#t~nondet20;havoc main_#t~nondet20;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 58#L207true assume !(~r1~0 == 0);init_~tmp~0 := 0; 76#L207-1true init_#res := init_~tmp~0; 39#L300true main_#t~ret21 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret21;havoc main_#t~ret21;assume main_~i2~0 != 0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0 := 0; 28#L366-3true [2018-11-10 05:10:07,505 INFO L795 eck$LassoCheckResult]: Loop: 28#L366-3true assume true; 24#L366-1true assume !!(main_~i2~0 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 34#L106true assume !(~mode1~0 % 256 != 0); 20#L120true assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite0 := ~send1~0; 15#L120-2true ~p1_new~0 := (if node1_#t~ite0 % 256 <= 127 then node1_#t~ite0 % 256 else node1_#t~ite0 % 256 - 256);havoc node1_#t~ite0;~mode1~0 := 1; 10#L106-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 45#L132true assume !(~mode2~0 % 256 != 0); 64#L145true assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; 59#L145-2true ~p2_new~0 := (if node2_#t~ite1 % 256 <= 127 then node2_#t~ite1 % 256 else node2_#t~ite1 % 256 - 256);havoc node2_#t~ite1;~mode2~0 := 1; 40#L132-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 9#L157true assume !(~mode3~0 % 256 != 0); 70#L170true assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite2 := ~send3~0; 50#L170-2true ~p3_new~0 := (if node3_#t~ite2 % 256 <= 127 then node3_#t~ite2 % 256 else node3_#t~ite2 % 256 - 256);havoc node3_#t~ite2;~mode3~0 := 1; 6#L157-2true assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 16#L182true assume !(~mode4~0 % 256 != 0); 55#L195true assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite3 := ~send4~0; 54#L195-2true ~p4_new~0 := (if node4_#t~ite3 % 256 <= 127 then node4_#t~ite3 % 256 else node4_#t~ite3 % 256 - 256);havoc node4_#t~ite3;~mode4~0 := 1; 69#L182-2true assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 33#L308true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1 := 0; 36#L308-1true check_#res := check_~tmp~1; 71#L328true main_#t~ret22 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret22;havoc main_#t~ret22;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 51#L393true assume !(assert_~arg % 256 == 0); 23#L388true assume { :end_inline_assert } true;main_#t~post23 := main_~i2~0;main_~i2~0 := main_#t~post23 + 1;havoc main_#t~post23; 28#L366-3true [2018-11-10 05:10:07,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:10:07,511 INFO L82 PathProgramCache]: Analyzing trace with hash 28826826, now seen corresponding path program 1 times [2018-11-10 05:10:07,513 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:10:07,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:10:07,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:10:07,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:10:07,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:10:07,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:10:07,639 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-10 05:10:07,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:10:07,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:10:07,644 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 05:10:07,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:10:07,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1790717122, now seen corresponding path program 1 times [2018-11-10 05:10:07,644 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:10:07,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:10:07,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:10:07,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:10:07,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:10:07,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:10:07,736 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-10 05:10:07,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:10:07,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 05:10:07,738 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 05:10:07,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 05:10:07,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 05:10:07,750 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 4 states. [2018-11-10 05:10:07,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:10:07,813 INFO L93 Difference]: Finished difference Result 77 states and 124 transitions. [2018-11-10 05:10:07,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 05:10:07,815 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 124 transitions. [2018-11-10 05:10:07,817 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2018-11-10 05:10:07,820 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 70 states and 95 transitions. [2018-11-10 05:10:07,821 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 70 [2018-11-10 05:10:07,821 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2018-11-10 05:10:07,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 95 transitions. [2018-11-10 05:10:07,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 05:10:07,822 INFO L705 BuchiCegarLoop]: Abstraction has 70 states and 95 transitions. [2018-11-10 05:10:07,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 95 transitions. [2018-11-10 05:10:07,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-11-10 05:10:07,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-10 05:10:07,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 95 transitions. [2018-11-10 05:10:07,844 INFO L728 BuchiCegarLoop]: Abstraction has 70 states and 95 transitions. [2018-11-10 05:10:07,844 INFO L608 BuchiCegarLoop]: Abstraction has 70 states and 95 transitions. [2018-11-10 05:10:07,844 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 05:10:07,844 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 95 transitions. [2018-11-10 05:10:07,845 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2018-11-10 05:10:07,846 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:10:07,846 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:10:07,847 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:10:07,847 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] [2018-11-10 05:10:07,847 INFO L793 eck$LassoCheckResult]: Stem: 216#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;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~mode2~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~mode3~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~mode4~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~0 := 0;~p4~0 := 0;~send4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset]; 188#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21, main_#t~ret22, main_#t~post23, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet4;havoc main_#t~nondet4;~id1~0 := main_#t~nondet5;havoc main_#t~nondet5;~st1~0 := main_#t~nondet6;havoc main_#t~nondet6;~send1~0 := main_#t~nondet7;havoc main_#t~nondet7;~mode1~0 := main_#t~nondet8;havoc main_#t~nondet8;~id2~0 := main_#t~nondet9;havoc main_#t~nondet9;~st2~0 := main_#t~nondet10;havoc main_#t~nondet10;~send2~0 := main_#t~nondet11;havoc main_#t~nondet11;~mode2~0 := main_#t~nondet12;havoc main_#t~nondet12;~id3~0 := main_#t~nondet13;havoc main_#t~nondet13;~st3~0 := main_#t~nondet14;havoc main_#t~nondet14;~send3~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode3~0 := main_#t~nondet16;havoc main_#t~nondet16;~id4~0 := main_#t~nondet17;havoc main_#t~nondet17;~st4~0 := main_#t~nondet18;havoc main_#t~nondet18;~send4~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode4~0 := main_#t~nondet20;havoc main_#t~nondet20;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 189#L207 assume ~r1~0 == 0; 170#L208 assume ~id1~0 >= 0; 171#L209 assume ~st1~0 == 0; 204#L210 assume ~send1~0 == ~id1~0; 224#L211 assume ~mode1~0 % 256 == 0; 185#L212 assume ~id2~0 >= 0; 186#L213 assume ~st2~0 == 0; 228#L214 assume ~send2~0 == ~id2~0; 194#L215 assume ~mode2~0 % 256 == 0; 195#L216 assume ~id3~0 >= 0; 218#L217 assume ~st3~0 == 0; 232#L218 assume ~send3~0 == ~id3~0; 174#L219 assume ~mode3~0 % 256 == 0; 175#L220 assume ~id4~0 >= 0; 205#L221 assume ~st4~0 == 0; 225#L222 assume ~send4~0 == ~id4~0; 212#L223 assume ~mode4~0 % 256 == 0; 213#L224 assume ~id1~0 != ~id2~0; 229#L225 assume ~id1~0 != ~id3~0; 196#L226 assume ~id1~0 != ~id4~0; 197#L227 assume ~id2~0 != ~id3~0; 219#L228 assume ~id2~0 != ~id4~0; 233#L229 assume ~id3~0 != ~id4~0;init_~tmp~0 := 1; 236#L207-1 init_#res := init_~tmp~0; 217#L300 main_#t~ret21 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret21;havoc main_#t~ret21;assume main_~i2~0 != 0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0 := 0; 201#L366-3 [2018-11-10 05:10:07,847 INFO L795 eck$LassoCheckResult]: Loop: 201#L366-3 assume true; 202#L366-1 assume !!(main_~i2~0 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 203#L106 assume !(~mode1~0 % 256 != 0); 198#L120 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite0 := ~send1~0; 193#L120-2 ~p1_new~0 := (if node1_#t~ite0 % 256 <= 127 then node1_#t~ite0 % 256 else node1_#t~ite0 % 256 - 256);havoc node1_#t~ite0;~mode1~0 := 1; 183#L106-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 184#L132 assume ~mode2~0 % 256 != 0;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 178#L135 assume !(node2_~m2~0 != ~nomsg~0); 176#L135-1 ~mode2~0 := 0; 177#L132-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 180#L157 assume !(~mode3~0 % 256 != 0); 181#L170 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite2 := ~send3~0; 226#L170-2 ~p3_new~0 := (if node3_#t~ite2 % 256 <= 127 then node3_#t~ite2 % 256 else node3_#t~ite2 % 256 - 256);havoc node3_#t~ite2;~mode3~0 := 1; 172#L157-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 173#L182 assume ~mode4~0 % 256 != 0;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 192#L185 assume !(node4_~m4~0 != ~nomsg~0); 168#L185-1 ~mode4~0 := 0; 231#L182-2 assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 209#L308 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1 := 0; 211#L308-1 check_#res := check_~tmp~1; 215#L328 main_#t~ret22 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret22;havoc main_#t~ret22;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 227#L393 assume !(assert_~arg % 256 == 0); 200#L388 assume { :end_inline_assert } true;main_#t~post23 := main_~i2~0;main_~i2~0 := main_#t~post23 + 1;havoc main_#t~post23; 201#L366-3 [2018-11-10 05:10:07,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:10:07,848 INFO L82 PathProgramCache]: Analyzing trace with hash 370924325, now seen corresponding path program 1 times [2018-11-10 05:10:07,848 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:10:07,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:10:07,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:10:07,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:10:07,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:10:07,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:10:07,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:10:07,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:10:07,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1414417838, now seen corresponding path program 1 times [2018-11-10 05:10:07,908 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:10:07,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:10:07,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:10:07,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:10:07,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:10:07,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:10:07,970 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-10 05:10:07,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:10:07,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 05:10:07,971 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 05:10:07,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 05:10:07,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 05:10:07,971 INFO L87 Difference]: Start difference. First operand 70 states and 95 transitions. cyclomatic complexity: 26 Second operand 5 states. [2018-11-10 05:10:08,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:10:08,037 INFO L93 Difference]: Finished difference Result 73 states and 97 transitions. [2018-11-10 05:10:08,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 05:10:08,038 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 97 transitions. [2018-11-10 05:10:08,040 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2018-11-10 05:10:08,040 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 70 states and 92 transitions. [2018-11-10 05:10:08,041 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 70 [2018-11-10 05:10:08,041 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2018-11-10 05:10:08,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 92 transitions. [2018-11-10 05:10:08,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 05:10:08,041 INFO L705 BuchiCegarLoop]: Abstraction has 70 states and 92 transitions. [2018-11-10 05:10:08,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 92 transitions. [2018-11-10 05:10:08,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-11-10 05:10:08,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-10 05:10:08,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 92 transitions. [2018-11-10 05:10:08,045 INFO L728 BuchiCegarLoop]: Abstraction has 70 states and 92 transitions. [2018-11-10 05:10:08,045 INFO L608 BuchiCegarLoop]: Abstraction has 70 states and 92 transitions. [2018-11-10 05:10:08,045 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 05:10:08,046 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 92 transitions. [2018-11-10 05:10:08,046 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2018-11-10 05:10:08,046 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:10:08,046 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:10:08,047 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:10:08,047 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:10:08,048 INFO L793 eck$LassoCheckResult]: Stem: 371#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;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~mode2~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~mode3~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~mode4~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~0 := 0;~p4~0 := 0;~send4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset]; 343#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21, main_#t~ret22, main_#t~post23, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet4;havoc main_#t~nondet4;~id1~0 := main_#t~nondet5;havoc main_#t~nondet5;~st1~0 := main_#t~nondet6;havoc main_#t~nondet6;~send1~0 := main_#t~nondet7;havoc main_#t~nondet7;~mode1~0 := main_#t~nondet8;havoc main_#t~nondet8;~id2~0 := main_#t~nondet9;havoc main_#t~nondet9;~st2~0 := main_#t~nondet10;havoc main_#t~nondet10;~send2~0 := main_#t~nondet11;havoc main_#t~nondet11;~mode2~0 := main_#t~nondet12;havoc main_#t~nondet12;~id3~0 := main_#t~nondet13;havoc main_#t~nondet13;~st3~0 := main_#t~nondet14;havoc main_#t~nondet14;~send3~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode3~0 := main_#t~nondet16;havoc main_#t~nondet16;~id4~0 := main_#t~nondet17;havoc main_#t~nondet17;~st4~0 := main_#t~nondet18;havoc main_#t~nondet18;~send4~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode4~0 := main_#t~nondet20;havoc main_#t~nondet20;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 344#L207 assume ~r1~0 == 0; 325#L208 assume ~id1~0 >= 0; 326#L209 assume ~st1~0 == 0; 359#L210 assume ~send1~0 == ~id1~0; 379#L211 assume ~mode1~0 % 256 == 0; 340#L212 assume ~id2~0 >= 0; 341#L213 assume ~st2~0 == 0; 383#L214 assume ~send2~0 == ~id2~0; 349#L215 assume ~mode2~0 % 256 == 0; 350#L216 assume ~id3~0 >= 0; 373#L217 assume ~st3~0 == 0; 387#L218 assume ~send3~0 == ~id3~0; 327#L219 assume ~mode3~0 % 256 == 0; 328#L220 assume ~id4~0 >= 0; 360#L221 assume ~st4~0 == 0; 380#L222 assume ~send4~0 == ~id4~0; 364#L223 assume ~mode4~0 % 256 == 0; 365#L224 assume ~id1~0 != ~id2~0; 384#L225 assume ~id1~0 != ~id3~0; 351#L226 assume ~id1~0 != ~id4~0; 352#L227 assume ~id2~0 != ~id3~0; 374#L228 assume ~id2~0 != ~id4~0; 388#L229 assume ~id3~0 != ~id4~0;init_~tmp~0 := 1; 391#L207-1 init_#res := init_~tmp~0; 372#L300 main_#t~ret21 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret21;havoc main_#t~ret21;assume main_~i2~0 != 0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0 := 0; 356#L366-3 [2018-11-10 05:10:08,048 INFO L795 eck$LassoCheckResult]: Loop: 356#L366-3 assume true; 357#L366-1 assume !!(main_~i2~0 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 358#L106 assume ~mode1~0 % 256 != 0;~r1~0 := (if (~r1~0 + 1) % 256 <= 127 then (~r1~0 + 1) % 256 else (~r1~0 + 1) % 256 - 256);node1_~m1~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 368#L110 assume !(node1_~m1~0 != ~nomsg~0); 362#L110-1 ~mode1~0 := 0; 338#L106-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 339#L132 assume !(~mode2~0 % 256 != 0); 376#L145 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; 389#L145-2 ~p2_new~0 := (if node2_#t~ite1 % 256 <= 127 then node2_#t~ite1 % 256 else node2_#t~ite1 % 256 - 256);havoc node2_#t~ite1;~mode2~0 := 1; 332#L132-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 335#L157 assume !(~mode3~0 % 256 != 0); 336#L170 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite2 := ~send3~0; 381#L170-2 ~p3_new~0 := (if node3_#t~ite2 % 256 <= 127 then node3_#t~ite2 % 256 else node3_#t~ite2 % 256 - 256);havoc node3_#t~ite2;~mode3~0 := 1; 329#L157-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 330#L182 assume !(~mode4~0 % 256 != 0); 347#L195 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite3 := ~send4~0; 385#L195-2 ~p4_new~0 := (if node4_#t~ite3 % 256 <= 127 then node4_#t~ite3 % 256 else node4_#t~ite3 % 256 - 256);havoc node4_#t~ite3;~mode4~0 := 1; 386#L182-2 assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 366#L308 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 367#L309 assume ~r1~0 >= 4; 378#L313 assume ~r1~0 < 4;check_~tmp~1 := 1; 369#L308-1 check_#res := check_~tmp~1; 370#L328 main_#t~ret22 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret22;havoc main_#t~ret22;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 382#L393 assume !(assert_~arg % 256 == 0); 355#L388 assume { :end_inline_assert } true;main_#t~post23 := main_~i2~0;main_~i2~0 := main_#t~post23 + 1;havoc main_#t~post23; 356#L366-3 [2018-11-10 05:10:08,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:10:08,048 INFO L82 PathProgramCache]: Analyzing trace with hash 370924325, now seen corresponding path program 2 times [2018-11-10 05:10:08,048 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:10:08,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:10:08,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:10:08,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:10:08,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:10:08,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:10:08,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:10:08,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:10:08,083 INFO L82 PathProgramCache]: Analyzing trace with hash 340758104, now seen corresponding path program 1 times [2018-11-10 05:10:08,083 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:10:08,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:10:08,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:10:08,085 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:10:08,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:10:08,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:10:08,110 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-10 05:10:08,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:10:08,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:10:08,110 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 05:10:08,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:10:08,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:10:08,111 INFO L87 Difference]: Start difference. First operand 70 states and 92 transitions. cyclomatic complexity: 23 Second operand 3 states. [2018-11-10 05:10:08,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:10:08,144 INFO L93 Difference]: Finished difference Result 107 states and 146 transitions. [2018-11-10 05:10:08,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:10:08,144 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 107 states and 146 transitions. [2018-11-10 05:10:08,145 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2018-11-10 05:10:08,146 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 107 states to 107 states and 146 transitions. [2018-11-10 05:10:08,146 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 107 [2018-11-10 05:10:08,147 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 107 [2018-11-10 05:10:08,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 146 transitions. [2018-11-10 05:10:08,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 05:10:08,148 INFO L705 BuchiCegarLoop]: Abstraction has 107 states and 146 transitions. [2018-11-10 05:10:08,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 146 transitions. [2018-11-10 05:10:08,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-11-10 05:10:08,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-10 05:10:08,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 146 transitions. [2018-11-10 05:10:08,153 INFO L728 BuchiCegarLoop]: Abstraction has 107 states and 146 transitions. [2018-11-10 05:10:08,153 INFO L608 BuchiCegarLoop]: Abstraction has 107 states and 146 transitions. [2018-11-10 05:10:08,154 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 05:10:08,154 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states and 146 transitions. [2018-11-10 05:10:08,154 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2018-11-10 05:10:08,154 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:10:08,154 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:10:08,155 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:10:08,155 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] [2018-11-10 05:10:08,156 INFO L793 eck$LassoCheckResult]: Stem: 554#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;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~mode2~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~mode3~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~mode4~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~0 := 0;~p4~0 := 0;~send4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset]; 525#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21, main_#t~ret22, main_#t~post23, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet4;havoc main_#t~nondet4;~id1~0 := main_#t~nondet5;havoc main_#t~nondet5;~st1~0 := main_#t~nondet6;havoc main_#t~nondet6;~send1~0 := main_#t~nondet7;havoc main_#t~nondet7;~mode1~0 := main_#t~nondet8;havoc main_#t~nondet8;~id2~0 := main_#t~nondet9;havoc main_#t~nondet9;~st2~0 := main_#t~nondet10;havoc main_#t~nondet10;~send2~0 := main_#t~nondet11;havoc main_#t~nondet11;~mode2~0 := main_#t~nondet12;havoc main_#t~nondet12;~id3~0 := main_#t~nondet13;havoc main_#t~nondet13;~st3~0 := main_#t~nondet14;havoc main_#t~nondet14;~send3~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode3~0 := main_#t~nondet16;havoc main_#t~nondet16;~id4~0 := main_#t~nondet17;havoc main_#t~nondet17;~st4~0 := main_#t~nondet18;havoc main_#t~nondet18;~send4~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode4~0 := main_#t~nondet20;havoc main_#t~nondet20;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 526#L207 assume ~r1~0 == 0; 508#L208 assume ~id1~0 >= 0; 509#L209 assume ~st1~0 == 0; 544#L210 assume ~send1~0 == ~id1~0; 566#L211 assume ~mode1~0 % 256 == 0; 523#L212 assume ~id2~0 >= 0; 524#L213 assume ~st2~0 == 0; 570#L214 assume ~send2~0 == ~id2~0; 534#L215 assume ~mode2~0 % 256 == 0; 535#L216 assume ~id3~0 >= 0; 559#L217 assume ~st3~0 == 0; 575#L218 assume ~send3~0 == ~id3~0; 510#L219 assume ~mode3~0 % 256 == 0; 511#L220 assume ~id4~0 >= 0; 545#L221 assume ~st4~0 == 0; 567#L222 assume ~send4~0 == ~id4~0; 549#L223 assume ~mode4~0 % 256 == 0; 550#L224 assume ~id1~0 != ~id2~0; 571#L225 assume ~id1~0 != ~id3~0; 536#L226 assume ~id1~0 != ~id4~0; 537#L227 assume ~id2~0 != ~id3~0; 560#L228 assume ~id2~0 != ~id4~0; 576#L229 assume ~id3~0 != ~id4~0;init_~tmp~0 := 1; 580#L207-1 init_#res := init_~tmp~0; 557#L300 main_#t~ret21 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret21;havoc main_#t~ret21;assume main_~i2~0 != 0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0 := 0; 541#L366-3 [2018-11-10 05:10:08,156 INFO L795 eck$LassoCheckResult]: Loop: 541#L366-3 assume true; 542#L366-1 assume !!(main_~i2~0 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 543#L106 assume ~mode1~0 % 256 != 0;~r1~0 := (if (~r1~0 + 1) % 256 <= 127 then (~r1~0 + 1) % 256 else (~r1~0 + 1) % 256 - 256);node1_~m1~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 553#L110 assume !(node1_~m1~0 != ~nomsg~0); 547#L110-1 ~mode1~0 := 0; 521#L106-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 522#L132 assume !(~mode2~0 % 256 != 0); 562#L145 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; 596#L145-2 ~p2_new~0 := (if node2_#t~ite1 % 256 <= 127 then node2_#t~ite1 % 256 else node2_#t~ite1 % 256 - 256);havoc node2_#t~ite1;~mode2~0 := 1; 558#L132-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 518#L157 assume !(~mode3~0 % 256 != 0); 519#L170 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite2 := ~send3~0; 568#L170-2 ~p3_new~0 := (if node3_#t~ite2 % 256 <= 127 then node3_#t~ite2 % 256 else node3_#t~ite2 % 256 - 256);havoc node3_#t~ite2;~mode3~0 := 1; 512#L157-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 513#L182 assume !(~mode4~0 % 256 != 0); 532#L195 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite3 := ~send4~0; 588#L195-2 ~p4_new~0 := (if node4_#t~ite3 % 256 <= 127 then node4_#t~ite3 % 256 else node4_#t~ite3 % 256 - 256);havoc node4_#t~ite3;~mode4~0 := 1; 586#L182-2 assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 585#L308 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 584#L309 assume !(~r1~0 >= 4); 564#L312 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 == 0; 565#L313 assume ~r1~0 < 4;check_~tmp~1 := 1; 555#L308-1 check_#res := check_~tmp~1; 556#L328 main_#t~ret22 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret22;havoc main_#t~ret22;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 569#L393 assume !(assert_~arg % 256 == 0); 540#L388 assume { :end_inline_assert } true;main_#t~post23 := main_~i2~0;main_~i2~0 := main_#t~post23 + 1;havoc main_#t~post23; 541#L366-3 [2018-11-10 05:10:08,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:10:08,156 INFO L82 PathProgramCache]: Analyzing trace with hash 370924325, now seen corresponding path program 3 times [2018-11-10 05:10:08,156 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:10:08,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:10:08,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:10:08,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:10:08,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:10:08,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:10:08,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:10:08,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:10:08,183 INFO L82 PathProgramCache]: Analyzing trace with hash -674828766, now seen corresponding path program 1 times [2018-11-10 05:10:08,183 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:10:08,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:10:08,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:10:08,184 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:10:08,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:10:08,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:10:08,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:10:08,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:10:08,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1696766906, now seen corresponding path program 1 times [2018-11-10 05:10:08,207 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:10:08,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:10:08,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:10:08,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:10:08,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:10:08,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:10:08,244 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-10 05:10:08,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:10:08,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:10:08,565 WARN L179 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 133 [2018-11-10 05:10:11,381 WARN L179 SmtUtils]: Spent 2.77 s on a formula simplification. DAG size of input: 154 DAG size of output: 135 [2018-11-10 05:10:11,392 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:10:11,393 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:10:11,393 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:10:11,393 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:10:11,393 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 05:10:11,393 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:10:11,393 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:10:11,393 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:10:11,394 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr.4_true-unreach-call.ufo.BOUNDED-8.pals_true-termination.c_Iteration4_Loop [2018-11-10 05:10:11,394 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:10:11,394 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:10:11,410 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-11-10 05:10:11,541 WARN L177 XnfTransformerHelper]: Simplifying conjuction of 8528 disjunctions. This might take some time... [2018-11-10 05:10:11,702 INFO L193 XnfTransformerHelper]: Simplified to conjuction of 48 disjunctions. [2018-11-10 05:10:11,706 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-10 05:10:11,715 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-10 05:10:11,718 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-10 05:10:11,719 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-10 05:10:11,841 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2018-11-10 05:10:11,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:10:11,846 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-10 05:10:11,867 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-10 05:10:11,868 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-10 05:10:11,871 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-10 05:10:11,872 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-10 05:10:11,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:10:11,876 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-10 05:10:11,878 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-10 05:10:11,881 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-10 05:10:11,883 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-10 05:10:11,886 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-10 05:10:11,890 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-10 05:10:11,891 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-10 05:10:11,893 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-10 05:10:11,894 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-10 05:10:11,899 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-10 05:10:11,900 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-10 05:10:11,903 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-10 05:10:11,905 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-10 05:10:12,076 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2018-11-10 05:10:12,141 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-10 05:10:32,286 WARN L179 SmtUtils]: Spent 20.06 s on a formula simplification. DAG size of input: 621 DAG size of output: 173 [2018-11-10 05:10:32,399 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:10:32,400 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3ed3b688-ed85-4cda-a730-91be95021f04/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-10 05:10:32,418 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:10:32,418 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3ed3b688-ed85-4cda-a730-91be95021f04/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-10 05:10:32,458 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 05:10:32,458 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:10:32,629 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 05:10:32,631 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:10:32,631 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:10:32,631 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:10:32,631 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:10:32,631 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:10:32,631 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:10:32,632 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:10:32,632 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:10:32,632 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr.4_true-unreach-call.ufo.BOUNDED-8.pals_true-termination.c_Iteration4_Loop [2018-11-10 05:10:32,632 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:10:32,632 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:10:32,635 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-11-10 05:10:32,684 WARN L177 XnfTransformerHelper]: Simplifying conjuction of 8528 disjunctions. This might take some time... [2018-11-10 05:10:32,820 INFO L193 XnfTransformerHelper]: Simplified to conjuction of 48 disjunctions. [2018-11-10 05:10:32,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:10:32,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:10:32,829 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-10 05:10:32,834 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-10 05:10:32,835 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-10 05:10:32,837 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-10 05:10:32,838 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-10 05:10:32,839 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-10 05:10:32,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:10:32,871 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-10 05:10:32,999 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2018-11-10 05:10:32,999 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-10 05:10:33,001 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-10 05:10:33,004 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-10 05:10:33,008 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-10 05:10:33,009 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-10 05:10:33,018 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-10 05:10:33,019 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-10 05:10:33,020 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-10 05:10:33,022 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-10 05:10:33,024 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-10 05:10:33,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-10 05:10:33,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-10 05:10:33,036 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-10 05:10:33,038 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-10 05:10:33,257 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2018-11-10 05:10:33,305 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-10 05:10:55,013 WARN L179 SmtUtils]: Spent 21.59 s on a formula simplification. DAG size of input: 621 DAG size of output: 173 [2018-11-10 05:10:55,075 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:10:55,079 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:10:55,080 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-10 05:10:55,081 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:10:55,081 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:10:55,082 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:10:55,082 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:10:55,082 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:10:55,083 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:10:55,084 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:10:55,087 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:10:55,087 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-10 05:10:55,088 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:10:55,088 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:10:55,088 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:10:55,088 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:10:55,088 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:10:55,089 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:10:55,089 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:10:55,091 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:10:55,091 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-10 05:10:55,092 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:10:55,092 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:10:55,092 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:10:55,092 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:10:55,092 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:10:55,093 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:10:55,093 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:10:55,094 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:10:55,094 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-10 05:10:55,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:10:55,095 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:10:55,095 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:10:55,095 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:10:55,096 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:10:55,097 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:10:55,098 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:10:55,099 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-10 05:10:55,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:10:55,099 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:10:55,099 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:10:55,100 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:10:55,100 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:10:55,100 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:10:55,100 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:10:55,101 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:10:55,105 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-10 05:10:55,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:10:55,106 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:10:55,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:10:55,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:10:55,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:10:55,106 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:10:55,106 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:10:55,107 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:10:55,107 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-10 05:10:55,108 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:10:55,108 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:10:55,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:10:55,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:10:55,108 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:10:55,109 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:10:55,109 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:10:55,109 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:10:55,110 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-10 05:10:55,110 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:10:55,110 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:10:55,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:10:55,110 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:10:55,111 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:10:55,112 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:10:55,114 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:10:55,114 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-10 05:10:55,115 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:10:55,115 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:10:55,115 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:10:55,115 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 05:10:55,115 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:10:55,116 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 05:10:55,116 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:10:55,119 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:10:55,120 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-10 05:10:55,120 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:10:55,120 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:10:55,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:10:55,121 INFO L206 nArgumentSynthesizer]: 64 loop disjuncts [2018-11-10 05:10:55,121 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:10:55,225 INFO L402 nArgumentSynthesizer]: We have 128 Motzkin's Theorem applications. [2018-11-10 05:10:55,226 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:10:55,600 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:10:55,601 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-10 05:10:55,601 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:10:55,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:10:55,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:10:55,602 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:10:55,602 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:10:55,602 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:10:55,604 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:10:55,604 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-10 05:10:55,605 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:10:55,605 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:10:55,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:10:55,607 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:10:55,607 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:10:55,607 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:10:55,607 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:10:55,608 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:10:55,609 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:10:55,609 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:10:55,609 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:10:55,609 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:10:55,609 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:10:55,609 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:10:55,610 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:10:55,610 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:10:55,611 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:10:55,611 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-10 05:10:55,612 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:10:55,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:10:55,612 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:10:55,612 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:10:55,612 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:10:55,613 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:10:55,618 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:10:55,619 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-10 05:10:55,619 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:10:55,619 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:10:55,619 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:10:55,620 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:10:55,620 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:10:55,620 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:10:55,622 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:10:55,623 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-10 05:10:55,623 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:10:55,623 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:10:55,623 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:10:55,623 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:10:55,623 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:10:55,624 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:10:55,624 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:10:55,624 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:10:55,625 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-10 05:10:55,625 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:10:55,625 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:10:55,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:10:55,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:10:55,626 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:10:55,626 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:10:55,626 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:10:55,626 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:10:55,627 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-10 05:10:55,627 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:10:55,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:10:55,627 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:10:55,627 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:10:55,628 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:10:55,628 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:10:55,630 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:10:55,631 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-10 05:10:55,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:10:55,632 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:10:55,632 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:10:55,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:10:55,633 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:10:55,633 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:10:55,633 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:10:55,634 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:10:55,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-10 05:10:55,634 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:10:55,634 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:10:55,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:10:55,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:10:55,635 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:10:55,635 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:10:55,635 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:10:55,636 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:10:55,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-10 05:10:55,638 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:10:55,638 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:10:55,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:10:55,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:10:55,638 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:10:55,638 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:10:55,638 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:10:55,640 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:10:55,640 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-10 05:10:55,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:10:55,641 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:10:55,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:10:55,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:10:55,641 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:10:55,642 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:10:55,642 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:10:55,643 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 05:10:55,646 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 05:10:55,646 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 05:10:55,648 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 05:10:55,648 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 05:10:55,648 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 05:10:55,649 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 15 Supporting invariants [] [2018-11-10 05:10:55,650 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 05:10:55,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:10:55,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:10:55,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:10:55,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:10:55,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:10:55,751 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-10 05:10:55,755 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-10 05:10:55,756 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 107 states and 146 transitions. cyclomatic complexity: 40 Second operand 4 states. [2018-11-10 05:10:55,795 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 107 states and 146 transitions. cyclomatic complexity: 40. Second operand 4 states. Result 186 states and 265 transitions. Complement of second has 6 states. [2018-11-10 05:10:55,796 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-10 05:10:55,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 05:10:55,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2018-11-10 05:10:55,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 92 transitions. Stem has 27 letters. Loop has 26 letters. [2018-11-10 05:10:55,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:10:55,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 92 transitions. Stem has 53 letters. Loop has 26 letters. [2018-11-10 05:10:55,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:10:55,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 92 transitions. Stem has 27 letters. Loop has 52 letters. [2018-11-10 05:10:55,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:10:55,802 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 186 states and 265 transitions. [2018-11-10 05:10:55,804 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 05:10:55,804 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 186 states to 0 states and 0 transitions. [2018-11-10 05:10:55,804 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 05:10:55,804 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 05:10:55,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 05:10:55,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 05:10:55,804 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:10:55,804 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:10:55,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:10:55,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:10:55,805 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2018-11-10 05:10:55,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:10:55,805 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-10 05:10:55,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 05:10:55,810 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-10 05:10:55,810 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 05:10:55,810 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 05:10:55,810 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 05:10:55,810 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 05:10:55,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 05:10:55,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 05:10:55,811 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:10:55,811 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:10:55,811 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:10:55,811 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 05:10:55,811 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 05:10:55,811 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 05:10:55,811 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 05:10:55,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 05:10:55 BoogieIcfgContainer [2018-11-10 05:10:55,821 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 05:10:55,821 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 05:10:55,821 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 05:10:55,821 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 05:10:55,822 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:10:07" (3/4) ... [2018-11-10 05:10:55,825 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 05:10:55,825 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 05:10:55,826 INFO L168 Benchmark]: Toolchain (without parser) took 49183.55 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 475.0 MB). Free memory was 961.9 MB in the beginning and 999.3 MB in the end (delta: -37.4 MB). Peak memory consumption was 437.6 MB. Max. memory is 11.5 GB. [2018-11-10 05:10:55,826 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:10:55,827 INFO L168 Benchmark]: CACSL2BoogieTranslator took 257.90 ms. Allocated memory is still 1.0 GB. Free memory was 961.9 MB in the beginning and 945.8 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-10 05:10:55,828 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.00 ms. Allocated memory is still 1.0 GB. Free memory was 945.8 MB in the beginning and 940.5 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-10 05:10:55,829 INFO L168 Benchmark]: Boogie Preprocessor took 73.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 940.5 MB in the beginning and 1.1 GB in the end (delta: -192.7 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. [2018-11-10 05:10:55,829 INFO L168 Benchmark]: RCFGBuilder took 387.97 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: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. [2018-11-10 05:10:55,829 INFO L168 Benchmark]: BuchiAutomizer took 48425.30 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 336.1 MB). Free memory was 1.1 GB in the beginning and 999.3 MB in the end (delta: 102.3 MB). Peak memory consumption was 438.4 MB. Max. memory is 11.5 GB. [2018-11-10 05:10:55,830 INFO L168 Benchmark]: Witness Printer took 3.86 ms. Allocated memory is still 1.5 GB. Free memory is still 999.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:10:55,835 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 257.90 ms. Allocated memory is still 1.0 GB. Free memory was 961.9 MB in the beginning and 945.8 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.00 ms. Allocated memory is still 1.0 GB. Free memory was 945.8 MB in the beginning and 940.5 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 73.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 940.5 MB in the beginning and 1.1 GB in the end (delta: -192.7 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 387.97 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: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 48425.30 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 336.1 MB). Free memory was 1.1 GB in the beginning and 999.3 MB in the end (delta: 102.3 MB). Peak memory consumption was 438.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.86 ms. Allocated memory is still 1.5 GB. Free memory is still 999.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 15 and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 48.3s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 47.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 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 107 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 443 SDtfs, 146 SDslu, 636 SDs, 0 SdLazy, 32 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital2594 mio100 ax101 hnf100 lsp7 ukn63 mio100 lsp100 div179 bol100 ite100 ukn100 eq163 hnf66 smp100 dnf38929 smp11 tf100 neg98 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 479ms VariablesStem: 0 VariablesLoop: 27 DisjunctsStem: 1 DisjunctsLoop: 64 SupportingInvariants: 0 MotzkinApplications: 128 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...