./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loops/insertion_sort-1.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/loops/insertion_sort-1.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 25b1595a40c04d1f29f2431a3990f69b3ca92105 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 04:46:39,167 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-26 04:46:39,172 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-26 04:46:39,233 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-26 04:46:39,233 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-26 04:46:39,239 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-26 04:46:39,242 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-26 04:46:39,250 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-26 04:46:39,258 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-26 04:46:39,264 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-26 04:46:39,267 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-26 04:46:39,268 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-26 04:46:39,269 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-26 04:46:39,273 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-26 04:46:39,274 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-26 04:46:39,276 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-26 04:46:39,277 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-26 04:46:39,281 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-26 04:46:39,285 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-26 04:46:39,304 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-26 04:46:39,306 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-26 04:46:39,308 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-26 04:46:39,311 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-26 04:46:39,312 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-26 04:46:39,322 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-26 04:46:39,322 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-26 04:46:39,323 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-26 04:46:39,325 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-26 04:46:39,326 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-26 04:46:39,327 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-26 04:46:39,327 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-26 04:46:39,328 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-26 04:46:39,330 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-26 04:46:39,331 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-26 04:46:39,333 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-26 04:46:39,333 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-26 04:46:39,334 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-26 04:46:39,334 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-26 04:46:39,334 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-26 04:46:39,336 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-26 04:46:39,337 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-26 04:46:39,338 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-26 04:46:39,392 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-26 04:46:39,393 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-26 04:46:39,396 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-26 04:46:39,397 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-26 04:46:39,397 INFO L138 SettingsManager]: * Use SBE=true [2020-10-26 04:46:39,397 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-26 04:46:39,397 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-26 04:46:39,398 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-26 04:46:39,398 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-26 04:46:39,398 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-26 04:46:39,399 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-26 04:46:39,400 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-26 04:46:39,400 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-26 04:46:39,400 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-26 04:46:39,400 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-26 04:46:39,400 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-26 04:46:39,400 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-26 04:46:39,401 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-26 04:46:39,401 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-26 04:46:39,401 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-26 04:46:39,401 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-26 04:46:39,401 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-26 04:46:39,402 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-26 04:46:39,402 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-26 04:46:39,402 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-26 04:46:39,402 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-26 04:46:39,402 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-26 04:46:39,402 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-26 04:46:39,403 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-26 04:46:39,403 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-26 04:46:39,403 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-26 04:46:39,403 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-26 04:46:39,405 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-26 04:46:39,405 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 -> 25b1595a40c04d1f29f2431a3990f69b3ca92105 [2020-10-26 04:46:39,842 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-26 04:46:39,870 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-26 04:46:39,873 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-26 04:46:39,874 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-26 04:46:39,880 INFO L275 PluginConnector]: CDTParser initialized [2020-10-26 04:46:39,881 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/insertion_sort-1.c [2020-10-26 04:46:39,977 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41492b211/b9fcced998cd4744aab3592aa738e35a/FLAG7255e0b17 [2020-10-26 04:46:40,571 INFO L306 CDTParser]: Found 1 translation units. [2020-10-26 04:46:40,573 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/insertion_sort-1.c [2020-10-26 04:46:40,582 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41492b211/b9fcced998cd4744aab3592aa738e35a/FLAG7255e0b17 [2020-10-26 04:46:40,915 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41492b211/b9fcced998cd4744aab3592aa738e35a [2020-10-26 04:46:40,918 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-26 04:46:40,926 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-26 04:46:40,931 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-26 04:46:40,931 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-26 04:46:40,935 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-26 04:46:40,937 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 04:46:40" (1/1) ... [2020-10-26 04:46:40,940 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4976ebc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:46:40, skipping insertion in model container [2020-10-26 04:46:40,941 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 04:46:40" (1/1) ... [2020-10-26 04:46:40,950 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-26 04:46:40,972 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-26 04:46:41,196 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 04:46:41,212 INFO L203 MainTranslator]: Completed pre-run [2020-10-26 04:46:41,240 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 04:46:41,257 INFO L208 MainTranslator]: Completed translation [2020-10-26 04:46:41,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:46:41 WrapperNode [2020-10-26 04:46:41,258 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-26 04:46:41,260 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-26 04:46:41,260 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-26 04:46:41,260 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-26 04:46:41,269 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:46:41" (1/1) ... [2020-10-26 04:46:41,279 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:46:41" (1/1) ... [2020-10-26 04:46:41,303 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-26 04:46:41,304 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-26 04:46:41,304 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-26 04:46:41,304 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-26 04:46:41,314 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:46:41" (1/1) ... [2020-10-26 04:46:41,315 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:46:41" (1/1) ... [2020-10-26 04:46:41,317 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:46:41" (1/1) ... [2020-10-26 04:46:41,318 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:46:41" (1/1) ... [2020-10-26 04:46:41,325 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:46:41" (1/1) ... [2020-10-26 04:46:41,330 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:46:41" (1/1) ... [2020-10-26 04:46:41,332 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:46:41" (1/1) ... [2020-10-26 04:46:41,335 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-26 04:46:41,336 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-26 04:46:41,336 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-26 04:46:41,336 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-26 04:46:41,340 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:46:41" (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 04:46:41,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-26 04:46:41,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-26 04:46:41,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-26 04:46:41,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-26 04:46:41,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-26 04:46:41,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-26 04:46:41,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-26 04:46:41,958 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-26 04:46:41,959 INFO L298 CfgBuilder]: Removed 12 assume(true) statements. [2020-10-26 04:46:41,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 04:46:41 BoogieIcfgContainer [2020-10-26 04:46:41,960 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-26 04:46:41,962 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-26 04:46:41,962 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-26 04:46:41,966 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-26 04:46:41,967 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 04:46:41,967 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.10 04:46:40" (1/3) ... [2020-10-26 04:46:41,968 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@9839f2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 04:46:41, skipping insertion in model container [2020-10-26 04:46:41,969 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 04:46:41,969 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:46:41" (2/3) ... [2020-10-26 04:46:41,969 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@9839f2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 04:46:41, skipping insertion in model container [2020-10-26 04:46:41,969 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 04:46:41,969 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 04:46:41" (3/3) ... [2020-10-26 04:46:41,971 INFO L373 chiAutomizerObserver]: Analyzing ICFG insertion_sort-1.c [2020-10-26 04:46:42,021 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-26 04:46:42,021 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-26 04:46:42,021 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-26 04:46:42,021 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-26 04:46:42,021 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-26 04:46:42,021 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-26 04:46:42,022 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-26 04:46:42,022 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-26 04:46:42,034 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2020-10-26 04:46:42,052 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2020-10-26 04:46:42,053 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:46:42,053 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:46:42,059 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-26 04:46:42,060 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-26 04:46:42,060 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-26 04:46:42,060 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2020-10-26 04:46:42,062 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2020-10-26 04:46:42,063 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:46:42,063 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:46:42,063 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-26 04:46:42,063 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-26 04:46:42,071 INFO L794 eck$LassoCheckResult]: Stem: 18#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(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 14#L-1true havoc main_#res;havoc main_#t~nondet7, main_#t~nondet9, main_#t~post8, main_#t~mem11, main_#t~mem14, main_#t~mem12, main_#t~short13, main_#t~post10, main_#t~mem16, main_#t~mem17, main_#t~post15, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 0; 24#L17-3true [2020-10-26 04:46:42,071 INFO L796 eck$LassoCheckResult]: Loop: 24#L17-3true assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 3#L17-2true main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 24#L17-3true [2020-10-26 04:46:42,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:46:42,078 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-10-26 04:46:42,088 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:46:42,089 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553617010] [2020-10-26 04:46:42,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:46:42,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:42,207 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:42,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:42,232 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:42,255 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:46:42,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:46:42,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2020-10-26 04:46:42,257 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:46:42,258 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032653769] [2020-10-26 04:46:42,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:46:42,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:42,269 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:42,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:42,278 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:42,281 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:46:42,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:46:42,284 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2020-10-26 04:46:42,284 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:46:42,284 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337080404] [2020-10-26 04:46:42,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:46:42,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:42,323 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:42,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:42,357 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:42,366 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:46:42,801 WARN L193 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 77 [2020-10-26 04:46:43,060 WARN L193 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2020-10-26 04:46:43,074 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 04:46:43,075 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 04:46:43,075 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 04:46:43,075 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 04:46:43,076 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 04:46:43,076 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:46:43,076 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 04:46:43,076 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 04:46:43,077 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertion_sort-1.c_Iteration1_Lasso [2020-10-26 04:46:43,077 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 04:46:43,077 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 04:46:43,103 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 04:46:43,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 04:46:43,122 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 04:46:43,126 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 04:46:43,130 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 04:46:43,134 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 04:46:43,139 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 04:46:43,143 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 04:46:43,147 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 04:46:43,152 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 04:46:43,156 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 04:46:43,160 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 04:46:43,163 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 04:46:43,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 04:46:43,171 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 04:46:43,174 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 04:46:43,179 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 04:46:43,686 WARN L193 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2020-10-26 04:46:43,732 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 04:46:43,737 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 04:46:43,988 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2020-10-26 04:46:44,389 WARN L193 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2020-10-26 04:46:44,473 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 04:46:44,483 INFO L489 LassoAnalysis]: Using template 'affine'. 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 04:46:44,498 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 04:46:44,500 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:44,500 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:46:44,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:44,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:44,501 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:44,503 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:46:44,504 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:46:44,506 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 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 04:46:44,540 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 04:46:44,543 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:44,543 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:44,543 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:44,543 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:44,547 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:46:44,547 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:46:44,551 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 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 04:46:44,578 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 04:46:44,581 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:44,581 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:46:44,581 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:44,581 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:44,581 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:44,583 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:46:44,583 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:46:44,585 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) [2020-10-26 04:46:44,618 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 04:46:44,620 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:44,621 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:46:44,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:44,621 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:44,621 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:44,622 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:46:44,622 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:46:44,625 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 04:46:44,654 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 04:46:44,656 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:44,656 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:46:44,656 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:44,657 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:44,657 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:44,658 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:46:44,658 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:46:44,660 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 04:46:44,688 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 04:46:44,690 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:44,690 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:44,690 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:44,690 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:44,694 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:46:44,694 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:46:44,699 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 04:46:44,724 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 04:46:44,726 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:44,727 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:46:44,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:44,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:44,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:44,728 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:46:44,728 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:46:44,736 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) [2020-10-26 04:46:44,776 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 04:46:44,778 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:44,778 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:46:44,778 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:44,778 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:44,779 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:44,780 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:46:44,780 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:46:44,783 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 04:46:44,821 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 04:46:44,823 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:44,823 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:44,823 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:44,823 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:44,826 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:46:44,826 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:46:44,830 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 04:46:44,860 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 04:46:44,864 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:44,864 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:46:44,864 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:44,864 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:44,864 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:44,865 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:46:44,865 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:46:44,867 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 04:46:44,908 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 04:46:44,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:44,911 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:46:44,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:44,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:44,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:44,912 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:46:44,912 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:46:44,914 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 04:46:44,942 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 04:46:44,944 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:44,944 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:46:44,944 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:44,945 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:44,945 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:44,946 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:46:44,946 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:46:44,948 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 04:46:44,978 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 04:46:44,980 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:44,980 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:46:44,980 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:44,980 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:44,980 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:44,982 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:46:44,982 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:46:44,984 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 04:46:45,008 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 04:46:45,010 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:45,010 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:46:45,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:45,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:45,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:45,011 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:46:45,011 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:46:45,013 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 04:46:45,036 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 04:46:45,038 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:45,038 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:46:45,038 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:45,038 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:45,038 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:45,039 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:46:45,039 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:46:45,040 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 04:46:45,066 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 04:46:45,068 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:45,068 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:46:45,068 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:45,068 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:45,068 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:45,069 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:46:45,070 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:46:45,075 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 04:46:45,103 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 04:46:45,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:45,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:45,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:45,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:45,109 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:46:45,109 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:46:45,129 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 04:46:45,165 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 04:46:45,166 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:45,167 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:45,167 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:45,167 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:45,171 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:46:45,171 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:46:45,176 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:46:45,221 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 04:46:45,223 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:45,223 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:45,223 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:45,223 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:45,226 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:46:45,226 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:46:45,231 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:46:45,279 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 04:46:45,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:45,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:45,282 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:45,282 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:46:45,291 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:46:45,292 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:46:45,295 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 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:46:45,324 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 04:46:45,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:45,326 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:45,326 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:45,326 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:45,330 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:46:45,330 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:46:45,334 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 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:46:45,358 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 04:46:45,360 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:45,360 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:45,360 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:45,360 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:45,363 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:46:45,363 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:46:45,369 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:46:45,405 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:46:45,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:45,407 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:45,407 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:45,407 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:45,409 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:46:45,409 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:46:45,414 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:46:45,441 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 Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:46:45,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:45,443 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2020-10-26 04:46:45,444 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:45,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:45,456 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2020-10-26 04:46:45,456 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:46:45,477 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 04:46:45,675 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2020-10-26 04:46:45,675 INFO L444 ModelExtractionUtils]: 4 out of 19 variables were initially zero. Simplification set additionally 11 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:46:45,697 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:46:45,703 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-26 04:46:45,704 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 04:46:45,705 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#v~0.base)_1, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~#v~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_~#v~0.base)_1 - 4*ULTIMATE.start_main_~j~0 - 1*ULTIMATE.start_main_~#v~0.offset Supporting invariants [] [2020-10-26 04:46:45,789 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2020-10-26 04:46:45,802 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-26 04:46:45,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:46:45,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:46:45,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-26 04:46:45,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:46:45,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:46:45,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-26 04:46:45,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:46:45,894 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 04:46:45,914 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 04:46:45,915 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states. Second operand 3 states. [2020-10-26 04:46:46,027 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states.. Second operand 3 states. Result 47 states and 69 transitions. Complement of second has 8 states. [2020-10-26 04:46:46,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-26 04:46:46,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-26 04:46:46,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2020-10-26 04:46:46,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 2 letters. Loop has 2 letters. [2020-10-26 04:46:46,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:46:46,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 4 letters. Loop has 2 letters. [2020-10-26 04:46:46,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:46:46,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 2 letters. Loop has 4 letters. [2020-10-26 04:46:46,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:46:46,034 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 69 transitions. [2020-10-26 04:46:46,039 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2020-10-26 04:46:46,043 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 21 states and 30 transitions. [2020-10-26 04:46:46,045 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-10-26 04:46:46,045 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2020-10-26 04:46:46,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 30 transitions. [2020-10-26 04:46:46,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:46:46,046 INFO L691 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2020-10-26 04:46:46,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 30 transitions. [2020-10-26 04:46:46,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-10-26 04:46:46,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-10-26 04:46:46,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 30 transitions. [2020-10-26 04:46:46,080 INFO L714 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2020-10-26 04:46:46,080 INFO L594 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2020-10-26 04:46:46,080 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-26 04:46:46,080 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. [2020-10-26 04:46:46,081 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2020-10-26 04:46:46,081 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:46:46,082 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:46:46,082 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-26 04:46:46,082 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-26 04:46:46,082 INFO L794 eck$LassoCheckResult]: Stem: 174#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(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 171#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet9, main_#t~post8, main_#t~mem11, main_#t~mem14, main_#t~mem12, main_#t~short13, main_#t~post10, main_#t~mem16, main_#t~mem17, main_#t~post15, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 0; 172#L17-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 175#L17-4 main_~j~0 := 1; 160#L19-3 [2020-10-26 04:46:46,083 INFO L796 eck$LassoCheckResult]: Loop: 160#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 161#L22-5 assume !true; 162#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 163#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 160#L19-3 [2020-10-26 04:46:46,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:46:46,083 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2020-10-26 04:46:46,084 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:46:46,084 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627765338] [2020-10-26 04:46:46,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:46:46,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:46,106 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:46,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:46,126 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:46,132 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:46:46,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:46:46,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1687228, now seen corresponding path program 1 times [2020-10-26 04:46:46,133 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:46:46,133 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147969392] [2020-10-26 04:46:46,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:46:46,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:46:46,161 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 04:46:46,161 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147969392] [2020-10-26 04:46:46,162 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:46:46,162 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-26 04:46:46,163 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543573785] [2020-10-26 04:46:46,166 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 04:46:46,166 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:46:46,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-26 04:46:46,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-26 04:46:46,171 INFO L87 Difference]: Start difference. First operand 21 states and 30 transitions. cyclomatic complexity: 12 Second operand 2 states. [2020-10-26 04:46:46,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:46:46,176 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2020-10-26 04:46:46,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-26 04:46:46,177 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 26 transitions. [2020-10-26 04:46:46,178 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2020-10-26 04:46:46,179 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 19 states and 25 transitions. [2020-10-26 04:46:46,179 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-10-26 04:46:46,179 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-10-26 04:46:46,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 25 transitions. [2020-10-26 04:46:46,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:46:46,180 INFO L691 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2020-10-26 04:46:46,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 25 transitions. [2020-10-26 04:46:46,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-10-26 04:46:46,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-10-26 04:46:46,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2020-10-26 04:46:46,183 INFO L714 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2020-10-26 04:46:46,183 INFO L594 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2020-10-26 04:46:46,183 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-26 04:46:46,183 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2020-10-26 04:46:46,184 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2020-10-26 04:46:46,184 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:46:46,184 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:46:46,184 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-26 04:46:46,185 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-10-26 04:46:46,185 INFO L794 eck$LassoCheckResult]: Stem: 218#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(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 215#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet9, main_#t~post8, main_#t~mem11, main_#t~mem14, main_#t~mem12, main_#t~short13, main_#t~post10, main_#t~mem16, main_#t~mem17, main_#t~post15, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 0; 216#L17-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 219#L17-4 main_~j~0 := 1; 208#L19-3 [2020-10-26 04:46:46,185 INFO L796 eck$LassoCheckResult]: Loop: 208#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 209#L22-5 main_#t~short13 := main_~i~0 >= 0; 212#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 213#L22-3 assume !main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 206#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 207#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 208#L19-3 [2020-10-26 04:46:46,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:46:46,186 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 2 times [2020-10-26 04:46:46,186 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:46:46,186 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806955511] [2020-10-26 04:46:46,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:46:46,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:46,205 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:46,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:46,224 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:46,228 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:46:46,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:46:46,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1602376878, now seen corresponding path program 1 times [2020-10-26 04:46:46,229 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:46:46,230 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016993908] [2020-10-26 04:46:46,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:46:46,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:46,244 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:46,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:46,255 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:46,258 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:46:46,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:46:46,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1970718008, now seen corresponding path program 1 times [2020-10-26 04:46:46,259 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:46:46,259 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593264400] [2020-10-26 04:46:46,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:46:46,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:46:46,479 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 04:46:46,480 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593264400] [2020-10-26 04:46:46,480 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:46:46,482 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-26 04:46:46,482 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109926484] [2020-10-26 04:46:46,650 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 53 [2020-10-26 04:46:46,708 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:46:46,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 04:46:46,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-26 04:46:46,709 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. cyclomatic complexity: 9 Second operand 5 states. [2020-10-26 04:46:46,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:46:46,845 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2020-10-26 04:46:46,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 04:46:46,846 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2020-10-26 04:46:46,847 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2020-10-26 04:46:46,847 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 20 states and 25 transitions. [2020-10-26 04:46:46,847 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-10-26 04:46:46,848 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-10-26 04:46:46,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 25 transitions. [2020-10-26 04:46:46,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:46:46,848 INFO L691 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2020-10-26 04:46:46,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 25 transitions. [2020-10-26 04:46:46,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2020-10-26 04:46:46,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-10-26 04:46:46,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2020-10-26 04:46:46,850 INFO L714 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2020-10-26 04:46:46,851 INFO L594 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2020-10-26 04:46:46,851 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-26 04:46:46,851 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2020-10-26 04:46:46,852 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2020-10-26 04:46:46,852 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:46:46,852 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:46:46,852 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-10-26 04:46:46,853 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-10-26 04:46:46,853 INFO L794 eck$LassoCheckResult]: Stem: 273#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(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 270#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet9, main_#t~post8, main_#t~mem11, main_#t~mem14, main_#t~mem12, main_#t~short13, main_#t~post10, main_#t~mem16, main_#t~mem17, main_#t~post15, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 0; 271#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 256#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 257#L17-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 274#L17-4 main_~j~0 := 1; 261#L19-3 [2020-10-26 04:46:46,853 INFO L796 eck$LassoCheckResult]: Loop: 261#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 262#L22-5 main_#t~short13 := main_~i~0 >= 0; 267#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 268#L22-3 assume !main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 263#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 264#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 261#L19-3 [2020-10-26 04:46:46,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:46:46,854 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2020-10-26 04:46:46,854 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:46:46,854 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99219007] [2020-10-26 04:46:46,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:46:46,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:46,871 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:46,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:46,886 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:46,891 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:46:46,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:46:46,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1602376878, now seen corresponding path program 2 times [2020-10-26 04:46:46,892 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:46:46,892 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782794395] [2020-10-26 04:46:46,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:46:46,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:46,902 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:46,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:46,912 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:46,915 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:46:46,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:46:46,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1315520442, now seen corresponding path program 1 times [2020-10-26 04:46:46,916 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:46:46,916 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7752707] [2020-10-26 04:46:46,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:46:46,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:46:47,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:46:47,127 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7752707] [2020-10-26 04:46:47,127 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881946591] [2020-10-26 04:46:47,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 04:46:47,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:46:47,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-26 04:46:47,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:46:47,227 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2020-10-26 04:46:47,227 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:46:47,257 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:46:47,265 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2020-10-26 04:46:47,266 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-26 04:46:47,300 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:46:47,301 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2020-10-26 04:46:47,301 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:46 [2020-10-26 04:46:47,411 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 04:46:47,487 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 04:46:47,946 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 89 [2020-10-26 04:46:48,011 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:46:48,085 INFO L625 ElimStorePlain]: treesize reduction 85, result has 38.8 percent of original size [2020-10-26 04:46:48,100 INFO L545 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-26 04:46:48,101 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:126, output treesize:49 [2020-10-26 04:46:48,173 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:46:48,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:46:48,206 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 04:46:48,206 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2020-10-26 04:46:48,206 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979316984] [2020-10-26 04:46:48,351 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 53 [2020-10-26 04:46:48,403 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:46:48,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-26 04:46:48,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-10-26 04:46:48,404 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. cyclomatic complexity: 8 Second operand 11 states. [2020-10-26 04:46:48,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:46:48,879 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-10-26 04:46:48,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-26 04:46:48,880 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 32 transitions. [2020-10-26 04:46:48,881 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2020-10-26 04:46:48,882 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 23 states and 28 transitions. [2020-10-26 04:46:48,882 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-10-26 04:46:48,882 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-10-26 04:46:48,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2020-10-26 04:46:48,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:46:48,883 INFO L691 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2020-10-26 04:46:48,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2020-10-26 04:46:48,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2020-10-26 04:46:48,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-10-26 04:46:48,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2020-10-26 04:46:48,886 INFO L714 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2020-10-26 04:46:48,886 INFO L594 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2020-10-26 04:46:48,886 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-26 04:46:48,887 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2020-10-26 04:46:48,887 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2020-10-26 04:46:48,888 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:46:48,888 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:46:48,888 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2020-10-26 04:46:48,889 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-10-26 04:46:48,889 INFO L794 eck$LassoCheckResult]: Stem: 372#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(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 368#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet9, main_#t~post8, main_#t~mem11, main_#t~mem14, main_#t~mem12, main_#t~short13, main_#t~post10, main_#t~mem16, main_#t~mem17, main_#t~post15, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 0; 369#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 355#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 356#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 375#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 376#L17-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 374#L17-4 main_~j~0 := 1; 360#L19-3 [2020-10-26 04:46:48,889 INFO L796 eck$LassoCheckResult]: Loop: 360#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 361#L22-5 main_#t~short13 := main_~i~0 >= 0; 366#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 371#L22-3 assume !main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 362#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 363#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 360#L19-3 [2020-10-26 04:46:48,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:46:48,890 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2020-10-26 04:46:48,890 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:46:48,890 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264933445] [2020-10-26 04:46:48,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:46:48,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:48,908 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:48,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:48,942 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:48,952 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:46:48,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:46:48,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1602376878, now seen corresponding path program 3 times [2020-10-26 04:46:48,954 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:46:48,955 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884318174] [2020-10-26 04:46:48,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:46:48,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:48,974 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:48,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:48,987 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:48,991 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:46:48,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:46:48,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1264115268, now seen corresponding path program 2 times [2020-10-26 04:46:48,998 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:46:48,999 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203728172] [2020-10-26 04:46:48,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:46:49,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:49,040 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:49,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:49,062 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:49,068 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:46:49,214 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 53 [2020-10-26 04:46:49,776 WARN L193 SmtUtils]: Spent 510.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 106 [2020-10-26 04:46:50,127 WARN L193 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 78 [2020-10-26 04:46:50,133 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 04:46:50,133 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 04:46:50,134 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 04:46:50,134 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 04:46:50,134 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 04:46:50,134 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:46:50,134 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 04:46:50,134 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 04:46:50,134 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertion_sort-1.c_Iteration5_Lasso [2020-10-26 04:46:50,134 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 04:46:50,134 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 04:46:50,138 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 04:46:50,151 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 04:46:50,154 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 04:46:50,159 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 04:46:50,166 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 04:46:50,169 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 04:46:50,172 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 04:46:50,176 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 04:46:50,181 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 04:46:50,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 04:46:50,187 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 04:46:50,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 04:46:50,193 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 04:46:50,197 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 04:46:50,200 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 04:46:50,203 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 04:46:50,566 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 04:46:50,570 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 04:46:50,807 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2020-10-26 04:46:51,125 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 04:46:51,126 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:46:51,129 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 04:46:51,131 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:51,131 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:51,131 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:51,131 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:51,134 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:46:51,134 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:46:51,138 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 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:46:51,166 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 04:46:51,167 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:51,167 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:46:51,167 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:51,167 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:51,167 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:51,168 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:46:51,168 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:46:51,169 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 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:46:51,192 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 04:46:51,194 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:51,194 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:51,194 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:51,194 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:51,196 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:46:51,196 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:46:51,204 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 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:46:51,229 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 04:46:51,230 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:51,230 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:46:51,230 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:51,230 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:51,230 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:51,231 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:46:51,231 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:46:51,232 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 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:46:51,257 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 04:46:51,258 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:51,258 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:46:51,258 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:51,258 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:51,258 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:51,259 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:46:51,259 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:46:51,260 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 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:46:51,286 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 04:46:51,287 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:51,288 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:46:51,288 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:51,288 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:51,288 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:51,288 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:46:51,288 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:46:51,289 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 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:46:51,315 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 04:46:51,317 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:51,317 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:46:51,317 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:51,317 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:51,317 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:51,317 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:46:51,317 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:46:51,318 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 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:46:51,343 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:46:51,344 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:51,345 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:51,345 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:51,345 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:51,346 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:46:51,347 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:46:51,355 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 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:46:51,378 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 04:46:51,380 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:51,380 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:46:51,380 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:51,380 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:51,380 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:51,381 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:46:51,381 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:46:51,382 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 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:46:51,409 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:46:51,410 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:51,410 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:46:51,411 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:51,411 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:51,411 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:51,411 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:46:51,411 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:46:51,419 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:46:51,441 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 Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:46:51,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:51,443 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:46:51,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:51,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:51,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:51,444 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:46:51,444 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:46:51,450 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 39 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:46:51,473 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 04:46:51,474 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:51,475 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:46:51,475 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:51,475 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:51,475 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:51,475 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:46:51,475 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:46:51,476 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 40 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:46:51,503 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 04:46:51,504 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:51,504 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:46:51,504 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:51,504 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:51,504 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:51,505 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:46:51,505 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:46:51,506 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 41 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:46:51,530 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 04:46:51,531 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:51,531 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:46:51,531 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:51,531 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:51,531 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:51,532 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:46:51,532 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:46:51,539 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:46:51,574 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 04:46:51,576 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:51,576 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:46:51,576 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:51,577 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:51,577 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:51,579 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:46:51,579 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:46:51,581 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:46:51,625 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 04:46:51,627 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:51,627 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:51,627 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:51,627 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:51,636 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:46:51,636 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:46:51,657 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 04:46:51,696 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2020-10-26 04:46:51,696 INFO L444 ModelExtractionUtils]: 9 out of 19 variables were initially zero. Simplification set additionally 6 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 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 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:46:51,699 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-26 04:46:51,701 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-10-26 04:46:51,701 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 04:46:51,702 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#v~0.base)_2, ULTIMATE.start_main_~j~0) = 1*v_rep(select #length ULTIMATE.start_main_~#v~0.base)_2 - 2*ULTIMATE.start_main_~j~0 Supporting invariants [1*ULTIMATE.start_main_~#v~0.offset >= 0] [2020-10-26 04:46:51,779 INFO L297 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2020-10-26 04:46:51,782 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-26 04:46:51,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:46:51,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:46:51,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-26 04:46:51,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:46:51,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:46:51,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-26 04:46:51,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:46:51,891 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:46:51,982 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 04:46:51,983 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2020-10-26 04:46:51,983 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand 6 states. [2020-10-26 04:46:52,199 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8. Second operand 6 states. Result 50 states and 66 transitions. Complement of second has 11 states. [2020-10-26 04:46:52,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2020-10-26 04:46:52,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-26 04:46:52,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2020-10-26 04:46:52,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 31 transitions. Stem has 8 letters. Loop has 6 letters. [2020-10-26 04:46:52,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:46:52,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 31 transitions. Stem has 14 letters. Loop has 6 letters. [2020-10-26 04:46:52,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:46:52,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 31 transitions. Stem has 8 letters. Loop has 12 letters. [2020-10-26 04:46:52,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:46:52,204 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 66 transitions. [2020-10-26 04:46:52,205 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2020-10-26 04:46:52,206 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 42 states and 54 transitions. [2020-10-26 04:46:52,206 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2020-10-26 04:46:52,206 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-10-26 04:46:52,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 54 transitions. [2020-10-26 04:46:52,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:46:52,207 INFO L691 BuchiCegarLoop]: Abstraction has 42 states and 54 transitions. [2020-10-26 04:46:52,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 54 transitions. [2020-10-26 04:46:52,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2020-10-26 04:46:52,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-10-26 04:46:52,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2020-10-26 04:46:52,211 INFO L714 BuchiCegarLoop]: Abstraction has 40 states and 52 transitions. [2020-10-26 04:46:52,211 INFO L594 BuchiCegarLoop]: Abstraction has 40 states and 52 transitions. [2020-10-26 04:46:52,212 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-26 04:46:52,212 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 52 transitions. [2020-10-26 04:46:52,213 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2020-10-26 04:46:52,213 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:46:52,213 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:46:52,213 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2020-10-26 04:46:52,213 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-10-26 04:46:52,214 INFO L794 eck$LassoCheckResult]: Stem: 588#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(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 582#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet9, main_#t~post8, main_#t~mem11, main_#t~mem14, main_#t~mem12, main_#t~short13, main_#t~post10, main_#t~mem16, main_#t~mem17, main_#t~post15, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 0; 583#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 592#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 593#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 563#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 564#L17-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 590#L17-4 main_~j~0 := 1; 591#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 571#L22-5 [2020-10-26 04:46:52,214 INFO L796 eck$LassoCheckResult]: Loop: 571#L22-5 main_#t~short13 := main_~i~0 >= 0; 595#L22-1 assume !main_#t~short13; 594#L22-3 assume !main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 566#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 567#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 570#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 571#L22-5 [2020-10-26 04:46:52,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:46:52,214 INFO L82 PathProgramCache]: Analyzing trace with hash -367607191, now seen corresponding path program 1 times [2020-10-26 04:46:52,215 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:46:52,215 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785173812] [2020-10-26 04:46:52,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:46:52,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:52,233 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:52,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:52,256 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:52,265 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:46:52,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:46:52,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1750331510, now seen corresponding path program 1 times [2020-10-26 04:46:52,266 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:46:52,267 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660793591] [2020-10-26 04:46:52,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:46:52,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:52,275 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:52,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:52,281 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:52,290 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:46:52,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:46:52,294 INFO L82 PathProgramCache]: Analyzing trace with hash -531020578, now seen corresponding path program 1 times [2020-10-26 04:46:52,294 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:46:52,295 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80639092] [2020-10-26 04:46:52,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:46:52,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:46:52,364 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-26 04:46:52,366 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80639092] [2020-10-26 04:46:52,367 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:46:52,367 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-26 04:46:52,367 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67379781] [2020-10-26 04:46:52,506 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:46:52,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 04:46:52,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-26 04:46:52,507 INFO L87 Difference]: Start difference. First operand 40 states and 52 transitions. cyclomatic complexity: 17 Second operand 5 states. [2020-10-26 04:46:52,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:46:52,611 INFO L93 Difference]: Finished difference Result 78 states and 99 transitions. [2020-10-26 04:46:52,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-26 04:46:52,613 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 99 transitions. [2020-10-26 04:46:52,614 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 30 [2020-10-26 04:46:52,616 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 78 states and 99 transitions. [2020-10-26 04:46:52,616 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2020-10-26 04:46:52,616 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2020-10-26 04:46:52,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 99 transitions. [2020-10-26 04:46:52,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:46:52,616 INFO L691 BuchiCegarLoop]: Abstraction has 78 states and 99 transitions. [2020-10-26 04:46:52,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 99 transitions. [2020-10-26 04:46:52,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 42. [2020-10-26 04:46:52,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-10-26 04:46:52,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 54 transitions. [2020-10-26 04:46:52,622 INFO L714 BuchiCegarLoop]: Abstraction has 42 states and 54 transitions. [2020-10-26 04:46:52,622 INFO L594 BuchiCegarLoop]: Abstraction has 42 states and 54 transitions. [2020-10-26 04:46:52,622 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-26 04:46:52,622 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 54 transitions. [2020-10-26 04:46:52,623 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2020-10-26 04:46:52,623 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:46:52,623 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:46:52,624 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2020-10-26 04:46:52,624 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-26 04:46:52,624 INFO L794 eck$LassoCheckResult]: Stem: 723#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(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 717#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet9, main_#t~post8, main_#t~mem11, main_#t~mem14, main_#t~mem12, main_#t~short13, main_#t~post10, main_#t~mem16, main_#t~mem17, main_#t~post15, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 0; 718#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 726#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 727#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 695#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 696#L17-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 725#L17-4 main_~j~0 := 1; 698#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 699#L22-5 [2020-10-26 04:46:52,625 INFO L796 eck$LassoCheckResult]: Loop: 699#L22-5 main_#t~short13 := main_~i~0 >= 0; 709#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 714#L22-3 assume !!main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 715#L23 assume main_~i~0 < 2;call main_#t~mem14 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);call write~int(main_#t~mem14, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4);havoc main_#t~mem14; 719#L23-2 main_~i~0 := main_~i~0 - 1; 699#L22-5 [2020-10-26 04:46:52,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:46:52,625 INFO L82 PathProgramCache]: Analyzing trace with hash -367607191, now seen corresponding path program 2 times [2020-10-26 04:46:52,625 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:46:52,626 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407904714] [2020-10-26 04:46:52,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:46:52,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:52,640 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:52,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:52,652 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:52,656 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:46:52,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:46:52,657 INFO L82 PathProgramCache]: Analyzing trace with hash 56404392, now seen corresponding path program 1 times [2020-10-26 04:46:52,657 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:46:52,657 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811824654] [2020-10-26 04:46:52,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:46:52,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:52,662 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:52,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:52,679 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:52,683 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:46:52,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:46:52,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1264113600, now seen corresponding path program 1 times [2020-10-26 04:46:52,685 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:46:52,685 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547013194] [2020-10-26 04:46:52,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:46:52,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:52,717 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:52,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:52,750 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:52,758 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:46:52,875 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2020-10-26 04:46:53,440 WARN L193 SmtUtils]: Spent 527.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 120 [2020-10-26 04:46:53,841 WARN L193 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 91 [2020-10-26 04:46:53,844 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 04:46:53,844 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 04:46:53,844 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 04:46:53,844 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 04:46:53,844 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 04:46:53,844 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:46:53,844 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 04:46:53,844 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 04:46:53,844 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertion_sort-1.c_Iteration7_Lasso [2020-10-26 04:46:53,844 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 04:46:53,844 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 04:46:53,847 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 04:46:53,852 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 04:46:53,860 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 04:46:54,159 WARN L193 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2020-10-26 04:46:54,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 04:46:54,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 04:46:54,258 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 04:46:54,261 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 04:46:54,265 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 04:46:54,268 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 04:46:54,271 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 04:46:54,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 04:46:54,276 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 04:46:54,279 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 04:46:54,283 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 04:46:54,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 04:46:54,290 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 04:46:54,296 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 04:46:54,299 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 04:46:54,761 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 04:46:54,762 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:46:54,771 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 04:46:54,773 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:54,773 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:46:54,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:54,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:54,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:54,775 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:46:54,775 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:46:54,777 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 46 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 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:46:54,804 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 04:46:54,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:54,805 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:46:54,805 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:54,805 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:54,805 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:54,806 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:46:54,806 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:46:54,807 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 47 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:46:54,829 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 04:46:54,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:54,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:54,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:54,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:54,833 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:46:54,833 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:46:54,836 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 48 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:46:54,859 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 04:46:54,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:46:54,861 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:46:54,861 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:46:54,862 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:46:54,867 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:46:54,867 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:46:54,881 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 04:46:54,939 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2020-10-26 04:46:54,939 INFO L444 ModelExtractionUtils]: 5 out of 22 variables were initially zero. Simplification set additionally 12 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 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 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:46:54,941 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-26 04:46:54,943 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-10-26 04:46:54,943 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 04:46:54,943 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~j~0) = 2*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~j~0 Supporting invariants [1*ULTIMATE.start_main_~j~0 - 1 >= 0] [2020-10-26 04:46:55,030 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2020-10-26 04:46:55,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:46:55,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:46:55,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-26 04:46:55,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:46:55,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:46:55,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-26 04:46:55,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:46:55,165 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 04:46:55,166 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2020-10-26 04:46:55,167 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 54 transitions. cyclomatic complexity: 17 Second operand 5 states. [2020-10-26 04:46:55,276 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 54 transitions. cyclomatic complexity: 17. Second operand 5 states. Result 77 states and 97 transitions. Complement of second has 10 states. [2020-10-26 04:46:55,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2020-10-26 04:46:55,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-26 04:46:55,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2020-10-26 04:46:55,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 9 letters. Loop has 5 letters. [2020-10-26 04:46:55,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:46:55,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 14 letters. Loop has 5 letters. [2020-10-26 04:46:55,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:46:55,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 9 letters. Loop has 10 letters. [2020-10-26 04:46:55,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:46:55,281 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 97 transitions. [2020-10-26 04:46:55,282 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 19 [2020-10-26 04:46:55,283 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 60 states and 75 transitions. [2020-10-26 04:46:55,283 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2020-10-26 04:46:55,283 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2020-10-26 04:46:55,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 75 transitions. [2020-10-26 04:46:55,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:46:55,284 INFO L691 BuchiCegarLoop]: Abstraction has 60 states and 75 transitions. [2020-10-26 04:46:55,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 75 transitions. [2020-10-26 04:46:55,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 48. [2020-10-26 04:46:55,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-10-26 04:46:55,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2020-10-26 04:46:55,289 INFO L714 BuchiCegarLoop]: Abstraction has 48 states and 63 transitions. [2020-10-26 04:46:55,289 INFO L594 BuchiCegarLoop]: Abstraction has 48 states and 63 transitions. [2020-10-26 04:46:55,289 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-26 04:46:55,289 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 63 transitions. [2020-10-26 04:46:55,290 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2020-10-26 04:46:55,290 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:46:55,290 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:46:55,291 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2020-10-26 04:46:55,291 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-26 04:46:55,291 INFO L794 eck$LassoCheckResult]: Stem: 978#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(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 973#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet9, main_#t~post8, main_#t~mem11, main_#t~mem14, main_#t~mem12, main_#t~short13, main_#t~post10, main_#t~mem16, main_#t~mem17, main_#t~post15, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 0; 974#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 951#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 952#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 981#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 983#L17-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 980#L17-4 main_~j~0 := 1; 954#L19-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 949#L19-4 main_~k~0 := 1; 950#L29-3 [2020-10-26 04:46:55,292 INFO L796 eck$LassoCheckResult]: Loop: 950#L29-3 assume !!(main_~k~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem16 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * (main_~k~0 - 1), 4);call main_#t~mem17 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~k~0, 4);__VERIFIER_assert_#in~cond := (if main_#t~mem16 <= main_#t~mem17 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 953#L6 assume !(0 == __VERIFIER_assert_~cond); 963#L6-2 havoc main_#t~mem17;havoc main_#t~mem16; 962#L29-2 main_#t~post15 := main_~k~0;main_~k~0 := 1 + main_#t~post15;havoc main_#t~post15; 950#L29-3 [2020-10-26 04:46:55,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:46:55,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1489078962, now seen corresponding path program 1 times [2020-10-26 04:46:55,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:46:55,293 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966898361] [2020-10-26 04:46:55,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:46:55,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:46:55,471 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:46:55,471 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966898361] [2020-10-26 04:46:55,471 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840408455] [2020-10-26 04:46:55,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 04:46:55,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:46:55,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-26 04:46:55,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:46:55,525 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2020-10-26 04:46:55,526 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:46:55,552 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:46:55,557 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2020-10-26 04:46:55,557 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-26 04:46:55,586 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:46:55,586 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2020-10-26 04:46:55,587 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:46 [2020-10-26 04:46:55,630 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:46:55,680 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:46:55,722 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2020-10-26 04:46:55,723 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:46:55,751 INFO L625 ElimStorePlain]: treesize reduction 21, result has 56.3 percent of original size [2020-10-26 04:46:55,755 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2020-10-26 04:46:55,756 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-26 04:46:55,766 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:46:55,767 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-26 04:46:55,768 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:57, output treesize:11 [2020-10-26 04:46:55,849 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:46:55,849 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 04:46:55,849 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2020-10-26 04:46:55,849 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878467530] [2020-10-26 04:46:55,850 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 04:46:55,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:46:55,850 INFO L82 PathProgramCache]: Analyzing trace with hash 2933516, now seen corresponding path program 1 times [2020-10-26 04:46:55,850 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:46:55,851 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289997761] [2020-10-26 04:46:55,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:46:55,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:55,858 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:55,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:55,862 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:55,864 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:46:55,989 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:46:55,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-26 04:46:55,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-10-26 04:46:55,990 INFO L87 Difference]: Start difference. First operand 48 states and 63 transitions. cyclomatic complexity: 21 Second operand 10 states. [2020-10-26 04:46:56,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:46:56,340 INFO L93 Difference]: Finished difference Result 51 states and 65 transitions. [2020-10-26 04:46:56,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-26 04:46:56,343 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 65 transitions. [2020-10-26 04:46:56,344 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2020-10-26 04:46:56,345 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 51 states and 65 transitions. [2020-10-26 04:46:56,345 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2020-10-26 04:46:56,345 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2020-10-26 04:46:56,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 65 transitions. [2020-10-26 04:46:56,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:46:56,345 INFO L691 BuchiCegarLoop]: Abstraction has 51 states and 65 transitions. [2020-10-26 04:46:56,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 65 transitions. [2020-10-26 04:46:56,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2020-10-26 04:46:56,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-10-26 04:46:56,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 62 transitions. [2020-10-26 04:46:56,350 INFO L714 BuchiCegarLoop]: Abstraction has 48 states and 62 transitions. [2020-10-26 04:46:56,350 INFO L594 BuchiCegarLoop]: Abstraction has 48 states and 62 transitions. [2020-10-26 04:46:56,350 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-26 04:46:56,350 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 62 transitions. [2020-10-26 04:46:56,353 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2020-10-26 04:46:56,354 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:46:56,354 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:46:56,356 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 04:46:56,356 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-10-26 04:46:56,356 INFO L794 eck$LassoCheckResult]: Stem: 1123#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(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 1117#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet9, main_#t~post8, main_#t~mem11, main_#t~mem14, main_#t~mem12, main_#t~short13, main_#t~post10, main_#t~mem16, main_#t~mem17, main_#t~post15, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 0; 1118#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 1094#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 1095#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 1127#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 1129#L17-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 1126#L17-4 main_~j~0 := 1; 1099#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 1100#L22-5 main_#t~short13 := main_~i~0 >= 0; 1120#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 1116#L22-3 assume !main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 1105#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 1106#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 1114#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 1128#L22-5 [2020-10-26 04:46:56,356 INFO L796 eck$LassoCheckResult]: Loop: 1128#L22-5 main_#t~short13 := main_~i~0 >= 0; 1135#L22-1 assume !main_#t~short13; 1115#L22-3 assume !main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 1103#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 1104#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 1113#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 1128#L22-5 [2020-10-26 04:46:56,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:46:56,357 INFO L82 PathProgramCache]: Analyzing trace with hash -532867620, now seen corresponding path program 3 times [2020-10-26 04:46:56,357 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:46:56,357 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884589774] [2020-10-26 04:46:56,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:46:56,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:46:56,668 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2020-10-26 04:46:56,737 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:46:56,737 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884589774] [2020-10-26 04:46:56,738 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938552757] [2020-10-26 04:46:56,738 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 04:46:56,791 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-10-26 04:46:56,791 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-26 04:46:56,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 13 conjunts are in the unsatisfiable core [2020-10-26 04:46:56,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:46:56,804 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2020-10-26 04:46:56,804 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:46:56,838 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:46:56,844 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2020-10-26 04:46:56,845 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-26 04:46:56,877 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:46:56,877 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2020-10-26 04:46:56,878 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:46 [2020-10-26 04:46:57,044 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 04:46:57,213 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:46:57,213 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 04:46:57,213 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2020-10-26 04:46:57,214 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854166154] [2020-10-26 04:46:57,214 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 04:46:57,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:46:57,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1750331510, now seen corresponding path program 2 times [2020-10-26 04:46:57,215 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:46:57,218 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624949417] [2020-10-26 04:46:57,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:46:57,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:57,232 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:57,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:57,245 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:57,248 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:46:57,370 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2020-10-26 04:46:57,413 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:46:57,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-26 04:46:57,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2020-10-26 04:46:57,414 INFO L87 Difference]: Start difference. First operand 48 states and 62 transitions. cyclomatic complexity: 20 Second operand 14 states. [2020-10-26 04:46:58,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:46:58,011 INFO L93 Difference]: Finished difference Result 70 states and 89 transitions. [2020-10-26 04:46:58,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-26 04:46:58,013 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 89 transitions. [2020-10-26 04:46:58,014 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 19 [2020-10-26 04:46:58,015 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 70 states and 89 transitions. [2020-10-26 04:46:58,015 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2020-10-26 04:46:58,019 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2020-10-26 04:46:58,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 89 transitions. [2020-10-26 04:46:58,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:46:58,019 INFO L691 BuchiCegarLoop]: Abstraction has 70 states and 89 transitions. [2020-10-26 04:46:58,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 89 transitions. [2020-10-26 04:46:58,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 64. [2020-10-26 04:46:58,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-10-26 04:46:58,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 83 transitions. [2020-10-26 04:46:58,031 INFO L714 BuchiCegarLoop]: Abstraction has 64 states and 83 transitions. [2020-10-26 04:46:58,032 INFO L594 BuchiCegarLoop]: Abstraction has 64 states and 83 transitions. [2020-10-26 04:46:58,032 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-26 04:46:58,032 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 83 transitions. [2020-10-26 04:46:58,033 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2020-10-26 04:46:58,033 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:46:58,033 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:46:58,038 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 04:46:58,038 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-26 04:46:58,038 INFO L794 eck$LassoCheckResult]: Stem: 1313#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(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 1304#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet9, main_#t~post8, main_#t~mem11, main_#t~mem14, main_#t~mem12, main_#t~short13, main_#t~post10, main_#t~mem16, main_#t~mem17, main_#t~post15, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 0; 1305#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 1316#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 1337#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 1336#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 1334#L17-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 1332#L17-4 main_~j~0 := 1; 1330#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 1324#L22-5 main_#t~short13 := main_~i~0 >= 0; 1306#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 1307#L22-3 assume !main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 1327#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 1298#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 1299#L19-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 1281#L19-4 main_~k~0 := 1; 1282#L29-3 [2020-10-26 04:46:58,038 INFO L796 eck$LassoCheckResult]: Loop: 1282#L29-3 assume !!(main_~k~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem16 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * (main_~k~0 - 1), 4);call main_#t~mem17 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~k~0, 4);__VERIFIER_assert_#in~cond := (if main_#t~mem16 <= main_#t~mem17 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1283#L6 assume !(0 == __VERIFIER_assert_~cond); 1293#L6-2 havoc main_#t~mem17;havoc main_#t~mem16; 1292#L29-2 main_#t~post15 := main_~k~0;main_~k~0 := 1 + main_#t~post15;havoc main_#t~post15; 1282#L29-3 [2020-10-26 04:46:58,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:46:58,039 INFO L82 PathProgramCache]: Analyzing trace with hash 660972959, now seen corresponding path program 1 times [2020-10-26 04:46:58,039 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:46:58,039 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896782667] [2020-10-26 04:46:58,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:46:58,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:58,084 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:58,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:58,124 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:58,131 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:46:58,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:46:58,135 INFO L82 PathProgramCache]: Analyzing trace with hash 2933516, now seen corresponding path program 2 times [2020-10-26 04:46:58,135 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:46:58,135 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936345729] [2020-10-26 04:46:58,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:46:58,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:58,143 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:58,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:58,148 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:58,150 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:46:58,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:46:58,151 INFO L82 PathProgramCache]: Analyzing trace with hash 183134634, now seen corresponding path program 1 times [2020-10-26 04:46:58,151 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:46:58,152 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146026978] [2020-10-26 04:46:58,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:46:58,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:58,181 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:58,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:46:58,214 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:46:58,231 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:46:59,404 WARN L193 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 187 DAG size of output: 144 [2020-10-26 04:46:59,988 WARN L193 SmtUtils]: Spent 572.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 105 [2020-10-26 04:46:59,991 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 04:46:59,992 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 04:46:59,992 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 04:46:59,992 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 04:46:59,992 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 04:46:59,992 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:46:59,992 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 04:46:59,993 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 04:46:59,993 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertion_sort-1.c_Iteration10_Lasso [2020-10-26 04:46:59,993 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 04:46:59,993 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 04:46:59,997 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 04:47:00,007 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 04:47:00,009 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 04:47:00,011 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 04:47:00,015 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 04:47:00,024 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 04:47:00,028 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 04:47:00,032 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 04:47:00,038 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 04:47:00,045 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 04:47:00,048 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 04:47:00,051 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 04:47:00,436 WARN L193 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2020-10-26 04:47:00,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:47:00,545 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 04:47:00,547 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 04:47:00,551 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 04:47:00,554 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 04:47:00,560 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 04:47:00,723 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2020-10-26 04:47:00,825 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2020-10-26 04:47:01,254 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 04:47:01,254 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 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 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:01,260 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 04:47:01,262 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:01,262 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:47:01,262 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:01,262 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:01,262 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:01,263 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:47:01,263 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:47:01,264 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 53 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 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:01,289 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 04:47:01,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:01,291 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:47:01,291 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:01,291 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:01,291 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:01,291 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:47:01,291 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:47:01,292 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 54 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 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:01,317 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 04:47:01,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:01,318 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:47:01,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:01,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:01,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:01,319 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:47:01,319 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:47:01,324 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 55 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 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:01,350 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:47:01,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:01,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:01,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:01,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:01,354 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:47:01,354 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:47:01,358 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 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:47:01,396 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 04:47:01,398 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:01,399 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:47:01,399 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:01,399 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:01,399 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:01,400 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:47:01,400 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:01,402 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 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:47:01,447 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 04:47:01,451 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:01,451 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:01,451 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:01,451 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:01,453 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:47:01,454 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:01,461 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 58 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 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:01,493 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 04:47:01,495 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:01,495 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:01,495 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:01,495 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:01,496 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:47:01,496 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:47:01,500 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 59 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 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:01,525 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 04:47:01,527 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:01,527 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:47:01,527 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:01,527 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:01,527 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:01,528 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:47:01,528 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:47:01,530 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 60 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 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:01,555 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 04:47:01,557 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:01,557 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:47:01,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:01,557 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:01,557 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:01,557 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:47:01,558 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:47:01,559 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 61 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 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:01,585 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 04:47:01,586 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:01,586 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:47:01,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:01,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:01,586 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:01,587 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:47:01,587 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:47:01,589 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 62 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 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:01,614 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 04:47:01,615 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:01,615 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:47:01,615 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:01,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:01,615 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:01,620 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:47:01,620 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:47:01,621 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 63 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 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:01,645 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 04:47:01,647 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:01,647 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:01,647 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:01,647 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:01,660 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:47:01,660 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:47:01,680 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 04:47:01,709 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2020-10-26 04:47:01,709 INFO L444 ModelExtractionUtils]: 8 out of 22 variables were initially zero. Simplification set additionally 10 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 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 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:01,712 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-26 04:47:01,714 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-26 04:47:01,714 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 04:47:01,714 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~#v~0.offset, v_rep(select #length ULTIMATE.start_main_~#v~0.base)_4, ULTIMATE.start_main_~k~0) = -1*ULTIMATE.start_main_~#v~0.offset + 1*v_rep(select #length ULTIMATE.start_main_~#v~0.base)_4 - 4*ULTIMATE.start_main_~k~0 Supporting invariants [] [2020-10-26 04:47:01,827 INFO L297 tatePredicateManager]: 18 out of 18 supporting invariants were superfluous and have been removed [2020-10-26 04:47:01,829 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-26 04:47:01,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:47:01,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:47:01,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-26 04:47:01,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:47:01,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:47:01,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-26 04:47:01,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:47:01,903 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 04:47:01,904 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 04:47:01,904 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 83 transitions. cyclomatic complexity: 26 Second operand 3 states. [2020-10-26 04:47:01,917 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 64 states and 83 transitions. cyclomatic complexity: 26. Second operand 3 states. Result 68 states and 88 transitions. Complement of second has 4 states. [2020-10-26 04:47:01,918 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 04:47:01,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-26 04:47:01,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2020-10-26 04:47:01,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 16 letters. Loop has 4 letters. [2020-10-26 04:47:01,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:47:01,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 20 letters. Loop has 4 letters. [2020-10-26 04:47:01,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:47:01,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 16 letters. Loop has 8 letters. [2020-10-26 04:47:01,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:47:01,920 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 88 transitions. [2020-10-26 04:47:01,921 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2020-10-26 04:47:01,922 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 45 states and 57 transitions. [2020-10-26 04:47:01,922 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-10-26 04:47:01,922 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-10-26 04:47:01,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 57 transitions. [2020-10-26 04:47:01,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:47:01,923 INFO L691 BuchiCegarLoop]: Abstraction has 45 states and 57 transitions. [2020-10-26 04:47:01,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 57 transitions. [2020-10-26 04:47:01,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-10-26 04:47:01,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-10-26 04:47:01,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2020-10-26 04:47:01,927 INFO L714 BuchiCegarLoop]: Abstraction has 45 states and 57 transitions. [2020-10-26 04:47:01,927 INFO L594 BuchiCegarLoop]: Abstraction has 45 states and 57 transitions. [2020-10-26 04:47:01,927 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-10-26 04:47:01,928 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 57 transitions. [2020-10-26 04:47:01,928 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2020-10-26 04:47:01,928 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:47:01,928 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:47:01,929 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 04:47:01,929 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-10-26 04:47:01,930 INFO L794 eck$LassoCheckResult]: Stem: 1589#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(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 1582#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet9, main_#t~post8, main_#t~mem11, main_#t~mem14, main_#t~mem12, main_#t~short13, main_#t~post10, main_#t~mem16, main_#t~mem17, main_#t~post15, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 0; 1583#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 1563#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 1564#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 1591#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 1596#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 1594#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 1593#L17-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 1590#L17-4 main_~j~0 := 1; 1569#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 1570#L22-5 main_#t~short13 := main_~i~0 >= 0; 1584#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 1585#L22-3 assume !main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 1600#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 1599#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 1598#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 1597#L22-5 [2020-10-26 04:47:01,930 INFO L796 eck$LassoCheckResult]: Loop: 1597#L22-5 main_#t~short13 := main_~i~0 >= 0; 1595#L22-1 assume !main_#t~short13; 1592#L22-3 assume !main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 1565#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 1566#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 1577#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 1597#L22-5 [2020-10-26 04:47:01,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:47:01,930 INFO L82 PathProgramCache]: Analyzing trace with hash -610476902, now seen corresponding path program 4 times [2020-10-26 04:47:01,931 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:47:01,931 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819268331] [2020-10-26 04:47:01,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:47:01,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:47:01,950 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:47:01,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:47:01,983 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:47:01,987 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:47:01,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:47:01,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1750331510, now seen corresponding path program 3 times [2020-10-26 04:47:01,988 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:47:01,988 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756767674] [2020-10-26 04:47:01,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:47:01,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:47:01,994 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:47:01,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:47:01,998 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:47:02,000 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:47:02,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:47:02,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1753926065, now seen corresponding path program 1 times [2020-10-26 04:47:02,001 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:47:02,001 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903684231] [2020-10-26 04:47:02,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:47:02,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:47:02,052 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-10-26 04:47:02,053 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903684231] [2020-10-26 04:47:02,053 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293637271] [2020-10-26 04:47:02,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 04:47:02,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:47:02,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-26 04:47:02,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:47:02,148 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:47:02,151 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-10-26 04:47:02,152 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 04:47:02,152 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-10-26 04:47:02,152 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243604875] [2020-10-26 04:47:02,257 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2020-10-26 04:47:02,303 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:47:02,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-26 04:47:02,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-26 04:47:02,304 INFO L87 Difference]: Start difference. First operand 45 states and 57 transitions. cyclomatic complexity: 17 Second operand 7 states. [2020-10-26 04:47:02,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:47:02,464 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2020-10-26 04:47:02,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-26 04:47:02,465 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 64 transitions. [2020-10-26 04:47:02,466 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-10-26 04:47:02,467 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 50 states and 64 transitions. [2020-10-26 04:47:02,467 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-10-26 04:47:02,467 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-10-26 04:47:02,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 64 transitions. [2020-10-26 04:47:02,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:47:02,467 INFO L691 BuchiCegarLoop]: Abstraction has 50 states and 64 transitions. [2020-10-26 04:47:02,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 64 transitions. [2020-10-26 04:47:02,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2020-10-26 04:47:02,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-10-26 04:47:02,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2020-10-26 04:47:02,471 INFO L714 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2020-10-26 04:47:02,472 INFO L594 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2020-10-26 04:47:02,472 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-10-26 04:47:02,472 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 45 transitions. [2020-10-26 04:47:02,472 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-26 04:47:02,473 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:47:02,473 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:47:02,473 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 04:47:02,474 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-26 04:47:02,474 INFO L794 eck$LassoCheckResult]: Stem: 1763#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(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 1757#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet9, main_#t~post8, main_#t~mem11, main_#t~mem14, main_#t~mem12, main_#t~short13, main_#t~post10, main_#t~mem16, main_#t~mem17, main_#t~post15, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 0; 1758#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 1766#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 1767#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 1742#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 1743#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 1769#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 1768#L17-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 1765#L17-4 main_~j~0 := 1; 1744#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 1745#L22-5 main_#t~short13 := main_~i~0 >= 0; 1772#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 1770#L22-3 assume !main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 1749#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 1750#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 1746#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 1748#L22-5 [2020-10-26 04:47:02,474 INFO L796 eck$LassoCheckResult]: Loop: 1748#L22-5 main_#t~short13 := main_~i~0 >= 0; 1751#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 1753#L22-3 assume !!main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 1754#L23 assume main_~i~0 < 2;call main_#t~mem14 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);call write~int(main_#t~mem14, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4);havoc main_#t~mem14; 1760#L23-2 main_~i~0 := main_~i~0 - 1; 1748#L22-5 [2020-10-26 04:47:02,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:47:02,475 INFO L82 PathProgramCache]: Analyzing trace with hash -610476902, now seen corresponding path program 5 times [2020-10-26 04:47:02,475 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:47:02,475 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082128407] [2020-10-26 04:47:02,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:47:02,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:47:02,497 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:47:02,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:47:02,513 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:47:02,517 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:47:02,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:47:02,518 INFO L82 PathProgramCache]: Analyzing trace with hash 56404392, now seen corresponding path program 2 times [2020-10-26 04:47:02,519 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:47:02,519 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014368531] [2020-10-26 04:47:02,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:47:02,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:47:02,523 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:47:02,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:47:02,525 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:47:02,527 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:47:02,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:47:02,528 INFO L82 PathProgramCache]: Analyzing trace with hash 2021573807, now seen corresponding path program 1 times [2020-10-26 04:47:02,528 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:47:02,528 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122159375] [2020-10-26 04:47:02,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:47:02,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:47:02,550 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:47:02,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:47:02,581 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:47:02,588 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:47:03,754 WARN L193 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 216 DAG size of output: 156 [2020-10-26 04:47:04,175 WARN L193 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 104 [2020-10-26 04:47:04,180 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 04:47:04,180 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 04:47:04,180 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 04:47:04,180 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 04:47:04,180 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 04:47:04,180 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:04,180 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 04:47:04,180 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 04:47:04,181 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertion_sort-1.c_Iteration12_Lasso [2020-10-26 04:47:04,181 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 04:47:04,181 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 04:47:04,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 04:47:04,188 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 04:47:04,197 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 04:47:04,200 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 04:47:04,203 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 04:47:04,206 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 04:47:04,209 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 04:47:04,627 WARN L193 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 72 [2020-10-26 04:47:04,745 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 04:47:04,748 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 04:47:04,752 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 04:47:04,755 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 04:47:04,758 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 04:47:04,761 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 04:47:04,768 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 04:47:04,770 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 04:47:04,774 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 04:47:04,777 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 04:47:04,781 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 04:47:05,297 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 04:47:05,297 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:47:05,314 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 04:47:05,316 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:05,316 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:05,316 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:05,316 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:05,318 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:47:05,318 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:05,325 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 67 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 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:05,356 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:47:05,358 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:05,358 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:05,358 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:05,358 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:05,360 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:47:05,360 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:47:05,362 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 68 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 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:05,387 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 04:47:05,389 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:05,389 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:47:05,389 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:05,389 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:05,389 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:05,389 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:47:05,389 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:47:05,390 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 69 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 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:05,415 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 04:47:05,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:05,416 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:47:05,416 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:05,416 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:05,416 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:05,417 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:47:05,417 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:47:05,418 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 70 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 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:05,444 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 04:47:05,446 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:05,446 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:47:05,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:05,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:05,446 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:05,447 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:47:05,447 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:47:05,454 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 71 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 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:05,483 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 04:47:05,485 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:05,485 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:47:05,485 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:05,485 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:05,485 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:05,485 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:47:05,485 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:47:05,492 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 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:47:05,528 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 04:47:05,530 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:05,530 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:05,530 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:05,530 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:05,533 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:47:05,533 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:05,541 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 73 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 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:05,563 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 04:47:05,565 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:05,565 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:05,565 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:05,565 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:05,568 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:47:05,569 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:47:05,580 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 74 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 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:05,620 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 04:47:05,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:05,622 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:05,622 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:05,622 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:05,624 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:47:05,624 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:47:05,631 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 75 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 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:05,655 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 04:47:05,656 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:05,656 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:05,656 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:05,656 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:05,660 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:47:05,661 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:47:05,665 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 76 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 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:05,690 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 04:47:05,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:05,692 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:05,692 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:05,692 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:05,703 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:47:05,703 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:47:05,715 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 04:47:05,737 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-10-26 04:47:05,737 INFO L444 ModelExtractionUtils]: 5 out of 19 variables were initially zero. Simplification set additionally 11 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 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 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:05,751 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-26 04:47:05,753 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-26 04:47:05,754 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 04:47:05,754 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~j~0) = 4*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~j~0 Supporting invariants [] [2020-10-26 04:47:05,876 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2020-10-26 04:47:05,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:47:05,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:47:05,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-26 04:47:05,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:47:05,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:47:05,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-26 04:47:05,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:47:06,044 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 04:47:06,045 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2020-10-26 04:47:06,046 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 45 transitions. cyclomatic complexity: 14 Second operand 6 states. [2020-10-26 04:47:06,092 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 45 transitions. cyclomatic complexity: 14. Second operand 6 states. Result 35 states and 45 transitions. Complement of second has 4 states. [2020-10-26 04:47:06,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2020-10-26 04:47:06,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-26 04:47:06,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2020-10-26 04:47:06,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 17 letters. Loop has 5 letters. [2020-10-26 04:47:06,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:47:06,094 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-26 04:47:06,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:47:06,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:47:06,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-26 04:47:06,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:47:06,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:47:06,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-26 04:47:06,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:47:06,257 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 04:47:06,258 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 3 loop predicates [2020-10-26 04:47:06,258 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 45 transitions. cyclomatic complexity: 14 Second operand 6 states. [2020-10-26 04:47:06,304 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 45 transitions. cyclomatic complexity: 14. Second operand 6 states. Result 35 states and 45 transitions. Complement of second has 4 states. [2020-10-26 04:47:06,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2020-10-26 04:47:06,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-26 04:47:06,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2020-10-26 04:47:06,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 17 letters. Loop has 5 letters. [2020-10-26 04:47:06,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:47:06,308 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-26 04:47:06,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:47:06,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:47:06,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-26 04:47:06,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:47:06,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:47:06,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-26 04:47:06,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:47:06,476 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 04:47:06,477 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2020-10-26 04:47:06,477 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 45 transitions. cyclomatic complexity: 14 Second operand 6 states. [2020-10-26 04:47:06,660 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 45 transitions. cyclomatic complexity: 14. Second operand 6 states. Result 73 states and 92 transitions. Complement of second has 12 states. [2020-10-26 04:47:06,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 3 stem states 3 non-accepting loop states 2 accepting loop states [2020-10-26 04:47:06,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-26 04:47:06,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2020-10-26 04:47:06,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 53 transitions. Stem has 17 letters. Loop has 5 letters. [2020-10-26 04:47:06,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:47:06,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 53 transitions. Stem has 22 letters. Loop has 5 letters. [2020-10-26 04:47:06,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:47:06,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 53 transitions. Stem has 17 letters. Loop has 10 letters. [2020-10-26 04:47:06,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:47:06,666 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 92 transitions. [2020-10-26 04:47:06,669 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-26 04:47:06,669 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 56 states and 70 transitions. [2020-10-26 04:47:06,670 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-10-26 04:47:06,670 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-10-26 04:47:06,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 70 transitions. [2020-10-26 04:47:06,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:47:06,670 INFO L691 BuchiCegarLoop]: Abstraction has 56 states and 70 transitions. [2020-10-26 04:47:06,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 70 transitions. [2020-10-26 04:47:06,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 47. [2020-10-26 04:47:06,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-10-26 04:47:06,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2020-10-26 04:47:06,679 INFO L714 BuchiCegarLoop]: Abstraction has 47 states and 61 transitions. [2020-10-26 04:47:06,679 INFO L594 BuchiCegarLoop]: Abstraction has 47 states and 61 transitions. [2020-10-26 04:47:06,679 INFO L427 BuchiCegarLoop]: ======== Iteration 13============ [2020-10-26 04:47:06,679 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 61 transitions. [2020-10-26 04:47:06,679 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-26 04:47:06,679 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:47:06,679 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:47:06,680 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2020-10-26 04:47:06,680 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-26 04:47:06,681 INFO L794 eck$LassoCheckResult]: Stem: 2296#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(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 2291#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet9, main_#t~post8, main_#t~mem11, main_#t~mem14, main_#t~mem12, main_#t~short13, main_#t~post10, main_#t~mem16, main_#t~mem17, main_#t~post15, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 0; 2292#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 2275#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 2276#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 2300#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 2303#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 2302#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 2301#L17-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 2299#L17-4 main_~j~0 := 1; 2277#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 2278#L22-5 main_#t~short13 := main_~i~0 >= 0; 2308#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 2307#L22-3 assume !main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 2306#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 2305#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 2279#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 2280#L22-5 main_#t~short13 := main_~i~0 >= 0; 2293#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 2290#L22-3 assume !main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 2281#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 2282#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 2287#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 2283#L22-5 [2020-10-26 04:47:06,681 INFO L796 eck$LassoCheckResult]: Loop: 2283#L22-5 main_#t~short13 := main_~i~0 >= 0; 2284#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 2288#L22-3 assume !!main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 2289#L23 assume main_~i~0 < 2;call main_#t~mem14 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);call write~int(main_#t~mem14, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4);havoc main_#t~mem14; 2294#L23-2 main_~i~0 := main_~i~0 - 1; 2283#L22-5 [2020-10-26 04:47:06,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:47:06,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1755773107, now seen corresponding path program 6 times [2020-10-26 04:47:06,684 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:47:06,684 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305330978] [2020-10-26 04:47:06,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:47:06,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:47:07,139 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2020-10-26 04:47:07,229 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:47:07,230 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305330978] [2020-10-26 04:47:07,230 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987959157] [2020-10-26 04:47:07,230 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 04:47:07,297 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2020-10-26 04:47:07,297 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-26 04:47:07,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 16 conjunts are in the unsatisfiable core [2020-10-26 04:47:07,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:47:07,606 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:47:07,607 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 04:47:07,607 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 18 [2020-10-26 04:47:07,609 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144480466] [2020-10-26 04:47:07,609 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 04:47:07,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:47:07,609 INFO L82 PathProgramCache]: Analyzing trace with hash 56404392, now seen corresponding path program 3 times [2020-10-26 04:47:07,609 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:47:07,609 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078343656] [2020-10-26 04:47:07,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:47:07,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:47:07,613 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:47:07,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:47:07,616 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:47:07,617 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:47:07,728 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2020-10-26 04:47:07,759 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:47:07,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-10-26 04:47:07,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2020-10-26 04:47:07,760 INFO L87 Difference]: Start difference. First operand 47 states and 61 transitions. cyclomatic complexity: 19 Second operand 19 states. [2020-10-26 04:47:08,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:47:08,847 INFO L93 Difference]: Finished difference Result 95 states and 122 transitions. [2020-10-26 04:47:08,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-26 04:47:08,849 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 95 states and 122 transitions. [2020-10-26 04:47:08,850 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-10-26 04:47:08,851 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 95 states to 69 states and 88 transitions. [2020-10-26 04:47:08,851 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-10-26 04:47:08,851 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-10-26 04:47:08,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 88 transitions. [2020-10-26 04:47:08,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:47:08,851 INFO L691 BuchiCegarLoop]: Abstraction has 69 states and 88 transitions. [2020-10-26 04:47:08,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 88 transitions. [2020-10-26 04:47:08,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 49. [2020-10-26 04:47:08,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-10-26 04:47:08,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2020-10-26 04:47:08,855 INFO L714 BuchiCegarLoop]: Abstraction has 49 states and 63 transitions. [2020-10-26 04:47:08,855 INFO L594 BuchiCegarLoop]: Abstraction has 49 states and 63 transitions. [2020-10-26 04:47:08,855 INFO L427 BuchiCegarLoop]: ======== Iteration 14============ [2020-10-26 04:47:08,855 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 63 transitions. [2020-10-26 04:47:08,855 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-26 04:47:08,856 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:47:08,856 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:47:08,856 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2020-10-26 04:47:08,856 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-26 04:47:08,857 INFO L794 eck$LassoCheckResult]: Stem: 2544#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(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 2539#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet9, main_#t~post8, main_#t~mem11, main_#t~mem14, main_#t~mem12, main_#t~short13, main_#t~post10, main_#t~mem16, main_#t~mem17, main_#t~post15, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 0; 2540#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 2523#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 2524#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 2547#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 2552#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 2551#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 2550#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 2549#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 2548#L17-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 2546#L17-4 main_~j~0 := 1; 2525#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 2526#L22-5 main_#t~short13 := main_~i~0 >= 0; 2557#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 2556#L22-3 assume !main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 2555#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 2554#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 2527#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 2528#L22-5 main_#t~short13 := main_~i~0 >= 0; 2541#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 2538#L22-3 assume !main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 2529#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 2530#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 2535#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 2531#L22-5 [2020-10-26 04:47:08,857 INFO L796 eck$LassoCheckResult]: Loop: 2531#L22-5 main_#t~short13 := main_~i~0 >= 0; 2532#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 2536#L22-3 assume !!main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 2537#L23 assume main_~i~0 < 2;call main_#t~mem14 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);call write~int(main_#t~mem14, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4);havoc main_#t~mem14; 2542#L23-2 main_~i~0 := main_~i~0 - 1; 2531#L22-5 [2020-10-26 04:47:08,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:47:08,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1134743541, now seen corresponding path program 7 times [2020-10-26 04:47:08,857 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:47:08,858 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996926112] [2020-10-26 04:47:08,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:47:08,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:47:08,887 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:47:08,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:47:08,913 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:47:08,917 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:47:08,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:47:08,918 INFO L82 PathProgramCache]: Analyzing trace with hash 56404392, now seen corresponding path program 4 times [2020-10-26 04:47:08,918 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:47:08,918 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059009778] [2020-10-26 04:47:08,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:47:08,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:47:08,922 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:47:08,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:47:08,925 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:47:08,927 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:47:08,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:47:08,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1926098910, now seen corresponding path program 2 times [2020-10-26 04:47:08,927 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:47:08,927 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943654586] [2020-10-26 04:47:08,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:47:08,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:47:08,986 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-10-26 04:47:08,987 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943654586] [2020-10-26 04:47:08,987 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714216556] [2020-10-26 04:47:08,987 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 04:47:09,058 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-26 04:47:09,058 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-26 04:47:09,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-26 04:47:09,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:47:09,079 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-10-26 04:47:09,079 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 04:47:09,080 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-10-26 04:47:09,080 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545134101] [2020-10-26 04:47:09,191 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2020-10-26 04:47:09,220 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:47:09,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-26 04:47:09,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-26 04:47:09,221 INFO L87 Difference]: Start difference. First operand 49 states and 63 transitions. cyclomatic complexity: 19 Second operand 7 states. [2020-10-26 04:47:09,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:47:09,366 INFO L93 Difference]: Finished difference Result 65 states and 81 transitions. [2020-10-26 04:47:09,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-26 04:47:09,367 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 81 transitions. [2020-10-26 04:47:09,368 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-10-26 04:47:09,369 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 65 states and 81 transitions. [2020-10-26 04:47:09,369 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-10-26 04:47:09,369 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-10-26 04:47:09,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 81 transitions. [2020-10-26 04:47:09,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:47:09,370 INFO L691 BuchiCegarLoop]: Abstraction has 65 states and 81 transitions. [2020-10-26 04:47:09,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 81 transitions. [2020-10-26 04:47:09,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 55. [2020-10-26 04:47:09,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-10-26 04:47:09,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 70 transitions. [2020-10-26 04:47:09,373 INFO L714 BuchiCegarLoop]: Abstraction has 55 states and 70 transitions. [2020-10-26 04:47:09,374 INFO L594 BuchiCegarLoop]: Abstraction has 55 states and 70 transitions. [2020-10-26 04:47:09,374 INFO L427 BuchiCegarLoop]: ======== Iteration 15============ [2020-10-26 04:47:09,374 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 70 transitions. [2020-10-26 04:47:09,374 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-26 04:47:09,374 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:47:09,374 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:47:09,375 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2020-10-26 04:47:09,375 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-26 04:47:09,375 INFO L794 eck$LassoCheckResult]: Stem: 2767#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(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 2759#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet9, main_#t~post8, main_#t~mem11, main_#t~mem14, main_#t~mem12, main_#t~short13, main_#t~post10, main_#t~mem16, main_#t~mem17, main_#t~post15, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 0; 2760#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 2772#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 2773#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 2742#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 2743#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 2777#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 2776#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 2775#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 2774#L17-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 2771#L17-4 main_~j~0 := 1; 2746#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 2747#L22-5 main_#t~short13 := main_~i~0 >= 0; 2782#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 2781#L22-3 assume !main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 2780#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 2779#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 2748#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 2749#L22-5 main_#t~short13 := main_~i~0 >= 0; 2793#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 2789#L22-3 assume !main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 2744#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 2745#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 2750#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 2778#L22-5 main_#t~short13 := main_~i~0 >= 0; 2764#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 2765#L22-3 assume !!main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 2768#L23 assume !(main_~i~0 < 2); 2761#L23-2 [2020-10-26 04:47:09,376 INFO L796 eck$LassoCheckResult]: Loop: 2761#L23-2 main_~i~0 := main_~i~0 - 1; 2751#L22-5 main_#t~short13 := main_~i~0 >= 0; 2752#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 2755#L22-3 assume !!main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 2756#L23 assume main_~i~0 < 2;call main_#t~mem14 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);call write~int(main_#t~mem14, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4);havoc main_#t~mem14; 2761#L23-2 [2020-10-26 04:47:09,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:47:09,376 INFO L82 PathProgramCache]: Analyzing trace with hash -353509773, now seen corresponding path program 1 times [2020-10-26 04:47:09,376 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:47:09,376 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633715574] [2020-10-26 04:47:09,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:47:09,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:47:09,400 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:47:09,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:47:09,425 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:47:09,430 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:47:09,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:47:09,431 INFO L82 PathProgramCache]: Analyzing trace with hash 72930612, now seen corresponding path program 5 times [2020-10-26 04:47:09,431 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:47:09,431 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035243101] [2020-10-26 04:47:09,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:47:09,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:47:09,434 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:47:09,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:47:09,436 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:47:09,437 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:47:09,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:47:09,438 INFO L82 PathProgramCache]: Analyzing trace with hash 2079206914, now seen corresponding path program 1 times [2020-10-26 04:47:09,438 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:47:09,438 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278993250] [2020-10-26 04:47:09,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:47:09,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:47:09,466 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:47:09,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:47:09,498 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:47:09,503 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:47:09,619 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2020-10-26 04:47:12,940 WARN L193 SmtUtils]: Spent 3.29 s on a formula simplification. DAG size of input: 311 DAG size of output: 204 [2020-10-26 04:47:13,532 WARN L193 SmtUtils]: Spent 558.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 117 [2020-10-26 04:47:13,536 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 04:47:13,536 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 04:47:13,536 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 04:47:13,536 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 04:47:13,536 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 04:47:13,536 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:13,536 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 04:47:13,536 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 04:47:13,537 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertion_sort-1.c_Iteration15_Lasso [2020-10-26 04:47:13,537 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 04:47:13,537 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 04:47:13,540 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 04:47:13,546 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 04:47:13,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:47:13,554 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 04:47:13,558 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 04:47:13,562 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 04:47:13,566 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 04:47:13,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:47:13,572 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 04:47:13,577 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 04:47:13,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:47:13,584 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 04:47:13,588 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 04:47:13,592 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 04:47:13,595 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 04:47:14,137 WARN L193 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 70 [2020-10-26 04:47:14,274 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2020-10-26 04:47:14,275 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 04:47:14,285 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 04:47:14,288 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 04:47:14,842 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 04:47:14,843 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 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 80 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:14,851 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 04:47:14,852 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:14,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:14,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:14,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:14,855 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:47:14,855 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:47:14,859 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 81 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 81 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:14,889 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 04:47:14,890 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:14,891 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:47:14,891 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:14,891 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:14,891 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:14,891 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:47:14,891 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:47:14,892 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 82 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 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:14,915 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 04:47:14,916 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:14,916 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:47:14,916 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:14,916 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:14,916 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:14,917 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:47:14,917 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:47:14,919 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 83 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 83 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:14,942 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 04:47:14,943 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:14,943 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:14,943 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:14,943 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:14,945 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:47:14,945 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:47:14,948 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 84 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 84 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:14,971 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 04:47:14,973 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:14,973 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:47:14,973 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:14,973 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:14,973 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:14,974 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:47:14,974 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:47:14,975 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 85 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 85 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:14,998 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 04:47:14,999 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:14,999 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:14,999 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:14,999 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:15,000 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:47:15,000 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:47:15,003 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 86 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 86 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:15,029 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 04:47:15,030 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:15,030 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:47:15,030 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:15,030 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:15,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:15,031 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:47:15,031 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:47:15,032 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 87 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 87 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:15,055 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 04:47:15,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:15,056 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:47:15,057 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:15,057 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:15,057 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:15,057 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:47:15,057 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:47:15,058 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 88 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 88 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:15,080 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 04:47:15,082 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:15,082 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:15,082 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:15,082 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:15,083 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:47:15,083 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:47:15,088 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 89 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 89 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:15,110 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 04:47:15,111 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:15,111 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:47:15,111 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:15,111 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:15,111 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:15,112 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:47:15,112 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:47:15,113 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 90 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 90 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:15,135 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 04:47:15,137 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:15,137 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:47:15,137 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:15,137 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:15,137 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:15,138 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:47:15,138 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:47:15,139 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 91 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 91 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:15,163 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 04:47:15,164 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:15,165 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:47:15,165 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:15,165 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:15,165 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:15,165 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:47:15,165 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:47:15,166 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 92 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 92 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:15,190 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 04:47:15,192 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:15,192 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:47:15,192 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:15,192 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:15,192 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:15,192 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:47:15,192 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:47:15,194 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 93 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 93 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:15,218 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 04:47:15,220 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:15,220 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:47:15,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:15,220 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:15,220 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:15,220 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:47:15,220 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:47:15,221 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 94 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:47:15,248 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 04:47:15,249 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:15,250 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:15,250 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:15,250 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:15,251 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:47:15,251 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 94 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:15,255 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 95 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 95 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:15,279 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 04:47:15,280 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:15,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:15,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:15,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:15,282 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:47:15,282 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:47:15,287 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 96 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 96 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:15,311 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 04:47:15,313 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:15,313 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:15,313 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:15,313 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:15,318 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:47:15,319 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:47:15,330 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 04:47:15,357 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2020-10-26 04:47:15,357 INFO L444 ModelExtractionUtils]: 5 out of 19 variables were initially zero. Simplification set additionally 12 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 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 97 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:15,359 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-26 04:47:15,362 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-26 04:47:15,362 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 04:47:15,362 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2020-10-26 04:47:15,505 INFO L297 tatePredicateManager]: 29 out of 29 supporting invariants were superfluous and have been removed [2020-10-26 04:47:15,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:47:15,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:47:15,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-26 04:47:15,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:47:15,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:47:15,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-26 04:47:15,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:47:15,663 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 04:47:15,664 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2020-10-26 04:47:15,664 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 55 states and 70 transitions. cyclomatic complexity: 20 Second operand 5 states. [2020-10-26 04:47:15,738 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 55 states and 70 transitions. cyclomatic complexity: 20. Second operand 5 states. Result 150 states and 193 transitions. Complement of second has 9 states. [2020-10-26 04:47:15,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-10-26 04:47:15,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-26 04:47:15,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2020-10-26 04:47:15,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 29 letters. Loop has 5 letters. [2020-10-26 04:47:15,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:47:15,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 34 letters. Loop has 5 letters. [2020-10-26 04:47:15,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:47:15,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 29 letters. Loop has 10 letters. [2020-10-26 04:47:15,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:47:15,743 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 150 states and 193 transitions. [2020-10-26 04:47:15,745 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-26 04:47:15,746 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 150 states to 119 states and 156 transitions. [2020-10-26 04:47:15,747 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-10-26 04:47:15,747 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-10-26 04:47:15,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 156 transitions. [2020-10-26 04:47:15,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:47:15,747 INFO L691 BuchiCegarLoop]: Abstraction has 119 states and 156 transitions. [2020-10-26 04:47:15,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 156 transitions. [2020-10-26 04:47:15,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 102. [2020-10-26 04:47:15,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-10-26 04:47:15,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 136 transitions. [2020-10-26 04:47:15,753 INFO L714 BuchiCegarLoop]: Abstraction has 102 states and 136 transitions. [2020-10-26 04:47:15,753 INFO L594 BuchiCegarLoop]: Abstraction has 102 states and 136 transitions. [2020-10-26 04:47:15,753 INFO L427 BuchiCegarLoop]: ======== Iteration 16============ [2020-10-26 04:47:15,753 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 136 transitions. [2020-10-26 04:47:15,754 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-26 04:47:15,754 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:47:15,754 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:47:15,755 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2020-10-26 04:47:15,756 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-26 04:47:15,756 INFO L794 eck$LassoCheckResult]: Stem: 3219#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(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 3211#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet9, main_#t~post8, main_#t~mem11, main_#t~mem14, main_#t~mem12, main_#t~short13, main_#t~post10, main_#t~mem16, main_#t~mem17, main_#t~post15, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 0; 3212#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 3224#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 3225#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 3194#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 3195#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 3229#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 3228#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 3227#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 3226#L17-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 3223#L17-4 main_~j~0 := 1; 3198#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 3199#L22-5 main_#t~short13 := main_~i~0 >= 0; 3253#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 3251#L22-3 assume !!main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 3246#L23 assume !(main_~i~0 < 2); 3248#L23-2 main_~i~0 := main_~i~0 - 1; 3254#L22-5 main_#t~short13 := main_~i~0 >= 0; 3255#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 3235#L22-3 assume !main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 3196#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 3197#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 3206#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 3272#L22-5 main_#t~short13 := main_~i~0 >= 0; 3274#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 3214#L22-3 assume !main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 3234#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 3233#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 3231#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 3202#L22-5 main_#t~short13 := main_~i~0 >= 0; 3203#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 3213#L22-3 assume !!main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 3220#L23 assume !(main_~i~0 < 2); 3215#L23-2 [2020-10-26 04:47:15,756 INFO L796 eck$LassoCheckResult]: Loop: 3215#L23-2 main_~i~0 := main_~i~0 - 1; 3216#L22-5 main_#t~short13 := main_~i~0 >= 0; 3230#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 3207#L22-3 assume !!main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 3208#L23 assume main_~i~0 < 2;call main_#t~mem14 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);call write~int(main_#t~mem14, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4);havoc main_#t~mem14; 3215#L23-2 [2020-10-26 04:47:15,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:47:15,757 INFO L82 PathProgramCache]: Analyzing trace with hash -362290672, now seen corresponding path program 1 times [2020-10-26 04:47:15,757 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:47:15,757 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135590919] [2020-10-26 04:47:15,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:47:15,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:47:15,798 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-10-26 04:47:15,799 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135590919] [2020-10-26 04:47:15,799 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:47:15,799 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 04:47:15,799 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539617300] [2020-10-26 04:47:15,800 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 04:47:15,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:47:15,800 INFO L82 PathProgramCache]: Analyzing trace with hash 72930612, now seen corresponding path program 6 times [2020-10-26 04:47:15,800 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:47:15,800 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640330578] [2020-10-26 04:47:15,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:47:15,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:47:15,805 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:47:15,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:47:15,808 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:47:15,809 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:47:15,914 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2020-10-26 04:47:15,947 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:47:15,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 04:47:15,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 04:47:15,948 INFO L87 Difference]: Start difference. First operand 102 states and 136 transitions. cyclomatic complexity: 44 Second operand 4 states. [2020-10-26 04:47:16,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:47:16,002 INFO L93 Difference]: Finished difference Result 80 states and 104 transitions. [2020-10-26 04:47:16,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 04:47:16,004 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 104 transitions. [2020-10-26 04:47:16,005 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-26 04:47:16,006 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 80 states and 104 transitions. [2020-10-26 04:47:16,006 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-10-26 04:47:16,006 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-10-26 04:47:16,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 104 transitions. [2020-10-26 04:47:16,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:47:16,007 INFO L691 BuchiCegarLoop]: Abstraction has 80 states and 104 transitions. [2020-10-26 04:47:16,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 104 transitions. [2020-10-26 04:47:16,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2020-10-26 04:47:16,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-10-26 04:47:16,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 104 transitions. [2020-10-26 04:47:16,011 INFO L714 BuchiCegarLoop]: Abstraction has 80 states and 104 transitions. [2020-10-26 04:47:16,011 INFO L594 BuchiCegarLoop]: Abstraction has 80 states and 104 transitions. [2020-10-26 04:47:16,011 INFO L427 BuchiCegarLoop]: ======== Iteration 17============ [2020-10-26 04:47:16,011 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 80 states and 104 transitions. [2020-10-26 04:47:16,012 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-26 04:47:16,012 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:47:16,013 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:47:16,014 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2020-10-26 04:47:16,014 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-26 04:47:16,014 INFO L794 eck$LassoCheckResult]: Stem: 3410#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(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 3404#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet9, main_#t~post8, main_#t~mem11, main_#t~mem14, main_#t~mem12, main_#t~short13, main_#t~post10, main_#t~mem16, main_#t~mem17, main_#t~post15, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 0; 3405#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 3414#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 3415#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 3385#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 3386#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 3421#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 3418#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 3417#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 3416#L17-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 3413#L17-4 main_~j~0 := 1; 3387#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 3388#L22-5 main_#t~short13 := main_~i~0 >= 0; 3447#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 3427#L22-3 assume !main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 3428#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 3397#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 3398#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 3449#L22-5 main_#t~short13 := main_~i~0 >= 0; 3433#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 3437#L22-3 assume !!main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 3438#L23 assume !(main_~i~0 < 2); 3446#L23-2 main_~i~0 := main_~i~0 - 1; 3440#L22-5 main_#t~short13 := main_~i~0 >= 0; 3441#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 3407#L22-3 assume !main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 3426#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 3425#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 3423#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 3422#L22-5 main_#t~short13 := main_~i~0 >= 0; 3420#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 3419#L22-3 assume !!main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 3411#L23 assume !(main_~i~0 < 2); 3408#L23-2 [2020-10-26 04:47:16,014 INFO L796 eck$LassoCheckResult]: Loop: 3408#L23-2 main_~i~0 := main_~i~0 - 1; 3393#L22-5 main_#t~short13 := main_~i~0 >= 0; 3394#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 3399#L22-3 assume !!main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 3400#L23 assume main_~i~0 < 2;call main_#t~mem14 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);call write~int(main_#t~mem14, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4);havoc main_#t~mem14; 3408#L23-2 [2020-10-26 04:47:16,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:47:16,015 INFO L82 PathProgramCache]: Analyzing trace with hash -247927222, now seen corresponding path program 2 times [2020-10-26 04:47:16,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:47:16,015 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719494313] [2020-10-26 04:47:16,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:47:16,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:47:16,061 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-10-26 04:47:16,061 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719494313] [2020-10-26 04:47:16,061 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804591794] [2020-10-26 04:47:16,062 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 04:47:16,124 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-26 04:47:16,124 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-26 04:47:16,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-26 04:47:16,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:47:16,146 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-10-26 04:47:16,146 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 04:47:16,146 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-10-26 04:47:16,147 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513932256] [2020-10-26 04:47:16,147 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 04:47:16,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:47:16,147 INFO L82 PathProgramCache]: Analyzing trace with hash 72930612, now seen corresponding path program 7 times [2020-10-26 04:47:16,147 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:47:16,148 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354790729] [2020-10-26 04:47:16,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:47:16,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:47:16,151 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:47:16,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:47:16,153 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:47:16,155 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:47:16,289 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:47:16,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-26 04:47:16,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-26 04:47:16,291 INFO L87 Difference]: Start difference. First operand 80 states and 104 transitions. cyclomatic complexity: 32 Second operand 6 states. [2020-10-26 04:47:16,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:47:16,398 INFO L93 Difference]: Finished difference Result 99 states and 123 transitions. [2020-10-26 04:47:16,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-26 04:47:16,400 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 123 transitions. [2020-10-26 04:47:16,401 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-10-26 04:47:16,402 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 99 states and 123 transitions. [2020-10-26 04:47:16,402 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2020-10-26 04:47:16,402 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2020-10-26 04:47:16,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 123 transitions. [2020-10-26 04:47:16,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:47:16,402 INFO L691 BuchiCegarLoop]: Abstraction has 99 states and 123 transitions. [2020-10-26 04:47:16,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 123 transitions. [2020-10-26 04:47:16,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 89. [2020-10-26 04:47:16,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-10-26 04:47:16,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 112 transitions. [2020-10-26 04:47:16,406 INFO L714 BuchiCegarLoop]: Abstraction has 89 states and 112 transitions. [2020-10-26 04:47:16,407 INFO L594 BuchiCegarLoop]: Abstraction has 89 states and 112 transitions. [2020-10-26 04:47:16,407 INFO L427 BuchiCegarLoop]: ======== Iteration 18============ [2020-10-26 04:47:16,407 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 112 transitions. [2020-10-26 04:47:16,408 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-10-26 04:47:16,408 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:47:16,408 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:47:16,409 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2020-10-26 04:47:16,409 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-26 04:47:16,410 INFO L794 eck$LassoCheckResult]: Stem: 3699#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(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 3693#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet9, main_#t~post8, main_#t~mem11, main_#t~mem14, main_#t~mem12, main_#t~short13, main_#t~post10, main_#t~mem16, main_#t~mem17, main_#t~post15, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 0; 3694#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 3705#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 3706#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 3676#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 3677#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 3710#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 3709#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 3708#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 3707#L17-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 3704#L17-4 main_~j~0 := 1; 3678#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 3679#L22-5 main_#t~short13 := main_~i~0 >= 0; 3736#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 3735#L22-3 assume !main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 3734#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 3733#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 3680#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 3681#L22-5 main_#t~short13 := main_~i~0 >= 0; 3725#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 3722#L22-3 assume !main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 3682#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 3683#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 3688#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 3732#L22-5 main_#t~short13 := main_~i~0 >= 0; 3726#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 3727#L22-3 assume !!main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 3764#L23 assume !(main_~i~0 < 2); 3763#L23-2 main_~i~0 := main_~i~0 - 1; 3744#L22-5 main_#t~short13 := main_~i~0 >= 0; 3695#L22-1 assume !main_#t~short13; 3696#L22-3 assume !main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 3721#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 3720#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 3718#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 3716#L22-5 main_#t~short13 := main_~i~0 >= 0; 3714#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 3712#L22-3 assume !!main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 3700#L23 assume !(main_~i~0 < 2); 3701#L23-2 [2020-10-26 04:47:16,410 INFO L796 eck$LassoCheckResult]: Loop: 3701#L23-2 main_~i~0 := main_~i~0 - 1; 3717#L22-5 main_#t~short13 := main_~i~0 >= 0; 3715#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 3713#L22-3 assume !!main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 3711#L23 assume !(main_~i~0 < 2); 3701#L23-2 [2020-10-26 04:47:16,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:47:16,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1974025145, now seen corresponding path program 1 times [2020-10-26 04:47:16,411 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:47:16,411 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602288469] [2020-10-26 04:47:16,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:47:16,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:47:16,454 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2020-10-26 04:47:16,455 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602288469] [2020-10-26 04:47:16,455 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:47:16,455 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-26 04:47:16,455 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329820761] [2020-10-26 04:47:16,455 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 04:47:16,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:47:16,456 INFO L82 PathProgramCache]: Analyzing trace with hash 72930614, now seen corresponding path program 1 times [2020-10-26 04:47:16,456 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:47:16,456 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790744661] [2020-10-26 04:47:16,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:47:16,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:47:16,459 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:47:16,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:47:16,461 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:47:16,462 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:47:16,545 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:47:16,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 04:47:16,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-26 04:47:16,546 INFO L87 Difference]: Start difference. First operand 89 states and 112 transitions. cyclomatic complexity: 32 Second operand 5 states. [2020-10-26 04:47:16,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:47:16,612 INFO L93 Difference]: Finished difference Result 99 states and 121 transitions. [2020-10-26 04:47:16,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 04:47:16,614 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 121 transitions. [2020-10-26 04:47:16,615 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-10-26 04:47:16,616 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 96 states and 117 transitions. [2020-10-26 04:47:16,616 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-10-26 04:47:16,616 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-10-26 04:47:16,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 96 states and 117 transitions. [2020-10-26 04:47:16,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:47:16,616 INFO L691 BuchiCegarLoop]: Abstraction has 96 states and 117 transitions. [2020-10-26 04:47:16,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states and 117 transitions. [2020-10-26 04:47:16,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 87. [2020-10-26 04:47:16,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-10-26 04:47:16,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 107 transitions. [2020-10-26 04:47:16,620 INFO L714 BuchiCegarLoop]: Abstraction has 87 states and 107 transitions. [2020-10-26 04:47:16,620 INFO L594 BuchiCegarLoop]: Abstraction has 87 states and 107 transitions. [2020-10-26 04:47:16,620 INFO L427 BuchiCegarLoop]: ======== Iteration 19============ [2020-10-26 04:47:16,620 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 87 states and 107 transitions. [2020-10-26 04:47:16,621 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-10-26 04:47:16,621 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:47:16,621 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:47:16,622 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2020-10-26 04:47:16,622 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-26 04:47:16,623 INFO L794 eck$LassoCheckResult]: Stem: 3898#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(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 3892#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet9, main_#t~post8, main_#t~mem11, main_#t~mem14, main_#t~mem12, main_#t~short13, main_#t~post10, main_#t~mem16, main_#t~mem17, main_#t~post15, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 0; 3893#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 3903#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 3904#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 3874#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 3875#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 3908#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 3907#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 3906#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 3905#L17-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 3902#L17-4 main_~j~0 := 1; 3878#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 3879#L22-5 main_#t~short13 := main_~i~0 >= 0; 3935#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 3921#L22-3 assume !main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 3922#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 3882#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 3883#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 3931#L22-5 main_#t~short13 := main_~i~0 >= 0; 3932#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 3926#L22-3 assume !main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 3876#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 3877#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 3880#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 3881#L22-5 main_#t~short13 := main_~i~0 >= 0; 3923#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 3924#L22-3 assume !!main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 3900#L23 assume !(main_~i~0 < 2); 3901#L23-2 main_~i~0 := main_~i~0 - 1; 3960#L22-5 main_#t~short13 := main_~i~0 >= 0; 3959#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 3958#L22-3 assume !main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 3920#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 3919#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 3917#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 3915#L22-5 main_#t~short13 := main_~i~0 >= 0; 3914#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 3911#L22-3 assume !!main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 3899#L23 assume !(main_~i~0 < 2); 3894#L23-2 [2020-10-26 04:47:16,623 INFO L796 eck$LassoCheckResult]: Loop: 3894#L23-2 main_~i~0 := main_~i~0 - 1; 3884#L22-5 main_#t~short13 := main_~i~0 >= 0; 3885#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 3888#L22-3 assume !!main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 3889#L23 assume !(main_~i~0 < 2); 3894#L23-2 [2020-10-26 04:47:16,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:47:16,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1293966775, now seen corresponding path program 3 times [2020-10-26 04:47:16,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:47:16,624 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225216026] [2020-10-26 04:47:16,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:47:16,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:47:16,819 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2020-10-26 04:47:17,284 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 24 proven. 32 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-26 04:47:17,285 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225216026] [2020-10-26 04:47:17,285 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630338498] [2020-10-26 04:47:17,285 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 04:47:17,381 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2020-10-26 04:47:17,382 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-26 04:47:17,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 18 conjunts are in the unsatisfiable core [2020-10-26 04:47:17,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:47:17,396 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2020-10-26 04:47:17,396 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:47:17,427 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:47:17,434 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2020-10-26 04:47:17,434 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-26 04:47:17,462 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:47:17,462 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2020-10-26 04:47:17,462 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:46 [2020-10-26 04:47:17,795 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 04:47:18,167 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 32 proven. 19 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-26 04:47:18,168 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 04:47:18,168 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2020-10-26 04:47:18,169 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375585904] [2020-10-26 04:47:18,169 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 04:47:18,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:47:18,170 INFO L82 PathProgramCache]: Analyzing trace with hash 72930614, now seen corresponding path program 2 times [2020-10-26 04:47:18,170 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:47:18,170 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378440297] [2020-10-26 04:47:18,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:47:18,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:47:18,174 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:47:18,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:47:18,177 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:47:18,178 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:47:18,284 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:47:18,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-10-26 04:47:18,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2020-10-26 04:47:18,285 INFO L87 Difference]: Start difference. First operand 87 states and 107 transitions. cyclomatic complexity: 29 Second operand 21 states. [2020-10-26 04:47:19,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:47:19,990 INFO L93 Difference]: Finished difference Result 141 states and 172 transitions. [2020-10-26 04:47:19,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-26 04:47:19,992 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 141 states and 172 transitions. [2020-10-26 04:47:19,993 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-10-26 04:47:19,994 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 141 states to 90 states and 110 transitions. [2020-10-26 04:47:19,994 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2020-10-26 04:47:19,994 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2020-10-26 04:47:19,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 110 transitions. [2020-10-26 04:47:19,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:47:19,994 INFO L691 BuchiCegarLoop]: Abstraction has 90 states and 110 transitions. [2020-10-26 04:47:19,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 110 transitions. [2020-10-26 04:47:19,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2020-10-26 04:47:19,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-10-26 04:47:19,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 109 transitions. [2020-10-26 04:47:19,997 INFO L714 BuchiCegarLoop]: Abstraction has 89 states and 109 transitions. [2020-10-26 04:47:19,997 INFO L594 BuchiCegarLoop]: Abstraction has 89 states and 109 transitions. [2020-10-26 04:47:19,998 INFO L427 BuchiCegarLoop]: ======== Iteration 20============ [2020-10-26 04:47:19,998 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 109 transitions. [2020-10-26 04:47:19,999 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-10-26 04:47:19,999 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:47:19,999 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:47:20,000 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2020-10-26 04:47:20,000 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-26 04:47:20,000 INFO L794 eck$LassoCheckResult]: Stem: 4287#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(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 4281#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet9, main_#t~post8, main_#t~mem11, main_#t~mem14, main_#t~mem12, main_#t~short13, main_#t~post10, main_#t~mem16, main_#t~mem17, main_#t~post15, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 0; 4282#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 4292#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 4293#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 4263#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 4264#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 4299#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 4298#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 4297#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 4296#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 4295#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 4294#L17-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 4291#L17-4 main_~j~0 := 1; 4265#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 4266#L22-5 main_#t~short13 := main_~i~0 >= 0; 4324#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 4323#L22-3 assume !main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 4269#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 4270#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 4267#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 4268#L22-5 main_#t~short13 := main_~i~0 >= 0; 4317#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 4313#L22-3 assume !main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 4314#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 4275#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 4276#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 4321#L22-5 main_#t~short13 := main_~i~0 >= 0; 4322#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 4345#L22-3 assume !!main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 4289#L23 assume !(main_~i~0 < 2); 4290#L23-2 main_~i~0 := main_~i~0 - 1; 4337#L22-5 main_#t~short13 := main_~i~0 >= 0; 4335#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 4336#L22-3 assume !main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 4311#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 4310#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 4308#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 4306#L22-5 main_#t~short13 := main_~i~0 >= 0; 4304#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 4302#L22-3 assume !!main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 4288#L23 assume !(main_~i~0 < 2); 4285#L23-2 [2020-10-26 04:47:20,001 INFO L796 eck$LassoCheckResult]: Loop: 4285#L23-2 main_~i~0 := main_~i~0 - 1; 4271#L22-5 main_#t~short13 := main_~i~0 >= 0; 4272#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 4277#L22-3 assume !!main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 4278#L23 assume !(main_~i~0 < 2); 4285#L23-2 [2020-10-26 04:47:20,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:47:20,001 INFO L82 PathProgramCache]: Analyzing trace with hash 3606713, now seen corresponding path program 4 times [2020-10-26 04:47:20,001 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:47:20,001 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807841672] [2020-10-26 04:47:20,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:47:20,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:47:20,071 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:47:20,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:47:20,128 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:47:20,134 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:47:20,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:47:20,135 INFO L82 PathProgramCache]: Analyzing trace with hash 72930614, now seen corresponding path program 3 times [2020-10-26 04:47:20,136 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:47:20,136 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861901255] [2020-10-26 04:47:20,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:47:20,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:47:20,139 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:47:20,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:47:20,141 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:47:20,143 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:47:20,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:47:20,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1866628990, now seen corresponding path program 5 times [2020-10-26 04:47:20,144 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:47:20,144 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642152703] [2020-10-26 04:47:20,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:47:20,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:47:20,182 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:47:20,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:47:20,221 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:47:20,228 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:47:27,477 WARN L193 SmtUtils]: Spent 7.17 s on a formula simplification. DAG size of input: 409 DAG size of output: 251 [2020-10-26 04:47:29,061 WARN L193 SmtUtils]: Spent 1.54 s on a formula simplification. DAG size of input: 157 DAG size of output: 123 [2020-10-26 04:47:29,066 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 04:47:29,066 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 04:47:29,066 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 04:47:29,066 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 04:47:29,067 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 04:47:29,067 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:29,067 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 04:47:29,067 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 04:47:29,067 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertion_sort-1.c_Iteration20_Lasso [2020-10-26 04:47:29,067 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 04:47:29,067 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 04:47:29,071 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 04:47:29,080 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 04:47:29,085 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 04:47:29,089 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 04:47:29,092 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 04:47:29,095 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 04:47:29,099 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 04:47:29,103 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 04:47:29,107 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 04:47:29,503 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2020-10-26 04:47:29,538 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 04:47:29,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:47:29,546 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 04:47:29,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:47:29,554 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 04:47:29,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:47:29,563 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 04:47:29,566 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 04:47:29,570 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 04:47:29,747 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2020-10-26 04:47:30,158 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 04:47:30,158 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 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 100 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:30,161 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 04:47:30,162 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:30,162 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:30,162 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:30,162 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:30,164 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:47:30,164 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:47:30,166 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 101 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 101 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:30,189 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 04:47:30,191 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:30,191 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:47:30,191 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:30,191 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:30,192 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:30,192 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:47:30,192 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:47:30,193 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 102 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 102 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:30,216 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 04:47:30,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:30,217 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:47:30,217 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:30,217 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:30,218 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:30,218 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:47:30,218 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:47:30,219 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 103 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 103 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:30,242 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 04:47:30,243 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:30,243 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:47:30,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:30,244 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:30,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:30,244 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:47:30,244 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:47:30,245 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 104 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 104 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:30,267 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 04:47:30,268 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:30,268 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:47:30,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:30,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:30,269 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:30,269 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:47:30,269 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:47:30,270 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 105 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 105 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:30,292 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 04:47:30,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:30,293 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:30,293 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:30,293 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:30,295 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:47:30,295 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:47:30,299 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 106 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 106 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:30,321 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 04:47:30,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:30,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:30,322 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:30,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:30,324 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:47:30,324 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:47:30,327 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 107 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:47:30,350 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 107 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:30,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:30,352 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:47:30,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:30,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:30,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:30,353 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:47:30,353 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:47:30,354 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 108 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 108 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:30,376 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 04:47:30,378 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:30,378 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:47:30,378 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:30,378 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:30,378 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:30,378 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:47:30,378 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:47:30,379 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 109 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 109 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:30,402 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 04:47:30,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:30,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:30,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:30,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:30,405 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:47:30,405 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:47:30,409 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 110 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 110 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:30,432 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 04:47:30,433 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:30,433 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:47:30,434 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:30,434 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:30,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:30,434 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:47:30,434 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:47:30,435 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 111 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 111 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:30,460 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 04:47:30,462 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:30,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:30,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:30,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:30,478 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:47:30,478 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:47:30,481 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 112 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 112 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:30,504 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 04:47:30,505 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:30,506 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:47:30,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:30,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:30,506 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:30,506 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:47:30,506 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:47:30,508 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 113 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 113 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:30,532 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 04:47:30,533 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:30,533 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:47:30,534 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:30,534 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:30,534 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:30,534 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:47:30,534 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:47:30,535 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 114 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 114 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:30,558 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 04:47:30,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:30,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:30,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:30,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:30,563 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:47:30,563 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:47:30,577 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 04:47:30,599 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2020-10-26 04:47:30,599 INFO L444 ModelExtractionUtils]: 7 out of 19 variables were initially zero. Simplification set additionally 10 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 115 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 115 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:30,601 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-26 04:47:30,603 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-26 04:47:30,603 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 04:47:30,603 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2020-10-26 04:47:30,718 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2020-10-26 04:47:30,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:47:30,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:47:30,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-26 04:47:30,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:47:30,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:47:30,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-26 04:47:30,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:47:30,809 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 04:47:30,810 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 04:47:30,810 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 89 states and 109 transitions. cyclomatic complexity: 29 Second operand 3 states. [2020-10-26 04:47:30,859 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 89 states and 109 transitions. cyclomatic complexity: 29. Second operand 3 states. Result 110 states and 135 transitions. Complement of second has 5 states. [2020-10-26 04:47:30,861 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 04:47:30,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-26 04:47:30,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2020-10-26 04:47:30,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 42 letters. Loop has 5 letters. [2020-10-26 04:47:30,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:47:30,862 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-26 04:47:30,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:47:30,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:47:30,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-26 04:47:30,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:47:30,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:47:30,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-26 04:47:30,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:47:30,960 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 04:47:30,961 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-26 04:47:30,961 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 89 states and 109 transitions. cyclomatic complexity: 29 Second operand 3 states. [2020-10-26 04:47:30,998 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 89 states and 109 transitions. cyclomatic complexity: 29. Second operand 3 states. Result 110 states and 135 transitions. Complement of second has 5 states. [2020-10-26 04:47:30,999 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 04:47:31,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-26 04:47:31,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2020-10-26 04:47:31,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 42 letters. Loop has 5 letters. [2020-10-26 04:47:31,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:47:31,000 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-26 04:47:31,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:47:31,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:47:31,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-26 04:47:31,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:47:31,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:47:31,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-26 04:47:31,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:47:31,095 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 04:47:31,096 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-26 04:47:31,096 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 89 states and 109 transitions. cyclomatic complexity: 29 Second operand 3 states. [2020-10-26 04:47:31,139 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 89 states and 109 transitions. cyclomatic complexity: 29. Second operand 3 states. Result 128 states and 159 transitions. Complement of second has 4 states. [2020-10-26 04:47:31,141 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 04:47:31,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-26 04:47:31,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2020-10-26 04:47:31,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 42 letters. Loop has 5 letters. [2020-10-26 04:47:31,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:47:31,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 47 letters. Loop has 5 letters. [2020-10-26 04:47:31,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:47:31,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 42 letters. Loop has 10 letters. [2020-10-26 04:47:31,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:47:31,143 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 128 states and 159 transitions. [2020-10-26 04:47:31,144 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-26 04:47:31,146 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 128 states to 105 states and 127 transitions. [2020-10-26 04:47:31,146 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-10-26 04:47:31,146 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2020-10-26 04:47:31,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 127 transitions. [2020-10-26 04:47:31,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:47:31,146 INFO L691 BuchiCegarLoop]: Abstraction has 105 states and 127 transitions. [2020-10-26 04:47:31,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 127 transitions. [2020-10-26 04:47:31,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 90. [2020-10-26 04:47:31,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-10-26 04:47:31,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 108 transitions. [2020-10-26 04:47:31,149 INFO L714 BuchiCegarLoop]: Abstraction has 90 states and 108 transitions. [2020-10-26 04:47:31,150 INFO L594 BuchiCegarLoop]: Abstraction has 90 states and 108 transitions. [2020-10-26 04:47:31,150 INFO L427 BuchiCegarLoop]: ======== Iteration 21============ [2020-10-26 04:47:31,150 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states and 108 transitions. [2020-10-26 04:47:31,151 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-26 04:47:31,151 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:47:31,151 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:47:31,152 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1] [2020-10-26 04:47:31,152 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-26 04:47:31,152 INFO L794 eck$LassoCheckResult]: Stem: 5272#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(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 5265#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet9, main_#t~post8, main_#t~mem11, main_#t~mem14, main_#t~mem12, main_#t~short13, main_#t~post10, main_#t~mem16, main_#t~mem17, main_#t~post15, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 0; 5266#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 5278#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 5279#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 5247#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 5248#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 5285#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 5284#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 5283#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 5282#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 5281#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 5280#L17-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 5277#L17-4 main_~j~0 := 1; 5249#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 5250#L22-5 main_#t~short13 := main_~i~0 >= 0; 5319#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 5318#L22-3 assume !main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 5253#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 5254#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 5251#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 5252#L22-5 main_#t~short13 := main_~i~0 >= 0; 5315#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 5298#L22-3 assume !main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 5299#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 5295#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 5296#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 5310#L22-5 main_#t~short13 := main_~i~0 >= 0; 5300#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 5301#L22-3 assume !!main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 5264#L23 assume !(main_~i~0 < 2); 5316#L23-2 main_~i~0 := main_~i~0 - 1; 5271#L22-5 main_#t~short13 := main_~i~0 >= 0; 5335#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 5334#L22-3 assume !main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 5297#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 5259#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 5260#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 5288#L22-5 main_#t~short13 := main_~i~0 >= 0; 5287#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 5286#L22-3 assume !!main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 5273#L23 assume !(main_~i~0 < 2); 5274#L23-2 main_~i~0 := main_~i~0 - 1; 5255#L22-5 [2020-10-26 04:47:31,153 INFO L796 eck$LassoCheckResult]: Loop: 5255#L22-5 main_#t~short13 := main_~i~0 >= 0; 5256#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 5261#L22-3 assume !!main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 5262#L23 assume main_~i~0 < 2;call main_#t~mem14 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);call write~int(main_#t~mem14, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4);havoc main_#t~mem14; 5269#L23-2 main_~i~0 := main_~i~0 - 1; 5255#L22-5 [2020-10-26 04:47:31,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:47:31,153 INFO L82 PathProgramCache]: Analyzing trace with hash 111808150, now seen corresponding path program 6 times [2020-10-26 04:47:31,153 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:47:31,153 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789695701] [2020-10-26 04:47:31,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:47:31,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:47:31,188 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:47:31,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:47:31,224 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:47:31,229 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:47:31,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:47:31,230 INFO L82 PathProgramCache]: Analyzing trace with hash 56404392, now seen corresponding path program 8 times [2020-10-26 04:47:31,230 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:47:31,231 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488643474] [2020-10-26 04:47:31,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:47:31,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:47:31,234 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:47:31,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:47:31,236 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:47:31,238 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:47:31,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:47:31,239 INFO L82 PathProgramCache]: Analyzing trace with hash 2030923827, now seen corresponding path program 2 times [2020-10-26 04:47:31,239 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:47:31,239 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226921706] [2020-10-26 04:47:31,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:47:31,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:47:31,320 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 13 proven. 47 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-10-26 04:47:31,320 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226921706] [2020-10-26 04:47:31,320 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252114687] [2020-10-26 04:47:31,320 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 04:47:31,406 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-26 04:47:31,407 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-26 04:47:31,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-26 04:47:31,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:47:31,441 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 29 proven. 31 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-10-26 04:47:31,441 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 04:47:31,441 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2020-10-26 04:47:31,442 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451690075] [2020-10-26 04:47:31,556 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2020-10-26 04:47:31,589 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:47:31,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-26 04:47:31,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-10-26 04:47:31,590 INFO L87 Difference]: Start difference. First operand 90 states and 108 transitions. cyclomatic complexity: 27 Second operand 9 states. [2020-10-26 04:47:31,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:47:31,822 INFO L93 Difference]: Finished difference Result 152 states and 177 transitions. [2020-10-26 04:47:31,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-26 04:47:31,823 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 152 states and 177 transitions. [2020-10-26 04:47:31,825 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-26 04:47:31,826 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 152 states to 145 states and 170 transitions. [2020-10-26 04:47:31,826 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-10-26 04:47:31,826 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-10-26 04:47:31,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 145 states and 170 transitions. [2020-10-26 04:47:31,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:47:31,827 INFO L691 BuchiCegarLoop]: Abstraction has 145 states and 170 transitions. [2020-10-26 04:47:31,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states and 170 transitions. [2020-10-26 04:47:31,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 102. [2020-10-26 04:47:31,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-10-26 04:47:31,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 122 transitions. [2020-10-26 04:47:31,831 INFO L714 BuchiCegarLoop]: Abstraction has 102 states and 122 transitions. [2020-10-26 04:47:31,831 INFO L594 BuchiCegarLoop]: Abstraction has 102 states and 122 transitions. [2020-10-26 04:47:31,831 INFO L427 BuchiCegarLoop]: ======== Iteration 22============ [2020-10-26 04:47:31,831 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 122 transitions. [2020-10-26 04:47:31,832 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-26 04:47:31,832 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:47:31,832 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:47:31,833 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2020-10-26 04:47:31,833 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-26 04:47:31,833 INFO L794 eck$LassoCheckResult]: Stem: 5674#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(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 5666#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet9, main_#t~post8, main_#t~mem11, main_#t~mem14, main_#t~mem12, main_#t~short13, main_#t~post10, main_#t~mem16, main_#t~mem17, main_#t~post15, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 0; 5667#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 5679#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 5680#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 5650#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 5651#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 5686#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 5685#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 5684#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 5683#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 5682#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 5681#L17-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 5678#L17-4 main_~j~0 := 1; 5652#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 5653#L22-5 main_#t~short13 := main_~i~0 >= 0; 5714#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 5713#L22-3 assume !main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 5712#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 5711#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 5710#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 5707#L22-5 main_#t~short13 := main_~i~0 >= 0; 5709#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 5696#L22-3 assume !main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 5697#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 5751#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 5750#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 5719#L22-5 main_#t~short13 := main_~i~0 >= 0; 5720#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 5727#L22-3 assume !!main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 5665#L23 assume !(main_~i~0 < 2); 5723#L23-2 main_~i~0 := main_~i~0 - 1; 5724#L22-5 main_#t~short13 := main_~i~0 >= 0; 5732#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 5730#L22-3 assume !main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 5695#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 5694#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 5687#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 5658#L22-5 main_#t~short13 := main_~i~0 >= 0; 5659#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 5662#L22-3 assume !!main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 5663#L23 assume !(main_~i~0 < 2); 5671#L23-2 main_~i~0 := main_~i~0 - 1; 5672#L22-5 main_#t~short13 := main_~i~0 >= 0; 5693#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 5692#L22-3 assume !!main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 5691#L23 assume !(main_~i~0 < 2); 5689#L23-2 main_~i~0 := main_~i~0 - 1; 5690#L22-5 [2020-10-26 04:47:31,834 INFO L796 eck$LassoCheckResult]: Loop: 5690#L22-5 main_#t~short13 := main_~i~0 >= 0; 5668#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 5669#L22-3 assume !!main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 5675#L23 assume main_~i~0 < 2;call main_#t~mem14 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);call write~int(main_#t~mem14, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4);havoc main_#t~mem14; 5676#L23-2 main_~i~0 := main_~i~0 - 1; 5690#L22-5 [2020-10-26 04:47:31,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:47:31,834 INFO L82 PathProgramCache]: Analyzing trace with hash 2030923889, now seen corresponding path program 7 times [2020-10-26 04:47:31,834 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:47:31,835 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893955734] [2020-10-26 04:47:31,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:47:31,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:47:31,870 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:47:31,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:47:31,943 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:47:31,949 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:47:31,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:47:31,951 INFO L82 PathProgramCache]: Analyzing trace with hash 56404392, now seen corresponding path program 9 times [2020-10-26 04:47:31,951 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:47:31,951 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480532552] [2020-10-26 04:47:31,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:47:31,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:47:31,955 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:47:31,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:47:31,957 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:47:31,959 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:47:31,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:47:31,959 INFO L82 PathProgramCache]: Analyzing trace with hash 139722552, now seen corresponding path program 3 times [2020-10-26 04:47:31,960 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:47:31,960 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314516891] [2020-10-26 04:47:31,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:47:32,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:47:32,011 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:47:32,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:47:32,070 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:47:32,078 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:47:32,182 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2020-10-26 04:47:41,177 WARN L193 SmtUtils]: Spent 8.96 s on a formula simplification. DAG size of input: 441 DAG size of output: 273 [2020-10-26 04:47:43,143 WARN L193 SmtUtils]: Spent 1.87 s on a formula simplification. DAG size of input: 214 DAG size of output: 152 [2020-10-26 04:47:43,147 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 04:47:43,147 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 04:47:43,147 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 04:47:43,148 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 04:47:43,148 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 04:47:43,148 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:43,148 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 04:47:43,148 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 04:47:43,148 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertion_sort-1.c_Iteration22_Lasso [2020-10-26 04:47:43,148 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 04:47:43,148 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 04:47:43,149 WARN L313 ript$VariableManager]: TermVariabe aux_div_v_ULTIMATE.start_main_~j~0_237_47 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 04:47:43,149 WARN L313 ript$VariableManager]: TermVariabe aux_mod_v_ULTIMATE.start_main_~j~0_237_47 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 04:47:43,152 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 04:47:43,166 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 04:47:43,170 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 04:47:43,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 04:47:43,176 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 04:47:43,181 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 04:47:43,186 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 04:47:43,191 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 04:47:43,195 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 04:47:43,200 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 04:47:43,205 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 04:47:43,209 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 04:47:43,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 04:47:43,217 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 04:47:43,222 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 04:47:43,226 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 04:47:43,230 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 04:47:43,235 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 04:47:44,339 WARN L193 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 82 [2020-10-26 04:47:44,688 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2020-10-26 04:47:45,074 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 04:47:45,075 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 117 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 117 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:45,078 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 04:47:45,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:45,079 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:47:45,080 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:45,080 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:45,080 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:45,080 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:47:45,080 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:47:45,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 118 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 118 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:45,104 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 04:47:45,105 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:45,105 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:47:45,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:45,106 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:45,106 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:45,106 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:47:45,106 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:47:45,114 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 119 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 119 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:45,145 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 04:47:45,146 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:45,147 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:47:45,147 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:45,147 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:45,147 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:45,147 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:47:45,147 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:47:45,148 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 120 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 120 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:45,172 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 04:47:45,173 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:45,173 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:47:45,173 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:45,173 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:45,173 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:45,173 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:47:45,173 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:47:45,174 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 121 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 121 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:45,197 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 04:47:45,198 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:45,198 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:45,198 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:45,198 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:45,199 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:47:45,199 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:47:45,203 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 122 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 122 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:45,225 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 04:47:45,226 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:45,227 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:45,227 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:45,227 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:45,229 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:47:45,229 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:47:45,233 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 123 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 123 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:45,255 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 04:47:45,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:45,256 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:47:45,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:45,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:45,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:45,257 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:47:45,257 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:47:45,258 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 124 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 124 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:45,280 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 04:47:45,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:45,282 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:47:45,282 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:45,282 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:45,282 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:45,282 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:47:45,282 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:47:45,283 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 125 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 125 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:45,305 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 04:47:45,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:45,308 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:45,308 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:45,308 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:45,310 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:47:45,310 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:47:45,312 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 126 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 126 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:45,335 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 04:47:45,336 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:45,337 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:47:45,337 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:45,337 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:45,337 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:45,337 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:47:45,337 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:47:45,338 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 127 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 127 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:45,362 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 04:47:45,363 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:45,363 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:47:45,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:45,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:45,364 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:45,364 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:47:45,364 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:47:45,365 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 128 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 128 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:45,389 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 04:47:45,390 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:45,391 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:47:45,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:45,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:45,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:45,391 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:47:45,391 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:47:45,392 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 129 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 129 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:45,415 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 04:47:45,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:45,416 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:47:45,416 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:45,416 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:45,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:45,417 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:47:45,417 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:47:45,418 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 130 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 130 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:45,440 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 04:47:45,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:45,441 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:47:45,442 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:45,442 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:45,442 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:45,442 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:47:45,442 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:47:45,443 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 131 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 131 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:45,467 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 04:47:45,469 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:45,469 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:47:45,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:45,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:45,469 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:45,469 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:47:45,469 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:47:45,470 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 132 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 132 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:45,495 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 04:47:45,496 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:45,496 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:47:45,496 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:45,496 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:45,496 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:45,497 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:47:45,497 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:47:45,498 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 133 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 133 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:45,520 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 04:47:45,522 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:45,522 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:45,522 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:45,522 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:45,524 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:47:45,524 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:47:45,527 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 134 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:47:45,551 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 04:47:45,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:45,553 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:45,553 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:45,553 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:45,555 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:47:45,555 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 134 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:45,559 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 135 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 135 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:45,581 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 04:47:45,583 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:45,583 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:47:45,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:45,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:45,583 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:45,583 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:47:45,584 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:47:45,585 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 136 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 136 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:45,607 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 04:47:45,608 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:45,608 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:45,608 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:45,608 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:45,609 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:47:45,609 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:47:45,612 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 137 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 137 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:45,634 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 04:47:45,635 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:45,635 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:45,636 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:45,636 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:45,638 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:47:45,638 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:47:45,645 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 138 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 138 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:45,666 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 04:47:45,668 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:45,668 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:45,668 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:45,668 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:45,670 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:47:45,670 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:47:45,673 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 139 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 139 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:45,696 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 04:47:45,697 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:45,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:45,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:45,697 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:45,699 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:47:45,699 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:47:45,703 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 140 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 140 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:45,724 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 04:47:45,726 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:45,726 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:47:45,726 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:45,726 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:45,726 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:45,727 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:47:45,727 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:47:45,728 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 141 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 141 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:45,753 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 04:47:45,754 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:45,754 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:47:45,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:45,755 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:45,755 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:45,755 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:47:45,755 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:47:45,756 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 142 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 142 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:45,780 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 04:47:45,782 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:47:45,782 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:47:45,782 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:47:45,782 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:47:45,787 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:47:45,787 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:47:45,801 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 04:47:45,829 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2020-10-26 04:47:45,829 INFO L444 ModelExtractionUtils]: 9 out of 19 variables were initially zero. Simplification set additionally 7 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 143 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 143 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:47:45,838 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-26 04:47:45,843 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-26 04:47:45,843 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 04:47:45,843 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, v_rep(select #length ULTIMATE.start_main_~#v~0.base)_8) = 16*ULTIMATE.start_main_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_~#v~0.base)_8 Supporting invariants [] [2020-10-26 04:47:46,011 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2020-10-26 04:47:46,013 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-26 04:47:46,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:47:46,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:47:46,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-26 04:47:46,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:47:46,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:47:46,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-26 04:47:46,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:47:46,178 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 04:47:46,179 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2020-10-26 04:47:46,179 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 102 states and 122 transitions. cyclomatic complexity: 29 Second operand 5 states. [2020-10-26 04:47:46,299 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 102 states and 122 transitions. cyclomatic complexity: 29. Second operand 5 states. Result 225 states and 260 transitions. Complement of second has 11 states. [2020-10-26 04:47:46,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2020-10-26 04:47:46,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-26 04:47:46,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2020-10-26 04:47:46,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 48 letters. Loop has 5 letters. [2020-10-26 04:47:46,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:47:46,302 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-26 04:47:46,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:47:46,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:47:46,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-26 04:47:46,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:47:46,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:47:46,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-26 04:47:46,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:47:46,473 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 04:47:46,474 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2020-10-26 04:47:46,474 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 102 states and 122 transitions. cyclomatic complexity: 29 Second operand 5 states. [2020-10-26 04:47:46,579 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 102 states and 122 transitions. cyclomatic complexity: 29. Second operand 5 states. Result 225 states and 260 transitions. Complement of second has 11 states. [2020-10-26 04:47:46,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2020-10-26 04:47:46,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-26 04:47:46,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2020-10-26 04:47:46,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 48 letters. Loop has 5 letters. [2020-10-26 04:47:46,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:47:46,582 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-26 04:47:46,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:47:46,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:47:46,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-26 04:47:46,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:47:46,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:47:46,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-26 04:47:46,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:47:46,752 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 04:47:46,752 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2020-10-26 04:47:46,753 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 102 states and 122 transitions. cyclomatic complexity: 29 Second operand 5 states. [2020-10-26 04:47:46,865 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 102 states and 122 transitions. cyclomatic complexity: 29. Second operand 5 states. Result 209 states and 241 transitions. Complement of second has 12 states. [2020-10-26 04:47:46,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2020-10-26 04:47:46,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-26 04:47:46,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2020-10-26 04:47:46,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 33 transitions. Stem has 48 letters. Loop has 5 letters. [2020-10-26 04:47:46,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:47:46,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 33 transitions. Stem has 53 letters. Loop has 5 letters. [2020-10-26 04:47:46,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:47:46,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 33 transitions. Stem has 48 letters. Loop has 10 letters. [2020-10-26 04:47:46,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:47:46,870 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 209 states and 241 transitions. [2020-10-26 04:47:46,872 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-26 04:47:46,872 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 209 states to 0 states and 0 transitions. [2020-10-26 04:47:46,873 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-26 04:47:46,873 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-26 04:47:46,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-26 04:47:46,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:47:46,873 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 04:47:46,873 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 04:47:46,873 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 04:47:46,874 INFO L427 BuchiCegarLoop]: ======== Iteration 23============ [2020-10-26 04:47:46,874 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-26 04:47:46,874 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-26 04:47:46,874 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-26 04:47:46,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.10 04:47:46 BoogieIcfgContainer [2020-10-26 04:47:46,881 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-26 04:47:46,884 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-26 04:47:46,884 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-26 04:47:46,884 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-26 04:47:46,885 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 04:46:41" (3/4) ... [2020-10-26 04:47:46,889 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-26 04:47:46,889 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-26 04:47:46,890 INFO L168 Benchmark]: Toolchain (without parser) took 65969.98 ms. Allocated memory was 58.7 MB in the beginning and 318.8 MB in the end (delta: 260.0 MB). Free memory was 36.3 MB in the beginning and 173.5 MB in the end (delta: -137.3 MB). Peak memory consumption was 125.5 MB. Max. memory is 16.1 GB. [2020-10-26 04:47:46,891 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 39.8 MB. Free memory was 20.2 MB in the beginning and 20.1 MB in the end (delta: 28.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 04:47:46,891 INFO L168 Benchmark]: CACSL2BoogieTranslator took 328.07 ms. Allocated memory is still 58.7 MB. Free memory was 35.6 MB in the beginning and 43.3 MB in the end (delta: -7.7 MB). Peak memory consumption was 12.1 MB. Max. memory is 16.1 GB. [2020-10-26 04:47:46,892 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.34 ms. Allocated memory is still 58.7 MB. Free memory was 43.1 MB in the beginning and 41.6 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-26 04:47:46,892 INFO L168 Benchmark]: Boogie Preprocessor took 31.01 ms. Allocated memory is still 58.7 MB. Free memory was 41.6 MB in the beginning and 40.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-26 04:47:46,893 INFO L168 Benchmark]: RCFGBuilder took 624.97 ms. Allocated memory is still 58.7 MB. Free memory was 40.3 MB in the beginning and 42.3 MB in the end (delta: -2.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 16.1 GB. [2020-10-26 04:47:46,893 INFO L168 Benchmark]: BuchiAutomizer took 64919.58 ms. Allocated memory was 58.7 MB in the beginning and 318.8 MB in the end (delta: 260.0 MB). Free memory was 42.3 MB in the beginning and 174.6 MB in the end (delta: -132.3 MB). Peak memory consumption was 126.8 MB. Max. memory is 16.1 GB. [2020-10-26 04:47:46,894 INFO L168 Benchmark]: Witness Printer took 5.64 ms. Allocated memory is still 318.8 MB. Free memory was 174.6 MB in the beginning and 173.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-26 04:47:46,898 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.19 ms. Allocated memory is still 39.8 MB. Free memory was 20.2 MB in the beginning and 20.1 MB in the end (delta: 28.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 328.07 ms. Allocated memory is still 58.7 MB. Free memory was 35.6 MB in the beginning and 43.3 MB in the end (delta: -7.7 MB). Peak memory consumption was 12.1 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 43.34 ms. Allocated memory is still 58.7 MB. Free memory was 43.1 MB in the beginning and 41.6 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 31.01 ms. Allocated memory is still 58.7 MB. Free memory was 41.6 MB in the beginning and 40.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 624.97 ms. Allocated memory is still 58.7 MB. Free memory was 40.3 MB in the beginning and 42.3 MB in the end (delta: -2.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 64919.58 ms. Allocated memory was 58.7 MB in the beginning and 318.8 MB in the end (delta: 260.0 MB). Free memory was 42.3 MB in the beginning and 174.6 MB in the end (delta: -132.3 MB). Peak memory consumption was 126.8 MB. Max. memory is 16.1 GB. * Witness Printer took 5.64 ms. Allocated memory is still 318.8 MB. Free memory was 174.6 MB in the beginning and 173.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 22 terminating modules (14 trivial, 5 deterministic, 3 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[v] + -4 * j + -1 * v and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[v] + -2 * j and consists of 7 locations. One deterministic module has affine ranking function 2 * i + j and consists of 6 locations. One deterministic module has affine ranking function -1 * v + unknown-#length-unknown[v] + -4 * k and consists of 3 locations. One deterministic module has affine ranking function i and consists of 5 locations. One nondeterministic module has affine ranking function 4 * i + j and consists of 8 locations. One nondeterministic module has affine ranking function i and consists of 3 locations. One nondeterministic module has affine ranking function 16 * i + unknown-#length-unknown[v] and consists of 6 locations. 14 modules have a trivial ranking function, the largest among these consists of 21 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 64.8s and 23 iterations. TraceHistogramMax:6. Analysis of lassos took 55.9s. Construction of modules took 2.5s. Büchi inclusion checks took 6.0s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 17. Automata minimization 0.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 210 StatesRemovedByMinimization, 17 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 102 states and ocurred in iteration 15. Nontrivial modules had stage [5, 0, 3, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 483 SDtfs, 1122 SDslu, 884 SDs, 0 SdLazy, 1693 SolverSat, 241 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc6 concLT0 SILN0 SILU7 SILI0 SILT0 lasso8 LassoPreprocessingBenchmarks: Lassos: inital511 mio100 ax100 hnf99 lsp99 ukn42 mio100 lsp53 div185 bol100 ite100 ukn100 eq149 hnf62 smp87 dnf114 smp94 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 265ms VariablesStem: 7 VariablesLoop: 9 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...