./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.5_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3cfc8bba-f7ed-4c13-a9dd-4386356dda28/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3cfc8bba-f7ed-4c13-a9dd-4386356dda28/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3cfc8bba-f7ed-4c13-a9dd-4386356dda28/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3cfc8bba-f7ed-4c13-a9dd-4386356dda28/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.5_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_3cfc8bba-f7ed-4c13-a9dd-4386356dda28/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3cfc8bba-f7ed-4c13-a9dd-4386356dda28/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 6191f76ca1968cb0b63f42b60887059af617e3ab ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 09:18:02,346 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 09:18:02,347 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 09:18:02,354 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 09:18:02,354 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 09:18:02,355 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 09:18:02,356 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 09:18:02,357 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 09:18:02,358 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 09:18:02,359 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 09:18:02,359 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 09:18:02,360 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 09:18:02,360 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 09:18:02,361 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 09:18:02,362 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 09:18:02,362 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 09:18:02,363 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 09:18:02,364 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 09:18:02,366 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 09:18:02,367 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 09:18:02,367 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 09:18:02,368 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 09:18:02,370 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 09:18:02,370 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 09:18:02,370 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 09:18:02,371 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 09:18:02,371 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 09:18:02,372 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 09:18:02,373 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 09:18:02,373 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 09:18:02,373 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 09:18:02,374 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 09:18:02,374 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 09:18:02,374 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 09:18:02,375 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 09:18:02,375 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 09:18:02,376 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3cfc8bba-f7ed-4c13-a9dd-4386356dda28/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 09:18:02,386 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 09:18:02,386 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 09:18:02,387 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 09:18:02,387 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 09:18:02,387 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 09:18:02,387 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 09:18:02,387 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 09:18:02,387 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 09:18:02,388 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 09:18:02,388 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 09:18:02,388 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 09:18:02,388 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 09:18:02,388 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 09:18:02,388 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 09:18:02,388 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 09:18:02,388 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 09:18:02,388 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 09:18:02,389 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 09:18:02,389 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 09:18:02,389 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 09:18:02,389 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 09:18:02,389 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 09:18:02,389 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 09:18:02,389 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 09:18:02,389 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 09:18:02,389 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 09:18:02,389 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 09:18:02,390 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 09:18:02,390 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 09:18:02,390 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 09:18:02,390 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 09:18:02,390 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 09:18:02,390 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_3cfc8bba-f7ed-4c13-a9dd-4386356dda28/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 -> 6191f76ca1968cb0b63f42b60887059af617e3ab [2018-11-18 09:18:02,412 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 09:18:02,420 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 09:18:02,423 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 09:18:02,424 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 09:18:02,424 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 09:18:02,424 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3cfc8bba-f7ed-4c13-a9dd-4386356dda28/bin-2019/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_lcr.5_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c [2018-11-18 09:18:02,461 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3cfc8bba-f7ed-4c13-a9dd-4386356dda28/bin-2019/uautomizer/data/ed46c29cb/0d78b6b40b6541cc8e928f1af8488c45/FLAGa1f2325cd [2018-11-18 09:18:02,828 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 09:18:02,828 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3cfc8bba-f7ed-4c13-a9dd-4386356dda28/sv-benchmarks/c/seq-mthreaded/pals_lcr.5_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c [2018-11-18 09:18:02,840 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3cfc8bba-f7ed-4c13-a9dd-4386356dda28/bin-2019/uautomizer/data/ed46c29cb/0d78b6b40b6541cc8e928f1af8488c45/FLAGa1f2325cd [2018-11-18 09:18:03,235 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3cfc8bba-f7ed-4c13-a9dd-4386356dda28/bin-2019/uautomizer/data/ed46c29cb/0d78b6b40b6541cc8e928f1af8488c45 [2018-11-18 09:18:03,238 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 09:18:03,239 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 09:18:03,239 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 09:18:03,239 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 09:18:03,242 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 09:18:03,243 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:18:03" (1/1) ... [2018-11-18 09:18:03,246 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28a0deda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:18:03, skipping insertion in model container [2018-11-18 09:18:03,246 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:18:03" (1/1) ... [2018-11-18 09:18:03,254 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 09:18:03,283 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 09:18:03,444 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:18:03,454 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 09:18:03,483 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:18:03,493 INFO L195 MainTranslator]: Completed translation [2018-11-18 09:18:03,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:18:03 WrapperNode [2018-11-18 09:18:03,494 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 09:18:03,494 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 09:18:03,494 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 09:18:03,494 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 09:18:03,539 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:18:03" (1/1) ... [2018-11-18 09:18:03,547 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:18:03" (1/1) ... [2018-11-18 09:18:03,569 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 09:18:03,569 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 09:18:03,569 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 09:18:03,570 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 09:18:03,575 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:18:03" (1/1) ... [2018-11-18 09:18:03,576 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:18:03" (1/1) ... [2018-11-18 09:18:03,578 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:18:03" (1/1) ... [2018-11-18 09:18:03,578 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:18:03" (1/1) ... [2018-11-18 09:18:03,584 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:18:03" (1/1) ... [2018-11-18 09:18:03,590 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:18:03" (1/1) ... [2018-11-18 09:18:03,592 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:18:03" (1/1) ... [2018-11-18 09:18:03,595 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 09:18:03,595 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 09:18:03,595 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 09:18:03,595 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 09:18:03,596 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:18:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3cfc8bba-f7ed-4c13-a9dd-4386356dda28/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:18:03,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 09:18:03,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 09:18:04,009 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 09:18:04,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:18:04 BoogieIcfgContainer [2018-11-18 09:18:04,009 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 09:18:04,010 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 09:18:04,010 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 09:18:04,013 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 09:18:04,013 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 09:18:04,013 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 09:18:03" (1/3) ... [2018-11-18 09:18:04,014 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3ce9e794 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 09:18:04, skipping insertion in model container [2018-11-18 09:18:04,014 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 09:18:04,014 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:18:03" (2/3) ... [2018-11-18 09:18:04,015 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3ce9e794 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 09:18:04, skipping insertion in model container [2018-11-18 09:18:04,015 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 09:18:04,015 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:18:04" (3/3) ... [2018-11-18 09:18:04,017 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_lcr.5_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c [2018-11-18 09:18:04,054 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 09:18:04,055 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 09:18:04,055 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 09:18:04,055 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 09:18:04,055 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 09:18:04,055 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 09:18:04,055 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 09:18:04,055 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 09:18:04,055 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 09:18:04,067 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states. [2018-11-18 09:18:04,086 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 52 [2018-11-18 09:18:04,087 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:18:04,087 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:18:04,093 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 09:18:04,093 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:18:04,093 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 09:18:04,093 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states. [2018-11-18 09:18:04,096 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 52 [2018-11-18 09:18:04,096 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:18:04,096 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:18:04,096 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 09:18:04,096 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:18:04,101 INFO L794 eck$LassoCheckResult]: Stem: 45#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;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~mode5~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~0 := 0;~p4~0 := 0;~send4~0 := 0;~p5~0 := 0;~send5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.base(), ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.offset();~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; 14#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc 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~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~ret26, main_#t~ret27, main_#t~post28, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet5;havoc main_#t~nondet5;~id1~0 := main_#t~nondet6;havoc main_#t~nondet6;~st1~0 := main_#t~nondet7;havoc main_#t~nondet7;~send1~0 := main_#t~nondet8;havoc main_#t~nondet8;~mode1~0 := main_#t~nondet9;havoc main_#t~nondet9;~id2~0 := main_#t~nondet10;havoc main_#t~nondet10;~st2~0 := main_#t~nondet11;havoc main_#t~nondet11;~send2~0 := main_#t~nondet12;havoc main_#t~nondet12;~mode2~0 := main_#t~nondet13;havoc main_#t~nondet13;~id3~0 := main_#t~nondet14;havoc main_#t~nondet14;~st3~0 := main_#t~nondet15;havoc main_#t~nondet15;~send3~0 := main_#t~nondet16;havoc main_#t~nondet16;~mode3~0 := main_#t~nondet17;havoc main_#t~nondet17;~id4~0 := main_#t~nondet18;havoc main_#t~nondet18;~st4~0 := main_#t~nondet19;havoc main_#t~nondet19;~send4~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode4~0 := main_#t~nondet21;havoc main_#t~nondet21;~id5~0 := main_#t~nondet22;havoc main_#t~nondet22;~st5~0 := main_#t~nondet23;havoc main_#t~nondet23;~send5~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode5~0 := main_#t~nondet25;havoc main_#t~nondet25;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 33#L242true assume !(0 == ~r1~0);init_~tmp~0 := 0; 31#L242-1true init_#res := init_~tmp~0; 77#L367true main_#t~ret26 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret26;havoc main_#t~ret26;assume 0 != main_~i2~0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; 15#L439-3true [2018-11-18 09:18:04,102 INFO L796 eck$LassoCheckResult]: Loop: 15#L439-3true assume true; 34#L439-1true assume !!(main_~i2~0 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 7#L113true assume !(0 != ~mode1~0 % 256); 72#L129true assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite0 := ~send1~0; 68#L129-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; 3#L113-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; 90#L141true assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 60#L144true assume !(node2_~m2~0 != ~nomsg~0); 56#L144-1true ~mode2~0 := 0; 87#L141-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; 62#L166true assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 41#L169true assume !(node3_~m3~0 != ~nomsg~0); 37#L169-1true ~mode3~0 := 0; 78#L166-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; 69#L191true assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 50#L194true assume !(node4_~m4~0 != ~nomsg~0); 49#L194-1true ~mode4~0 := 0; 36#L191-2true assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 52#L216true assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 5#L219true assume !(node5_~m5~0 != ~nomsg~0); 4#L219-1true ~mode5~0 := 0; 48#L216-2true assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 83#L375true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1 := 0; 84#L375-1true check_#res := check_~tmp~1; 39#L395true main_#t~ret27 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret27;havoc main_#t~ret27;assume { :begin_inline_assert } true;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 65#L469true assume !(0 == assert_~arg % 256); 26#L464true assume { :end_inline_assert } true;main_#t~post28 := main_~i2~0;main_~i2~0 := 1 + main_#t~post28;havoc main_#t~post28; 15#L439-3true [2018-11-18 09:18:04,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:18:04,107 INFO L82 PathProgramCache]: Analyzing trace with hash 28874490, now seen corresponding path program 1 times [2018-11-18 09:18:04,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:18:04,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:18:04,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:04,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:18:04,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:04,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:18:04,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:18:04,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:18:04,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:18:04,243 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 09:18:04,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:18:04,243 INFO L82 PathProgramCache]: Analyzing trace with hash -593397871, now seen corresponding path program 1 times [2018-11-18 09:18:04,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:18:04,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:18:04,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:04,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:18:04,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:04,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:18:04,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:18:04,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:18:04,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 09:18:04,333 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 09:18:04,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 09:18:04,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:18:04,344 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 4 states. [2018-11-18 09:18:04,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:18:04,397 INFO L93 Difference]: Finished difference Result 93 states and 153 transitions. [2018-11-18 09:18:04,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 09:18:04,399 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 153 transitions. [2018-11-18 09:18:04,401 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2018-11-18 09:18:04,404 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 86 states and 116 transitions. [2018-11-18 09:18:04,405 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 86 [2018-11-18 09:18:04,406 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 86 [2018-11-18 09:18:04,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 86 states and 116 transitions. [2018-11-18 09:18:04,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 09:18:04,407 INFO L705 BuchiCegarLoop]: Abstraction has 86 states and 116 transitions. [2018-11-18 09:18:04,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states and 116 transitions. [2018-11-18 09:18:04,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-11-18 09:18:04,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-18 09:18:04,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 116 transitions. [2018-11-18 09:18:04,434 INFO L728 BuchiCegarLoop]: Abstraction has 86 states and 116 transitions. [2018-11-18 09:18:04,434 INFO L608 BuchiCegarLoop]: Abstraction has 86 states and 116 transitions. [2018-11-18 09:18:04,434 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 09:18:04,434 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 116 transitions. [2018-11-18 09:18:04,435 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2018-11-18 09:18:04,436 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:18:04,436 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:18:04,437 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:18:04,437 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:18:04,437 INFO L794 eck$LassoCheckResult]: Stem: 259#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;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~mode5~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~0 := 0;~p4~0 := 0;~send4~0 := 0;~p5~0 := 0;~send5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.base(), ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.offset();~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; 221#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc 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~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~ret26, main_#t~ret27, main_#t~post28, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet5;havoc main_#t~nondet5;~id1~0 := main_#t~nondet6;havoc main_#t~nondet6;~st1~0 := main_#t~nondet7;havoc main_#t~nondet7;~send1~0 := main_#t~nondet8;havoc main_#t~nondet8;~mode1~0 := main_#t~nondet9;havoc main_#t~nondet9;~id2~0 := main_#t~nondet10;havoc main_#t~nondet10;~st2~0 := main_#t~nondet11;havoc main_#t~nondet11;~send2~0 := main_#t~nondet12;havoc main_#t~nondet12;~mode2~0 := main_#t~nondet13;havoc main_#t~nondet13;~id3~0 := main_#t~nondet14;havoc main_#t~nondet14;~st3~0 := main_#t~nondet15;havoc main_#t~nondet15;~send3~0 := main_#t~nondet16;havoc main_#t~nondet16;~mode3~0 := main_#t~nondet17;havoc main_#t~nondet17;~id4~0 := main_#t~nondet18;havoc main_#t~nondet18;~st4~0 := main_#t~nondet19;havoc main_#t~nondet19;~send4~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode4~0 := main_#t~nondet21;havoc main_#t~nondet21;~id5~0 := main_#t~nondet22;havoc main_#t~nondet22;~st5~0 := main_#t~nondet23;havoc main_#t~nondet23;~send5~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode5~0 := main_#t~nondet25;havoc main_#t~nondet25;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 222#L242 assume 0 == ~r1~0; 247#L243 assume ~id1~0 >= 0; 276#L244 assume 0 == ~st1~0; 257#L245 assume ~send1~0 == ~id1~0; 258#L246 assume 0 == ~mode1~0 % 256; 280#L247 assume ~id2~0 >= 0; 232#L248 assume 0 == ~st2~0; 233#L249 assume ~send2~0 == ~id2~0; 268#L250 assume 0 == ~mode2~0 % 256; 271#L251 assume ~id3~0 >= 0; 213#L252 assume 0 == ~st3~0; 214#L253 assume ~send3~0 == ~id3~0; 249#L254 assume 0 == ~mode3~0 % 256; 223#L255 assume ~id4~0 >= 0; 224#L256 assume 0 == ~st4~0; 260#L257 assume ~send4~0 == ~id4~0; 281#L258 assume 0 == ~mode4~0 % 256; 235#L259 assume ~id5~0 >= 0; 236#L260 assume 0 == ~st5~0; 269#L261 assume ~send5~0 == ~id5~0; 272#L262 assume 0 == ~mode5~0 % 256; 215#L263 assume ~id1~0 != ~id2~0; 216#L264 assume ~id1~0 != ~id3~0; 250#L265 assume ~id1~0 != ~id4~0; 225#L266 assume ~id1~0 != ~id5~0; 226#L267 assume ~id2~0 != ~id3~0; 261#L268 assume ~id2~0 != ~id4~0; 282#L269 assume ~id2~0 != ~id5~0; 237#L270 assume ~id3~0 != ~id4~0; 238#L271 assume ~id3~0 != ~id5~0; 239#L272 assume ~id4~0 != ~id5~0;init_~tmp~0 := 1; 244#L242-1 init_#res := init_~tmp~0; 245#L367 main_#t~ret26 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret26;havoc main_#t~ret26;assume 0 != main_~i2~0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; 219#L439-3 [2018-11-18 09:18:04,438 INFO L796 eck$LassoCheckResult]: Loop: 219#L439-3 assume true; 220#L439-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 208#L113 assume !(0 != ~mode1~0 % 256); 209#L129 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite0 := ~send1~0; 278#L129-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; 199#L113-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; 200#L141 assume !(0 != ~mode2~0 % 256); 240#L154 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; 241#L154-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; 265#L141-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; 275#L166 assume !(0 != ~mode3~0 % 256); 217#L179 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite2 := ~send3~0; 211#L179-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; 212#L166-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; 279#L191 assume !(0 != ~mode4~0 % 256); 229#L204 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite3 := ~send4~0; 227#L204-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; 228#L191-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 248#L216 assume !(0 != ~mode5~0 % 256); 266#L229 assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite4 := ~send5~0; 284#L229-2 ~p5_new~0 := (if node5_#t~ite4 % 256 <= 127 then node5_#t~ite4 % 256 else node5_#t~ite4 % 256 - 256);havoc node5_#t~ite4;~mode5~0 := 1; 202#L216-2 assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 262#L375 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1 := 0; 230#L375-1 check_#res := check_~tmp~1; 252#L395 main_#t~ret27 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret27;havoc main_#t~ret27;assume { :begin_inline_assert } true;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 253#L469 assume !(0 == assert_~arg % 256); 234#L464 assume { :end_inline_assert } true;main_#t~post28 := main_~i2~0;main_~i2~0 := 1 + main_#t~post28;havoc main_#t~post28; 219#L439-3 [2018-11-18 09:18:04,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:18:04,438 INFO L82 PathProgramCache]: Analyzing trace with hash -806541263, now seen corresponding path program 1 times [2018-11-18 09:18:04,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:18:04,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:18:04,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:04,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:18:04,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:04,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:18:04,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:18:04,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:18:04,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1723032425, now seen corresponding path program 1 times [2018-11-18 09:18:04,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:18:04,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:18:04,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:04,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:18:04,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:04,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:18:04,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:18:04,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:18:04,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 09:18:04,580 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 09:18:04,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 09:18:04,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 09:18:04,581 INFO L87 Difference]: Start difference. First operand 86 states and 116 transitions. cyclomatic complexity: 31 Second operand 5 states. [2018-11-18 09:18:04,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:18:04,626 INFO L93 Difference]: Finished difference Result 89 states and 118 transitions. [2018-11-18 09:18:04,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 09:18:04,628 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 118 transitions. [2018-11-18 09:18:04,630 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2018-11-18 09:18:04,631 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 86 states and 113 transitions. [2018-11-18 09:18:04,631 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 86 [2018-11-18 09:18:04,631 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 86 [2018-11-18 09:18:04,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 86 states and 113 transitions. [2018-11-18 09:18:04,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 09:18:04,632 INFO L705 BuchiCegarLoop]: Abstraction has 86 states and 113 transitions. [2018-11-18 09:18:04,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states and 113 transitions. [2018-11-18 09:18:04,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-11-18 09:18:04,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-18 09:18:04,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 113 transitions. [2018-11-18 09:18:04,636 INFO L728 BuchiCegarLoop]: Abstraction has 86 states and 113 transitions. [2018-11-18 09:18:04,636 INFO L608 BuchiCegarLoop]: Abstraction has 86 states and 113 transitions. [2018-11-18 09:18:04,636 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 09:18:04,636 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 113 transitions. [2018-11-18 09:18:04,637 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2018-11-18 09:18:04,637 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:18:04,637 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:18:04,638 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:18:04,638 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:18:04,639 INFO L794 eck$LassoCheckResult]: Stem: 446#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;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~mode5~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~0 := 0;~p4~0 := 0;~send4~0 := 0;~p5~0 := 0;~send5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.base(), ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.offset();~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; 406#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc 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~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~ret26, main_#t~ret27, main_#t~post28, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet5;havoc main_#t~nondet5;~id1~0 := main_#t~nondet6;havoc main_#t~nondet6;~st1~0 := main_#t~nondet7;havoc main_#t~nondet7;~send1~0 := main_#t~nondet8;havoc main_#t~nondet8;~mode1~0 := main_#t~nondet9;havoc main_#t~nondet9;~id2~0 := main_#t~nondet10;havoc main_#t~nondet10;~st2~0 := main_#t~nondet11;havoc main_#t~nondet11;~send2~0 := main_#t~nondet12;havoc main_#t~nondet12;~mode2~0 := main_#t~nondet13;havoc main_#t~nondet13;~id3~0 := main_#t~nondet14;havoc main_#t~nondet14;~st3~0 := main_#t~nondet15;havoc main_#t~nondet15;~send3~0 := main_#t~nondet16;havoc main_#t~nondet16;~mode3~0 := main_#t~nondet17;havoc main_#t~nondet17;~id4~0 := main_#t~nondet18;havoc main_#t~nondet18;~st4~0 := main_#t~nondet19;havoc main_#t~nondet19;~send4~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode4~0 := main_#t~nondet21;havoc main_#t~nondet21;~id5~0 := main_#t~nondet22;havoc main_#t~nondet22;~st5~0 := main_#t~nondet23;havoc main_#t~nondet23;~send5~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode5~0 := main_#t~nondet25;havoc main_#t~nondet25;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 407#L242 assume 0 == ~r1~0; 434#L243 assume ~id1~0 >= 0; 463#L244 assume 0 == ~st1~0; 443#L245 assume ~send1~0 == ~id1~0; 444#L246 assume 0 == ~mode1~0 % 256; 467#L247 assume ~id2~0 >= 0; 419#L248 assume 0 == ~st2~0; 420#L249 assume ~send2~0 == ~id2~0; 454#L250 assume 0 == ~mode2~0 % 256; 458#L251 assume ~id3~0 >= 0; 400#L252 assume 0 == ~st3~0; 401#L253 assume ~send3~0 == ~id3~0; 435#L254 assume 0 == ~mode3~0 % 256; 408#L255 assume ~id4~0 >= 0; 409#L256 assume 0 == ~st4~0; 447#L257 assume ~send4~0 == ~id4~0; 468#L258 assume 0 == ~mode4~0 % 256; 422#L259 assume ~id5~0 >= 0; 423#L260 assume 0 == ~st5~0; 456#L261 assume ~send5~0 == ~id5~0; 459#L262 assume 0 == ~mode5~0 % 256; 402#L263 assume ~id1~0 != ~id2~0; 403#L264 assume ~id1~0 != ~id3~0; 437#L265 assume ~id1~0 != ~id4~0; 412#L266 assume ~id1~0 != ~id5~0; 413#L267 assume ~id2~0 != ~id3~0; 448#L268 assume ~id2~0 != ~id4~0; 469#L269 assume ~id2~0 != ~id5~0; 424#L270 assume ~id3~0 != ~id4~0; 425#L271 assume ~id3~0 != ~id5~0; 426#L272 assume ~id4~0 != ~id5~0;init_~tmp~0 := 1; 431#L242-1 init_#res := init_~tmp~0; 432#L367 main_#t~ret26 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret26;havoc main_#t~ret26;assume 0 != main_~i2~0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; 410#L439-3 [2018-11-18 09:18:04,639 INFO L796 eck$LassoCheckResult]: Loop: 410#L439-3 assume true; 411#L439-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 395#L113 assume !(0 != ~mode1~0 % 256); 396#L129 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite0 := ~send1~0; 465#L129-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; 386#L113-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; 387#L141 assume !(0 != ~mode2~0 % 256); 427#L154 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; 428#L154-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; 452#L141-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; 462#L166 assume !(0 != ~mode3~0 % 256); 404#L179 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite2 := ~send3~0; 398#L179-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; 399#L166-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; 466#L191 assume !(0 != ~mode4~0 % 256); 416#L204 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite3 := ~send4~0; 414#L204-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; 415#L191-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 436#L216 assume !(0 != ~mode5~0 % 256); 453#L229 assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite4 := ~send5~0; 471#L229-2 ~p5_new~0 := (if node5_#t~ite4 % 256 <= 127 then node5_#t~ite4 % 256 else node5_#t~ite4 % 256 - 256);havoc node5_#t~ite4;~mode5~0 := 1; 389#L216-2 assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 449#L375 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; 392#L376 assume ~r1~0 >= 5; 393#L380 assume ~r1~0 < 5;check_~tmp~1 := 1; 417#L375-1 check_#res := check_~tmp~1; 439#L395 main_#t~ret27 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret27;havoc main_#t~ret27;assume { :begin_inline_assert } true;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 440#L469 assume !(0 == assert_~arg % 256); 421#L464 assume { :end_inline_assert } true;main_#t~post28 := main_~i2~0;main_~i2~0 := 1 + main_#t~post28;havoc main_#t~post28; 410#L439-3 [2018-11-18 09:18:04,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:18:04,639 INFO L82 PathProgramCache]: Analyzing trace with hash -806541263, now seen corresponding path program 2 times [2018-11-18 09:18:04,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:18:04,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:18:04,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:04,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:18:04,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:04,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:18:04,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:18:04,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:18:04,672 INFO L82 PathProgramCache]: Analyzing trace with hash 855932633, now seen corresponding path program 1 times [2018-11-18 09:18:04,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:18:04,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:18:04,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:04,674 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:18:04,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:04,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:18:04,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:18:04,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:18:04,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:18:04,705 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 09:18:04,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:18:04,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:18:04,705 INFO L87 Difference]: Start difference. First operand 86 states and 113 transitions. cyclomatic complexity: 28 Second operand 3 states. [2018-11-18 09:18:04,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:18:04,730 INFO L93 Difference]: Finished difference Result 131 states and 180 transitions. [2018-11-18 09:18:04,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:18:04,731 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 131 states and 180 transitions. [2018-11-18 09:18:04,732 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 96 [2018-11-18 09:18:04,733 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 131 states to 131 states and 180 transitions. [2018-11-18 09:18:04,734 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 131 [2018-11-18 09:18:04,734 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 131 [2018-11-18 09:18:04,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 131 states and 180 transitions. [2018-11-18 09:18:04,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 09:18:04,735 INFO L705 BuchiCegarLoop]: Abstraction has 131 states and 180 transitions. [2018-11-18 09:18:04,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states and 180 transitions. [2018-11-18 09:18:04,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-11-18 09:18:04,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-18 09:18:04,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 180 transitions. [2018-11-18 09:18:04,741 INFO L728 BuchiCegarLoop]: Abstraction has 131 states and 180 transitions. [2018-11-18 09:18:04,741 INFO L608 BuchiCegarLoop]: Abstraction has 131 states and 180 transitions. [2018-11-18 09:18:04,741 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 09:18:04,741 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 131 states and 180 transitions. [2018-11-18 09:18:04,742 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 96 [2018-11-18 09:18:04,742 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:18:04,742 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:18:04,743 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:18:04,743 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:18:04,743 INFO L794 eck$LassoCheckResult]: Stem: 669#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;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~mode5~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~0 := 0;~p4~0 := 0;~send4~0 := 0;~p5~0 := 0;~send5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.base(), ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.offset();~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; 631#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc 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~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~ret26, main_#t~ret27, main_#t~post28, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet5;havoc main_#t~nondet5;~id1~0 := main_#t~nondet6;havoc main_#t~nondet6;~st1~0 := main_#t~nondet7;havoc main_#t~nondet7;~send1~0 := main_#t~nondet8;havoc main_#t~nondet8;~mode1~0 := main_#t~nondet9;havoc main_#t~nondet9;~id2~0 := main_#t~nondet10;havoc main_#t~nondet10;~st2~0 := main_#t~nondet11;havoc main_#t~nondet11;~send2~0 := main_#t~nondet12;havoc main_#t~nondet12;~mode2~0 := main_#t~nondet13;havoc main_#t~nondet13;~id3~0 := main_#t~nondet14;havoc main_#t~nondet14;~st3~0 := main_#t~nondet15;havoc main_#t~nondet15;~send3~0 := main_#t~nondet16;havoc main_#t~nondet16;~mode3~0 := main_#t~nondet17;havoc main_#t~nondet17;~id4~0 := main_#t~nondet18;havoc main_#t~nondet18;~st4~0 := main_#t~nondet19;havoc main_#t~nondet19;~send4~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode4~0 := main_#t~nondet21;havoc main_#t~nondet21;~id5~0 := main_#t~nondet22;havoc main_#t~nondet22;~st5~0 := main_#t~nondet23;havoc main_#t~nondet23;~send5~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode5~0 := main_#t~nondet25;havoc main_#t~nondet25;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 632#L242 assume 0 == ~r1~0; 656#L243 assume ~id1~0 >= 0; 686#L244 assume 0 == ~st1~0; 667#L245 assume ~send1~0 == ~id1~0; 668#L246 assume 0 == ~mode1~0 % 256; 690#L247 assume ~id2~0 >= 0; 641#L248 assume 0 == ~st2~0; 642#L249 assume ~send2~0 == ~id2~0; 678#L250 assume 0 == ~mode2~0 % 256; 681#L251 assume ~id3~0 >= 0; 622#L252 assume 0 == ~st3~0; 623#L253 assume ~send3~0 == ~id3~0; 658#L254 assume 0 == ~mode3~0 % 256; 633#L255 assume ~id4~0 >= 0; 634#L256 assume 0 == ~st4~0; 670#L257 assume ~send4~0 == ~id4~0; 691#L258 assume 0 == ~mode4~0 % 256; 644#L259 assume ~id5~0 >= 0; 645#L260 assume 0 == ~st5~0; 679#L261 assume ~send5~0 == ~id5~0; 682#L262 assume 0 == ~mode5~0 % 256; 624#L263 assume ~id1~0 != ~id2~0; 625#L264 assume ~id1~0 != ~id3~0; 662#L265 assume ~id1~0 != ~id4~0; 637#L266 assume ~id1~0 != ~id5~0; 638#L267 assume ~id2~0 != ~id3~0; 671#L268 assume ~id2~0 != ~id4~0; 692#L269 assume ~id2~0 != ~id5~0; 646#L270 assume ~id3~0 != ~id4~0; 647#L271 assume ~id3~0 != ~id5~0; 648#L272 assume ~id4~0 != ~id5~0;init_~tmp~0 := 1; 653#L242-1 init_#res := init_~tmp~0; 654#L367 main_#t~ret26 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret26;havoc main_#t~ret26;assume 0 != main_~i2~0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; 694#L439-3 [2018-11-18 09:18:04,743 INFO L796 eck$LassoCheckResult]: Loop: 694#L439-3 assume true; 735#L439-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 734#L113 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 619#L117 assume !(node1_~m1~0 != ~nomsg~0); 627#L117-1 ~mode1~0 := 0; 628#L113-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; 731#L141 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 729#L144 assume !(node2_~m2~0 != ~nomsg~0); 726#L144-1 ~mode2~0 := 0; 724#L141-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; 723#L166 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 722#L169 assume !(node3_~m3~0 != ~nomsg~0); 717#L169-1 ~mode3~0 := 0; 716#L166-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; 715#L191 assume !(0 != ~mode4~0 % 256); 711#L204 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite3 := ~send4~0; 710#L204-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; 708#L191-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 707#L216 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 704#L219 assume !(node5_~m5~0 != ~nomsg~0); 701#L219-1 ~mode5~0 := 0; 700#L216-2 assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 699#L375 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; 698#L376 assume !(~r1~0 >= 5); 696#L379 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; 697#L380 assume ~r1~0 < 5;check_~tmp~1 := 1; 739#L375-1 check_#res := check_~tmp~1; 738#L395 main_#t~ret27 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret27;havoc main_#t~ret27;assume { :begin_inline_assert } true;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 737#L469 assume !(0 == assert_~arg % 256); 736#L464 assume { :end_inline_assert } true;main_#t~post28 := main_~i2~0;main_~i2~0 := 1 + main_#t~post28;havoc main_#t~post28; 694#L439-3 [2018-11-18 09:18:04,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:18:04,744 INFO L82 PathProgramCache]: Analyzing trace with hash -806541263, now seen corresponding path program 3 times [2018-11-18 09:18:04,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:18:04,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:18:04,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:04,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:18:04,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:04,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:18:04,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:18:04,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:18:04,770 INFO L82 PathProgramCache]: Analyzing trace with hash -953350166, now seen corresponding path program 1 times [2018-11-18 09:18:04,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:18:04,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:18:04,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:04,771 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:18:04,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:04,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:18:04,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:18:04,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:18:04,791 INFO L82 PathProgramCache]: Analyzing trace with hash 88718362, now seen corresponding path program 1 times [2018-11-18 09:18:04,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:18:04,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:18:04,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:04,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:18:04,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:18:04,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:18:04,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:18:04,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:18:04,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:18:05,172 WARN L180 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 143 [2018-11-18 09:18:06,042 WARN L180 SmtUtils]: Spent 851.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 127 [2018-11-18 09:18:06,049 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 09:18:06,050 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 09:18:06,050 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 09:18:06,050 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 09:18:06,050 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 09:18:06,050 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:18:06,050 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 09:18:06,050 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 09:18:06,050 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr.5_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c_Iteration4_Loop [2018-11-18 09:18:06,050 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 09:18:06,050 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 09:18:06,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:06,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:06,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:06,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:06,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:06,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:06,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:06,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:06,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:06,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:06,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:06,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:06,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:06,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:06,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:06,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:06,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:06,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:06,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:06,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:06,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:06,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:06,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:06,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:06,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:06,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:06,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:06,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:06,447 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2018-11-18 09:18:07,323 WARN L180 SmtUtils]: Spent 745.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 92 [2018-11-18 09:18:07,348 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 09:18:07,349 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3cfc8bba-f7ed-4c13-a9dd-4386356dda28/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:18:07,354 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:18:07,354 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3cfc8bba-f7ed-4c13-a9dd-4386356dda28/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:18:07,376 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 09:18:07,376 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:18:07,504 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 09:18:07,506 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 09:18:07,506 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 09:18:07,506 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 09:18:07,506 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 09:18:07,506 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 09:18:07,506 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:18:07,506 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 09:18:07,506 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 09:18:07,506 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr.5_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c_Iteration4_Loop [2018-11-18 09:18:07,506 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 09:18:07,507 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 09:18:07,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:07,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:07,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:07,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:07,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:07,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:07,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:07,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:07,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:07,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:07,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:07,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:07,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:07,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:07,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:07,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:07,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:07,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:07,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:07,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:07,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:07,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:07,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:07,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:07,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:07,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:07,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:07,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:18:07,870 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2018-11-18 09:18:08,660 WARN L180 SmtUtils]: Spent 681.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 92 [2018-11-18 09:18:08,678 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 09:18:08,681 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 09:18:08,682 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:08,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:08,683 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:08,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:08,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:08,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:08,685 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:08,685 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:08,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:08,688 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:08,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:08,689 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:08,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:08,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:08,689 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:08,689 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:08,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:08,690 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:08,690 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:08,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:08,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:08,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:08,691 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:08,692 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:08,692 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:08,693 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:08,693 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:08,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:08,694 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:08,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:08,694 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:18:08,694 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:08,695 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:18:08,695 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:08,697 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:08,697 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:08,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:08,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:08,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:08,698 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:08,699 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:08,699 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:08,701 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:08,701 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:08,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:08,701 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:08,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:08,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:08,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:08,702 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:08,702 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:08,704 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:08,704 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:08,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:08,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:08,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:08,705 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:08,706 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:08,706 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:08,713 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:08,713 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:08,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:08,714 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:08,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:08,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:08,714 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:08,715 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:08,715 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:08,716 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:08,716 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:08,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:08,717 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:08,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:08,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:08,717 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:08,717 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:08,717 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:08,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:08,718 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:08,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:08,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:08,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:08,719 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:08,720 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:18:08,720 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:18:08,722 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:08,722 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:08,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:08,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:08,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:08,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:08,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:08,723 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:08,723 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:08,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:18:08,724 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:18:08,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:18:08,724 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:18:08,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:18:08,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:18:08,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:18:08,725 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:18:08,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:18:08,726 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 09:18:08,729 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 09:18:08,729 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 09:18:08,731 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 09:18:08,731 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 09:18:08,731 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 09:18:08,731 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 19 Supporting invariants [] [2018-11-18 09:18:08,732 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 09:18:08,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:18:08,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:18:08,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:18:08,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:18:08,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:18:08,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:18:08,819 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 09:18:08,820 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 131 states and 180 transitions. cyclomatic complexity: 50 Second operand 4 states. [2018-11-18 09:18:08,853 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 131 states and 180 transitions. cyclomatic complexity: 50. Second operand 4 states. Result 226 states and 325 transitions. Complement of second has 6 states. [2018-11-18 09:18:08,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 09:18:08,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 09:18:08,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2018-11-18 09:18:08,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 113 transitions. Stem has 35 letters. Loop has 30 letters. [2018-11-18 09:18:08,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:18:08,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 113 transitions. Stem has 65 letters. Loop has 30 letters. [2018-11-18 09:18:08,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:18:08,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 113 transitions. Stem has 35 letters. Loop has 60 letters. [2018-11-18 09:18:08,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:18:08,857 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 226 states and 325 transitions. [2018-11-18 09:18:08,859 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 09:18:08,859 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 226 states to 0 states and 0 transitions. [2018-11-18 09:18:08,859 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 09:18:08,859 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 09:18:08,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 09:18:08,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 09:18:08,859 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 09:18:08,859 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 09:18:08,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:18:08,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:18:08,860 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2018-11-18 09:18:08,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:18:08,860 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-18 09:18:08,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 09:18:08,860 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-18 09:18:08,860 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 09:18:08,860 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 09:18:08,860 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 09:18:08,860 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 09:18:08,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 09:18:08,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 09:18:08,861 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 09:18:08,861 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 09:18:08,861 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 09:18:08,861 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 09:18:08,861 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 09:18:08,861 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 09:18:08,861 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 09:18:08,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 09:18:08 BoogieIcfgContainer [2018-11-18 09:18:08,866 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 09:18:08,866 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 09:18:08,866 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 09:18:08,866 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 09:18:08,866 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:18:04" (3/4) ... [2018-11-18 09:18:08,869 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 09:18:08,869 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 09:18:08,869 INFO L168 Benchmark]: Toolchain (without parser) took 5631.23 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 328.2 MB). Free memory was 953.8 MB in the beginning and 970.9 MB in the end (delta: -17.2 MB). Peak memory consumption was 311.0 MB. Max. memory is 11.5 GB. [2018-11-18 09:18:08,870 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 09:18:08,870 INFO L168 Benchmark]: CACSL2BoogieTranslator took 254.84 ms. Allocated memory is still 1.0 GB. Free memory was 951.1 MB in the beginning and 935.0 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-18 09:18:08,870 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 935.0 MB in the beginning and 1.2 GB in the end (delta: -221.4 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2018-11-18 09:18:08,871 INFO L168 Benchmark]: Boogie Preprocessor took 25.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2018-11-18 09:18:08,871 INFO L168 Benchmark]: RCFGBuilder took 414.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 39.3 MB). Peak memory consumption was 39.3 MB. Max. memory is 11.5 GB. [2018-11-18 09:18:08,872 INFO L168 Benchmark]: BuchiAutomizer took 4855.74 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 167.2 MB). Free memory was 1.1 GB in the beginning and 970.9 MB in the end (delta: 142.9 MB). Peak memory consumption was 310.2 MB. Max. memory is 11.5 GB. [2018-11-18 09:18:08,872 INFO L168 Benchmark]: Witness Printer took 2.85 ms. Allocated memory is still 1.4 GB. Free memory is still 970.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 09:18:08,874 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 254.84 ms. Allocated memory is still 1.0 GB. Free memory was 951.1 MB in the beginning and 935.0 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 74.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 935.0 MB in the beginning and 1.2 GB in the end (delta: -221.4 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 414.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 39.3 MB). Peak memory consumption was 39.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4855.74 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 167.2 MB). Free memory was 1.1 GB in the beginning and 970.9 MB in the end (delta: 142.9 MB). Peak memory consumption was 310.2 MB. Max. memory is 11.5 GB. * Witness Printer took 2.85 ms. Allocated memory is still 1.4 GB. Free memory is still 970.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 19 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 4.8s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 4.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 131 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 548 SDtfs, 180 SDslu, 783 SDs, 0 SdLazy, 32 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital650 mio100 ax109 hnf102 lsp15 ukn78 mio100 lsp100 div137 bol100 ite100 ukn100 eq188 hnf75 smp100 dnf707 smp49 tf100 neg99 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 2ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...