./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f4a20245-4bd4-4fd1-9c63-7d7587a9ab47/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f4a20245-4bd4-4fd1-9c63-7d7587a9ab47/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f4a20245-4bd4-4fd1-9c63-7d7587a9ab47/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f4a20245-4bd4-4fd1-9c63-7d7587a9ab47/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c -s /tmp/vcloud-vcloud-master/worker/working_dir_f4a20245-4bd4-4fd1-9c63-7d7587a9ab47/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f4a20245-4bd4-4fd1-9c63-7d7587a9ab47/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5564e2866529becd702f0ed3cd0d2d94f195a7b8 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 09:03:00,211 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:03:00,214 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:03:00,225 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:03:00,226 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:03:00,227 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:03:00,228 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:03:00,230 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:03:00,232 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:03:00,234 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:03:00,236 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:03:00,237 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:03:00,243 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:03:00,244 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:03:00,245 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:03:00,246 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:03:00,246 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:03:00,247 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:03:00,248 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:03:00,249 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:03:00,250 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:03:00,251 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:03:00,252 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:03:00,252 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:03:00,254 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:03:00,254 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:03:00,254 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:03:00,255 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:03:00,255 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:03:00,256 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:03:00,256 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:03:00,257 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:03:00,258 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:03:00,258 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:03:00,259 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:03:00,259 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:03:00,260 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:03:00,260 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:03:00,260 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:03:00,261 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:03:00,261 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:03:00,262 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f4a20245-4bd4-4fd1-9c63-7d7587a9ab47/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 09:03:00,273 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:03:00,273 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:03:00,274 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:03:00,274 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:03:00,274 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:03:00,274 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 09:03:00,275 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 09:03:00,277 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 09:03:00,278 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 09:03:00,281 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 09:03:00,285 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 09:03:00,285 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:03:00,285 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 09:03:00,285 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 09:03:00,286 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:03:00,286 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 09:03:00,286 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:03:00,286 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 09:03:00,286 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 09:03:00,286 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 09:03:00,286 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 09:03:00,287 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:03:00,287 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 09:03:00,287 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:03:00,291 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 09:03:00,292 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:03:00,292 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:03:00,292 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 09:03:00,292 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:03:00,292 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:03:00,292 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 09:03:00,293 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 09:03:00,296 INFO L138 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_f4a20245-4bd4-4fd1-9c63-7d7587a9ab47/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5564e2866529becd702f0ed3cd0d2d94f195a7b8 [2019-10-22 09:03:00,324 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:03:00,334 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:03:00,337 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:03:00,338 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:03:00,338 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:03:00,339 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f4a20245-4bd4-4fd1-9c63-7d7587a9ab47/bin/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c [2019-10-22 09:03:00,385 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f4a20245-4bd4-4fd1-9c63-7d7587a9ab47/bin/uautomizer/data/60ae20931/6cb6742c092c40a6abfea0a2dd96a572/FLAG739cdf116 [2019-10-22 09:03:00,834 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:03:00,834 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f4a20245-4bd4-4fd1-9c63-7d7587a9ab47/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c [2019-10-22 09:03:00,843 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f4a20245-4bd4-4fd1-9c63-7d7587a9ab47/bin/uautomizer/data/60ae20931/6cb6742c092c40a6abfea0a2dd96a572/FLAG739cdf116 [2019-10-22 09:03:00,853 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f4a20245-4bd4-4fd1-9c63-7d7587a9ab47/bin/uautomizer/data/60ae20931/6cb6742c092c40a6abfea0a2dd96a572 [2019-10-22 09:03:00,856 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:03:00,857 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:03:00,858 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:03:00,858 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:03:00,861 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:03:00,862 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:03:00" (1/1) ... [2019-10-22 09:03:00,864 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1250712a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:03:00, skipping insertion in model container [2019-10-22 09:03:00,864 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:03:00" (1/1) ... [2019-10-22 09:03:00,871 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:03:00,908 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:03:01,160 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:03:01,168 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:03:01,224 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:03:01,238 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:03:01,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:03:01 WrapperNode [2019-10-22 09:03:01,238 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:03:01,239 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:03:01,239 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:03:01,239 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:03:01,246 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:03:01" (1/1) ... [2019-10-22 09:03:01,255 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:03:01" (1/1) ... [2019-10-22 09:03:01,284 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:03:01,285 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:03:01,285 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:03:01,285 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:03:01,294 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:03:01" (1/1) ... [2019-10-22 09:03:01,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:03:01" (1/1) ... [2019-10-22 09:03:01,298 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:03:01" (1/1) ... [2019-10-22 09:03:01,298 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:03:01" (1/1) ... [2019-10-22 09:03:01,305 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:03:01" (1/1) ... [2019-10-22 09:03:01,312 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:03:01" (1/1) ... [2019-10-22 09:03:01,314 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:03:01" (1/1) ... [2019-10-22 09:03:01,318 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:03:01,319 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:03:01,319 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:03:01,319 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:03:01,319 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:03:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4a20245-4bd4-4fd1-9c63-7d7587a9ab47/bin/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 [2019-10-22 09:03:01,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:03:01,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:03:02,330 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:03:02,330 INFO L284 CfgBuilder]: Removed 23 assume(true) statements. [2019-10-22 09:03:02,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:03:02 BoogieIcfgContainer [2019-10-22 09:03:02,331 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:03:02,332 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 09:03:02,332 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 09:03:02,336 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 09:03:02,337 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:03:02,337 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 09:03:00" (1/3) ... [2019-10-22 09:03:02,338 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@514b071d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:03:02, skipping insertion in model container [2019-10-22 09:03:02,338 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:03:02,338 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:03:01" (2/3) ... [2019-10-22 09:03:02,339 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@514b071d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:03:02, skipping insertion in model container [2019-10-22 09:03:02,339 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:03:02,339 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:03:02" (3/3) ... [2019-10-22 09:03:02,341 INFO L371 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c [2019-10-22 09:03:02,386 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 09:03:02,386 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 09:03:02,386 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 09:03:02,386 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:03:02,387 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:03:02,387 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 09:03:02,387 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:03:02,387 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 09:03:02,403 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 142 states. [2019-10-22 09:03:02,429 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2019-10-22 09:03:02,429 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:03:02,429 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:03:02,438 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 09:03:02,438 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:02,438 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 09:03:02,438 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 142 states. [2019-10-22 09:03:02,443 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2019-10-22 09:03:02,443 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:03:02,443 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:03:02,444 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 09:03:02,444 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:02,450 INFO L791 eck$LassoCheckResult]: Stem: 105#ULTIMATE.startENTRYtrue ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; 14#L-1true havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~ret43, main_#t~ret44, main_#t~post45, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~send1~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode1~0 := main_#t~nondet16;havoc main_#t~nondet16;~alive1~0 := main_#t~nondet17;havoc main_#t~nondet17;~id2~0 := main_#t~nondet18;havoc main_#t~nondet18;~st2~0 := main_#t~nondet19;havoc main_#t~nondet19;~send2~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode2~0 := main_#t~nondet21;havoc main_#t~nondet21;~alive2~0 := main_#t~nondet22;havoc main_#t~nondet22;~id3~0 := main_#t~nondet23;havoc main_#t~nondet23;~st3~0 := main_#t~nondet24;havoc main_#t~nondet24;~send3~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode3~0 := main_#t~nondet26;havoc main_#t~nondet26;~alive3~0 := main_#t~nondet27;havoc main_#t~nondet27;~id4~0 := main_#t~nondet28;havoc main_#t~nondet28;~st4~0 := main_#t~nondet29;havoc main_#t~nondet29;~send4~0 := main_#t~nondet30;havoc main_#t~nondet30;~mode4~0 := main_#t~nondet31;havoc main_#t~nondet31;~alive4~0 := main_#t~nondet32;havoc main_#t~nondet32;~id5~0 := main_#t~nondet33;havoc main_#t~nondet33;~st5~0 := main_#t~nondet34;havoc main_#t~nondet34;~send5~0 := main_#t~nondet35;havoc main_#t~nondet35;~mode5~0 := main_#t~nondet36;havoc main_#t~nondet36;~alive5~0 := main_#t~nondet37;havoc main_#t~nondet37;~id6~0 := main_#t~nondet38;havoc main_#t~nondet38;~st6~0 := main_#t~nondet39;havoc main_#t~nondet39;~send6~0 := main_#t~nondet40;havoc main_#t~nondet40;~mode6~0 := main_#t~nondet41;havoc main_#t~nondet41;~alive6~0 := main_#t~nondet42;havoc main_#t~nondet42;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 43#L334true assume !(0 == ~r1~0);init_~tmp~0 := 0; 45#L334-1true init_#res := init_~tmp~0; 51#L499true main_#t~ret43 := init_#res;main_~i2~0 := main_#t~ret43;havoc main_#t~ret43;assume 0 != main_~i2~0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; 106#L575-2true [2019-10-22 09:03:02,451 INFO L793 eck$LassoCheckResult]: Loop: 106#L575-2true assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 118#L126true assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 71#L130true assume !(node1_~m1~0 != ~nomsg~0); 69#L130-1true ~mode1~0 := 0; 112#L126-2true havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 75#L163true assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 46#L166true assume !(node2_~m2~0 != ~nomsg~0); 44#L166-1true ~mode2~0 := 0; 70#L163-2true havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 4#L197true assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 133#L200true assume !(node3_~m3~0 != ~nomsg~0); 132#L200-1true ~mode3~0 := 0; 21#L197-2true havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 102#L231true assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 104#L234true assume !(node4_~m4~0 != ~nomsg~0); 83#L234-1true ~mode4~0 := 0; 97#L231-2true havoc node5_#t~ite8, node5_#t~ite9, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 48#L265true assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 54#L268true assume !(node5_~m5~0 != ~nomsg~0); 53#L268-1true ~mode5~0 := 0; 47#L265-2true havoc node6_#t~ite10, node6_#t~ite11, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 17#L299true assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 142#L302true assume !(node6_~m6~0 != ~nomsg~0); 139#L302-1true ~mode6~0 := 0; 134#L299-2true ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 74#L507true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1 := 0; 77#L507-1true check_#res := check_~tmp~1; 18#L519true main_#t~ret44 := check_#res;main_~c1~0 := main_#t~ret44;havoc main_#t~ret44;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 117#L608true assume !(0 == assert_~arg % 256); 93#L603true main_#t~post45 := main_~i2~0;main_~i2~0 := 1 + main_#t~post45;havoc main_#t~post45; 106#L575-2true [2019-10-22 09:03:02,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:02,457 INFO L82 PathProgramCache]: Analyzing trace with hash 28934070, now seen corresponding path program 1 times [2019-10-22 09:03:02,463 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:02,463 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113463496] [2019-10-22 09:03:02,463 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:02,464 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:02,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:02,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:02,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:03:02,628 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113463496] [2019-10-22 09:03:02,629 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:02,629 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:03:02,630 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64992162] [2019-10-22 09:03:02,633 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:03:02,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:02,634 INFO L82 PathProgramCache]: Analyzing trace with hash -885212333, now seen corresponding path program 1 times [2019-10-22 09:03:02,634 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:02,634 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831421193] [2019-10-22 09:03:02,634 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:02,634 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:02,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:02,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:02,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:03:02,835 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831421193] [2019-10-22 09:03:02,835 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:02,835 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:03:02,836 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397361004] [2019-10-22 09:03:02,837 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:03:02,838 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:02,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:03:02,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:03:02,857 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 4 states. [2019-10-22 09:03:02,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:02,973 INFO L93 Difference]: Finished difference Result 144 states and 241 transitions. [2019-10-22 09:03:02,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:03:02,975 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 144 states and 241 transitions. [2019-10-22 09:03:02,979 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2019-10-22 09:03:02,984 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 144 states to 137 states and 194 transitions. [2019-10-22 09:03:02,986 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 137 [2019-10-22 09:03:02,986 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 137 [2019-10-22 09:03:02,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 137 states and 194 transitions. [2019-10-22 09:03:02,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:03:02,988 INFO L688 BuchiCegarLoop]: Abstraction has 137 states and 194 transitions. [2019-10-22 09:03:03,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states and 194 transitions. [2019-10-22 09:03:03,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2019-10-22 09:03:03,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-10-22 09:03:03,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 194 transitions. [2019-10-22 09:03:03,022 INFO L711 BuchiCegarLoop]: Abstraction has 137 states and 194 transitions. [2019-10-22 09:03:03,022 INFO L591 BuchiCegarLoop]: Abstraction has 137 states and 194 transitions. [2019-10-22 09:03:03,022 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 09:03:03,023 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 137 states and 194 transitions. [2019-10-22 09:03:03,025 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2019-10-22 09:03:03,025 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:03:03,025 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:03:03,030 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:03,031 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:03,031 INFO L791 eck$LassoCheckResult]: Stem: 429#ULTIMATE.startENTRY ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; 321#L-1 havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~ret43, main_#t~ret44, main_#t~post45, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~send1~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode1~0 := main_#t~nondet16;havoc main_#t~nondet16;~alive1~0 := main_#t~nondet17;havoc main_#t~nondet17;~id2~0 := main_#t~nondet18;havoc main_#t~nondet18;~st2~0 := main_#t~nondet19;havoc main_#t~nondet19;~send2~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode2~0 := main_#t~nondet21;havoc main_#t~nondet21;~alive2~0 := main_#t~nondet22;havoc main_#t~nondet22;~id3~0 := main_#t~nondet23;havoc main_#t~nondet23;~st3~0 := main_#t~nondet24;havoc main_#t~nondet24;~send3~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode3~0 := main_#t~nondet26;havoc main_#t~nondet26;~alive3~0 := main_#t~nondet27;havoc main_#t~nondet27;~id4~0 := main_#t~nondet28;havoc main_#t~nondet28;~st4~0 := main_#t~nondet29;havoc main_#t~nondet29;~send4~0 := main_#t~nondet30;havoc main_#t~nondet30;~mode4~0 := main_#t~nondet31;havoc main_#t~nondet31;~alive4~0 := main_#t~nondet32;havoc main_#t~nondet32;~id5~0 := main_#t~nondet33;havoc main_#t~nondet33;~st5~0 := main_#t~nondet34;havoc main_#t~nondet34;~send5~0 := main_#t~nondet35;havoc main_#t~nondet35;~mode5~0 := main_#t~nondet36;havoc main_#t~nondet36;~alive5~0 := main_#t~nondet37;havoc main_#t~nondet37;~id6~0 := main_#t~nondet38;havoc main_#t~nondet38;~st6~0 := main_#t~nondet39;havoc main_#t~nondet39;~send6~0 := main_#t~nondet40;havoc main_#t~nondet40;~mode6~0 := main_#t~nondet41;havoc main_#t~nondet41;~alive6~0 := main_#t~nondet42;havoc main_#t~nondet42;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 322#L334 assume 0 == ~r1~0; 372#L335 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; 425#L336 assume ~id1~0 >= 0; 362#L337 assume 0 == ~st1~0; 363#L338 assume ~send1~0 == ~id1~0; 403#L339 assume 0 == ~mode1~0 % 256; 323#L340 assume ~id2~0 >= 0; 324#L341 assume 0 == ~st2~0; 397#L342 assume ~send2~0 == ~id2~0; 313#L343 assume 0 == ~mode2~0 % 256; 314#L344 assume ~id3~0 >= 0; 370#L345 assume 0 == ~st3~0; 371#L346 assume ~send3~0 == ~id3~0; 423#L347 assume 0 == ~mode3~0 % 256; 359#L348 assume ~id4~0 >= 0; 360#L349 assume 0 == ~st4~0; 402#L350 assume ~send4~0 == ~id4~0; 346#L351 assume 0 == ~mode4~0 % 256; 347#L352 assume ~id5~0 >= 0; 396#L353 assume 0 == ~st5~0; 310#L354 assume ~send5~0 == ~id5~0; 311#L355 assume 0 == ~mode5~0 % 256; 368#L356 assume ~id6~0 >= 0; 369#L357 assume 0 == ~st6~0; 421#L358 assume ~send6~0 == ~id6~0; 356#L359 assume 0 == ~mode6~0 % 256; 357#L360 assume ~id1~0 != ~id2~0; 401#L361 assume ~id1~0 != ~id3~0; 344#L362 assume ~id1~0 != ~id4~0; 345#L363 assume ~id1~0 != ~id5~0; 395#L364 assume ~id1~0 != ~id6~0; 308#L365 assume ~id2~0 != ~id3~0; 309#L366 assume ~id2~0 != ~id4~0; 389#L367 assume ~id2~0 != ~id5~0; 390#L368 assume ~id2~0 != ~id6~0; 420#L369 assume ~id3~0 != ~id4~0; 354#L370 assume ~id3~0 != ~id5~0; 355#L371 assume ~id3~0 != ~id6~0; 400#L372 assume ~id4~0 != ~id5~0; 342#L373 assume ~id4~0 != ~id6~0; 343#L374 assume ~id5~0 != ~id6~0;init_~tmp~0 := 1; 374#L334-1 init_#res := init_~tmp~0; 375#L499 main_#t~ret43 := init_#res;main_~i2~0 := main_#t~ret43;havoc main_#t~ret43;assume 0 != main_~i2~0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; 383#L575-2 [2019-10-22 09:03:03,031 INFO L793 eck$LassoCheckResult]: Loop: 383#L575-2 assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 431#L126 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 406#L130 assume !(node1_~m1~0 != ~nomsg~0); 334#L130-1 ~mode1~0 := 0; 399#L126-2 havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 409#L163 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 376#L166 assume !(node2_~m2~0 != ~nomsg~0); 373#L166-1 ~mode2~0 := 0; 352#L163-2 havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 303#L197 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 305#L200 assume !(node3_~m3~0 != ~nomsg~0); 365#L200-1 ~mode3~0 := 0; 336#L197-2 havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 337#L231 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 428#L234 assume !(node4_~m4~0 != ~nomsg~0); 386#L234-1 ~mode4~0 := 0; 410#L231-2 havoc node5_#t~ite8, node5_#t~ite9, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 378#L265 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 379#L268 assume !(node5_~m5~0 != ~nomsg~0); 384#L268-1 ~mode5~0 := 0; 307#L265-2 havoc node6_#t~ite10, node6_#t~ite11, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 327#L299 assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 329#L302 assume !(node6_~m6~0 != ~nomsg~0); 326#L302-1 ~mode6~0 := 0; 430#L299-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 407#L507 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1 := 0; 318#L507-1 check_#res := check_~tmp~1; 330#L519 main_#t~ret44 := check_#res;main_~c1~0 := main_#t~ret44;havoc main_#t~ret44;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 331#L608 assume !(0 == assert_~arg % 256); 422#L603 main_#t~post45 := main_~i2~0;main_~i2~0 := 1 + main_#t~post45;havoc main_#t~post45; 383#L575-2 [2019-10-22 09:03:03,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:03,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1302395264, now seen corresponding path program 1 times [2019-10-22 09:03:03,032 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:03,032 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238991294] [2019-10-22 09:03:03,033 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:03,033 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:03,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:03,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:03,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:03,168 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:03:03,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:03,169 INFO L82 PathProgramCache]: Analyzing trace with hash -885212333, now seen corresponding path program 2 times [2019-10-22 09:03:03,169 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:03,169 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839034250] [2019-10-22 09:03:03,169 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:03,170 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:03,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:03,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:03,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:03:03,296 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839034250] [2019-10-22 09:03:03,297 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:03,297 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:03:03,297 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538834941] [2019-10-22 09:03:03,297 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:03:03,298 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:03,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:03:03,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:03:03,298 INFO L87 Difference]: Start difference. First operand 137 states and 194 transitions. cyclomatic complexity: 58 Second operand 5 states. [2019-10-22 09:03:03,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:03,371 INFO L93 Difference]: Finished difference Result 140 states and 196 transitions. [2019-10-22 09:03:03,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:03:03,373 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 140 states and 196 transitions. [2019-10-22 09:03:03,377 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2019-10-22 09:03:03,379 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 140 states to 137 states and 192 transitions. [2019-10-22 09:03:03,379 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 137 [2019-10-22 09:03:03,379 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 137 [2019-10-22 09:03:03,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 137 states and 192 transitions. [2019-10-22 09:03:03,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:03:03,380 INFO L688 BuchiCegarLoop]: Abstraction has 137 states and 192 transitions. [2019-10-22 09:03:03,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states and 192 transitions. [2019-10-22 09:03:03,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2019-10-22 09:03:03,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-10-22 09:03:03,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 192 transitions. [2019-10-22 09:03:03,392 INFO L711 BuchiCegarLoop]: Abstraction has 137 states and 192 transitions. [2019-10-22 09:03:03,392 INFO L591 BuchiCegarLoop]: Abstraction has 137 states and 192 transitions. [2019-10-22 09:03:03,392 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 09:03:03,392 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 137 states and 192 transitions. [2019-10-22 09:03:03,393 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2019-10-22 09:03:03,394 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:03:03,394 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:03:03,395 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:03,395 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:03,401 INFO L791 eck$LassoCheckResult]: Stem: 718#ULTIMATE.startENTRY ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; 610#L-1 havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~ret43, main_#t~ret44, main_#t~post45, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~send1~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode1~0 := main_#t~nondet16;havoc main_#t~nondet16;~alive1~0 := main_#t~nondet17;havoc main_#t~nondet17;~id2~0 := main_#t~nondet18;havoc main_#t~nondet18;~st2~0 := main_#t~nondet19;havoc main_#t~nondet19;~send2~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode2~0 := main_#t~nondet21;havoc main_#t~nondet21;~alive2~0 := main_#t~nondet22;havoc main_#t~nondet22;~id3~0 := main_#t~nondet23;havoc main_#t~nondet23;~st3~0 := main_#t~nondet24;havoc main_#t~nondet24;~send3~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode3~0 := main_#t~nondet26;havoc main_#t~nondet26;~alive3~0 := main_#t~nondet27;havoc main_#t~nondet27;~id4~0 := main_#t~nondet28;havoc main_#t~nondet28;~st4~0 := main_#t~nondet29;havoc main_#t~nondet29;~send4~0 := main_#t~nondet30;havoc main_#t~nondet30;~mode4~0 := main_#t~nondet31;havoc main_#t~nondet31;~alive4~0 := main_#t~nondet32;havoc main_#t~nondet32;~id5~0 := main_#t~nondet33;havoc main_#t~nondet33;~st5~0 := main_#t~nondet34;havoc main_#t~nondet34;~send5~0 := main_#t~nondet35;havoc main_#t~nondet35;~mode5~0 := main_#t~nondet36;havoc main_#t~nondet36;~alive5~0 := main_#t~nondet37;havoc main_#t~nondet37;~id6~0 := main_#t~nondet38;havoc main_#t~nondet38;~st6~0 := main_#t~nondet39;havoc main_#t~nondet39;~send6~0 := main_#t~nondet40;havoc main_#t~nondet40;~mode6~0 := main_#t~nondet41;havoc main_#t~nondet41;~alive6~0 := main_#t~nondet42;havoc main_#t~nondet42;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 611#L334 assume 0 == ~r1~0; 661#L335 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; 714#L336 assume ~id1~0 >= 0; 651#L337 assume 0 == ~st1~0; 652#L338 assume ~send1~0 == ~id1~0; 692#L339 assume 0 == ~mode1~0 % 256; 612#L340 assume ~id2~0 >= 0; 613#L341 assume 0 == ~st2~0; 686#L342 assume ~send2~0 == ~id2~0; 602#L343 assume 0 == ~mode2~0 % 256; 603#L344 assume ~id3~0 >= 0; 659#L345 assume 0 == ~st3~0; 660#L346 assume ~send3~0 == ~id3~0; 713#L347 assume 0 == ~mode3~0 % 256; 648#L348 assume ~id4~0 >= 0; 649#L349 assume 0 == ~st4~0; 691#L350 assume ~send4~0 == ~id4~0; 635#L351 assume 0 == ~mode4~0 % 256; 636#L352 assume ~id5~0 >= 0; 685#L353 assume 0 == ~st5~0; 599#L354 assume ~send5~0 == ~id5~0; 600#L355 assume 0 == ~mode5~0 % 256; 657#L356 assume ~id6~0 >= 0; 658#L357 assume 0 == ~st6~0; 710#L358 assume ~send6~0 == ~id6~0; 645#L359 assume 0 == ~mode6~0 % 256; 646#L360 assume ~id1~0 != ~id2~0; 690#L361 assume ~id1~0 != ~id3~0; 633#L362 assume ~id1~0 != ~id4~0; 634#L363 assume ~id1~0 != ~id5~0; 684#L364 assume ~id1~0 != ~id6~0; 597#L365 assume ~id2~0 != ~id3~0; 598#L366 assume ~id2~0 != ~id4~0; 678#L367 assume ~id2~0 != ~id5~0; 679#L368 assume ~id2~0 != ~id6~0; 709#L369 assume ~id3~0 != ~id4~0; 643#L370 assume ~id3~0 != ~id5~0; 644#L371 assume ~id3~0 != ~id6~0; 689#L372 assume ~id4~0 != ~id5~0; 631#L373 assume ~id4~0 != ~id6~0; 632#L374 assume ~id5~0 != ~id6~0;init_~tmp~0 := 1; 663#L334-1 init_#res := init_~tmp~0; 664#L499 main_#t~ret43 := init_#res;main_~i2~0 := main_#t~ret43;havoc main_#t~ret43;assume 0 != main_~i2~0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; 672#L575-2 [2019-10-22 09:03:03,401 INFO L793 eck$LassoCheckResult]: Loop: 672#L575-2 assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 720#L126 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 695#L130 assume !(node1_~m1~0 != ~nomsg~0); 625#L130-1 ~mode1~0 := 0; 688#L126-2 havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 698#L163 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 665#L166 assume !(node2_~m2~0 != ~nomsg~0); 662#L166-1 ~mode2~0 := 0; 641#L163-2 havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 592#L197 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 594#L200 assume !(node3_~m3~0 != ~nomsg~0); 654#L200-1 ~mode3~0 := 0; 622#L197-2 havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 623#L231 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 717#L234 assume !(node4_~m4~0 != ~nomsg~0); 674#L234-1 ~mode4~0 := 0; 699#L231-2 havoc node5_#t~ite8, node5_#t~ite9, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 667#L265 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 668#L268 assume !(node5_~m5~0 != ~nomsg~0); 676#L268-1 ~mode5~0 := 0; 596#L265-2 havoc node6_#t~ite10, node6_#t~ite11, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 616#L299 assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 618#L302 assume !(node6_~m6~0 != ~nomsg~0); 615#L302-1 ~mode6~0 := 0; 719#L299-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 697#L507 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; 621#L508 assume ~r1~0 < 6;check_~tmp~1 := 1; 607#L507-1 check_#res := check_~tmp~1; 619#L519 main_#t~ret44 := check_#res;main_~c1~0 := main_#t~ret44;havoc main_#t~ret44;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 620#L608 assume !(0 == assert_~arg % 256); 712#L603 main_#t~post45 := main_~i2~0;main_~i2~0 := 1 + main_#t~post45;havoc main_#t~post45; 672#L575-2 [2019-10-22 09:03:03,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:03,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1302395264, now seen corresponding path program 2 times [2019-10-22 09:03:03,402 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:03,402 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421804541] [2019-10-22 09:03:03,402 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:03,402 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:03,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:03,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:03,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:03,501 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:03:03,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:03,502 INFO L82 PathProgramCache]: Analyzing trace with hash -2055105496, now seen corresponding path program 1 times [2019-10-22 09:03:03,502 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:03,502 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74948608] [2019-10-22 09:03:03,503 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:03,503 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:03,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:03,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:03,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:03,547 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:03:03,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:03,548 INFO L82 PathProgramCache]: Analyzing trace with hash -122585655, now seen corresponding path program 1 times [2019-10-22 09:03:03,548 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:03,548 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084246360] [2019-10-22 09:03:03,548 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:03,549 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:03,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:03,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:03,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:03:03,645 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084246360] [2019-10-22 09:03:03,645 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:03,645 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:03:03,646 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909758238] [2019-10-22 09:03:04,233 WARN L191 SmtUtils]: Spent 581.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 157 [2019-10-22 09:03:05,272 WARN L191 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 139 DAG size of output: 134 [2019-10-22 09:03:05,286 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:03:05,287 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:03:05,287 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:03:05,287 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:03:05,287 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 09:03:05,288 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:03:05,288 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:03:05,288 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:03:05,288 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c_Iteration3_Loop [2019-10-22 09:03:05,289 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:03:05,289 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:03:05,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:05,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:05,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:05,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:05,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:05,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:05,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:05,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:05,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:05,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:05,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:05,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:05,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:05,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:05,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:05,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:05,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:05,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:05,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:05,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:05,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:05,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:05,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:05,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:05,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:05,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:05,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:05,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:05,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:05,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:05,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:05,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:05,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:05,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:05,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:05,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:05,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:05,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:05,822 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-10-22 09:03:06,177 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-10-22 09:03:06,274 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:03:06,274 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4a20245-4bd4-4fd1-9c63-7d7587a9ab47/bin/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 [2019-10-22 09:03:06,288 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:03:06,289 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4a20245-4bd4-4fd1-9c63-7d7587a9ab47/bin/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 [2019-10-22 09:03:06,310 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 09:03:06,310 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:03:06,456 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 09:03:06,458 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:03:06,458 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:03:06,458 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:03:06,458 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:03:06,458 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:03:06,459 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:03:06,459 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:03:06,459 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:03:06,459 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c_Iteration3_Loop [2019-10-22 09:03:06,459 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:03:06,459 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:03:06,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:06,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:06,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:06,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:06,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:06,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:06,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:06,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:06,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:06,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:06,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:06,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:06,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:06,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:06,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:06,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:06,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:06,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:06,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:06,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:06,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:06,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:06,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:06,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:06,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:06,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:06,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:06,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:06,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:06,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:06,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:06,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:06,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:06,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:06,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:06,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:06,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:06,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:07,073 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-10-22 09:03:07,326 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:03:07,330 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:03:07,332 INFO L120 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 [2019-10-22 09:03:07,333 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:07,333 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:07,334 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:07,334 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:07,334 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:07,336 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:03:07,336 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:07,339 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:07,339 INFO L120 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 [2019-10-22 09:03:07,340 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:07,340 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:07,340 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:07,340 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:07,342 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:03:07,342 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:03:07,343 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:07,343 INFO L120 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 [2019-10-22 09:03:07,344 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:07,344 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:07,344 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:07,344 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:07,344 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:07,345 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:03:07,345 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:07,345 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:07,346 INFO L120 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 [2019-10-22 09:03:07,346 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:07,346 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:07,346 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:07,346 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:07,348 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:03:07,348 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:03:07,349 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:07,350 INFO L120 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 [2019-10-22 09:03:07,350 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:07,350 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:07,351 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:07,351 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:07,351 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:07,351 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:03:07,351 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:07,353 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:07,353 INFO L120 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 [2019-10-22 09:03:07,354 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:07,354 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:07,354 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:07,354 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:07,354 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:07,355 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:03:07,355 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:07,355 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:07,356 INFO L120 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 [2019-10-22 09:03:07,356 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:07,356 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:07,356 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:07,356 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:07,357 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:03:07,358 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:03:07,360 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:07,360 INFO L120 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 [2019-10-22 09:03:07,360 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:07,361 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:07,361 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:07,361 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:03:07,361 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:07,362 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:03:07,362 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:07,366 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:07,366 INFO L120 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 [2019-10-22 09:03:07,367 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:07,367 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:07,367 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:07,368 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:07,369 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:03:07,369 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:03:07,371 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:07,371 INFO L120 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 [2019-10-22 09:03:07,372 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:07,372 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:07,372 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:07,372 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:07,372 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:07,373 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:03:07,373 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:07,377 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:07,380 INFO L120 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 [2019-10-22 09:03:07,380 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:07,380 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:07,380 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:07,381 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:07,381 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:03:07,382 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:03:07,384 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:07,384 INFO L120 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 [2019-10-22 09:03:07,384 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:07,384 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:07,385 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:07,385 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:07,385 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:07,385 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:03:07,385 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:07,385 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:07,386 INFO L120 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 [2019-10-22 09:03:07,386 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:07,386 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:07,386 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:07,386 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:07,386 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:07,387 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:03:07,387 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:07,387 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:07,388 INFO L120 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 [2019-10-22 09:03:07,388 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:07,388 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:07,389 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:07,389 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:07,389 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:07,389 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:03:07,389 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:07,390 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:07,390 INFO L120 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 [2019-10-22 09:03:07,391 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:07,391 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:07,391 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:07,391 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:07,391 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:07,391 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:03:07,391 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:07,392 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:07,393 INFO L120 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 [2019-10-22 09:03:07,393 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:07,393 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:07,393 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:07,393 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:07,394 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:03:07,394 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:03:07,397 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:07,399 INFO L120 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 [2019-10-22 09:03:07,403 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:07,403 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:07,403 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:07,403 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:07,404 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:07,404 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:03:07,404 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:07,405 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:07,405 INFO L120 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 [2019-10-22 09:03:07,406 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:07,406 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:07,406 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:07,406 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:07,406 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:07,407 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:03:07,407 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:07,408 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:07,409 INFO L120 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 [2019-10-22 09:03:07,409 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:07,410 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:07,410 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:07,410 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:07,410 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:07,410 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:03:07,411 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:07,412 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:03:07,416 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:03:07,416 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-10-22 09:03:07,418 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:03:07,418 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 09:03:07,418 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:03:07,419 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 23 Supporting invariants [] [2019-10-22 09:03:07,424 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 09:03:07,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:07,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:07,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:03:07,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:03:07,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:07,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:03:07,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:03:07,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:03:07,569 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 [2019-10-22 09:03:07,570 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 137 states and 192 transitions. cyclomatic complexity: 56 Second operand 3 states. [2019-10-22 09:03:07,643 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 137 states and 192 transitions. cyclomatic complexity: 56. Second operand 3 states. Result 229 states and 340 transitions. Complement of second has 4 states. [2019-10-22 09:03:07,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 09:03:07,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:03:07,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 192 transitions. [2019-10-22 09:03:07,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 192 transitions. Stem has 45 letters. Loop has 31 letters. [2019-10-22 09:03:07,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:03:07,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 192 transitions. Stem has 76 letters. Loop has 31 letters. [2019-10-22 09:03:07,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:03:07,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 192 transitions. Stem has 45 letters. Loop has 62 letters. [2019-10-22 09:03:07,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:03:07,654 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 229 states and 340 transitions. [2019-10-22 09:03:07,658 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:03:07,658 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 229 states to 0 states and 0 transitions. [2019-10-22 09:03:07,658 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 09:03:07,658 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 09:03:07,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 09:03:07,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:03:07,659 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:03:07,659 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:03:07,659 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:07,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:03:07,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:03:07,659 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2019-10-22 09:03:07,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:07,659 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-10-22 09:03:07,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 09:03:07,660 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-10-22 09:03:07,660 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:03:07,660 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 09:03:07,660 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 09:03:07,660 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 09:03:07,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 09:03:07,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:03:07,660 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:03:07,660 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:03:07,660 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:03:07,660 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 09:03:07,661 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 09:03:07,661 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:03:07,661 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 09:03:07,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 09:03:07 BoogieIcfgContainer [2019-10-22 09:03:07,671 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 09:03:07,672 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:03:07,672 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:03:07,672 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:03:07,672 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:03:02" (3/4) ... [2019-10-22 09:03:07,676 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 09:03:07,676 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:03:07,678 INFO L168 Benchmark]: Toolchain (without parser) took 6820.55 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 348.1 MB). Free memory was 949.9 MB in the beginning and 1.1 GB in the end (delta: -165.3 MB). Peak memory consumption was 182.8 MB. Max. memory is 11.5 GB. [2019-10-22 09:03:07,678 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:03:07,679 INFO L168 Benchmark]: CACSL2BoogieTranslator took 380.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -201.4 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2019-10-22 09:03:07,680 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.45 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:03:07,681 INFO L168 Benchmark]: Boogie Preprocessor took 33.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-10-22 09:03:07,681 INFO L168 Benchmark]: RCFGBuilder took 1013.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 58.8 MB). Peak memory consumption was 58.8 MB. Max. memory is 11.5 GB. [2019-10-22 09:03:07,682 INFO L168 Benchmark]: BuchiAutomizer took 5339.20 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 186.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -34.8 MB). Peak memory consumption was 151.8 MB. Max. memory is 11.5 GB. [2019-10-22 09:03:07,683 INFO L168 Benchmark]: Witness Printer took 4.82 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:03:07,685 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 380.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -201.4 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.45 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1013.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 58.8 MB). Peak memory consumption was 58.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5339.20 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 186.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -34.8 MB). Peak memory consumption was 151.8 MB. Max. memory is 11.5 GB. * Witness Printer took 4.82 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 23 and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.2s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 4.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. 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 137 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 621 SDtfs, 339 SDslu, 1148 SDs, 0 SdLazy, 22 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital347 mio100 ax121 hnf105 lsp16 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq229 hnf85 smp100 dnf100 smp100 tf101 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 4ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...