./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3_true-unreach-call.ufo.BOUNDED-6.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_216a629e-b313-4e44-b086-7e4c34f61d6b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_216a629e-b313-4e44-b086-7e4c34f61d6b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_216a629e-b313-4e44-b086-7e4c34f61d6b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_216a629e-b313-4e44-b086-7e4c34f61d6b/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3_true-unreach-call.ufo.BOUNDED-6.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_216a629e-b313-4e44-b086-7e4c34f61d6b/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_216a629e-b313-4e44-b086-7e4c34f61d6b/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 7ec78bcf477493ed3d3d8f07f2c43f18a2cf41d6 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 11:49:55,028 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 11:49:55,030 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 11:49:55,036 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 11:49:55,036 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 11:49:55,036 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 11:49:55,037 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 11:49:55,038 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 11:49:55,038 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 11:49:55,039 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 11:49:55,040 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 11:49:55,040 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 11:49:55,040 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 11:49:55,041 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 11:49:55,042 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 11:49:55,042 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 11:49:55,043 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 11:49:55,044 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 11:49:55,045 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 11:49:55,046 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 11:49:55,047 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 11:49:55,047 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 11:49:55,049 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 11:49:55,049 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 11:49:55,049 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 11:49:55,050 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 11:49:55,050 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 11:49:55,051 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 11:49:55,051 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 11:49:55,052 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 11:49:55,052 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 11:49:55,052 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 11:49:55,052 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 11:49:55,053 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 11:49:55,053 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 11:49:55,053 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 11:49:55,054 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_216a629e-b313-4e44-b086-7e4c34f61d6b/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 11:49:55,062 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 11:49:55,062 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 11:49:55,063 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 11:49:55,063 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 11:49:55,064 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 11:49:55,064 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 11:49:55,064 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 11:49:55,064 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 11:49:55,064 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 11:49:55,064 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 11:49:55,064 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 11:49:55,065 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 11:49:55,065 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 11:49:55,065 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 11:49:55,065 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 11:49:55,065 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 11:49:55,065 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 11:49:55,065 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 11:49:55,065 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 11:49:55,066 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 11:49:55,066 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 11:49:55,066 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 11:49:55,066 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 11:49:55,066 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 11:49:55,066 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 11:49:55,066 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 11:49:55,066 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 11:49:55,067 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 11:49:55,067 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 11:49:55,067 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 11:49:55,067 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 11:49:55,068 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 11:49:55,068 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_216a629e-b313-4e44-b086-7e4c34f61d6b/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 -> 7ec78bcf477493ed3d3d8f07f2c43f18a2cf41d6 [2018-11-18 11:49:55,091 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 11:49:55,100 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 11:49:55,103 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 11:49:55,104 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 11:49:55,104 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 11:49:55,105 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_216a629e-b313-4e44-b086-7e4c34f61d6b/bin-2019/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3_true-unreach-call.ufo.BOUNDED-6.pals_true-termination.c [2018-11-18 11:49:55,149 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_216a629e-b313-4e44-b086-7e4c34f61d6b/bin-2019/uautomizer/data/1dc83687c/82ac6682fdf94cdb98f8bdd9f098c19a/FLAG88434e3a6 [2018-11-18 11:49:55,590 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 11:49:55,591 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_216a629e-b313-4e44-b086-7e4c34f61d6b/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3_true-unreach-call.ufo.BOUNDED-6.pals_true-termination.c [2018-11-18 11:49:55,598 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_216a629e-b313-4e44-b086-7e4c34f61d6b/bin-2019/uautomizer/data/1dc83687c/82ac6682fdf94cdb98f8bdd9f098c19a/FLAG88434e3a6 [2018-11-18 11:49:55,609 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_216a629e-b313-4e44-b086-7e4c34f61d6b/bin-2019/uautomizer/data/1dc83687c/82ac6682fdf94cdb98f8bdd9f098c19a [2018-11-18 11:49:55,611 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 11:49:55,612 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 11:49:55,613 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 11:49:55,613 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 11:49:55,616 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 11:49:55,617 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:49:55" (1/1) ... [2018-11-18 11:49:55,619 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@268d617c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:49:55, skipping insertion in model container [2018-11-18 11:49:55,619 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:49:55" (1/1) ... [2018-11-18 11:49:55,627 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 11:49:55,651 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 11:49:55,792 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:49:55,801 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 11:49:55,824 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:49:55,874 INFO L195 MainTranslator]: Completed translation [2018-11-18 11:49:55,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:49:55 WrapperNode [2018-11-18 11:49:55,875 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 11:49:55,875 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 11:49:55,875 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 11:49:55,875 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 11:49:55,880 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:49:55" (1/1) ... [2018-11-18 11:49:55,885 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:49:55" (1/1) ... [2018-11-18 11:49:55,901 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 11:49:55,901 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 11:49:55,901 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 11:49:55,902 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 11:49:55,907 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:49:55" (1/1) ... [2018-11-18 11:49:55,907 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:49:55" (1/1) ... [2018-11-18 11:49:55,909 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:49:55" (1/1) ... [2018-11-18 11:49:55,909 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:49:55" (1/1) ... [2018-11-18 11:49:55,913 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:49:55" (1/1) ... [2018-11-18 11:49:55,918 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:49:55" (1/1) ... [2018-11-18 11:49:55,920 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:49:55" (1/1) ... [2018-11-18 11:49:55,923 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 11:49:55,923 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 11:49:55,923 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 11:49:55,923 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 11:49:55,924 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:49:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_216a629e-b313-4e44-b086-7e4c34f61d6b/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 11:49:55,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 11:49:55,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 11:49:56,261 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 11:49:56,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:49:56 BoogieIcfgContainer [2018-11-18 11:49:56,261 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 11:49:56,262 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 11:49:56,262 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 11:49:56,264 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 11:49:56,264 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 11:49:56,265 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 11:49:55" (1/3) ... [2018-11-18 11:49:56,265 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@71e40156 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 11:49:56, skipping insertion in model container [2018-11-18 11:49:56,265 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 11:49:56,265 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:49:55" (2/3) ... [2018-11-18 11:49:56,266 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@71e40156 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 11:49:56, skipping insertion in model container [2018-11-18 11:49:56,266 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 11:49:56,266 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:49:56" (3/3) ... [2018-11-18 11:49:56,268 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.3_true-unreach-call.ufo.BOUNDED-6.pals_true-termination.c [2018-11-18 11:49:56,310 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 11:49:56,311 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 11:49:56,311 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 11:49:56,311 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 11:49:56,311 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 11:49:56,311 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 11:49:56,311 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 11:49:56,311 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 11:49:56,312 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 11:49:56,325 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states. [2018-11-18 11:49:56,346 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 52 [2018-11-18 11:49:56,346 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:49:56,347 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:49:56,354 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 11:49:56,354 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] [2018-11-18 11:49:56,354 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 11:49:56,354 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states. [2018-11-18 11:49:56,357 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 52 [2018-11-18 11:49:56,358 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:49:56,358 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:49:56,358 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 11:49:56,358 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] [2018-11-18 11:49:56,366 INFO L794 eck$LassoCheckResult]: Stem: 37#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;~r1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~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]; 15#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~ret22, main_#t~ret23, main_#t~post24, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet6;havoc main_#t~nondet6;~id1~0 := main_#t~nondet7;havoc main_#t~nondet7;~st1~0 := main_#t~nondet8;havoc main_#t~nondet8;~send1~0 := main_#t~nondet9;havoc main_#t~nondet9;~mode1~0 := main_#t~nondet10;havoc main_#t~nondet10;~alive1~0 := main_#t~nondet11;havoc main_#t~nondet11;~id2~0 := main_#t~nondet12;havoc main_#t~nondet12;~st2~0 := main_#t~nondet13;havoc main_#t~nondet13;~send2~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode2~0 := main_#t~nondet15;havoc main_#t~nondet15;~alive2~0 := main_#t~nondet16;havoc main_#t~nondet16;~id3~0 := main_#t~nondet17;havoc main_#t~nondet17;~st3~0 := main_#t~nondet18;havoc main_#t~nondet18;~send3~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode3~0 := main_#t~nondet20;havoc main_#t~nondet20;~alive3~0 := main_#t~nondet21;havoc main_#t~nondet21;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 41#L205true assume !(0 == ~r1~0);init_~tmp~0 := 0; 38#L205-1true init_#res := init_~tmp~0; 10#L274true main_#t~ret22 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret22;havoc main_#t~ret22;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;main_~i2~0 := 0; 20#L329-3true [2018-11-18 11:49:56,366 INFO L796 eck$LassoCheckResult]: Loop: 20#L329-3true assume true; 16#L329-1true assume !!(main_~i2~0 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 8#L102true 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 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 36#L106true assume !(node1_~m1~0 != ~nomsg~0); 13#L106-1true ~mode1~0 := 0; 25#L102-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 54#L137true assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 59#L140true assume !(node2_~m2~0 != ~nomsg~0); 58#L140-1true ~mode2~0 := 0; 50#L137-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 17#L171true assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 77#L174true assume !(node3_~m3~0 != ~nomsg~0); 76#L174-1true ~mode3~0 := 0; 71#L171-2true assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 27#L282true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 44#L282-1true check_#res := check_~tmp~1; 48#L294true main_#t~ret23 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret23;havoc main_#t~ret23;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; 68#L353true assume !(0 == assert_~arg % 256); 40#L348true assume { :end_inline_assert } true;main_#t~post24 := main_~i2~0;main_~i2~0 := 1 + main_#t~post24;havoc main_#t~post24; 20#L329-3true [2018-11-18 11:49:56,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:49:56,370 INFO L82 PathProgramCache]: Analyzing trace with hash 28791078, now seen corresponding path program 1 times [2018-11-18 11:49:56,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:49:56,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:49:56,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:56,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:49:56,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:56,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:49:56,492 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 11:49:56,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:49:56,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:49:56,498 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 11:49:56,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:49:56,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1798022383, now seen corresponding path program 1 times [2018-11-18 11:49:56,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:49:56,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:49:56,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:56,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:49:56,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:56,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:49:56,565 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 11:49:56,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:49:56,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 11:49:56,567 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 11:49:56,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 11:49:56,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 11:49:56,577 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 4 states. [2018-11-18 11:49:56,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:49:56,635 INFO L93 Difference]: Finished difference Result 79 states and 125 transitions. [2018-11-18 11:49:56,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 11:49:56,637 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 125 transitions. [2018-11-18 11:49:56,640 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2018-11-18 11:49:56,644 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 72 states and 102 transitions. [2018-11-18 11:49:56,645 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72 [2018-11-18 11:49:56,645 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72 [2018-11-18 11:49:56,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 102 transitions. [2018-11-18 11:49:56,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 11:49:56,646 INFO L705 BuchiCegarLoop]: Abstraction has 72 states and 102 transitions. [2018-11-18 11:49:56,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 102 transitions. [2018-11-18 11:49:56,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-11-18 11:49:56,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-18 11:49:56,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 102 transitions. [2018-11-18 11:49:56,668 INFO L728 BuchiCegarLoop]: Abstraction has 72 states and 102 transitions. [2018-11-18 11:49:56,668 INFO L608 BuchiCegarLoop]: Abstraction has 72 states and 102 transitions. [2018-11-18 11:49:56,668 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 11:49:56,669 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 102 transitions. [2018-11-18 11:49:56,670 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2018-11-18 11:49:56,670 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:49:56,670 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:49:56,671 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] [2018-11-18 11:49:56,671 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] [2018-11-18 11:49:56,671 INFO L794 eck$LassoCheckResult]: Stem: 221#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~r1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~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]; 195#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~ret22, main_#t~ret23, main_#t~post24, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet6;havoc main_#t~nondet6;~id1~0 := main_#t~nondet7;havoc main_#t~nondet7;~st1~0 := main_#t~nondet8;havoc main_#t~nondet8;~send1~0 := main_#t~nondet9;havoc main_#t~nondet9;~mode1~0 := main_#t~nondet10;havoc main_#t~nondet10;~alive1~0 := main_#t~nondet11;havoc main_#t~nondet11;~id2~0 := main_#t~nondet12;havoc main_#t~nondet12;~st2~0 := main_#t~nondet13;havoc main_#t~nondet13;~send2~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode2~0 := main_#t~nondet15;havoc main_#t~nondet15;~alive2~0 := main_#t~nondet16;havoc main_#t~nondet16;~id3~0 := main_#t~nondet17;havoc main_#t~nondet17;~st3~0 := main_#t~nondet18;havoc main_#t~nondet18;~send3~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode3~0 := main_#t~nondet20;havoc main_#t~nondet20;~alive3~0 := main_#t~nondet21;havoc main_#t~nondet21;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 196#L205 assume 0 == ~r1~0; 225#L206 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; 240#L207 assume ~id1~0 >= 0; 176#L208 assume 0 == ~st1~0; 177#L209 assume ~send1~0 == ~id1~0; 214#L210 assume 0 == ~mode1~0 % 256; 233#L211 assume ~id2~0 >= 0; 193#L212 assume 0 == ~st2~0; 194#L213 assume ~send2~0 == ~id2~0; 237#L214 assume 0 == ~mode2~0 % 256; 201#L215 assume ~id3~0 >= 0; 202#L216 assume 0 == ~st3~0; 226#L217 assume ~send3~0 == ~id3~0; 241#L218 assume 0 == ~mode3~0 % 256; 180#L219 assume ~id1~0 != ~id2~0; 181#L220 assume ~id1~0 != ~id3~0; 216#L221 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 222#L205-1 init_#res := init_~tmp~0; 186#L274 main_#t~ret22 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret22;havoc main_#t~ret22;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;main_~i2~0 := 0; 187#L329-3 [2018-11-18 11:49:56,671 INFO L796 eck$LassoCheckResult]: Loop: 187#L329-3 assume true; 200#L329-1 assume !!(main_~i2~0 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 182#L102 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 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 184#L106 assume !(node1_~m1~0 != ~nomsg~0); 191#L106-1 ~mode1~0 := 0; 192#L102-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 208#L137 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 235#L140 assume !(node2_~m2~0 != ~nomsg~0); 206#L140-1 ~mode2~0 := 0; 179#L137-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 197#L171 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 199#L174 assume !(node3_~m3~0 != ~nomsg~0); 173#L174-1 ~mode3~0 := 0; 218#L171-2 assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 211#L282 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 212#L282-1 check_#res := check_~tmp~1; 227#L294 main_#t~ret23 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret23;havoc main_#t~ret23;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; 230#L353 assume !(0 == assert_~arg % 256); 224#L348 assume { :end_inline_assert } true;main_#t~post24 := main_~i2~0;main_~i2~0 := 1 + main_#t~post24;havoc main_#t~post24; 187#L329-3 [2018-11-18 11:49:56,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:49:56,672 INFO L82 PathProgramCache]: Analyzing trace with hash -47575204, now seen corresponding path program 1 times [2018-11-18 11:49:56,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:49:56,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:49:56,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:56,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:49:56,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:56,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:49:56,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:49:56,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:49:56,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1798022383, now seen corresponding path program 2 times [2018-11-18 11:49:56,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:49:56,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:49:56,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:56,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:49:56,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:56,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:49:56,772 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 11:49:56,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:49:56,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 11:49:56,773 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 11:49:56,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 11:49:56,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 11:49:56,774 INFO L87 Difference]: Start difference. First operand 72 states and 102 transitions. cyclomatic complexity: 31 Second operand 5 states. [2018-11-18 11:49:56,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:49:56,802 INFO L93 Difference]: Finished difference Result 75 states and 104 transitions. [2018-11-18 11:49:56,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 11:49:56,803 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 104 transitions. [2018-11-18 11:49:56,805 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2018-11-18 11:49:56,805 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 72 states and 100 transitions. [2018-11-18 11:49:56,806 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72 [2018-11-18 11:49:56,806 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72 [2018-11-18 11:49:56,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 100 transitions. [2018-11-18 11:49:56,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 11:49:56,807 INFO L705 BuchiCegarLoop]: Abstraction has 72 states and 100 transitions. [2018-11-18 11:49:56,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 100 transitions. [2018-11-18 11:49:56,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-11-18 11:49:56,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-18 11:49:56,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 100 transitions. [2018-11-18 11:49:56,812 INFO L728 BuchiCegarLoop]: Abstraction has 72 states and 100 transitions. [2018-11-18 11:49:56,812 INFO L608 BuchiCegarLoop]: Abstraction has 72 states and 100 transitions. [2018-11-18 11:49:56,812 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 11:49:56,812 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 100 transitions. [2018-11-18 11:49:56,813 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2018-11-18 11:49:56,813 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:49:56,813 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:49:56,814 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] [2018-11-18 11:49:56,814 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] [2018-11-18 11:49:56,815 INFO L794 eck$LassoCheckResult]: Stem: 380#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~r1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~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]; 354#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~ret22, main_#t~ret23, main_#t~post24, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet6;havoc main_#t~nondet6;~id1~0 := main_#t~nondet7;havoc main_#t~nondet7;~st1~0 := main_#t~nondet8;havoc main_#t~nondet8;~send1~0 := main_#t~nondet9;havoc main_#t~nondet9;~mode1~0 := main_#t~nondet10;havoc main_#t~nondet10;~alive1~0 := main_#t~nondet11;havoc main_#t~nondet11;~id2~0 := main_#t~nondet12;havoc main_#t~nondet12;~st2~0 := main_#t~nondet13;havoc main_#t~nondet13;~send2~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode2~0 := main_#t~nondet15;havoc main_#t~nondet15;~alive2~0 := main_#t~nondet16;havoc main_#t~nondet16;~id3~0 := main_#t~nondet17;havoc main_#t~nondet17;~st3~0 := main_#t~nondet18;havoc main_#t~nondet18;~send3~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode3~0 := main_#t~nondet20;havoc main_#t~nondet20;~alive3~0 := main_#t~nondet21;havoc main_#t~nondet21;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 355#L205 assume 0 == ~r1~0; 384#L206 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; 399#L207 assume ~id1~0 >= 0; 335#L208 assume 0 == ~st1~0; 336#L209 assume ~send1~0 == ~id1~0; 372#L210 assume 0 == ~mode1~0 % 256; 392#L211 assume ~id2~0 >= 0; 352#L212 assume 0 == ~st2~0; 353#L213 assume ~send2~0 == ~id2~0; 396#L214 assume 0 == ~mode2~0 % 256; 360#L215 assume ~id3~0 >= 0; 361#L216 assume 0 == ~st3~0; 385#L217 assume ~send3~0 == ~id3~0; 400#L218 assume 0 == ~mode3~0 % 256; 337#L219 assume ~id1~0 != ~id2~0; 338#L220 assume ~id1~0 != ~id3~0; 373#L221 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 381#L205-1 init_#res := init_~tmp~0; 345#L274 main_#t~ret22 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret22;havoc main_#t~ret22;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;main_~i2~0 := 0; 346#L329-3 [2018-11-18 11:49:56,815 INFO L796 eck$LassoCheckResult]: Loop: 346#L329-3 assume true; 356#L329-1 assume !!(main_~i2~0 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 341#L102 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 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 343#L106 assume !(node1_~m1~0 != ~nomsg~0); 350#L106-1 ~mode1~0 := 0; 351#L102-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 367#L137 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 394#L140 assume !(node2_~m2~0 != ~nomsg~0); 365#L140-1 ~mode2~0 := 0; 340#L137-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 357#L171 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 359#L174 assume !(node3_~m3~0 != ~nomsg~0); 332#L174-1 ~mode3~0 := 0; 376#L171-2 assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 370#L282 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 371#L283 assume ~r1~0 < 3;check_~tmp~1 := 1; 378#L282-1 check_#res := check_~tmp~1; 386#L294 main_#t~ret23 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret23;havoc main_#t~ret23;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; 389#L353 assume !(0 == assert_~arg % 256); 383#L348 assume { :end_inline_assert } true;main_#t~post24 := main_~i2~0;main_~i2~0 := 1 + main_#t~post24;havoc main_#t~post24; 346#L329-3 [2018-11-18 11:49:56,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:49:56,815 INFO L82 PathProgramCache]: Analyzing trace with hash -47575204, now seen corresponding path program 2 times [2018-11-18 11:49:56,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:49:56,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:49:56,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:56,821 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:49:56,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:56,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:49:56,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:49:56,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:49:56,854 INFO L82 PathProgramCache]: Analyzing trace with hash -287446291, now seen corresponding path program 1 times [2018-11-18 11:49:56,854 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:49:56,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:49:56,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:56,855 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:49:56,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:56,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:49:56,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:49:56,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:49:56,874 INFO L82 PathProgramCache]: Analyzing trace with hash 600424136, now seen corresponding path program 1 times [2018-11-18 11:49:56,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:49:56,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:49:56,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:56,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:49:56,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:56,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:49:56,913 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 11:49:56,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:49:56,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:49:57,100 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 97 [2018-11-18 11:49:57,448 WARN L180 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 86 [2018-11-18 11:49:57,455 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 11:49:57,456 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 11:49:57,456 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 11:49:57,456 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 11:49:57,456 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 11:49:57,456 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:49:57,456 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 11:49:57,457 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 11:49:57,457 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.3_true-unreach-call.ufo.BOUNDED-6.pals_true-termination.c_Iteration3_Loop [2018-11-18 11:49:57,457 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 11:49:57,457 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 11:49:57,475 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 11:49:57,484 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 11:49:57,488 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 11:49:57,490 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 11:49:57,491 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 11:49:57,492 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 11:49:57,505 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 11:49:57,506 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 11:49:57,513 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 11:49:57,514 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 11:49:57,516 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 11:49:57,537 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 11:49:57,538 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 11:49:57,545 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 11:49:57,546 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 11:49:57,547 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 11:49:57,549 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 11:49:57,551 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 11:49:57,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:49:57,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 11:49:57,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:49:57,576 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 11:49:57,577 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 11:49:57,853 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 11:49:57,854 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_216a629e-b313-4e44-b086-7e4c34f61d6b/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 11:49:57,857 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:49:57,857 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_216a629e-b313-4e44-b086-7e4c34f61d6b/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 11:49:57,881 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 11:49:57,881 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:49:57,961 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 11:49:57,963 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 11:49:57,963 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 11:49:57,963 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 11:49:57,963 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 11:49:57,963 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 11:49:57,963 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:49:57,963 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 11:49:57,963 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 11:49:57,963 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.3_true-unreach-call.ufo.BOUNDED-6.pals_true-termination.c_Iteration3_Loop [2018-11-18 11:49:57,963 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 11:49:57,963 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 11:49:57,967 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 11:49:57,987 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 11:49:57,990 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 11:49:57,992 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 11:49:57,993 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 11:49:57,994 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 11:49:57,995 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 11:49:57,997 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 11:49:57,998 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 11:49:58,000 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 11:49:58,003 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 11:49:58,005 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 11:49:58,005 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 11:49:58,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:49:58,033 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 11:49:58,050 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 11:49:58,051 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 11:49:58,054 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 11:49:58,057 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 11:49:58,058 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 11:49:58,060 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 11:49:58,061 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 11:49:58,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:49:58,298 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 11:49:58,302 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 11:49:58,303 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 11:49:58,304 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:49:58,304 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:49:58,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:49:58,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:49:58,305 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:49:58,306 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:49:58,307 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:49:58,310 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:49:58,310 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 11:49:58,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:49:58,311 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:49:58,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:49:58,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:49:58,311 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:49:58,312 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:49:58,312 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:49:58,314 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:49:58,314 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 11:49:58,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:49:58,315 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:49:58,315 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:49:58,315 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:49:58,317 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:49:58,317 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:49:58,318 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:49:58,319 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 11:49:58,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:49:58,319 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:49:58,320 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:49:58,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:49:58,320 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:49:58,320 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:49:58,320 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:49:58,321 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:49:58,321 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 11:49:58,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:49:58,321 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:49:58,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:49:58,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:49:58,322 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:49:58,322 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:49:58,322 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:49:58,323 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:49:58,323 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 11:49:58,323 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:49:58,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:49:58,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:49:58,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:49:58,325 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:49:58,325 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:49:58,327 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:49:58,328 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 11:49:58,329 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:49:58,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:49:58,329 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:49:58,329 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:49:58,330 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:49:58,331 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:49:58,332 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:49:58,333 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 11:49:58,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:49:58,333 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:49:58,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:49:58,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:49:58,333 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:49:58,333 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:49:58,333 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:49:58,334 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:49:58,334 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 11:49:58,334 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:49:58,335 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:49:58,335 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:49:58,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:49:58,335 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:49:58,335 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:49:58,335 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:49:58,337 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:49:58,337 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 11:49:58,337 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:49:58,338 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:49:58,338 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:49:58,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:49:58,338 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:49:58,338 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:49:58,338 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:49:58,340 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:49:58,341 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 11:49:58,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:49:58,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:49:58,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:49:58,341 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:49:58,342 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:49:58,342 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:49:58,345 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:49:58,345 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 11:49:58,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:49:58,346 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:49:58,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:49:58,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:49:58,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:49:58,347 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:49:58,347 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:49:58,347 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:49:58,348 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 11:49:58,348 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:49:58,348 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:49:58,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:49:58,348 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:49:58,348 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:49:58,349 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:49:58,349 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:49:58,352 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:49:58,353 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 11:49:58,353 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:49:58,353 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:49:58,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:49:58,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:49:58,354 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:49:58,354 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:49:58,354 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:49:58,355 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:49:58,355 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 11:49:58,355 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:49:58,355 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:49:58,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:49:58,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:49:58,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:49:58,357 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:49:58,357 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:49:58,360 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:49:58,360 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 11:49:58,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:49:58,360 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:49:58,361 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:49:58,361 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:49:58,361 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:49:58,361 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:49:58,361 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:49:58,362 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:49:58,362 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 11:49:58,362 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:49:58,362 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:49:58,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:49:58,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:49:58,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:49:58,363 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:49:58,363 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:49:58,365 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:49:58,365 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 11:49:58,366 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:49:58,366 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:49:58,366 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:49:58,366 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:49:58,366 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:49:58,367 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:49:58,367 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:49:58,368 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 11:49:58,371 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 11:49:58,371 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 11:49:58,372 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 11:49:58,373 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 11:49:58,373 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 11:49:58,373 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 11 Supporting invariants [] [2018-11-18 11:49:58,374 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 11:49:58,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:49:58,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:49:58,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:49:58,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:49:58,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:49:58,452 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 11:49:58,455 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 11:49:58,455 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 72 states and 100 transitions. cyclomatic complexity: 29 Second operand 4 states. [2018-11-18 11:49:58,489 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 72 states and 100 transitions. cyclomatic complexity: 29. Second operand 4 states. Result 123 states and 180 transitions. Complement of second has 6 states. [2018-11-18 11:49:58,489 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 11:49:58,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 11:49:58,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2018-11-18 11:49:58,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 100 transitions. Stem has 21 letters. Loop has 20 letters. [2018-11-18 11:49:58,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:49:58,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 100 transitions. Stem has 41 letters. Loop has 20 letters. [2018-11-18 11:49:58,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:49:58,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 100 transitions. Stem has 21 letters. Loop has 40 letters. [2018-11-18 11:49:58,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:49:58,493 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 180 transitions. [2018-11-18 11:49:58,494 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 11:49:58,494 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 0 states and 0 transitions. [2018-11-18 11:49:58,494 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 11:49:58,494 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 11:49:58,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 11:49:58,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 11:49:58,495 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 11:49:58,495 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 11:49:58,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:49:58,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:49:58,495 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2018-11-18 11:49:58,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:49:58,495 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-18 11:49:58,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 11:49:58,496 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-18 11:49:58,496 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 11:49:58,496 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 11:49:58,496 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 11:49:58,496 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 11:49:58,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 11:49:58,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 11:49:58,496 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 11:49:58,496 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 11:49:58,496 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 11:49:58,496 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 11:49:58,497 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 11:49:58,497 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 11:49:58,497 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 11:49:58,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 11:49:58 BoogieIcfgContainer [2018-11-18 11:49:58,502 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 11:49:58,502 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 11:49:58,502 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 11:49:58,502 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 11:49:58,502 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:49:56" (3/4) ... [2018-11-18 11:49:58,505 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 11:49:58,505 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 11:49:58,505 INFO L168 Benchmark]: Toolchain (without parser) took 2893.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 961.9 MB in the beginning and 897.3 MB in the end (delta: 64.6 MB). Peak memory consumption was 204.6 MB. Max. memory is 11.5 GB. [2018-11-18 11:49:58,506 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:49:58,507 INFO L168 Benchmark]: CACSL2BoogieTranslator took 261.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 961.9 MB in the beginning and 1.1 GB in the end (delta: -175.2 MB). Peak memory consumption was 31.0 MB. Max. memory is 11.5 GB. [2018-11-18 11:49:58,507 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 11:49:58,508 INFO L168 Benchmark]: Boogie Preprocessor took 21.34 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:49:58,508 INFO L168 Benchmark]: RCFGBuilder took 338.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.5 MB). Peak memory consumption was 38.5 MB. Max. memory is 11.5 GB. [2018-11-18 11:49:58,508 INFO L168 Benchmark]: BuchiAutomizer took 2239.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 897.3 MB in the end (delta: 198.6 MB). Peak memory consumption was 198.6 MB. Max. memory is 11.5 GB. [2018-11-18 11:49:58,509 INFO L168 Benchmark]: Witness Printer took 3.04 ms. Allocated memory is still 1.2 GB. Free memory is still 897.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:49:58,511 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 261.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 961.9 MB in the beginning and 1.1 GB in the end (delta: -175.2 MB). Peak memory consumption was 31.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.34 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 338.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.5 MB). Peak memory consumption was 38.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2239.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 897.3 MB in the end (delta: 198.6 MB). Peak memory consumption was 198.6 MB. Max. memory is 11.5 GB. * Witness Printer took 3.04 ms. Allocated memory is still 1.2 GB. Free memory is still 897.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 11 and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.2s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 72 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 321 SDtfs, 101 SDslu, 597 SDs, 0 SdLazy, 22 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital215 mio100 ax117 hnf104 lsp22 ukn65 mio100 lsp100 div173 bol100 ite100 ukn100 eq151 hnf74 smp100 dnf104 smp96 tf102 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 4ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...