./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4_false-unreach-call.2.ufo.BOUNDED-8.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0aa353e5-9aa9-4fe1-8f0a-5ecd49f5bb83/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0aa353e5-9aa9-4fe1-8f0a-5ecd49f5bb83/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0aa353e5-9aa9-4fe1-8f0a-5ecd49f5bb83/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0aa353e5-9aa9-4fe1-8f0a-5ecd49f5bb83/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4_false-unreach-call.2.ufo.BOUNDED-8.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_0aa353e5-9aa9-4fe1-8f0a-5ecd49f5bb83/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0aa353e5-9aa9-4fe1-8f0a-5ecd49f5bb83/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 5ece07e091f918f26c76e2a65f38501df262220c ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 10:43:06,146 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 10:43:06,148 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 10:43:06,156 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 10:43:06,156 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 10:43:06,157 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 10:43:06,157 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 10:43:06,159 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 10:43:06,160 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 10:43:06,161 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 10:43:06,161 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 10:43:06,162 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 10:43:06,162 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 10:43:06,163 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 10:43:06,164 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 10:43:06,165 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 10:43:06,165 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 10:43:06,166 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 10:43:06,168 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 10:43:06,169 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 10:43:06,170 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 10:43:06,171 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 10:43:06,172 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 10:43:06,173 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 10:43:06,173 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 10:43:06,173 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 10:43:06,174 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 10:43:06,175 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 10:43:06,175 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 10:43:06,176 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 10:43:06,176 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 10:43:06,177 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 10:43:06,177 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 10:43:06,177 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 10:43:06,178 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 10:43:06,179 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 10:43:06,179 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0aa353e5-9aa9-4fe1-8f0a-5ecd49f5bb83/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 10:43:06,190 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 10:43:06,191 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 10:43:06,191 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 10:43:06,192 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 10:43:06,192 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 10:43:06,192 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 10:43:06,192 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 10:43:06,192 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 10:43:06,192 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 10:43:06,193 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 10:43:06,193 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 10:43:06,193 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 10:43:06,193 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 10:43:06,193 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 10:43:06,193 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 10:43:06,193 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 10:43:06,194 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 10:43:06,194 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 10:43:06,194 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 10:43:06,194 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 10:43:06,194 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 10:43:06,194 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 10:43:06,194 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 10:43:06,195 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 10:43:06,195 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 10:43:06,195 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 10:43:06,195 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 10:43:06,195 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 10:43:06,195 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 10:43:06,196 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 10:43:06,196 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 10:43:06,196 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_0aa353e5-9aa9-4fe1-8f0a-5ecd49f5bb83/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 -> 5ece07e091f918f26c76e2a65f38501df262220c [2018-11-10 10:43:06,219 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 10:43:06,228 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 10:43:06,230 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 10:43:06,231 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 10:43:06,231 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 10:43:06,232 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0aa353e5-9aa9-4fe1-8f0a-5ecd49f5bb83/bin-2019/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4_false-unreach-call.2.ufo.BOUNDED-8.pals_true-termination.c [2018-11-10 10:43:06,273 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0aa353e5-9aa9-4fe1-8f0a-5ecd49f5bb83/bin-2019/uautomizer/data/e0ee122b8/7e8228499e284a59a162824a10216438/FLAGa178b08a1 [2018-11-10 10:43:06,625 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 10:43:06,625 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0aa353e5-9aa9-4fe1-8f0a-5ecd49f5bb83/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4_false-unreach-call.2.ufo.BOUNDED-8.pals_true-termination.c [2018-11-10 10:43:06,633 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0aa353e5-9aa9-4fe1-8f0a-5ecd49f5bb83/bin-2019/uautomizer/data/e0ee122b8/7e8228499e284a59a162824a10216438/FLAGa178b08a1 [2018-11-10 10:43:06,643 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0aa353e5-9aa9-4fe1-8f0a-5ecd49f5bb83/bin-2019/uautomizer/data/e0ee122b8/7e8228499e284a59a162824a10216438 [2018-11-10 10:43:06,645 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 10:43:06,646 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 10:43:06,647 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 10:43:06,647 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 10:43:06,650 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 10:43:06,650 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:43:06" (1/1) ... [2018-11-10 10:43:06,652 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70607c0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:43:06, skipping insertion in model container [2018-11-10 10:43:06,653 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:43:06" (1/1) ... [2018-11-10 10:43:06,660 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 10:43:06,685 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 10:43:06,807 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:43:06,812 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 10:43:06,842 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:43:06,852 INFO L193 MainTranslator]: Completed translation [2018-11-10 10:43:06,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:43:06 WrapperNode [2018-11-10 10:43:06,852 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 10:43:06,853 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 10:43:06,853 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 10:43:06,853 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 10:43:06,860 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:43:06" (1/1) ... [2018-11-10 10:43:06,868 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:43:06" (1/1) ... [2018-11-10 10:43:06,933 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 10:43:06,933 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 10:43:06,933 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 10:43:06,934 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 10:43:06,942 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:43:06" (1/1) ... [2018-11-10 10:43:06,942 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:43:06" (1/1) ... [2018-11-10 10:43:06,944 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:43:06" (1/1) ... [2018-11-10 10:43:06,944 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:43:06" (1/1) ... [2018-11-10 10:43:06,949 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:43:06" (1/1) ... [2018-11-10 10:43:06,955 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:43:06" (1/1) ... [2018-11-10 10:43:06,957 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:43:06" (1/1) ... [2018-11-10 10:43:06,959 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 10:43:06,959 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 10:43:06,960 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 10:43:06,960 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 10:43:06,960 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:43:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0aa353e5-9aa9-4fe1-8f0a-5ecd49f5bb83/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:43:07,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 10:43:07,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 10:43:07,394 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 10:43:07,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:43:07 BoogieIcfgContainer [2018-11-10 10:43:07,395 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 10:43:07,395 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 10:43:07,395 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 10:43:07,399 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 10:43:07,399 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 10:43:07,400 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 10:43:06" (1/3) ... [2018-11-10 10:43:07,401 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@52ee7e80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 10:43:07, skipping insertion in model container [2018-11-10 10:43:07,401 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 10:43:07,401 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:43:06" (2/3) ... [2018-11-10 10:43:07,401 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@52ee7e80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 10:43:07, skipping insertion in model container [2018-11-10 10:43:07,401 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 10:43:07,401 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:43:07" (3/3) ... [2018-11-10 10:43:07,407 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.4_false-unreach-call.2.ufo.BOUNDED-8.pals_true-termination.c [2018-11-10 10:43:07,453 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 10:43:07,454 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 10:43:07,454 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 10:43:07,454 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 10:43:07,454 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 10:43:07,454 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 10:43:07,454 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 10:43:07,455 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 10:43:07,455 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 10:43:07,469 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 95 states. [2018-11-10 10:43:07,491 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2018-11-10 10:43:07,491 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:43:07,491 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:43:07,499 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 10:43:07,499 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:43:07,499 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 10:43:07,499 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 95 states. [2018-11-10 10:43:07,504 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2018-11-10 10:43:07,504 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:43:07,504 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:43:07,505 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 10:43:07,505 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:43:07,512 INFO L793 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;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~0 := 0;~p4~0 := 0;~send4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset]; 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~ret28, main_#t~ret29, main_#t~post30, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet7;havoc main_#t~nondet7;~id1~0 := main_#t~nondet8;havoc main_#t~nondet8;~st1~0 := main_#t~nondet9;havoc main_#t~nondet9;~send1~0 := main_#t~nondet10;havoc main_#t~nondet10;~mode1~0 := main_#t~nondet11;havoc main_#t~nondet11;~alive1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id2~0 := main_#t~nondet13;havoc main_#t~nondet13;~st2~0 := main_#t~nondet14;havoc main_#t~nondet14;~send2~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode2~0 := main_#t~nondet16;havoc main_#t~nondet16;~alive2~0 := main_#t~nondet17;havoc main_#t~nondet17;~id3~0 := main_#t~nondet18;havoc main_#t~nondet18;~st3~0 := main_#t~nondet19;havoc main_#t~nondet19;~send3~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode3~0 := main_#t~nondet21;havoc main_#t~nondet21;~alive3~0 := main_#t~nondet22;havoc main_#t~nondet22;~id4~0 := main_#t~nondet23;havoc main_#t~nondet23;~st4~0 := main_#t~nondet24;havoc main_#t~nondet24;~send4~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode4~0 := main_#t~nondet26;havoc main_#t~nondet26;~alive4~0 := main_#t~nondet27;havoc main_#t~nondet27;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 83#L244true assume !(~r1~0 == 0);init_~tmp~0 := 0; 81#L244-1true init_#res := init_~tmp~0; 59#L341true main_#t~ret28 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret28;havoc main_#t~ret28;assume main_~i2~0 != 0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0 := 0; 46#L403-3true [2018-11-10 10:43:07,512 INFO L795 eck$LassoCheckResult]: Loop: 46#L403-3true assume true; 43#L403-1true assume !!(main_~i2~0 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 49#L110true assume !(~mode1~0 % 256 != 0); 38#L128true assume !(~alive1~0 % 256 != 0); 10#L128-2true ~mode1~0 := 1; 44#L110-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite1, node2_#t~ite2, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 23#L142true assume ~mode2~0 % 256 != 0;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 79#L145true assume !(node2_~m2~0 != ~nomsg~0); 76#L145-1true ~mode2~0 := 0; 16#L142-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite3, node3_#t~ite4, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 26#L176true assume ~mode3~0 % 256 != 0;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 9#L179true assume !(node3_~m3~0 != ~nomsg~0); 8#L179-1true ~mode3~0 := 0; 50#L176-2true assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite5, node4_#t~ite6, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 57#L210true assume ~mode4~0 % 256 != 0;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 63#L213true assume !(node4_~m4~0 != ~nomsg~0); 34#L213-1true ~mode4~0 := 0; 56#L210-2true assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 66#L349true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1 := 0; 69#L349-1true check_#res := check_~tmp~1; 86#L361true main_#t~ret29 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret29;havoc main_#t~ret29;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 75#L430true assume !(assert_~arg % 256 == 0); 35#L425true assume { :end_inline_assert } true;main_#t~post30 := main_~i2~0;main_~i2~0 := main_#t~post30 + 1;havoc main_#t~post30; 46#L403-3true [2018-11-10 10:43:07,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:43:07,517 INFO L82 PathProgramCache]: Analyzing trace with hash 28832784, now seen corresponding path program 1 times [2018-11-10 10:43:07,519 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:43:07,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:43:07,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:43:07,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:43:07,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:43:07,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:43:07,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:43:07,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:43:07,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:43:07,661 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 10:43:07,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:43:07,662 INFO L82 PathProgramCache]: Analyzing trace with hash 2143910842, now seen corresponding path program 1 times [2018-11-10 10:43:07,662 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:43:07,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:43:07,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:43:07,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:43:07,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:43:07,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:43:07,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:43:07,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:43:07,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 10:43:07,725 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 10:43:07,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:43:07,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:43:07,736 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 4 states. [2018-11-10 10:43:07,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:43:07,801 INFO L93 Difference]: Finished difference Result 97 states and 157 transitions. [2018-11-10 10:43:07,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:43:07,803 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 97 states and 157 transitions. [2018-11-10 10:43:07,806 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2018-11-10 10:43:07,810 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 97 states to 90 states and 127 transitions. [2018-11-10 10:43:07,811 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 90 [2018-11-10 10:43:07,811 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2018-11-10 10:43:07,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 127 transitions. [2018-11-10 10:43:07,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 10:43:07,813 INFO L705 BuchiCegarLoop]: Abstraction has 90 states and 127 transitions. [2018-11-10 10:43:07,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 127 transitions. [2018-11-10 10:43:07,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-11-10 10:43:07,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-10 10:43:07,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 127 transitions. [2018-11-10 10:43:07,840 INFO L728 BuchiCegarLoop]: Abstraction has 90 states and 127 transitions. [2018-11-10 10:43:07,840 INFO L608 BuchiCegarLoop]: Abstraction has 90 states and 127 transitions. [2018-11-10 10:43:07,840 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 10:43:07,840 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states and 127 transitions. [2018-11-10 10:43:07,842 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2018-11-10 10:43:07,842 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:43:07,842 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:43:07,843 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:43:07,843 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:43:07,843 INFO L793 eck$LassoCheckResult]: Stem: 265#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~r1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~0 := 0;~p4~0 := 0;~send4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset]; 225#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~ret28, main_#t~ret29, main_#t~post30, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet7;havoc main_#t~nondet7;~id1~0 := main_#t~nondet8;havoc main_#t~nondet8;~st1~0 := main_#t~nondet9;havoc main_#t~nondet9;~send1~0 := main_#t~nondet10;havoc main_#t~nondet10;~mode1~0 := main_#t~nondet11;havoc main_#t~nondet11;~alive1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id2~0 := main_#t~nondet13;havoc main_#t~nondet13;~st2~0 := main_#t~nondet14;havoc main_#t~nondet14;~send2~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode2~0 := main_#t~nondet16;havoc main_#t~nondet16;~alive2~0 := main_#t~nondet17;havoc main_#t~nondet17;~id3~0 := main_#t~nondet18;havoc main_#t~nondet18;~st3~0 := main_#t~nondet19;havoc main_#t~nondet19;~send3~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode3~0 := main_#t~nondet21;havoc main_#t~nondet21;~alive3~0 := main_#t~nondet22;havoc main_#t~nondet22;~id4~0 := main_#t~nondet23;havoc main_#t~nondet23;~st4~0 := main_#t~nondet24;havoc main_#t~nondet24;~send4~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode4~0 := main_#t~nondet26;havoc main_#t~nondet26;~alive4~0 := main_#t~nondet27;havoc main_#t~nondet27;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 226#L244 assume ~r1~0 == 0; 260#L245 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; 261#L246 assume ~id1~0 >= 0; 286#L247 assume ~st1~0 == 0; 241#L248 assume ~send1~0 == ~id1~0; 242#L249 assume ~mode1~0 % 256 == 0; 273#L250 assume ~id2~0 >= 0; 275#L251 assume ~st2~0 == 0; 212#L252 assume ~send2~0 == ~id2~0; 213#L253 assume ~mode2~0 % 256 == 0; 254#L254 assume ~id3~0 >= 0; 227#L255 assume ~st3~0 == 0; 228#L256 assume ~send3~0 == ~id3~0; 266#L257 assume ~mode3~0 % 256 == 0; 287#L258 assume ~id4~0 >= 0; 243#L259 assume ~st4~0 == 0; 244#L260 assume ~send4~0 == ~id4~0; 274#L261 assume ~mode4~0 % 256 == 0; 276#L262 assume ~id1~0 != ~id2~0; 214#L263 assume ~id1~0 != ~id3~0; 215#L264 assume ~id1~0 != ~id4~0; 255#L265 assume ~id2~0 != ~id3~0; 229#L266 assume ~id2~0 != ~id4~0; 230#L267 assume ~id3~0 != ~id4~0;init_~tmp~0 := 1; 267#L244-1 init_#res := init_~tmp~0; 280#L341 main_#t~ret28 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret28;havoc main_#t~ret28;assume main_~i2~0 != 0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0 := 0; 259#L403-3 [2018-11-10 10:43:07,843 INFO L795 eck$LassoCheckResult]: Loop: 259#L403-3 assume true; 268#L403-1 assume !!(main_~i2~0 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 269#L110 assume !(~mode1~0 % 256 != 0); 262#L128 assume !(~alive1~0 % 256 != 0); 223#L128-2 ~mode1~0 := 1; 224#L110-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite1, node2_#t~ite2, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 246#L142 assume ~mode2~0 % 256 != 0;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 247#L145 assume !(node2_~m2~0 != ~nomsg~0); 217#L145-1 ~mode2~0 := 0; 236#L142-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite3, node3_#t~ite4, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 237#L176 assume ~mode3~0 % 256 != 0;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 221#L179 assume !(node3_~m3~0 != ~nomsg~0); 219#L179-1 ~mode3~0 := 0; 220#L176-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite5, node4_#t~ite6, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 272#L210 assume ~mode4~0 % 256 != 0;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 278#L213 assume !(node4_~m4~0 != ~nomsg~0); 239#L213-1 ~mode4~0 := 0; 249#L210-2 assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 277#L349 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1 := 0; 284#L349-1 check_#res := check_~tmp~1; 288#L361 main_#t~ret29 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret29;havoc main_#t~ret29;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 293#L430 assume !(assert_~arg % 256 == 0); 258#L425 assume { :end_inline_assert } true;main_#t~post30 := main_~i2~0;main_~i2~0 := main_#t~post30 + 1;havoc main_#t~post30; 259#L403-3 [2018-11-10 10:43:07,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:43:07,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1386311927, now seen corresponding path program 1 times [2018-11-10 10:43:07,844 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:43:07,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:43:07,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:43:07,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:43:07,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:43:07,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:43:07,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:43:07,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:43:07,902 INFO L82 PathProgramCache]: Analyzing trace with hash 2143910842, now seen corresponding path program 2 times [2018-11-10 10:43:07,902 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:43:07,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:43:07,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:43:07,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:43:07,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:43:07,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:43:07,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:43:07,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:43:07,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 10:43:07,963 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 10:43:07,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 10:43:07,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:43:07,964 INFO L87 Difference]: Start difference. First operand 90 states and 127 transitions. cyclomatic complexity: 38 Second operand 5 states. [2018-11-10 10:43:07,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:43:07,995 INFO L93 Difference]: Finished difference Result 93 states and 129 transitions. [2018-11-10 10:43:07,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 10:43:07,996 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 129 transitions. [2018-11-10 10:43:07,998 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2018-11-10 10:43:07,999 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 90 states and 125 transitions. [2018-11-10 10:43:07,999 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 90 [2018-11-10 10:43:07,999 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2018-11-10 10:43:07,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 125 transitions. [2018-11-10 10:43:08,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 10:43:08,000 INFO L705 BuchiCegarLoop]: Abstraction has 90 states and 125 transitions. [2018-11-10 10:43:08,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 125 transitions. [2018-11-10 10:43:08,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-11-10 10:43:08,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-10 10:43:08,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 125 transitions. [2018-11-10 10:43:08,006 INFO L728 BuchiCegarLoop]: Abstraction has 90 states and 125 transitions. [2018-11-10 10:43:08,006 INFO L608 BuchiCegarLoop]: Abstraction has 90 states and 125 transitions. [2018-11-10 10:43:08,007 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 10:43:08,007 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states and 125 transitions. [2018-11-10 10:43:08,008 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2018-11-10 10:43:08,008 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:43:08,008 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:43:08,009 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:43:08,009 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:43:08,010 INFO L793 eck$LassoCheckResult]: Stem: 457#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~r1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~0 := 0;~p4~0 := 0;~send4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset]; 420#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~ret28, main_#t~ret29, main_#t~post30, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet7;havoc main_#t~nondet7;~id1~0 := main_#t~nondet8;havoc main_#t~nondet8;~st1~0 := main_#t~nondet9;havoc main_#t~nondet9;~send1~0 := main_#t~nondet10;havoc main_#t~nondet10;~mode1~0 := main_#t~nondet11;havoc main_#t~nondet11;~alive1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id2~0 := main_#t~nondet13;havoc main_#t~nondet13;~st2~0 := main_#t~nondet14;havoc main_#t~nondet14;~send2~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode2~0 := main_#t~nondet16;havoc main_#t~nondet16;~alive2~0 := main_#t~nondet17;havoc main_#t~nondet17;~id3~0 := main_#t~nondet18;havoc main_#t~nondet18;~st3~0 := main_#t~nondet19;havoc main_#t~nondet19;~send3~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode3~0 := main_#t~nondet21;havoc main_#t~nondet21;~alive3~0 := main_#t~nondet22;havoc main_#t~nondet22;~id4~0 := main_#t~nondet23;havoc main_#t~nondet23;~st4~0 := main_#t~nondet24;havoc main_#t~nondet24;~send4~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode4~0 := main_#t~nondet26;havoc main_#t~nondet26;~alive4~0 := main_#t~nondet27;havoc main_#t~nondet27;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 421#L244 assume ~r1~0 == 0; 455#L245 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; 456#L246 assume ~id1~0 >= 0; 480#L247 assume ~st1~0 == 0; 436#L248 assume ~send1~0 == ~id1~0; 437#L249 assume ~mode1~0 % 256 == 0; 468#L250 assume ~id2~0 >= 0; 470#L251 assume ~st2~0 == 0; 407#L252 assume ~send2~0 == ~id2~0; 408#L253 assume ~mode2~0 % 256 == 0; 449#L254 assume ~id3~0 >= 0; 422#L255 assume ~st3~0 == 0; 423#L256 assume ~send3~0 == ~id3~0; 458#L257 assume ~mode3~0 % 256 == 0; 481#L258 assume ~id4~0 >= 0; 438#L259 assume ~st4~0 == 0; 439#L260 assume ~send4~0 == ~id4~0; 469#L261 assume ~mode4~0 % 256 == 0; 471#L262 assume ~id1~0 != ~id2~0; 409#L263 assume ~id1~0 != ~id3~0; 410#L264 assume ~id1~0 != ~id4~0; 450#L265 assume ~id2~0 != ~id3~0; 424#L266 assume ~id2~0 != ~id4~0; 425#L267 assume ~id3~0 != ~id4~0;init_~tmp~0 := 1; 462#L244-1 init_#res := init_~tmp~0; 475#L341 main_#t~ret28 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret28;havoc main_#t~ret28;assume main_~i2~0 != 0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0 := 0; 454#L403-3 [2018-11-10 10:43:08,010 INFO L795 eck$LassoCheckResult]: Loop: 454#L403-3 assume true; 463#L403-1 assume !!(main_~i2~0 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 464#L110 assume !(~mode1~0 % 256 != 0); 459#L128 assume !(~alive1~0 % 256 != 0); 418#L128-2 ~mode1~0 := 1; 419#L110-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite1, node2_#t~ite2, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 441#L142 assume ~mode2~0 % 256 != 0;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 442#L145 assume !(node2_~m2~0 != ~nomsg~0); 412#L145-1 ~mode2~0 := 0; 431#L142-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite3, node3_#t~ite4, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 432#L176 assume ~mode3~0 % 256 != 0;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 416#L179 assume !(node3_~m3~0 != ~nomsg~0); 414#L179-1 ~mode3~0 := 0; 415#L176-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite5, node4_#t~ite6, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 467#L210 assume ~mode4~0 % 256 != 0;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 473#L213 assume !(node4_~m4~0 != ~nomsg~0); 434#L213-1 ~mode4~0 := 0; 444#L210-2 assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 472#L349 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 479#L350 assume ~r1~0 < 4;check_~tmp~1 := 1; 482#L349-1 check_#res := check_~tmp~1; 483#L361 main_#t~ret29 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret29;havoc main_#t~ret29;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 488#L430 assume !(assert_~arg % 256 == 0); 453#L425 assume { :end_inline_assert } true;main_#t~post30 := main_~i2~0;main_~i2~0 := main_#t~post30 + 1;havoc main_#t~post30; 454#L403-3 [2018-11-10 10:43:08,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:43:08,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1386311927, now seen corresponding path program 2 times [2018-11-10 10:43:08,010 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:43:08,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:43:08,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:43:08,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:43:08,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:43:08,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:43:08,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:43:08,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:43:08,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1653399484, now seen corresponding path program 1 times [2018-11-10 10:43:08,047 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:43:08,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:43:08,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:43:08,048 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:43:08,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:43:08,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:43:08,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:43:08,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:43:08,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1919997636, now seen corresponding path program 1 times [2018-11-10 10:43:08,064 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:43:08,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:43:08,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:43:08,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:43:08,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:43:08,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:43:08,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:43:08,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:43:08,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:43:08,305 WARN L179 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 104 [2018-11-10 10:43:08,531 WARN L179 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 90 [2018-11-10 10:43:08,540 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 10:43:08,541 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 10:43:08,542 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 10:43:08,542 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 10:43:08,542 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 10:43:08,542 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:43:08,542 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 10:43:08,542 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 10:43:08,543 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.4_false-unreach-call.2.ufo.BOUNDED-8.pals_true-termination.c_Iteration3_Loop [2018-11-10 10:43:08,543 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 10:43:08,543 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 10:43:08,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:43:08,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:43:08,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:43:08,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:43:08,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:43:08,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-10 10:43:08,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-10 10:43:08,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:43:08,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:43:08,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:43:08,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:43:08,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:43:08,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:43:08,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:43:08,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:43:08,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:43:08,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:43:08,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:43:08,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:43:08,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:43:08,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:43:08,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:43:08,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:43:08,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:43:08,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:43:08,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:43:08,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:43:08,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:43:08,951 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 10:43:08,952 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0aa353e5-9aa9-4fe1-8f0a-5ecd49f5bb83/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:43:08,960 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:43:08,960 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0aa353e5-9aa9-4fe1-8f0a-5ecd49f5bb83/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:43:08,991 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 10:43:08,991 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:43:09,109 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 10:43:09,111 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 10:43:09,111 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 10:43:09,111 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 10:43:09,111 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 10:43:09,111 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 10:43:09,111 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:43:09,111 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 10:43:09,111 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 10:43:09,111 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.4_false-unreach-call.2.ufo.BOUNDED-8.pals_true-termination.c_Iteration3_Loop [2018-11-10 10:43:09,111 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 10:43:09,111 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 10:43:09,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:43:09,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:43:09,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:43:09,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:43:09,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:43:09,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:43:09,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:43:09,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:43:09,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:43:09,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:43:09,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:43:09,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:43:09,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:43:09,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:43:09,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:43:09,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:43:09,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:43:09,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:43:09,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:43:09,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:43:09,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:43:09,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:43:09,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:43:09,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:43:09,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:43:09,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:43:09,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:43:09,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:43:09,462 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 10:43:09,467 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 10:43:09,468 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:43:09,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:43:09,469 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:43:09,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:43:09,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:43:09,470 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:43:09,472 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:43:09,473 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:43:09,476 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:43:09,477 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:43:09,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:43:09,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:43:09,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:43:09,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:43:09,479 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:43:09,479 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:43:09,482 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:43:09,484 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:43:09,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:43:09,485 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:43:09,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:43:09,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:43:09,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:43:09,485 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:43:09,485 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:43:09,488 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:43:09,489 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:43:09,489 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:43:09,489 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:43:09,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:43:09,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:43:09,489 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:43:09,490 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:43:09,490 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:43:09,491 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:43:09,491 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:43:09,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:43:09,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:43:09,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:43:09,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:43:09,493 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:43:09,493 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:43:09,495 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:43:09,495 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:43:09,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:43:09,496 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:43:09,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:43:09,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:43:09,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:43:09,497 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:43:09,497 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:43:09,499 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:43:09,499 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:43:09,499 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:43:09,499 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:43:09,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:43:09,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:43:09,501 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:43:09,501 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:43:09,508 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:43:09,509 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:43:09,509 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:43:09,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:43:09,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:43:09,511 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:43:09,512 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:43:09,512 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:43:09,514 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:43:09,514 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:43:09,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:43:09,515 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:43:09,515 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:43:09,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:43:09,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:43:09,515 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:43:09,516 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:43:09,516 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:43:09,516 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:43:09,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:43:09,517 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:43:09,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:43:09,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:43:09,517 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:43:09,518 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:43:09,518 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:43:09,518 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:43:09,518 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:43:09,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:43:09,519 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:43:09,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:43:09,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:43:09,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:43:09,520 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:43:09,520 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:43:09,521 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 10:43:09,523 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 10:43:09,524 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 10:43:09,525 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 10:43:09,525 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 10:43:09,525 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 10:43:09,525 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 15 Supporting invariants [] [2018-11-10 10:43:09,526 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 10:43:09,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:43:09,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:43:09,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:43:09,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:43:09,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:43:09,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:43:09,608 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 10:43:09,609 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 90 states and 125 transitions. cyclomatic complexity: 36 Second operand 4 states. [2018-11-10 10:43:09,647 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 90 states and 125 transitions. cyclomatic complexity: 36. Second operand 4 states. Result 152 states and 223 transitions. Complement of second has 6 states. [2018-11-10 10:43:09,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 10:43:09,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 10:43:09,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 125 transitions. [2018-11-10 10:43:09,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 125 transitions. Stem has 28 letters. Loop has 24 letters. [2018-11-10 10:43:09,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:43:09,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 125 transitions. Stem has 52 letters. Loop has 24 letters. [2018-11-10 10:43:09,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:43:09,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 125 transitions. Stem has 28 letters. Loop has 48 letters. [2018-11-10 10:43:09,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:43:09,651 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 152 states and 223 transitions. [2018-11-10 10:43:09,653 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 10:43:09,653 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 152 states to 0 states and 0 transitions. [2018-11-10 10:43:09,653 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 10:43:09,653 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 10:43:09,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 10:43:09,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 10:43:09,653 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 10:43:09,653 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 10:43:09,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:43:09,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:43:09,653 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2018-11-10 10:43:09,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:43:09,653 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-10 10:43:09,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 10:43:09,654 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-10 10:43:09,654 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 10:43:09,654 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 10:43:09,654 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 10:43:09,654 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 10:43:09,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 10:43:09,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 10:43:09,654 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 10:43:09,654 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 10:43:09,654 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 10:43:09,654 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 10:43:09,654 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 10:43:09,654 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 10:43:09,655 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 10:43:09,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 10:43:09 BoogieIcfgContainer [2018-11-10 10:43:09,659 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 10:43:09,659 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 10:43:09,659 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 10:43:09,659 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 10:43:09,660 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:43:07" (3/4) ... [2018-11-10 10:43:09,662 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 10:43:09,662 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 10:43:09,663 INFO L168 Benchmark]: Toolchain (without parser) took 3017.55 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 227.5 MB). Free memory was 960.2 MB in the beginning and 1.0 GB in the end (delta: -80.5 MB). Peak memory consumption was 147.1 MB. Max. memory is 11.5 GB. [2018-11-10 10:43:09,663 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:43:09,664 INFO L168 Benchmark]: CACSL2BoogieTranslator took 206.09 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 944.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-10 10:43:09,664 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 944.1 MB in the beginning and 1.2 GB in the end (delta: -209.1 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2018-11-10 10:43:09,665 INFO L168 Benchmark]: Boogie Preprocessor took 25.84 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:43:09,665 INFO L168 Benchmark]: RCFGBuilder took 435.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 42.9 MB). Peak memory consumption was 42.9 MB. Max. memory is 11.5 GB. [2018-11-10 10:43:09,666 INFO L168 Benchmark]: BuchiAutomizer took 2263.31 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 68.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 64.3 MB). Peak memory consumption was 133.0 MB. Max. memory is 11.5 GB. [2018-11-10 10:43:09,666 INFO L168 Benchmark]: Witness Printer took 3.11 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.3 MB). Peak memory consumption was 5.3 MB. Max. memory is 11.5 GB. [2018-11-10 10:43:09,669 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 206.09 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 944.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 80.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 944.1 MB in the beginning and 1.2 GB in the end (delta: -209.1 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.84 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 435.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 42.9 MB). Peak memory consumption was 42.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2263.31 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 68.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 64.3 MB). Peak memory consumption was 133.0 MB. Max. memory is 11.5 GB. * Witness Printer took 3.11 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.3 MB). Peak memory consumption was 5.3 MB. 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 + 15 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 90 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 403 SDtfs, 126 SDslu, 747 SDs, 0 SdLazy, 22 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital120 mio100 ax139 hnf109 lsp25 ukn100 mio100 lsp100 div106 bol100 ite100 ukn100 eq214 hnf85 smp100 dnf100 smp100 tf102 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms 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...