./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.5.1.ufo.BOUNDED-10.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.5.1.ufo.BOUNDED-10.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 8c23cf037d507a0ee8791b9f31277b87b4e3943f .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:54:23,911 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-26 05:54:23,914 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-26 05:54:23,976 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-26 05:54:23,977 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-26 05:54:23,983 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-26 05:54:23,987 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-26 05:54:23,995 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-26 05:54:24,003 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-26 05:54:24,012 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-26 05:54:24,014 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-26 05:54:24,016 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-26 05:54:24,017 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-26 05:54:24,019 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-26 05:54:24,022 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-26 05:54:24,025 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-26 05:54:24,026 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-26 05:54:24,031 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-26 05:54:24,033 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-26 05:54:24,042 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-26 05:54:24,046 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-26 05:54:24,048 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-26 05:54:24,050 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-26 05:54:24,052 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-26 05:54:24,062 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-26 05:54:24,062 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-26 05:54:24,063 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-26 05:54:24,064 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-26 05:54:24,066 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-26 05:54:24,067 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-26 05:54:24,068 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-26 05:54:24,069 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-26 05:54:24,072 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-26 05:54:24,073 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-26 05:54:24,075 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-26 05:54:24,075 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-26 05:54:24,077 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-26 05:54:24,077 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-26 05:54:24,077 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-26 05:54:24,082 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-26 05:54:24,084 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-26 05:54:24,085 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:54:24,136 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-26 05:54:24,137 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-26 05:54:24,141 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-26 05:54:24,142 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-26 05:54:24,142 INFO L138 SettingsManager]: * Use SBE=true [2020-10-26 05:54:24,143 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-26 05:54:24,143 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-26 05:54:24,143 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-26 05:54:24,144 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-26 05:54:24,144 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-26 05:54:24,145 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-26 05:54:24,146 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-26 05:54:24,146 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-26 05:54:24,146 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-26 05:54:24,147 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-26 05:54:24,147 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-26 05:54:24,147 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-26 05:54:24,147 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-26 05:54:24,148 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-26 05:54:24,148 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-26 05:54:24,148 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-26 05:54:24,148 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-26 05:54:24,149 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-26 05:54:24,149 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-26 05:54:24,149 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-26 05:54:24,149 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-26 05:54:24,150 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-26 05:54:24,150 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-26 05:54:24,150 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-26 05:54:24,151 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-26 05:54:24,151 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-26 05:54:24,151 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-26 05:54:24,153 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-26 05:54:24,153 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 -> 8c23cf037d507a0ee8791b9f31277b87b4e3943f [2020-10-26 05:54:24,570 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-26 05:54:24,617 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-26 05:54:24,620 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-26 05:54:24,623 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-26 05:54:24,627 INFO L275 PluginConnector]: CDTParser initialized [2020-10-26 05:54:24,628 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.5.1.ufo.BOUNDED-10.pals.c [2020-10-26 05:54:24,717 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/790f4f86f/e761b2f86afb47e5afa450ee2dafbcf7/FLAGab6d786bb [2020-10-26 05:54:25,463 INFO L306 CDTParser]: Found 1 translation units. [2020-10-26 05:54:25,463 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.5.1.ufo.BOUNDED-10.pals.c [2020-10-26 05:54:25,481 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/790f4f86f/e761b2f86afb47e5afa450ee2dafbcf7/FLAGab6d786bb [2020-10-26 05:54:25,794 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/790f4f86f/e761b2f86afb47e5afa450ee2dafbcf7 [2020-10-26 05:54:25,799 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-26 05:54:25,812 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-26 05:54:25,816 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-26 05:54:25,816 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-26 05:54:25,820 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-26 05:54:25,822 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 05:54:25" (1/1) ... [2020-10-26 05:54:25,825 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d89caf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:54:25, skipping insertion in model container [2020-10-26 05:54:25,826 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 05:54:25" (1/1) ... [2020-10-26 05:54:25,835 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-26 05:54:25,932 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-26 05:54:26,175 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 05:54:26,189 INFO L203 MainTranslator]: Completed pre-run [2020-10-26 05:54:26,247 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 05:54:26,270 INFO L208 MainTranslator]: Completed translation [2020-10-26 05:54:26,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:54:26 WrapperNode [2020-10-26 05:54:26,271 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-26 05:54:26,272 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-26 05:54:26,272 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-26 05:54:26,273 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-26 05:54:26,282 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:54:26" (1/1) ... [2020-10-26 05:54:26,295 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:54:26" (1/1) ... [2020-10-26 05:54:26,367 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-26 05:54:26,368 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-26 05:54:26,368 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-26 05:54:26,368 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-26 05:54:26,384 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:54:26" (1/1) ... [2020-10-26 05:54:26,384 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:54:26" (1/1) ... [2020-10-26 05:54:26,399 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:54:26" (1/1) ... [2020-10-26 05:54:26,400 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:54:26" (1/1) ... [2020-10-26 05:54:26,417 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:54:26" (1/1) ... [2020-10-26 05:54:26,436 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:54:26" (1/1) ... [2020-10-26 05:54:26,443 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:54:26" (1/1) ... [2020-10-26 05:54:26,452 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-26 05:54:26,456 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-26 05:54:26,456 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-26 05:54:26,457 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-26 05:54:26,461 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:54: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:54:26,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-26 05:54:26,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-26 05:54:26,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-26 05:54:26,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-26 05:54:27,419 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-26 05:54:27,420 INFO L298 CfgBuilder]: Removed 25 assume(true) statements. [2020-10-26 05:54:27,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 05:54:27 BoogieIcfgContainer [2020-10-26 05:54:27,422 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-26 05:54:27,423 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-26 05:54:27,424 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-26 05:54:27,428 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-26 05:54:27,429 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 05:54:27,429 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.10 05:54:25" (1/3) ... [2020-10-26 05:54:27,430 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@29c4b08c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 05:54:27, skipping insertion in model container [2020-10-26 05:54:27,430 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 05:54:27,431 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:54:26" (2/3) ... [2020-10-26 05:54:27,431 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@29c4b08c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 05:54:27, skipping insertion in model container [2020-10-26 05:54:27,431 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 05:54:27,431 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 05:54:27" (3/3) ... [2020-10-26 05:54:27,433 INFO L373 chiAutomizerObserver]: Analyzing ICFG pals_lcr.5.1.ufo.BOUNDED-10.pals.c [2020-10-26 05:54:27,491 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-26 05:54:27,491 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-26 05:54:27,492 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-26 05:54:27,492 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-26 05:54:27,492 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-26 05:54:27,492 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-26 05:54:27,492 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-26 05:54:27,492 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-26 05:54:27,511 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states. [2020-10-26 05:54:27,541 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 52 [2020-10-26 05:54:27,542 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:54:27,542 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:54:27,553 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-26 05:54:27,554 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, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 05:54:27,554 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-26 05:54:27,554 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states. [2020-10-26 05:54:27,562 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 52 [2020-10-26 05:54:27,562 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:54:27,562 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:54:27,564 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-26 05:54:27,565 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, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 05:54:27,574 INFO L794 eck$LassoCheckResult]: Stem: 35#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(35);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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; 11#L-1true havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~ret33, main_#t~ret34, main_#t~post35, 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;~id2~0 := main_#t~nondet17;havoc main_#t~nondet17;~st2~0 := main_#t~nondet18;havoc main_#t~nondet18;~send2~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode2~0 := main_#t~nondet20;havoc main_#t~nondet20;~id3~0 := main_#t~nondet21;havoc main_#t~nondet21;~st3~0 := main_#t~nondet22;havoc main_#t~nondet22;~send3~0 := main_#t~nondet23;havoc main_#t~nondet23;~mode3~0 := main_#t~nondet24;havoc main_#t~nondet24;~id4~0 := main_#t~nondet25;havoc main_#t~nondet25;~st4~0 := main_#t~nondet26;havoc main_#t~nondet26;~send4~0 := main_#t~nondet27;havoc main_#t~nondet27;~mode4~0 := main_#t~nondet28;havoc main_#t~nondet28;~id5~0 := main_#t~nondet29;havoc main_#t~nondet29;~st5~0 := main_#t~nondet30;havoc main_#t~nondet30;~send5~0 := main_#t~nondet31;havoc main_#t~nondet31;~mode5~0 := main_#t~nondet32;havoc main_#t~nondet32;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 86#L247true assume !(0 == ~r1~0);init_~tmp~0 := 0; 84#L247-1true init_#res := init_~tmp~0; 80#L372true main_#t~ret33 := init_#res;main_~i2~0 := main_#t~ret33;havoc main_#t~ret33;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 4#L69true assume !(0 == assume_abort_if_not_~cond); 93#L68true ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; 68#L444-2true [2020-10-26 05:54:27,576 INFO L796 eck$LassoCheckResult]: Loop: 68#L444-2true assume !!(main_~i2~0 < 10);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 61#L118true assume !(0 != ~mode1~0 % 256); 73#L134true assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite7 := ~send1~0; 94#L134-2true ~p1_new~0 := (if node1_#t~ite7 % 256 <= 127 then node1_#t~ite7 % 256 else node1_#t~ite7 % 256 - 256);havoc node1_#t~ite7;~mode1~0 := 1; 33#L118-2true havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 8#L146true assume !(0 != ~mode2~0 % 256); 81#L159true assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite8 := ~send2~0; 52#L159-2true ~p2_new~0 := (if node2_#t~ite8 % 256 <= 127 then node2_#t~ite8 % 256 else node2_#t~ite8 % 256 - 256);havoc node2_#t~ite8;~mode2~0 := 1; 5#L146-2true havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 16#L171true assume !(0 != ~mode3~0 % 256); 65#L184true assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite9 := ~send3~0; 62#L184-2true ~p3_new~0 := (if node3_#t~ite9 % 256 <= 127 then node3_#t~ite9 % 256 else node3_#t~ite9 % 256 - 256);havoc node3_#t~ite9;~mode3~0 := 1; 78#L171-2true havoc node4_#t~ite10, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 95#L196true assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 50#L199true assume !(node4_~m4~0 != ~nomsg~0); 49#L199-1true ~mode4~0 := 0; 88#L196-2true havoc node5_#t~ite11, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 53#L221true assume !(0 != ~mode5~0 % 256); 34#L234true assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite11 := ~send5~0; 10#L234-2true ~p5_new~0 := (if node5_#t~ite11 % 256 <= 127 then node5_#t~ite11 % 256 else node5_#t~ite11 % 256 - 256);havoc node5_#t~ite11;~mode5~0 := 1; 48#L221-2true ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 18#L380true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1 := 0; 20#L380-1true check_#res := check_~tmp~1; 66#L400true main_#t~ret34 := check_#res;main_~c1~0 := main_#t~ret34;havoc main_#t~ret34;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 92#L474true assume !(0 == assert_~arg % 256); 56#L469true main_#t~post35 := main_~i2~0;main_~i2~0 := 1 + main_#t~post35;havoc main_#t~post35; 68#L444-2true [2020-10-26 05:54:27,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:54:27,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1978587388, now seen corresponding path program 1 times [2020-10-26 05:54:27,599 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:54:27,599 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084751640] [2020-10-26 05:54:27,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:54:27,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:54:27,874 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:54:27,875 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084751640] [2020-10-26 05:54:27,876 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:54:27,876 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-26 05:54:27,882 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348758167] [2020-10-26 05:54:27,887 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 05:54:27,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:54:27,889 INFO L82 PathProgramCache]: Analyzing trace with hash -896220334, now seen corresponding path program 1 times [2020-10-26 05:54:27,889 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:54:27,889 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447376422] [2020-10-26 05:54:27,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:54:27,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:54:28,066 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:54:28,066 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447376422] [2020-10-26 05:54:28,067 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:54:28,067 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-26 05:54:28,067 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53392930] [2020-10-26 05:54:28,069 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 05:54:28,070 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 05:54:28,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 05:54:28,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-26 05:54:28,091 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 5 states. [2020-10-26 05:54:28,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 05:54:28,264 INFO L93 Difference]: Finished difference Result 95 states and 155 transitions. [2020-10-26 05:54:28,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 05:54:28,268 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 95 states and 155 transitions. [2020-10-26 05:54:28,274 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2020-10-26 05:54:28,290 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 95 states to 87 states and 117 transitions. [2020-10-26 05:54:28,292 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 87 [2020-10-26 05:54:28,293 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 87 [2020-10-26 05:54:28,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 117 transitions. [2020-10-26 05:54:28,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 05:54:28,295 INFO L691 BuchiCegarLoop]: Abstraction has 87 states and 117 transitions. [2020-10-26 05:54:28,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 117 transitions. [2020-10-26 05:54:28,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2020-10-26 05:54:28,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-10-26 05:54:28,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 117 transitions. [2020-10-26 05:54:28,389 INFO L714 BuchiCegarLoop]: Abstraction has 87 states and 117 transitions. [2020-10-26 05:54:28,389 INFO L594 BuchiCegarLoop]: Abstraction has 87 states and 117 transitions. [2020-10-26 05:54:28,389 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-26 05:54:28,389 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 87 states and 117 transitions. [2020-10-26 05:54:28,396 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2020-10-26 05:54:28,396 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:54:28,396 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:54:28,399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 05:54:28,399 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, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 05:54:28,400 INFO L794 eck$LassoCheckResult]: Stem: 258#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(35);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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; 224#L-1 havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~ret33, main_#t~ret34, main_#t~post35, 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;~id2~0 := main_#t~nondet17;havoc main_#t~nondet17;~st2~0 := main_#t~nondet18;havoc main_#t~nondet18;~send2~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode2~0 := main_#t~nondet20;havoc main_#t~nondet20;~id3~0 := main_#t~nondet21;havoc main_#t~nondet21;~st3~0 := main_#t~nondet22;havoc main_#t~nondet22;~send3~0 := main_#t~nondet23;havoc main_#t~nondet23;~mode3~0 := main_#t~nondet24;havoc main_#t~nondet24;~id4~0 := main_#t~nondet25;havoc main_#t~nondet25;~st4~0 := main_#t~nondet26;havoc main_#t~nondet26;~send4~0 := main_#t~nondet27;havoc main_#t~nondet27;~mode4~0 := main_#t~nondet28;havoc main_#t~nondet28;~id5~0 := main_#t~nondet29;havoc main_#t~nondet29;~st5~0 := main_#t~nondet30;havoc main_#t~nondet30;~send5~0 := main_#t~nondet31;havoc main_#t~nondet31;~mode5~0 := main_#t~nondet32;havoc main_#t~nondet32;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 225#L247 assume 0 == ~r1~0; 240#L248 assume ~id1~0 >= 0; 241#L249 assume 0 == ~st1~0; 261#L250 assume ~send1~0 == ~id1~0; 266#L251 assume 0 == ~mode1~0 % 256; 213#L252 assume ~id2~0 >= 0; 214#L253 assume 0 == ~st2~0; 251#L254 assume ~send2~0 == ~id2~0; 226#L255 assume 0 == ~mode2~0 % 256; 227#L256 assume ~id3~0 >= 0; 259#L257 assume 0 == ~st3~0; 285#L258 assume ~send3~0 == ~id3~0; 242#L259 assume 0 == ~mode3~0 % 256; 243#L260 assume ~id4~0 >= 0; 262#L261 assume 0 == ~st4~0; 267#L262 assume ~send4~0 == ~id4~0; 215#L263 assume 0 == ~mode4~0 % 256; 216#L264 assume ~id5~0 >= 0; 252#L265 assume 0 == ~st5~0; 228#L266 assume ~send5~0 == ~id5~0; 229#L267 assume 0 == ~mode5~0 % 256; 260#L268 assume ~id1~0 != ~id2~0; 286#L269 assume ~id1~0 != ~id3~0; 244#L270 assume ~id1~0 != ~id4~0; 245#L271 assume ~id1~0 != ~id5~0; 247#L272 assume ~id2~0 != ~id3~0; 268#L273 assume ~id2~0 != ~id4~0; 217#L274 assume ~id2~0 != ~id5~0; 218#L275 assume ~id3~0 != ~id4~0; 253#L276 assume ~id3~0 != ~id5~0; 230#L277 assume ~id4~0 != ~id5~0;init_~tmp~0 := 1; 231#L247-1 init_#res := init_~tmp~0; 292#L372 main_#t~ret33 := init_#res;main_~i2~0 := main_#t~ret33;havoc main_#t~ret33;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 209#L69 assume !(0 == assume_abort_if_not_~cond); 210#L68 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; 278#L444-2 [2020-10-26 05:54:28,400 INFO L796 eck$LassoCheckResult]: Loop: 278#L444-2 assume !!(main_~i2~0 < 10);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 281#L118 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 263#L122 assume !(node1_~m1~0 != ~nomsg~0); 264#L122-1 ~mode1~0 := 0; 256#L118-2 havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 219#L146 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 220#L149 assume !(node2_~m2~0 != ~nomsg~0); 232#L149-1 ~mode2~0 := 0; 211#L146-2 havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 212#L171 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 234#L174 assume !(node3_~m3~0 != ~nomsg~0); 207#L174-1 ~mode3~0 := 0; 284#L171-2 havoc node4_#t~ite10, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 291#L196 assume !(0 != ~mode4~0 % 256); 250#L209 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite10 := ~send4~0; 248#L209-2 ~p4_new~0 := (if node4_#t~ite10 % 256 <= 127 then node4_#t~ite10 % 256 else node4_#t~ite10 % 256 - 256);havoc node4_#t~ite10;~mode4~0 := 1; 249#L196-2 havoc node5_#t~ite11, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 274#L221 assume !(0 != ~mode5~0 % 256); 257#L234 assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite11 := ~send5~0; 222#L234-2 ~p5_new~0 := (if node5_#t~ite11 % 256 <= 127 then node5_#t~ite11 % 256 else node5_#t~ite11 % 256 - 256);havoc node5_#t~ite11;~mode5~0 := 1; 223#L221-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 236#L380 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1 := 0; 237#L380-1 check_#res := check_~tmp~1; 239#L400 main_#t~ret34 := check_#res;main_~c1~0 := main_#t~ret34;havoc main_#t~ret34;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 287#L474 assume !(0 == assert_~arg % 256); 277#L469 main_#t~post35 := main_~i2~0;main_~i2~0 := 1 + main_#t~post35;havoc main_#t~post35; 278#L444-2 [2020-10-26 05:54:28,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:54:28,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1992034189, now seen corresponding path program 1 times [2020-10-26 05:54:28,401 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:54:28,402 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264464666] [2020-10-26 05:54:28,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:54:28,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:54:28,451 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:54:28,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:54:28,507 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:54:28,557 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 05:54:28,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:54:28,558 INFO L82 PathProgramCache]: Analyzing trace with hash -573496218, now seen corresponding path program 1 times [2020-10-26 05:54:28,558 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:54:28,558 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073299842] [2020-10-26 05:54:28,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:54:28,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:54:28,724 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:54:28,724 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073299842] [2020-10-26 05:54:28,724 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:54:28,724 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-26 05:54:28,725 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931310163] [2020-10-26 05:54:28,725 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 05:54:28,726 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 05:54:28,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 05:54:28,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-26 05:54:28,727 INFO L87 Difference]: Start difference. First operand 87 states and 117 transitions. cyclomatic complexity: 31 Second operand 5 states. [2020-10-26 05:54:28,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 05:54:28,852 INFO L93 Difference]: Finished difference Result 90 states and 119 transitions. [2020-10-26 05:54:28,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 05:54:28,856 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 119 transitions. [2020-10-26 05:54:28,862 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2020-10-26 05:54:28,869 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 87 states and 114 transitions. [2020-10-26 05:54:28,869 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 87 [2020-10-26 05:54:28,870 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 87 [2020-10-26 05:54:28,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 114 transitions. [2020-10-26 05:54:28,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 05:54:28,873 INFO L691 BuchiCegarLoop]: Abstraction has 87 states and 114 transitions. [2020-10-26 05:54:28,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 114 transitions. [2020-10-26 05:54:28,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2020-10-26 05:54:28,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-10-26 05:54:28,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 114 transitions. [2020-10-26 05:54:28,890 INFO L714 BuchiCegarLoop]: Abstraction has 87 states and 114 transitions. [2020-10-26 05:54:28,890 INFO L594 BuchiCegarLoop]: Abstraction has 87 states and 114 transitions. [2020-10-26 05:54:28,890 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-26 05:54:28,890 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 87 states and 114 transitions. [2020-10-26 05:54:28,893 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2020-10-26 05:54:28,893 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:54:28,893 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:54:28,899 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 05:54:28,903 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 05:54:28,903 INFO L794 eck$LassoCheckResult]: Stem: 447#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(35);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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; 413#L-1 havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~ret33, main_#t~ret34, main_#t~post35, 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;~id2~0 := main_#t~nondet17;havoc main_#t~nondet17;~st2~0 := main_#t~nondet18;havoc main_#t~nondet18;~send2~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode2~0 := main_#t~nondet20;havoc main_#t~nondet20;~id3~0 := main_#t~nondet21;havoc main_#t~nondet21;~st3~0 := main_#t~nondet22;havoc main_#t~nondet22;~send3~0 := main_#t~nondet23;havoc main_#t~nondet23;~mode3~0 := main_#t~nondet24;havoc main_#t~nondet24;~id4~0 := main_#t~nondet25;havoc main_#t~nondet25;~st4~0 := main_#t~nondet26;havoc main_#t~nondet26;~send4~0 := main_#t~nondet27;havoc main_#t~nondet27;~mode4~0 := main_#t~nondet28;havoc main_#t~nondet28;~id5~0 := main_#t~nondet29;havoc main_#t~nondet29;~st5~0 := main_#t~nondet30;havoc main_#t~nondet30;~send5~0 := main_#t~nondet31;havoc main_#t~nondet31;~mode5~0 := main_#t~nondet32;havoc main_#t~nondet32;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 414#L247 assume 0 == ~r1~0; 429#L248 assume ~id1~0 >= 0; 430#L249 assume 0 == ~st1~0; 450#L250 assume ~send1~0 == ~id1~0; 452#L251 assume 0 == ~mode1~0 % 256; 402#L252 assume ~id2~0 >= 0; 403#L253 assume 0 == ~st2~0; 440#L254 assume ~send2~0 == ~id2~0; 415#L255 assume 0 == ~mode2~0 % 256; 416#L256 assume ~id3~0 >= 0; 448#L257 assume 0 == ~st3~0; 474#L258 assume ~send3~0 == ~id3~0; 431#L259 assume 0 == ~mode3~0 % 256; 432#L260 assume ~id4~0 >= 0; 451#L261 assume 0 == ~st4~0; 456#L262 assume ~send4~0 == ~id4~0; 404#L263 assume 0 == ~mode4~0 % 256; 405#L264 assume ~id5~0 >= 0; 441#L265 assume 0 == ~st5~0; 417#L266 assume ~send5~0 == ~id5~0; 418#L267 assume 0 == ~mode5~0 % 256; 449#L268 assume ~id1~0 != ~id2~0; 475#L269 assume ~id1~0 != ~id3~0; 433#L270 assume ~id1~0 != ~id4~0; 434#L271 assume ~id1~0 != ~id5~0; 436#L272 assume ~id2~0 != ~id3~0; 457#L273 assume ~id2~0 != ~id4~0; 406#L274 assume ~id2~0 != ~id5~0; 407#L275 assume ~id3~0 != ~id4~0; 444#L276 assume ~id3~0 != ~id5~0; 419#L277 assume ~id4~0 != ~id5~0;init_~tmp~0 := 1; 420#L247-1 init_#res := init_~tmp~0; 481#L372 main_#t~ret33 := init_#res;main_~i2~0 := main_#t~ret33;havoc main_#t~ret33;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 398#L69 assume !(0 == assume_abort_if_not_~cond); 399#L68 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; 466#L444-2 [2020-10-26 05:54:28,904 INFO L796 eck$LassoCheckResult]: Loop: 466#L444-2 assume !!(main_~i2~0 < 10);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 470#L118 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 453#L122 assume !(node1_~m1~0 != ~nomsg~0); 454#L122-1 ~mode1~0 := 0; 445#L118-2 havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 408#L146 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 409#L149 assume !(node2_~m2~0 != ~nomsg~0); 421#L149-1 ~mode2~0 := 0; 400#L146-2 havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 401#L171 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 423#L174 assume !(node3_~m3~0 != ~nomsg~0); 396#L174-1 ~mode3~0 := 0; 473#L171-2 havoc node4_#t~ite10, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 480#L196 assume !(0 != ~mode4~0 % 256); 439#L209 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite10 := ~send4~0; 437#L209-2 ~p4_new~0 := (if node4_#t~ite10 % 256 <= 127 then node4_#t~ite10 % 256 else node4_#t~ite10 % 256 - 256);havoc node4_#t~ite10;~mode4~0 := 1; 438#L196-2 havoc node5_#t~ite11, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 463#L221 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 464#L224 assume !(node5_~m5~0 != ~nomsg~0); 468#L224-1 ~mode5~0 := 0; 412#L221-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 425#L380 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; 426#L381 assume ~r1~0 >= 5; 443#L385 assume ~r1~0 < 5;check_~tmp~1 := 1; 427#L380-1 check_#res := check_~tmp~1; 428#L400 main_#t~ret34 := check_#res;main_~c1~0 := main_#t~ret34;havoc main_#t~ret34;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 476#L474 assume !(0 == assert_~arg % 256); 465#L469 main_#t~post35 := main_~i2~0;main_~i2~0 := 1 + main_#t~post35;havoc main_#t~post35; 466#L444-2 [2020-10-26 05:54:28,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:54:28,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1992034189, now seen corresponding path program 2 times [2020-10-26 05:54:28,905 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:54:28,905 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532024160] [2020-10-26 05:54:28,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:54:28,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:54:28,976 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:54:29,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:54:29,005 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:54:29,023 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 05:54:29,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:54:29,025 INFO L82 PathProgramCache]: Analyzing trace with hash -747827360, now seen corresponding path program 1 times [2020-10-26 05:54:29,025 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:54:29,025 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227976027] [2020-10-26 05:54:29,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:54:29,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:54:29,069 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:54:29,070 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227976027] [2020-10-26 05:54:29,070 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:54:29,070 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 05:54:29,071 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023121361] [2020-10-26 05:54:29,071 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 05:54:29,072 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 05:54:29,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 05:54:29,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 05:54:29,073 INFO L87 Difference]: Start difference. First operand 87 states and 114 transitions. cyclomatic complexity: 28 Second operand 3 states. [2020-10-26 05:54:29,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 05:54:29,144 INFO L93 Difference]: Finished difference Result 131 states and 180 transitions. [2020-10-26 05:54:29,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 05:54:29,145 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 131 states and 180 transitions. [2020-10-26 05:54:29,154 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2020-10-26 05:54:29,156 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 131 states to 131 states and 180 transitions. [2020-10-26 05:54:29,157 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 131 [2020-10-26 05:54:29,159 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 131 [2020-10-26 05:54:29,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 131 states and 180 transitions. [2020-10-26 05:54:29,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 05:54:29,161 INFO L691 BuchiCegarLoop]: Abstraction has 131 states and 180 transitions. [2020-10-26 05:54:29,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states and 180 transitions. [2020-10-26 05:54:29,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2020-10-26 05:54:29,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2020-10-26 05:54:29,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 180 transitions. [2020-10-26 05:54:29,181 INFO L714 BuchiCegarLoop]: Abstraction has 131 states and 180 transitions. [2020-10-26 05:54:29,182 INFO L594 BuchiCegarLoop]: Abstraction has 131 states and 180 transitions. [2020-10-26 05:54:29,182 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-26 05:54:29,185 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 131 states and 180 transitions. [2020-10-26 05:54:29,187 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2020-10-26 05:54:29,188 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:54:29,188 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:54:29,190 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 05:54:29,190 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 05:54:29,193 INFO L794 eck$LassoCheckResult]: Stem: 671#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(35);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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; 637#L-1 havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~ret33, main_#t~ret34, main_#t~post35, 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;~id2~0 := main_#t~nondet17;havoc main_#t~nondet17;~st2~0 := main_#t~nondet18;havoc main_#t~nondet18;~send2~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode2~0 := main_#t~nondet20;havoc main_#t~nondet20;~id3~0 := main_#t~nondet21;havoc main_#t~nondet21;~st3~0 := main_#t~nondet22;havoc main_#t~nondet22;~send3~0 := main_#t~nondet23;havoc main_#t~nondet23;~mode3~0 := main_#t~nondet24;havoc main_#t~nondet24;~id4~0 := main_#t~nondet25;havoc main_#t~nondet25;~st4~0 := main_#t~nondet26;havoc main_#t~nondet26;~send4~0 := main_#t~nondet27;havoc main_#t~nondet27;~mode4~0 := main_#t~nondet28;havoc main_#t~nondet28;~id5~0 := main_#t~nondet29;havoc main_#t~nondet29;~st5~0 := main_#t~nondet30;havoc main_#t~nondet30;~send5~0 := main_#t~nondet31;havoc main_#t~nondet31;~mode5~0 := main_#t~nondet32;havoc main_#t~nondet32;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 638#L247 assume 0 == ~r1~0; 653#L248 assume ~id1~0 >= 0; 654#L249 assume 0 == ~st1~0; 675#L250 assume ~send1~0 == ~id1~0; 680#L251 assume 0 == ~mode1~0 % 256; 626#L252 assume ~id2~0 >= 0; 627#L253 assume 0 == ~st2~0; 664#L254 assume ~send2~0 == ~id2~0; 639#L255 assume 0 == ~mode2~0 % 256; 640#L256 assume ~id3~0 >= 0; 672#L257 assume 0 == ~st3~0; 699#L258 assume ~send3~0 == ~id3~0; 655#L259 assume 0 == ~mode3~0 % 256; 656#L260 assume ~id4~0 >= 0; 676#L261 assume 0 == ~st4~0; 681#L262 assume ~send4~0 == ~id4~0; 628#L263 assume 0 == ~mode4~0 % 256; 629#L264 assume ~id5~0 >= 0; 665#L265 assume 0 == ~st5~0; 641#L266 assume ~send5~0 == ~id5~0; 642#L267 assume 0 == ~mode5~0 % 256; 673#L268 assume ~id1~0 != ~id2~0; 700#L269 assume ~id1~0 != ~id3~0; 657#L270 assume ~id1~0 != ~id4~0; 658#L271 assume ~id1~0 != ~id5~0; 660#L272 assume ~id2~0 != ~id3~0; 682#L273 assume ~id2~0 != ~id4~0; 630#L274 assume ~id2~0 != ~id5~0; 631#L275 assume ~id3~0 != ~id4~0; 666#L276 assume ~id3~0 != ~id5~0; 643#L277 assume ~id4~0 != ~id5~0;init_~tmp~0 := 1; 644#L247-1 init_#res := init_~tmp~0; 707#L372 main_#t~ret33 := init_#res;main_~i2~0 := main_#t~ret33;havoc main_#t~ret33;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 622#L69 assume !(0 == assume_abort_if_not_~cond); 623#L68 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; 708#L444-2 [2020-10-26 05:54:29,194 INFO L796 eck$LassoCheckResult]: Loop: 708#L444-2 assume !!(main_~i2~0 < 10);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 745#L118 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 677#L122 assume !(node1_~m1~0 != ~nomsg~0); 678#L122-1 ~mode1~0 := 0; 702#L118-2 havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 742#L146 assume !(0 != ~mode2~0 % 256); 738#L159 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite8 := ~send2~0; 737#L159-2 ~p2_new~0 := (if node2_#t~ite8 % 256 <= 127 then node2_#t~ite8 % 256 else node2_#t~ite8 % 256 - 256);havoc node2_#t~ite8;~mode2~0 := 1; 735#L146-2 havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 734#L171 assume !(0 != ~mode3~0 % 256); 730#L184 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite9 := ~send3~0; 729#L184-2 ~p3_new~0 := (if node3_#t~ite9 % 256 <= 127 then node3_#t~ite9 % 256 else node3_#t~ite9 % 256 - 256);havoc node3_#t~ite9;~mode3~0 := 1; 727#L171-2 havoc node4_#t~ite10, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 726#L196 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 723#L199 assume !(node4_~m4~0 != ~nomsg~0); 721#L199-1 ~mode4~0 := 0; 719#L196-2 havoc node5_#t~ite11, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 718#L221 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 715#L224 assume !(node5_~m5~0 != ~nomsg~0); 713#L224-1 ~mode5~0 := 0; 711#L221-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 710#L380 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; 709#L381 assume !(~r1~0 >= 5); 667#L384 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; 668#L385 assume ~r1~0 < 5;check_~tmp~1 := 1; 749#L380-1 check_#res := check_~tmp~1; 748#L400 main_#t~ret34 := check_#res;main_~c1~0 := main_#t~ret34;havoc main_#t~ret34;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 747#L474 assume !(0 == assert_~arg % 256); 746#L469 main_#t~post35 := main_~i2~0;main_~i2~0 := 1 + main_#t~post35;havoc main_#t~post35; 708#L444-2 [2020-10-26 05:54:29,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:54:29,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1992034189, now seen corresponding path program 3 times [2020-10-26 05:54:29,195 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:54:29,196 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929682310] [2020-10-26 05:54:29,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:54:29,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:54:29,239 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:54:29,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:54:29,266 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:54:29,282 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 05:54:29,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:54:29,283 INFO L82 PathProgramCache]: Analyzing trace with hash 180648891, now seen corresponding path program 1 times [2020-10-26 05:54:29,284 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:54:29,284 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182946887] [2020-10-26 05:54:29,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:54:29,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:54:29,311 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:54:29,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:54:29,341 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:54:29,356 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 05:54:29,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:54:29,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1618481015, now seen corresponding path program 1 times [2020-10-26 05:54:29,358 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:54:29,358 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626401435] [2020-10-26 05:54:29,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:54:29,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:54:29,443 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:54:29,443 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626401435] [2020-10-26 05:54:29,444 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:54:29,444 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 05:54:29,444 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104473765] [2020-10-26 05:54:30,361 WARN L193 SmtUtils]: Spent 909.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 148 [2020-10-26 05:54:31,197 WARN L193 SmtUtils]: Spent 808.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 137 [2020-10-26 05:54:31,211 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 05:54:31,212 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 05:54:31,212 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 05:54:31,212 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 05:54:31,212 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-26 05:54:31,213 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:54:31,213 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 05:54:31,213 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 05:54:31,213 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.5.1.ufo.BOUNDED-10.pals.c_Iteration4_Loop [2020-10-26 05:54:31,214 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 05:54:31,214 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 05:54:31,243 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:54:31,262 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:54:31,267 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:54:31,272 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:54:31,277 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:54:31,281 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:54:31,286 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:54:31,315 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:54:31,334 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:54:31,340 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:54:31,344 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:54:31,349 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:54:31,363 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:54:31,374 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:54:31,380 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:54:31,390 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:54:31,396 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:54:31,408 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:54:31,424 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:54:31,442 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:54:31,449 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:54:31,458 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:54:31,466 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:54:31,476 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:54:31,859 WARN L193 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2020-10-26 05:54:31,863 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:54:31,880 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:54:31,888 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:54:31,895 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:54:32,868 WARN L193 SmtUtils]: Spent 463.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2020-10-26 05:54:32,960 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-10-26 05:54:33,148 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 27 [2020-10-26 05:54:46,781 WARN L193 SmtUtils]: Spent 13.44 s on a formula simplification. DAG size of input: 169 DAG size of output: 121 [2020-10-26 05:54:46,900 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 05:54:46,901 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:54:46,909 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-26 05:54:46,910 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:54:46,942 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-26 05:54:46,942 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-26 05:54:47,068 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-26 05:54:47,072 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 05:54:47,072 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 05:54:47,072 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 05:54:47,072 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 05:54:47,072 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 05:54:47,072 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:54:47,072 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 05:54:47,072 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 05:54:47,072 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.5.1.ufo.BOUNDED-10.pals.c_Iteration4_Loop [2020-10-26 05:54:47,073 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 05:54:47,073 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 05:54:47,087 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:54:47,110 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:54:47,116 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:54:47,121 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:54:47,129 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:54:47,133 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:54:47,137 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:54:47,167 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:54:47,173 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:54:47,184 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:54:47,189 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:54:47,196 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:54:47,207 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:54:47,213 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:54:47,219 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:54:47,231 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:54:47,243 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:54:47,250 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:54:47,254 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:54:47,260 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:54:47,274 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:54:47,281 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:54:47,286 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:54:47,303 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:54:47,314 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:54:47,703 WARN L193 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2020-10-26 05:54:47,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:54:47,711 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:54:47,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:54:48,664 WARN L193 SmtUtils]: Spent 428.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2020-10-26 05:54:48,690 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-10-26 05:54:48,869 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 27 [2020-10-26 05:55:03,591 WARN L193 SmtUtils]: Spent 14.51 s on a formula simplification. DAG size of input: 169 DAG size of output: 121 [2020-10-26 05:55:03,640 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 05:55:03,646 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:55:03,651 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:55:03,654 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:55:03,654 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 05:55:03,655 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:55:03,656 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 05:55:03,656 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:55:03,662 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 05:55:03,662 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 05:55:03,666 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. 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) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:55:03,691 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:55:03,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:55:03,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:55:03,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 05:55:03,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:55:03,699 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 05:55:03,700 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 05:55:03,705 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:55:03,731 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:55:03,733 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:55:03,733 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 05:55:03,733 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:55:03,733 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 05:55:03,733 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:55:03,734 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 05:55:03,734 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 05:55:03,742 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:55:03,768 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:55:03,770 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:55:03,771 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 05:55:03,771 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:55:03,771 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 05:55:03,771 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:55:03,772 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 05:55:03,772 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 05:55:03,775 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:55:03,802 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:55:03,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:55:03,806 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 05:55:03,806 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:55:03,806 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 05:55:03,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:55:03,807 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 05:55:03,807 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 05:55:03,808 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:55:03,835 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:55:03,837 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:55:03,838 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 05:55:03,838 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:55:03,838 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 05:55:03,838 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:55:03,839 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 05:55:03,839 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 05:55:03,841 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:55:03,867 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:55:03,869 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:55:03,869 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 05:55:03,869 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:55:03,870 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-26 05:55:03,870 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:55:03,878 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-10-26 05:55:03,878 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 05:55:03,884 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:55:03,913 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:55:03,915 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:55:03,915 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:55:03,915 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 05:55:03,915 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:55:03,923 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 05:55:03,923 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 05:55:03,927 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:55:03,950 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:55:03,952 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:55:03,952 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 05:55:03,952 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:55:03,952 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 05:55:03,952 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:55:03,955 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 05:55:03,955 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 05:55:03,957 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:55:03,980 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:55:03,981 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:55:03,982 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:55:03,982 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 05:55:03,982 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:55:03,984 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 05:55:03,984 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 05:55:03,988 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:55:04,012 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:55:04,014 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:55:04,014 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 05:55:04,014 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:55:04,014 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 05:55:04,014 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:55:04,015 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 05:55:04,015 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 05:55:04,017 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:55:04,040 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:55:04,042 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:55:04,042 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 05:55:04,042 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:55:04,042 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 05:55:04,042 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:55:04,044 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 05:55:04,045 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 05:55:04,048 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:55:04,074 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:55:04,076 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:55:04,076 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:55:04,076 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 05:55:04,076 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:55:04,079 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 05:55:04,079 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 05:55:04,082 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:55:04,107 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:55:04,109 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:55:04,109 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:55:04,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 05:55:04,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:55:04,112 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 05:55:04,112 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 05:55:04,118 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:55:04,144 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:55:04,146 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:55:04,146 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 05:55:04,147 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:55:04,147 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 05:55:04,147 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:55:04,148 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 05:55:04,148 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 05:55:04,158 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:55:04,182 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:55:04,184 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 05:55:04,184 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 05:55:04,184 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 05:55:04,184 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 05:55:04,184 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 05:55:04,186 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 05:55:04,186 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 05:55:04,190 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 05:55:04,203 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-26 05:55:04,203 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 05:55:04,215 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-26 05:55:04,215 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-26 05:55:04,215 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 05:55:04,216 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 19 Supporting invariants [] Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 05:55:04,248 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-26 05:55:04,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:55:04,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:55:04,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-26 05:55:04,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 05:55:04,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:55:04,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-26 05:55:04,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 05:55:04,533 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:55:04,540 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:55:04,541 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 131 states and 180 transitions. cyclomatic complexity: 50 Second operand 3 states. [2020-10-26 05:55:04,623 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 131 states and 180 transitions. cyclomatic complexity: 50. Second operand 3 states. Result 224 states and 323 transitions. Complement of second has 4 states. [2020-10-26 05:55:04,624 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:55:04,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-26 05:55:04,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2020-10-26 05:55:04,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 114 transitions. Stem has 37 letters. Loop has 29 letters. [2020-10-26 05:55:04,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 05:55:04,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 114 transitions. Stem has 66 letters. Loop has 29 letters. [2020-10-26 05:55:04,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 05:55:04,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 114 transitions. Stem has 37 letters. Loop has 58 letters. [2020-10-26 05:55:04,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 05:55:04,632 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 224 states and 323 transitions. [2020-10-26 05:55:04,635 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-26 05:55:04,635 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 224 states to 0 states and 0 transitions. [2020-10-26 05:55:04,635 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-26 05:55:04,635 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-26 05:55:04,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-26 05:55:04,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 05:55:04,635 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 05:55:04,636 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 05:55:04,636 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 05:55:04,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 05:55:04,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 05:55:04,637 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2020-10-26 05:55:04,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 05:55:04,637 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-10-26 05:55:04,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-26 05:55:04,637 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2020-10-26 05:55:04,637 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-26 05:55:04,637 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2020-10-26 05:55:04,638 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-26 05:55:04,638 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-26 05:55:04,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-26 05:55:04,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 05:55:04,638 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 05:55:04,638 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 05:55:04,638 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 05:55:04,638 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-26 05:55:04,638 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-26 05:55:04,638 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-26 05:55:04,639 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-26 05:55:04,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.10 05:55:04 BoogieIcfgContainer [2020-10-26 05:55:04,645 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-26 05:55:04,646 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-26 05:55:04,646 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-26 05:55:04,646 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-26 05:55:04,647 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 05:54:27" (3/4) ... [2020-10-26 05:55:04,650 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-26 05:55:04,651 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-26 05:55:04,652 INFO L168 Benchmark]: Toolchain (without parser) took 38848.79 ms. Allocated memory was 41.9 MB in the beginning and 88.1 MB in the end (delta: 46.1 MB). Free memory was 18.3 MB in the beginning and 31.6 MB in the end (delta: -13.4 MB). Peak memory consumption was 36.0 MB. Max. memory is 16.1 GB. [2020-10-26 05:55:04,653 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 41.9 MB. Free memory was 20.0 MB in the beginning and 19.9 MB in the end (delta: 63.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 05:55:04,654 INFO L168 Benchmark]: CACSL2BoogieTranslator took 455.57 ms. Allocated memory was 41.9 MB in the beginning and 50.3 MB in the end (delta: 8.4 MB). Free memory was 17.7 MB in the beginning and 22.8 MB in the end (delta: -5.2 MB). Peak memory consumption was 3.5 MB. Max. memory is 16.1 GB. [2020-10-26 05:55:04,655 INFO L168 Benchmark]: Boogie Procedure Inliner took 94.93 ms. Allocated memory is still 50.3 MB. Free memory was 22.8 MB in the beginning and 33.7 MB in the end (delta: -10.9 MB). Peak memory consumption was 5.5 MB. Max. memory is 16.1 GB. [2020-10-26 05:55:04,655 INFO L168 Benchmark]: Boogie Preprocessor took 87.21 ms. Allocated memory is still 50.3 MB. Free memory was 33.7 MB in the beginning and 31.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-26 05:55:04,656 INFO L168 Benchmark]: RCFGBuilder took 966.17 ms. Allocated memory was 50.3 MB in the beginning and 60.8 MB in the end (delta: 10.5 MB). Free memory was 31.8 MB in the beginning and 41.3 MB in the end (delta: -9.5 MB). Peak memory consumption was 14.6 MB. Max. memory is 16.1 GB. [2020-10-26 05:55:04,657 INFO L168 Benchmark]: BuchiAutomizer took 37221.86 ms. Allocated memory was 60.8 MB in the beginning and 88.1 MB in the end (delta: 27.3 MB). Free memory was 41.0 MB in the beginning and 32.4 MB in the end (delta: 8.6 MB). Peak memory consumption was 35.5 MB. Max. memory is 16.1 GB. [2020-10-26 05:55:04,657 INFO L168 Benchmark]: Witness Printer took 4.77 ms. Allocated memory is still 88.1 MB. Free memory is still 31.6 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 05:55:04,662 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.33 ms. Allocated memory is still 41.9 MB. Free memory was 20.0 MB in the beginning and 19.9 MB in the end (delta: 63.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 455.57 ms. Allocated memory was 41.9 MB in the beginning and 50.3 MB in the end (delta: 8.4 MB). Free memory was 17.7 MB in the beginning and 22.8 MB in the end (delta: -5.2 MB). Peak memory consumption was 3.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 94.93 ms. Allocated memory is still 50.3 MB. Free memory was 22.8 MB in the beginning and 33.7 MB in the end (delta: -10.9 MB). Peak memory consumption was 5.5 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 87.21 ms. Allocated memory is still 50.3 MB. Free memory was 33.7 MB in the beginning and 31.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 966.17 ms. Allocated memory was 50.3 MB in the beginning and 60.8 MB in the end (delta: 10.5 MB). Free memory was 31.8 MB in the beginning and 41.3 MB in the end (delta: -9.5 MB). Peak memory consumption was 14.6 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 37221.86 ms. Allocated memory was 60.8 MB in the beginning and 88.1 MB in the end (delta: 27.3 MB). Free memory was 41.0 MB in the beginning and 32.4 MB in the end (delta: 8.6 MB). Peak memory consumption was 35.5 MB. Max. memory is 16.1 GB. * Witness Printer took 4.77 ms. Allocated memory is still 88.1 MB. Free memory is still 31.6 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 + 19 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 37.1s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 36.0s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 131 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 550 SDtfs, 258 SDslu, 937 SDs, 0 SdLazy, 36 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital220 mio100 ax127 hnf105 lsp54 ukn69 mio100 lsp100 div155 bol100 ite100 ukn100 eq175 hnf71 smp100 dnf5255 smp24 tf100 neg98 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 18ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...