./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 54858612 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 b690c861b7d4573d7c615743786ffa5ed0fc7e3b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-5485861 [2020-10-26 05:52:24,042 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-26 05:52:24,047 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-26 05:52:24,106 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-26 05:52:24,107 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-26 05:52:24,113 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-26 05:52:24,116 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-26 05:52:24,123 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-26 05:52:24,127 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-26 05:52:24,134 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-26 05:52:24,136 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-26 05:52:24,142 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-26 05:52:24,143 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-26 05:52:24,147 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-26 05:52:24,149 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-26 05:52:24,151 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-26 05:52:24,153 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-26 05:52:24,155 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-26 05:52:24,160 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-26 05:52:24,165 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-26 05:52:24,167 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-26 05:52:24,172 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-26 05:52:24,175 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-26 05:52:24,178 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-26 05:52:24,182 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-26 05:52:24,187 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-26 05:52:24,188 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-26 05:52:24,189 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-26 05:52:24,191 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-26 05:52:24,192 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-26 05:52:24,193 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-26 05:52:24,193 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-26 05:52:24,195 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-26 05:52:24,197 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-26 05:52:24,198 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-26 05:52:24,199 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-26 05:52:24,200 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-26 05:52:24,200 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-26 05:52:24,201 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-26 05:52:24,203 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-26 05:52:24,204 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-26 05:52:24,205 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-26 05:52:24,270 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-26 05:52:24,270 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-26 05:52:24,275 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-26 05:52:24,275 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-26 05:52:24,275 INFO L138 SettingsManager]: * Use SBE=true [2020-10-26 05:52:24,276 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-26 05:52:24,276 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-26 05:52:24,277 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-26 05:52:24,277 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-26 05:52:24,277 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-26 05:52:24,278 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-26 05:52:24,279 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-26 05:52:24,279 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-26 05:52:24,279 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-26 05:52:24,280 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-26 05:52:24,280 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-26 05:52:24,280 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-26 05:52:24,280 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-26 05:52:24,281 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-26 05:52:24,281 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-26 05:52:24,281 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-26 05:52:24,281 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-26 05:52:24,282 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-26 05:52:24,282 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-26 05:52:24,282 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-26 05:52:24,282 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-26 05:52:24,283 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-26 05:52:24,283 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-26 05:52:24,283 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-26 05:52:24,283 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-26 05:52:24,284 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-26 05:52:24,284 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-26 05:52:24,286 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-26 05:52:24,287 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> b690c861b7d4573d7c615743786ffa5ed0fc7e3b [2020-10-26 05:52:24,778 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-26 05:52:24,826 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-26 05:52:24,830 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-26 05:52:24,832 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-26 05:52:24,833 INFO L275 PluginConnector]: CDTParser initialized [2020-10-26 05:52:24,835 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c [2020-10-26 05:52:24,942 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/964bc74cb/7d4b9dcea3f74fb6b681067d2536d456/FLAG49c862817 [2020-10-26 05:52:25,625 INFO L306 CDTParser]: Found 1 translation units. [2020-10-26 05:52:25,626 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c [2020-10-26 05:52:25,640 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/964bc74cb/7d4b9dcea3f74fb6b681067d2536d456/FLAG49c862817 [2020-10-26 05:52:25,948 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/964bc74cb/7d4b9dcea3f74fb6b681067d2536d456 [2020-10-26 05:52:25,952 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-26 05:52:25,962 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-26 05:52:25,966 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-26 05:52:25,966 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-26 05:52:25,970 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-26 05:52:25,971 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 05:52:25" (1/1) ... [2020-10-26 05:52:25,976 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24ed5836 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:52:25, skipping insertion in model container [2020-10-26 05:52:25,977 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 05:52:25" (1/1) ... [2020-10-26 05:52:25,985 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-26 05:52:26,042 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-26 05:52:26,272 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 05:52:26,292 INFO L203 MainTranslator]: Completed pre-run [2020-10-26 05:52:26,344 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 05:52:26,365 INFO L208 MainTranslator]: Completed translation [2020-10-26 05:52:26,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:52:26 WrapperNode [2020-10-26 05:52:26,366 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-26 05:52:26,367 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-26 05:52:26,367 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-26 05:52:26,368 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-26 05:52:26,376 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:52:26" (1/1) ... [2020-10-26 05:52:26,394 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:52:26" (1/1) ... [2020-10-26 05:52:26,435 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-26 05:52:26,436 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-26 05:52:26,436 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-26 05:52:26,436 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-26 05:52:26,448 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:52:26" (1/1) ... [2020-10-26 05:52:26,449 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:52:26" (1/1) ... [2020-10-26 05:52:26,452 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:52:26" (1/1) ... [2020-10-26 05:52:26,453 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:52:26" (1/1) ... [2020-10-26 05:52:26,460 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:52:26" (1/1) ... [2020-10-26 05:52:26,467 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:52:26" (1/1) ... [2020-10-26 05:52:26,470 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:52:26" (1/1) ... [2020-10-26 05:52:26,474 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-26 05:52:26,476 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-26 05:52:26,476 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-26 05:52:26,476 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-26 05:52:26,477 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:52:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-26 05:52:26,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-26 05:52:26,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-26 05:52:26,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-26 05:52:26,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-26 05:52:27,200 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-26 05:52:27,202 INFO L298 CfgBuilder]: Removed 19 assume(true) statements. [2020-10-26 05:52:27,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 05:52:27 BoogieIcfgContainer [2020-10-26 05:52:27,205 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-26 05:52:27,206 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-26 05:52:27,206 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-26 05:52:27,217 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-26 05:52:27,218 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 05:52:27,218 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.10 05:52:25" (1/3) ... [2020-10-26 05:52:27,219 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@26644dab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 05:52:27, skipping insertion in model container [2020-10-26 05:52:27,219 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 05:52:27,219 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:52:26" (2/3) ... [2020-10-26 05:52:27,220 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@26644dab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 05:52:27, skipping insertion in model container [2020-10-26 05:52:27,220 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 05:52:27,220 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 05:52:27" (3/3) ... [2020-10-26 05:52:27,223 INFO L373 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c [2020-10-26 05:52:27,298 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-26 05:52:27,299 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-26 05:52:27,299 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-26 05:52:27,299 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-26 05:52:27,299 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-26 05:52:27,300 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-26 05:52:27,300 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-26 05:52:27,300 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-26 05:52:27,323 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states. [2020-10-26 05:52:27,361 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 49 [2020-10-26 05:52:27,361 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:52:27,361 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:52:27,374 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-26 05:52:27,375 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 05:52:27,375 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-26 05:52:27,375 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states. [2020-10-26 05:52:27,393 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 49 [2020-10-26 05:52:27,393 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:52:27,394 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:52:27,397 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-26 05:52:27,398 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 05:52:27,410 INFO L794 eck$LassoCheckResult]: Stem: 36#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(49);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~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;~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]; 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~ret28, main_#t~ret29, main_#t~post30, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~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;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 16#L204true assume !(0 == ~r1~0);init_~tmp~0 := 0; 15#L204-1true init_#res := init_~tmp~0; 65#L273true main_#t~ret28 := init_#res;main_~i2~0 := main_#t~ret28;havoc main_#t~ret28; 68#L320true assume 0 == main_~i2~0;assume false; 53#L320-2true ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0 := 0; 74#L328-2true [2020-10-26 05:52:27,412 INFO L796 eck$LassoCheckResult]: Loop: 74#L328-2true assume !!(main_~i2~0 < 6);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 49#L104true assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 73#L108true assume !(node1_~m1~0 != ~nomsg~0); 71#L108-1true ~mode1~0 := 0; 46#L104-2true havoc node2_#t~ite8, node2_#t~ite9, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 34#L136true assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 37#L139true assume !(node2_~m2~0 != ~nomsg~0); 35#L139-1true ~mode2~0 := 0; 30#L136-2true havoc node3_#t~ite10, node3_#t~ite11, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 70#L170true assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 57#L173true assume !(node3_~m3~0 != ~nomsg~0); 56#L173-1true ~mode3~0 := 0; 50#L170-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;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 25#L281true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 20#L281-1true check_#res := check_~tmp~1; 28#L293true main_#t~ret29 := check_#res;main_~c1~0 := main_#t~ret29;havoc main_#t~ret29;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 51#L352true assume !(0 == assert_~arg % 256); 21#L347true main_#t~post30 := main_~i2~0;main_~i2~0 := 1 + main_#t~post30;havoc main_#t~post30; 74#L328-2true [2020-10-26 05:52:27,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:52:27,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1898425706, now seen corresponding path program 1 times [2020-10-26 05:52:27,434 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:52:27,434 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739732441] [2020-10-26 05:52:27,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:52:27,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:52:27,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 05:52:27,617 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739732441] [2020-10-26 05:52:27,618 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:52:27,618 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-26 05:52:27,619 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980446044] [2020-10-26 05:52:27,624 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 05:52:27,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:52:27,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1181507516, now seen corresponding path program 1 times [2020-10-26 05:52:27,626 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:52:27,626 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685256724] [2020-10-26 05:52:27,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:52:27,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:52:27,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 05:52:27,850 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685256724] [2020-10-26 05:52:27,850 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:52:27,850 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-26 05:52:27,851 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091472986] [2020-10-26 05:52:27,852 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 05:52:27,853 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 05:52:27,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-26 05:52:27,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-26 05:52:27,871 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 2 states. [2020-10-26 05:52:27,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 05:52:27,884 INFO L93 Difference]: Finished difference Result 75 states and 120 transitions. [2020-10-26 05:52:27,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-26 05:52:27,886 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 120 transitions. [2020-10-26 05:52:27,889 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2020-10-26 05:52:27,895 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 70 states and 115 transitions. [2020-10-26 05:52:27,896 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 70 [2020-10-26 05:52:27,897 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2020-10-26 05:52:27,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 115 transitions. [2020-10-26 05:52:27,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 05:52:27,898 INFO L691 BuchiCegarLoop]: Abstraction has 70 states and 115 transitions. [2020-10-26 05:52:27,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 115 transitions. [2020-10-26 05:52:27,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-10-26 05:52:27,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-10-26 05:52:27,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 115 transitions. [2020-10-26 05:52:27,934 INFO L714 BuchiCegarLoop]: Abstraction has 70 states and 115 transitions. [2020-10-26 05:52:27,934 INFO L594 BuchiCegarLoop]: Abstraction has 70 states and 115 transitions. [2020-10-26 05:52:27,934 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-26 05:52:27,934 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 115 transitions. [2020-10-26 05:52:27,936 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2020-10-26 05:52:27,936 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:52:27,936 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:52:27,937 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-26 05:52:27,938 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 05:52:27,938 INFO L794 eck$LassoCheckResult]: Stem: 210#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(49);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~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;~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]; 183#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~ret28, main_#t~ret29, main_#t~post30, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~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;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 184#L204 assume !(0 == ~r1~0);init_~tmp~0 := 0; 167#L204-1 init_#res := init_~tmp~0; 185#L273 main_#t~ret28 := init_#res;main_~i2~0 := main_#t~ret28;havoc main_#t~ret28; 231#L320 assume !(0 == main_~i2~0); 223#L320-2 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0 := 0; 193#L328-2 [2020-10-26 05:52:27,938 INFO L796 eck$LassoCheckResult]: Loop: 193#L328-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 221#L104 assume !(0 != ~mode1~0 % 256); 215#L122 assume !(0 != ~alive1~0 % 256); 216#L122-2 ~mode1~0 := 1; 219#L104-2 havoc node2_#t~ite8, node2_#t~ite9, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 207#L136 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 208#L139 assume !(node2_~m2~0 != ~nomsg~0); 209#L139-1 ~mode2~0 := 0; 203#L136-2 havoc node3_#t~ite10, node3_#t~ite11, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 204#L170 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 226#L173 assume !(node3_~m3~0 != ~nomsg~0); 164#L173-1 ~mode3~0 := 0; 175#L170-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;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 194#L281 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 178#L281-1 check_#res := check_~tmp~1; 191#L293 main_#t~ret29 := check_#res;main_~c1~0 := main_#t~ret29;havoc main_#t~ret29;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 200#L352 assume !(0 == assert_~arg % 256); 192#L347 main_#t~post30 := main_~i2~0;main_~i2~0 := 1 + main_#t~post30;havoc main_#t~post30; 193#L328-2 [2020-10-26 05:52:27,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:52:27,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1898425768, now seen corresponding path program 1 times [2020-10-26 05:52:27,940 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:52:27,940 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824393138] [2020-10-26 05:52:27,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:52:27,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:52:28,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 05:52:28,027 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824393138] [2020-10-26 05:52:28,028 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:52:28,028 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-26 05:52:28,029 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959093760] [2020-10-26 05:52:28,029 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 05:52:28,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:52:28,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1582780834, now seen corresponding path program 1 times [2020-10-26 05:52:28,030 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:52:28,031 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033885368] [2020-10-26 05:52:28,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:52:28,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:52:28,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 05:52:28,164 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033885368] [2020-10-26 05:52:28,165 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:52:28,165 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-26 05:52:28,165 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972515224] [2020-10-26 05:52:28,165 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 05:52:28,166 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 05:52:28,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 05:52:28,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-26 05:52:28,167 INFO L87 Difference]: Start difference. First operand 70 states and 115 transitions. cyclomatic complexity: 46 Second operand 5 states. [2020-10-26 05:52:28,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 05:52:28,257 INFO L93 Difference]: Finished difference Result 120 states and 192 transitions. [2020-10-26 05:52:28,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-26 05:52:28,258 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 192 transitions. [2020-10-26 05:52:28,261 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2020-10-26 05:52:28,263 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 117 states and 173 transitions. [2020-10-26 05:52:28,263 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 117 [2020-10-26 05:52:28,264 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 117 [2020-10-26 05:52:28,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 117 states and 173 transitions. [2020-10-26 05:52:28,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 05:52:28,266 INFO L691 BuchiCegarLoop]: Abstraction has 117 states and 173 transitions. [2020-10-26 05:52:28,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states and 173 transitions. [2020-10-26 05:52:28,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 70. [2020-10-26 05:52:28,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-10-26 05:52:28,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 98 transitions. [2020-10-26 05:52:28,273 INFO L714 BuchiCegarLoop]: Abstraction has 70 states and 98 transitions. [2020-10-26 05:52:28,274 INFO L594 BuchiCegarLoop]: Abstraction has 70 states and 98 transitions. [2020-10-26 05:52:28,274 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-26 05:52:28,274 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 98 transitions. [2020-10-26 05:52:28,275 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2020-10-26 05:52:28,275 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:52:28,276 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:52:28,277 INFO L852 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] [2020-10-26 05:52:28,277 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 05:52:28,277 INFO L794 eck$LassoCheckResult]: Stem: 415#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(49);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~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;~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]; 387#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~ret28, main_#t~ret29, main_#t~post30, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~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;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 388#L204 assume 0 == ~r1~0; 391#L205 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; 417#L206 assume ~id1~0 >= 0; 433#L207 assume 0 == ~st1~0; 370#L208 assume ~send1~0 == ~id1~0; 371#L209 assume 0 == ~mode1~0 % 256; 410#L210 assume ~id2~0 >= 0; 425#L211 assume 0 == ~st2~0; 385#L212 assume ~send2~0 == ~id2~0; 386#L213 assume 0 == ~mode2~0 % 256; 428#L214 assume ~id3~0 >= 0; 392#L215 assume 0 == ~st3~0; 393#L216 assume ~send3~0 == ~id3~0; 418#L217 assume 0 == ~mode3~0 % 256; 434#L218 assume ~id1~0 != ~id2~0; 372#L219 assume ~id1~0 != ~id3~0; 373#L220 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 389#L204-1 init_#res := init_~tmp~0; 390#L273 main_#t~ret28 := init_#res;main_~i2~0 := main_#t~ret28;havoc main_#t~ret28; 436#L320 assume !(0 == main_~i2~0); 429#L320-2 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0 := 0; 398#L328-2 [2020-10-26 05:52:28,278 INFO L796 eck$LassoCheckResult]: Loop: 398#L328-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 426#L104 assume !(0 != ~mode1~0 % 256); 419#L122 assume !(0 != ~alive1~0 % 256); 420#L122-2 ~mode1~0 := 1; 424#L104-2 havoc node2_#t~ite8, node2_#t~ite9, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 412#L136 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 413#L139 assume !(node2_~m2~0 != ~nomsg~0); 414#L139-1 ~mode2~0 := 0; 408#L136-2 havoc node3_#t~ite10, node3_#t~ite11, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 409#L170 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 431#L173 assume !(node3_~m3~0 != ~nomsg~0); 369#L173-1 ~mode3~0 := 0; 379#L170-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;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 402#L281 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 382#L281-1 check_#res := check_~tmp~1; 396#L293 main_#t~ret29 := check_#res;main_~c1~0 := main_#t~ret29;havoc main_#t~ret29;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 405#L352 assume !(0 == assert_~arg % 256); 397#L347 main_#t~post30 := main_~i2~0;main_~i2~0 := 1 + main_#t~post30;havoc main_#t~post30; 398#L328-2 [2020-10-26 05:52:28,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:52:28,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1524872798, now seen corresponding path program 1 times [2020-10-26 05:52:28,279 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:52:28,279 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573243825] [2020-10-26 05:52:28,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:52:28,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:52:28,308 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:52:28,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:52:28,363 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:52:28,414 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 05:52:28,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:52:28,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1582780834, now seen corresponding path program 2 times [2020-10-26 05:52:28,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:52:28,417 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310077211] [2020-10-26 05:52:28,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:52:28,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:52:28,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 05:52:28,535 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310077211] [2020-10-26 05:52:28,535 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:52:28,535 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-26 05:52:28,536 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862885822] [2020-10-26 05:52:28,536 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 05:52:28,536 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 05:52:28,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 05:52:28,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-26 05:52:28,539 INFO L87 Difference]: Start difference. First operand 70 states and 98 transitions. cyclomatic complexity: 29 Second operand 5 states. [2020-10-26 05:52:28,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 05:52:28,606 INFO L93 Difference]: Finished difference Result 73 states and 100 transitions. [2020-10-26 05:52:28,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 05:52:28,609 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 100 transitions. [2020-10-26 05:52:28,612 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2020-10-26 05:52:28,614 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 70 states and 96 transitions. [2020-10-26 05:52:28,614 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 70 [2020-10-26 05:52:28,615 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2020-10-26 05:52:28,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 96 transitions. [2020-10-26 05:52:28,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 05:52:28,616 INFO L691 BuchiCegarLoop]: Abstraction has 70 states and 96 transitions. [2020-10-26 05:52:28,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 96 transitions. [2020-10-26 05:52:28,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-10-26 05:52:28,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-10-26 05:52:28,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 96 transitions. [2020-10-26 05:52:28,628 INFO L714 BuchiCegarLoop]: Abstraction has 70 states and 96 transitions. [2020-10-26 05:52:28,630 INFO L594 BuchiCegarLoop]: Abstraction has 70 states and 96 transitions. [2020-10-26 05:52:28,630 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-26 05:52:28,630 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 96 transitions. [2020-10-26 05:52:28,631 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2020-10-26 05:52:28,632 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:52:28,632 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:52:28,634 INFO L852 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] [2020-10-26 05:52:28,636 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 05:52:28,636 INFO L794 eck$LassoCheckResult]: Stem: 570#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(49);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~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;~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]; 542#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~ret28, main_#t~ret29, main_#t~post30, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~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;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 543#L204 assume 0 == ~r1~0; 546#L205 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; 572#L206 assume ~id1~0 >= 0; 588#L207 assume 0 == ~st1~0; 525#L208 assume ~send1~0 == ~id1~0; 526#L209 assume 0 == ~mode1~0 % 256; 565#L210 assume ~id2~0 >= 0; 580#L211 assume 0 == ~st2~0; 540#L212 assume ~send2~0 == ~id2~0; 541#L213 assume 0 == ~mode2~0 % 256; 583#L214 assume ~id3~0 >= 0; 547#L215 assume 0 == ~st3~0; 548#L216 assume ~send3~0 == ~id3~0; 573#L217 assume 0 == ~mode3~0 % 256; 589#L218 assume ~id1~0 != ~id2~0; 527#L219 assume ~id1~0 != ~id3~0; 528#L220 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 544#L204-1 init_#res := init_~tmp~0; 545#L273 main_#t~ret28 := init_#res;main_~i2~0 := main_#t~ret28;havoc main_#t~ret28; 591#L320 assume !(0 == main_~i2~0); 584#L320-2 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0 := 0; 552#L328-2 [2020-10-26 05:52:28,637 INFO L796 eck$LassoCheckResult]: Loop: 552#L328-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 581#L104 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 582#L108 assume !(node1_~m1~0 != ~nomsg~0); 532#L108-1 ~mode1~0 := 0; 579#L104-2 havoc node2_#t~ite8, node2_#t~ite9, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 567#L136 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 568#L139 assume !(node2_~m2~0 != ~nomsg~0); 569#L139-1 ~mode2~0 := 0; 563#L136-2 havoc node3_#t~ite10, node3_#t~ite11, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 564#L170 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 586#L173 assume !(node3_~m3~0 != ~nomsg~0); 524#L173-1 ~mode3~0 := 0; 534#L170-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;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 557#L281 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 558#L282 assume ~r1~0 < 3;check_~tmp~1 := 1; 536#L281-1 check_#res := check_~tmp~1; 553#L293 main_#t~ret29 := check_#res;main_~c1~0 := main_#t~ret29;havoc main_#t~ret29;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 560#L352 assume !(0 == assert_~arg % 256); 551#L347 main_#t~post30 := main_~i2~0;main_~i2~0 := 1 + main_#t~post30;havoc main_#t~post30; 552#L328-2 [2020-10-26 05:52:28,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:52:28,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1524872798, now seen corresponding path program 2 times [2020-10-26 05:52:28,638 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:52:28,638 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784541099] [2020-10-26 05:52:28,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:52:28,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:52:28,673 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:52:28,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:52:28,705 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:52:28,718 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 05:52:28,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:52:28,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1644643476, now seen corresponding path program 1 times [2020-10-26 05:52:28,737 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:52:28,737 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719103368] [2020-10-26 05:52:28,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:52:28,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:52:28,754 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:52:28,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:52:28,765 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:52:28,779 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 05:52:28,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:52:28,781 INFO L82 PathProgramCache]: Analyzing trace with hash 309767959, now seen corresponding path program 1 times [2020-10-26 05:52:28,781 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:52:28,782 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770580923] [2020-10-26 05:52:28,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:52:28,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:52:28,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 05:52:28,869 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770580923] [2020-10-26 05:52:28,870 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:52:28,870 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 05:52:28,870 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812763729] [2020-10-26 05:52:29,168 WARN L193 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 97 [2020-10-26 05:52:29,479 WARN L193 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 86 [2020-10-26 05:52:29,493 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 05:52:29,494 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 05:52:29,495 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 05:52:29,495 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 05:52:29,495 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-26 05:52:29,496 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:52:29,496 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 05:52:29,496 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 05:52:29,496 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2020-10-26 05:52:29,496 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 05:52:29,497 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 05:52:29,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:29,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:29,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:29,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:29,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:29,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:29,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:29,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:29,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:29,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:29,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:29,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:29,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:29,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:29,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:29,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:29,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:29,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:29,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:29,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:29,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:29,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:30,336 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 05:52:30,337 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-26 05:52:30,359 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-26 05:52:30,360 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-26 05:52:30,387 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-26 05:52:30,387 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-26 05:52:30,414 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-26 05:52:30,417 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 05:52:30,418 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 05:52:30,418 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 05:52:30,418 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 05:52:30,418 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 05:52:30,418 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:52:30,418 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 05:52:30,420 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 05:52:30,420 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2020-10-26 05:52:30,420 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 05:52:30,420 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 05:52:30,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:30,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:30,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:30,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:30,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:30,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:30,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:30,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:30,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:30,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:30,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:30,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:30,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:30,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:30,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:30,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:30,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:30,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:30,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:30,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:30,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:30,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 05:52:31,219 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 05:52:31,226 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:52:31,234 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 [2020-10-26 05:52:31,236 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:52:31,236 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 05:52:31,237 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:52:31,237 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 05:52:31,237 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:52:31,239 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 05:52:31,240 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 05:52:31,242 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 05:52:31,256 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-26 05:52:31,256 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 05:52:31,266 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-26 05:52:31,266 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-26 05:52:31,268 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 05:52:31,269 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 11 Supporting invariants [] Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:52:31,297 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-26 05:52:31,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:52:31,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:52:31,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-26 05:52:31,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 05:52:31,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:52:31,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-26 05:52:31,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 05:52:31,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 05:52:31,592 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 [2020-10-26 05:52:31,594 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 70 states and 96 transitions. cyclomatic complexity: 27 Second operand 3 states. [2020-10-26 05:52:31,659 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 70 states and 96 transitions. cyclomatic complexity: 27. Second operand 3 states. Result 117 states and 170 transitions. Complement of second has 4 states. [2020-10-26 05:52:31,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-26 05:52:31,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-26 05:52:31,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2020-10-26 05:52:31,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 96 transitions. Stem has 23 letters. Loop has 19 letters. [2020-10-26 05:52:31,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 05:52:31,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 96 transitions. Stem has 42 letters. Loop has 19 letters. [2020-10-26 05:52:31,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 05:52:31,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 96 transitions. Stem has 23 letters. Loop has 38 letters. [2020-10-26 05:52:31,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 05:52:31,667 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 117 states and 170 transitions. [2020-10-26 05:52:31,669 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-26 05:52:31,670 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 117 states to 0 states and 0 transitions. [2020-10-26 05:52:31,670 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-26 05:52:31,670 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-26 05:52:31,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-26 05:52:31,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 05:52:31,670 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 05:52:31,670 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 05:52:31,671 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 05:52:31,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 05:52:31,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 05:52:31,672 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2020-10-26 05:52:31,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 05:52:31,672 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-10-26 05:52:31,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-26 05:52:31,672 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2020-10-26 05:52:31,672 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-26 05:52:31,673 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2020-10-26 05:52:31,673 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-26 05:52:31,673 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-26 05:52:31,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-26 05:52:31,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 05:52:31,673 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 05:52:31,673 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 05:52:31,673 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 05:52:31,673 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-26 05:52:31,674 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-26 05:52:31,674 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-26 05:52:31,674 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-26 05:52:31,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.10 05:52:31 BoogieIcfgContainer [2020-10-26 05:52:31,681 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-26 05:52:31,682 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-26 05:52:31,682 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-26 05:52:31,682 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-26 05:52:31,683 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 05:52:27" (3/4) ... [2020-10-26 05:52:31,687 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-26 05:52:31,687 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-26 05:52:31,689 INFO L168 Benchmark]: Toolchain (without parser) took 5733.65 ms. Allocated memory was 48.2 MB in the beginning and 109.1 MB in the end (delta: 60.8 MB). Free memory was 25.2 MB in the beginning and 36.9 MB in the end (delta: -11.6 MB). Peak memory consumption was 51.9 MB. Max. memory is 16.1 GB. [2020-10-26 05:52:31,690 INFO L168 Benchmark]: CDTParser took 0.44 ms. Allocated memory is still 48.2 MB. Free memory was 31.0 MB in the beginning and 30.9 MB in the end (delta: 84.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 05:52:31,691 INFO L168 Benchmark]: CACSL2BoogieTranslator took 400.50 ms. Allocated memory is still 48.2 MB. Free memory was 24.5 MB in the beginning and 25.0 MB in the end (delta: -457.6 kB). Peak memory consumption was 5.6 MB. Max. memory is 16.1 GB. [2020-10-26 05:52:31,692 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.17 ms. Allocated memory is still 48.2 MB. Free memory was 25.0 MB in the beginning and 22.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-26 05:52:31,693 INFO L168 Benchmark]: Boogie Preprocessor took 38.70 ms. Allocated memory is still 48.2 MB. Free memory was 22.9 MB in the beginning and 21.2 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-26 05:52:31,694 INFO L168 Benchmark]: RCFGBuilder took 729.22 ms. Allocated memory was 48.2 MB in the beginning and 58.7 MB in the end (delta: 10.5 MB). Free memory was 21.2 MB in the beginning and 25.0 MB in the end (delta: -3.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 16.1 GB. [2020-10-26 05:52:31,695 INFO L168 Benchmark]: BuchiAutomizer took 4475.47 ms. Allocated memory was 58.7 MB in the beginning and 109.1 MB in the end (delta: 50.3 MB). Free memory was 25.0 MB in the beginning and 36.9 MB in the end (delta: -11.8 MB). Peak memory consumption was 39.4 MB. Max. memory is 16.1 GB. [2020-10-26 05:52:31,695 INFO L168 Benchmark]: Witness Printer took 5.29 ms. Allocated memory is still 109.1 MB. Free memory is still 36.9 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 05:52:31,701 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.44 ms. Allocated memory is still 48.2 MB. Free memory was 31.0 MB in the beginning and 30.9 MB in the end (delta: 84.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 400.50 ms. Allocated memory is still 48.2 MB. Free memory was 24.5 MB in the beginning and 25.0 MB in the end (delta: -457.6 kB). Peak memory consumption was 5.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 68.17 ms. Allocated memory is still 48.2 MB. Free memory was 25.0 MB in the beginning and 22.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 38.70 ms. Allocated memory is still 48.2 MB. Free memory was 22.9 MB in the beginning and 21.2 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 729.22 ms. Allocated memory was 48.2 MB in the beginning and 58.7 MB in the end (delta: 10.5 MB). Free memory was 21.2 MB in the beginning and 25.0 MB in the end (delta: -3.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 4475.47 ms. Allocated memory was 58.7 MB in the beginning and 109.1 MB in the end (delta: 50.3 MB). Free memory was 25.0 MB in the beginning and 36.9 MB in the end (delta: -11.8 MB). Peak memory consumption was 39.4 MB. Max. memory is 16.1 GB. * Witness Printer took 5.29 ms. Allocated memory is still 109.1 MB. Free memory is still 36.9 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 11 and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.3s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 3.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 47 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 70 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 421 SDtfs, 173 SDslu, 664 SDs, 0 SdLazy, 35 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI2 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital123 mio100 ax129 hnf106 lsp22 ukn100 mio100 lsp100 div168 bol100 ite100 ukn100 eq153 hnf75 smp100 dnf104 smp96 tf102 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 40ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...