./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/loops/insertion_sort-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c9baa8a5-f1b8-4e2f-a71b-890e45b45180/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c9baa8a5-f1b8-4e2f-a71b-890e45b45180/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c9baa8a5-f1b8-4e2f-a71b-890e45b45180/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c9baa8a5-f1b8-4e2f-a71b-890e45b45180/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loops/insertion_sort-2.c -s /tmp/vcloud-vcloud-master/worker/working_dir_c9baa8a5-f1b8-4e2f-a71b-890e45b45180/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c9baa8a5-f1b8-4e2f-a71b-890e45b45180/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 67df9bfb6d520441572384e685c149d99c29f78c ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:59:20,289 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:59:20,291 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:59:20,305 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:59:20,305 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:59:20,306 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:59:20,307 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:59:20,308 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:59:20,309 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:59:20,310 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:59:20,311 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:59:20,312 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:59:20,312 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:59:20,313 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:59:20,314 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:59:20,314 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:59:20,315 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:59:20,316 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:59:20,317 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:59:20,319 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:59:20,320 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:59:20,321 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:59:20,323 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:59:20,323 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:59:20,325 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:59:20,326 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:59:20,326 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:59:20,327 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:59:20,327 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:59:20,328 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:59:20,329 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:59:20,329 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:59:20,330 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:59:20,330 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:59:20,331 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:59:20,332 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:59:20,332 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:59:20,332 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:59:20,332 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:59:20,333 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:59:20,334 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:59:20,335 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c9baa8a5-f1b8-4e2f-a71b-890e45b45180/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 08:59:20,351 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:59:20,351 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:59:20,352 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:59:20,352 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:59:20,352 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:59:20,352 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:59:20,353 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:59:20,353 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:59:20,353 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:59:20,353 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:59:20,353 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:59:20,353 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:59:20,353 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:59:20,354 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:59:20,354 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:59:20,354 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:59:20,354 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:59:20,354 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:59:20,354 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:59:20,354 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:59:20,354 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:59:20,355 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:59:20,355 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:59:20,355 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:59:20,355 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:59:20,355 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:59:20,355 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:59:20,355 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:59:20,356 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:59:20,356 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:59:20,356 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:59:20,357 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:59:20,357 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_c9baa8a5-f1b8-4e2f-a71b-890e45b45180/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 67df9bfb6d520441572384e685c149d99c29f78c [2019-10-22 08:59:20,396 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:59:20,410 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:59:20,413 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:59:20,415 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:59:20,415 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:59:20,416 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c9baa8a5-f1b8-4e2f-a71b-890e45b45180/bin/uautomizer/../../sv-benchmarks/c/loops/insertion_sort-2.c [2019-10-22 08:59:20,461 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c9baa8a5-f1b8-4e2f-a71b-890e45b45180/bin/uautomizer/data/cdb322d6a/538981304c064d328c871eaf55ee22f6/FLAG5e22615a7 [2019-10-22 08:59:20,816 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:59:20,816 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c9baa8a5-f1b8-4e2f-a71b-890e45b45180/sv-benchmarks/c/loops/insertion_sort-2.c [2019-10-22 08:59:20,821 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c9baa8a5-f1b8-4e2f-a71b-890e45b45180/bin/uautomizer/data/cdb322d6a/538981304c064d328c871eaf55ee22f6/FLAG5e22615a7 [2019-10-22 08:59:20,837 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c9baa8a5-f1b8-4e2f-a71b-890e45b45180/bin/uautomizer/data/cdb322d6a/538981304c064d328c871eaf55ee22f6 [2019-10-22 08:59:20,840 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:59:20,841 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:59:20,842 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:59:20,842 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:59:20,847 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:59:20,848 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:59:20" (1/1) ... [2019-10-22 08:59:20,850 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11585523 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:20, skipping insertion in model container [2019-10-22 08:59:20,850 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:59:20" (1/1) ... [2019-10-22 08:59:20,858 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:59:20,876 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:59:21,025 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:59:21,029 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:59:21,108 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:59:21,127 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:59:21,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:21 WrapperNode [2019-10-22 08:59:21,127 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:59:21,128 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:59:21,128 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:59:21,128 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:59:21,134 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:21" (1/1) ... [2019-10-22 08:59:21,142 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:21" (1/1) ... [2019-10-22 08:59:21,161 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:59:21,161 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:59:21,161 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:59:21,161 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:59:21,170 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:21" (1/1) ... [2019-10-22 08:59:21,170 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:21" (1/1) ... [2019-10-22 08:59:21,172 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:21" (1/1) ... [2019-10-22 08:59:21,172 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:21" (1/1) ... [2019-10-22 08:59:21,177 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:21" (1/1) ... [2019-10-22 08:59:21,181 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:21" (1/1) ... [2019-10-22 08:59:21,182 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:21" (1/1) ... [2019-10-22 08:59:21,184 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:59:21,184 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:59:21,184 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:59:21,184 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:59:21,185 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9baa8a5-f1b8-4e2f-a71b-890e45b45180/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:21,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:59:21,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:59:21,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:59:21,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:59:21,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:59:21,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:59:21,505 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:59:21,505 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-10-22 08:59:21,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:21 BoogieIcfgContainer [2019-10-22 08:59:21,506 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:59:21,507 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:59:21,507 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:59:21,511 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:59:21,523 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:59:21,523 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:59:20" (1/3) ... [2019-10-22 08:59:21,524 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@75b05108 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:59:21, skipping insertion in model container [2019-10-22 08:59:21,524 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:59:21,524 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:21" (2/3) ... [2019-10-22 08:59:21,525 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@75b05108 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:59:21, skipping insertion in model container [2019-10-22 08:59:21,525 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:59:21,525 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:21" (3/3) ... [2019-10-22 08:59:21,527 INFO L371 chiAutomizerObserver]: Analyzing ICFG insertion_sort-2.c [2019-10-22 08:59:21,613 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:59:21,617 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:59:21,618 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:59:21,618 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:59:21,618 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:59:21,618 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:59:21,618 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:59:21,618 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:59:21,640 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-10-22 08:59:21,665 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2019-10-22 08:59:21,666 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:21,666 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:21,672 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:59:21,673 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 08:59:21,673 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:59:21,674 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-10-22 08:59:21,675 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2019-10-22 08:59:21,676 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:21,676 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:21,676 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:59:21,676 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 08:59:21,684 INFO L791 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, 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~nondet0;havoc main_#t~nondet0;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 := 1; 11#L14-3true [2019-10-22 08:59:21,685 INFO L793 eck$LassoCheckResult]: Loop: 11#L14-3true assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 13#L17-5true assume !true; 12#L17-6true call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 14#L14-2true main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 11#L14-3true [2019-10-22 08:59:21,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:21,691 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-10-22 08:59:21,698 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:21,699 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718531522] [2019-10-22 08:59:21,699 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:21,699 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:21,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:21,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:21,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:21,838 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:21,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:21,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1249301, now seen corresponding path program 1 times [2019-10-22 08:59:21,839 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:21,840 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763504978] [2019-10-22 08:59:21,840 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:21,840 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:21,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:21,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:21,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:21,881 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763504978] [2019-10-22 08:59:21,881 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:21,882 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:59:21,882 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440773422] [2019-10-22 08:59:21,886 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:59:21,887 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:21,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 08:59:21,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 08:59:21,904 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2019-10-22 08:59:21,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:21,912 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2019-10-22 08:59:21,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 08:59:21,914 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 21 transitions. [2019-10-22 08:59:21,916 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-10-22 08:59:21,920 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 16 transitions. [2019-10-22 08:59:21,921 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-10-22 08:59:21,921 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-10-22 08:59:21,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2019-10-22 08:59:21,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:59:21,924 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2019-10-22 08:59:21,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2019-10-22 08:59:21,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-10-22 08:59:21,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-10-22 08:59:21,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2019-10-22 08:59:21,952 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2019-10-22 08:59:21,953 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2019-10-22 08:59:21,953 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:59:21,953 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2019-10-22 08:59:21,954 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-10-22 08:59:21,954 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:21,954 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:21,954 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:59:21,954 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:59:21,955 INFO L791 eck$LassoCheckResult]: Stem: 52#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 48#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, 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~nondet0;havoc main_#t~nondet0;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 := 1; 49#L14-3 [2019-10-22 08:59:21,955 INFO L793 eck$LassoCheckResult]: Loop: 49#L14-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 55#L17-5 main_#t~short4 := main_~i~0 >= 0; 44#L17-1 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 > main_~key~0; 45#L17-3 assume !main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4; 53#L17-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 54#L14-2 main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 49#L14-3 [2019-10-22 08:59:21,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:21,955 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-10-22 08:59:21,955 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:21,956 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431434939] [2019-10-22 08:59:21,956 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:21,956 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:21,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:21,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:21,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:21,982 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:21,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:21,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1188208270, now seen corresponding path program 1 times [2019-10-22 08:59:21,982 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:21,983 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137762321] [2019-10-22 08:59:21,983 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:21,983 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:21,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:22,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:22,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:22,031 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:22,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:22,032 INFO L82 PathProgramCache]: Analyzing trace with hash 268257488, now seen corresponding path program 1 times [2019-10-22 08:59:22,032 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:22,032 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745275887] [2019-10-22 08:59:22,032 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:22,032 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:22,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:22,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:22,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:22,096 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:22,289 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 53 [2019-10-22 08:59:22,443 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:59:22,444 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:59:22,444 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:59:22,444 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:59:22,445 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:59:22,445 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:22,445 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:59:22,445 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:59:22,445 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertion_sort-2.c_Iteration2_Lasso [2019-10-22 08:59:22,445 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:59:22,445 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:59:22,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:22,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:22,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:22,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:22,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:22,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:22,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:22,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:22,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:22,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:22,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:22,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:22,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:22,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:23,014 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2019-10-22 08:59:23,076 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:59:23,081 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:59:23,083 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:23,085 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:23,085 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:23,085 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:23,086 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:23,086 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:23,088 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:23,088 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:23,090 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:23,090 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:23,091 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:23,091 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:23,091 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:23,092 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:23,092 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:23,092 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:23,092 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:23,093 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:23,094 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:23,095 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:23,095 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:23,095 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:23,096 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:23,096 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:23,096 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:23,096 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:23,097 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:23,097 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:23,098 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:23,098 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:23,099 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:23,099 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:23,099 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:23,099 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:23,100 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:23,100 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:23,101 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:23,101 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:23,102 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:23,102 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:23,102 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:23,102 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:23,103 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:23,103 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:23,104 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:23,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 [2019-10-22 08:59:23,105 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:23,105 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:23,105 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:23,105 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:23,105 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:23,106 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:23,106 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:23,107 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:23,108 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:23,108 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:23,109 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:23,109 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:23,109 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:23,109 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:23,110 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:23,110 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:23,111 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:23,111 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:23,112 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:23,112 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:23,112 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:23,113 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:23,115 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:23,115 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:23,119 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:23,120 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:23,120 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:23,120 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:23,121 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:23,121 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:23,121 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:23,121 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:23,121 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:23,126 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:23,126 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:23,127 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:23,127 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:23,127 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:23,127 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:23,128 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:23,128 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:23,128 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:23,129 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:23,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 [2019-10-22 08:59:23,130 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:23,131 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:23,132 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:23,132 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:23,132 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:23,132 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:23,133 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:23,133 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:23,134 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:23,138 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:23,139 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:23,139 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:23,139 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:23,139 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:23,140 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:23,140 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:23,142 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:23,144 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:23,145 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:23,145 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:23,145 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:23,145 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:23,145 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:23,146 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:23,146 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:23,147 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:23,147 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:23,148 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:23,148 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:23,148 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:23,148 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:23,150 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:23,150 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:23,162 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:23,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 [2019-10-22 08:59:23,163 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:23,164 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 08:59:23,164 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:23,164 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:23,172 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 08:59:23,172 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:23,258 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:59:23,277 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:59:23,277 INFO L444 ModelExtractionUtils]: 14 out of 19 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:59:23,280 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:59:23,281 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:59:23,281 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:59:23,282 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#v~0.base)_1, ULTIMATE.start_main_~#v~0.offset, ULTIMATE.start_main_~j~0) = 1*v_rep(select #length ULTIMATE.start_main_~#v~0.base)_1 - 1*ULTIMATE.start_main_~#v~0.offset - 4*ULTIMATE.start_main_~j~0 Supporting invariants [] [2019-10-22 08:59:23,290 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2019-10-22 08:59:23,298 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:59:23,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:23,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:23,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:59:23,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:23,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:23,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:59:23,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:23,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:23,378 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 08:59:23,379 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-10-22 08:59:23,440 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 25 states and 34 transitions. Complement of second has 6 states. [2019-10-22 08:59:23,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 08:59:23,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:59:23,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-10-22 08:59:23,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 2 letters. Loop has 6 letters. [2019-10-22 08:59:23,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:23,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 8 letters. Loop has 6 letters. [2019-10-22 08:59:23,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:23,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 2 letters. Loop has 12 letters. [2019-10-22 08:59:23,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:23,446 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 34 transitions. [2019-10-22 08:59:23,450 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-10-22 08:59:23,452 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 18 states and 25 transitions. [2019-10-22 08:59:23,452 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-10-22 08:59:23,452 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-10-22 08:59:23,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2019-10-22 08:59:23,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:59:23,454 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-10-22 08:59:23,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2019-10-22 08:59:23,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-10-22 08:59:23,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-22 08:59:23,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2019-10-22 08:59:23,458 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-10-22 08:59:23,459 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-10-22 08:59:23,459 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:59:23,459 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2019-10-22 08:59:23,459 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-10-22 08:59:23,459 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:23,460 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:23,460 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-10-22 08:59:23,460 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:59:23,460 INFO L791 eck$LassoCheckResult]: Stem: 147#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 143#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, 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~nondet0;havoc main_#t~nondet0;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 := 1; 144#L14-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 151#L17-5 [2019-10-22 08:59:23,460 INFO L793 eck$LassoCheckResult]: Loop: 151#L17-5 main_#t~short4 := main_~i~0 >= 0; 137#L17-1 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 > main_~key~0; 138#L17-3 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;call main_#t~mem5 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);call write~int(main_#t~mem5, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4);havoc main_#t~mem5;main_~i~0 := main_~i~0 - 1; 151#L17-5 [2019-10-22 08:59:23,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:23,461 INFO L82 PathProgramCache]: Analyzing trace with hash 29863, now seen corresponding path program 1 times [2019-10-22 08:59:23,461 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:23,461 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812617093] [2019-10-22 08:59:23,461 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:23,461 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:23,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:23,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:23,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:23,503 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:23,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:23,503 INFO L82 PathProgramCache]: Analyzing trace with hash 44790, now seen corresponding path program 1 times [2019-10-22 08:59:23,503 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:23,503 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204081083] [2019-10-22 08:59:23,504 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:23,504 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:23,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:23,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:23,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:23,519 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:23,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:23,520 INFO L82 PathProgramCache]: Analyzing trace with hash 889663632, now seen corresponding path program 1 times [2019-10-22 08:59:23,520 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:23,520 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163959693] [2019-10-22 08:59:23,521 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:23,521 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:23,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:23,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:23,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:23,561 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:23,829 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:59:23,829 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:59:23,829 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:59:23,829 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:59:23,830 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:59:23,830 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:23,830 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:59:23,830 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:59:23,830 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertion_sort-2.c_Iteration3_Lasso [2019-10-22 08:59:23,830 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:59:23,830 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:59:23,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:23,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:23,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:23,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:23,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:23,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:23,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:23,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:23,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:23,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:23,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:23,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:23,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:23,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:24,176 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:59:24,177 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:59:24,177 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:24,180 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:24,180 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:24,180 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:24,181 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:24,181 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:24,181 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:24,181 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:24,182 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:24,183 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:24,183 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:24,183 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:24,184 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:24,184 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:24,184 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:24,184 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:24,184 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:24,185 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:24,185 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:24,186 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:24,186 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:24,189 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:24,190 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:24,190 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:24,190 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:24,191 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:24,191 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:24,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 [2019-10-22 08:59:24,192 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:24,192 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:24,192 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:24,193 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:24,193 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:24,193 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:24,193 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:24,194 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:24,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 [2019-10-22 08:59:24,215 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:24,215 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:24,215 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:24,215 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:24,216 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:24,216 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:24,219 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:24,219 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:24,220 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:24,220 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:24,220 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:24,220 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:24,220 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:24,220 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:24,220 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:24,221 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:24,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 [2019-10-22 08:59:24,222 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:24,222 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:24,222 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:24,222 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:24,224 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:24,225 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:24,225 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:24,225 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:24,226 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:24,227 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:24,227 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:24,227 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:24,228 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:24,228 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:24,228 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:24,228 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:24,229 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:24,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 [2019-10-22 08:59:24,230 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:24,230 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:24,230 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:24,230 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:24,230 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:24,230 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:24,231 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:24,231 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:24,232 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:24,233 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:24,234 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:24,234 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:24,234 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:24,234 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:24,235 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:24,235 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:24,236 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:24,237 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:24,238 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:24,238 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:24,239 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:24,239 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:24,240 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:24,240 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:24,244 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:24,246 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:24,247 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:24,249 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:24,249 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:24,249 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:24,251 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:24,251 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:24,281 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:59:24,293 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:59:24,293 INFO L444 ModelExtractionUtils]: 16 out of 19 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-10-22 08:59:24,294 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:59:24,294 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:59:24,295 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:59:24,295 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 2*ULTIMATE.start_main_~i~0 + 1 Supporting invariants [] [2019-10-22 08:59:24,301 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2019-10-22 08:59:24,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:24,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:24,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:59:24,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:24,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:24,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 08:59:24,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:24,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:24,370 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-10-22 08:59:24,370 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 10 Second operand 4 states. [2019-10-22 08:59:24,420 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 10. Second operand 4 states. Result 69 states and 87 transitions. Complement of second has 9 states. [2019-10-22 08:59:24,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-10-22 08:59:24,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:59:24,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2019-10-22 08:59:24,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 3 letters. Loop has 3 letters. [2019-10-22 08:59:24,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:24,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 6 letters. Loop has 3 letters. [2019-10-22 08:59:24,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:24,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 3 letters. Loop has 6 letters. [2019-10-22 08:59:24,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:24,424 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 87 transitions. [2019-10-22 08:59:24,425 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 19 [2019-10-22 08:59:24,429 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 45 states and 58 transitions. [2019-10-22 08:59:24,430 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-10-22 08:59:24,431 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-10-22 08:59:24,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 58 transitions. [2019-10-22 08:59:24,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:59:24,431 INFO L688 BuchiCegarLoop]: Abstraction has 45 states and 58 transitions. [2019-10-22 08:59:24,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 58 transitions. [2019-10-22 08:59:24,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 22. [2019-10-22 08:59:24,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-22 08:59:24,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2019-10-22 08:59:24,434 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2019-10-22 08:59:24,434 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2019-10-22 08:59:24,434 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:59:24,434 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2019-10-22 08:59:24,436 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-10-22 08:59:24,437 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:24,437 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:24,438 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-10-22 08:59:24,438 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 08:59:24,438 INFO L791 eck$LassoCheckResult]: Stem: 287#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 283#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, 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~nondet0;havoc main_#t~nondet0;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 := 1; 284#L14-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 285#L14-4 main_~k~0 := 1; 281#L23-3 [2019-10-22 08:59:24,438 INFO L793 eck$LassoCheckResult]: Loop: 281#L23-3 assume !!(main_~k~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem7 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * (main_~k~0 - 1), 4);call main_#t~mem8 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~k~0, 4);__VERIFIER_assert_#in~cond := (if main_#t~mem7 <= main_#t~mem8 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 282#L4 assume !(0 == __VERIFIER_assert_~cond); 295#L4-2 havoc main_#t~mem8;havoc main_#t~mem7; 286#L23-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 281#L23-3 [2019-10-22 08:59:24,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:24,438 INFO L82 PathProgramCache]: Analyzing trace with hash 925727, now seen corresponding path program 1 times [2019-10-22 08:59:24,438 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:24,439 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857204740] [2019-10-22 08:59:24,439 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:24,439 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:24,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:24,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:24,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:24,452 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:24,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:24,453 INFO L82 PathProgramCache]: Analyzing trace with hash 2285066, now seen corresponding path program 1 times [2019-10-22 08:59:24,454 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:24,454 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506560825] [2019-10-22 08:59:24,454 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:24,454 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:24,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:24,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:24,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:24,469 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:24,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:24,471 INFO L82 PathProgramCache]: Analyzing trace with hash 231194408, now seen corresponding path program 1 times [2019-10-22 08:59:24,471 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:24,472 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216639523] [2019-10-22 08:59:24,472 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:24,472 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:24,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:24,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:24,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:24,637 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216639523] [2019-10-22 08:59:24,638 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:24,638 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:59:24,638 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45004903] [2019-10-22 08:59:24,744 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:24,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:59:24,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:59:24,744 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. cyclomatic complexity: 13 Second operand 4 states. [2019-10-22 08:59:24,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:24,832 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2019-10-22 08:59:24,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:59:24,833 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 34 transitions. [2019-10-22 08:59:24,834 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-10-22 08:59:24,834 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 24 states and 32 transitions. [2019-10-22 08:59:24,834 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-10-22 08:59:24,834 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-10-22 08:59:24,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 32 transitions. [2019-10-22 08:59:24,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:59:24,834 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2019-10-22 08:59:24,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 32 transitions. [2019-10-22 08:59:24,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2019-10-22 08:59:24,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-22 08:59:24,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2019-10-22 08:59:24,836 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2019-10-22 08:59:24,836 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2019-10-22 08:59:24,836 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:59:24,836 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 30 transitions. [2019-10-22 08:59:24,837 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-10-22 08:59:24,837 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:24,837 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:24,837 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:24,837 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:59:24,838 INFO L791 eck$LassoCheckResult]: Stem: 346#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 342#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, 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~nondet0;havoc main_#t~nondet0;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 := 1; 343#L14-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 349#L17-5 main_#t~short4 := main_~i~0 >= 0; 338#L17-1 assume !main_#t~short4; 339#L17-3 assume !main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4; 347#L17-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 348#L14-2 main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 350#L14-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 352#L17-5 [2019-10-22 08:59:24,838 INFO L793 eck$LassoCheckResult]: Loop: 352#L17-5 main_#t~short4 := main_~i~0 >= 0; 336#L17-1 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 > main_~key~0; 337#L17-3 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;call main_#t~mem5 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);call write~int(main_#t~mem5, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4);havoc main_#t~mem5;main_~i~0 := main_~i~0 - 1; 352#L17-5 [2019-10-22 08:59:24,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:24,838 INFO L82 PathProgramCache]: Analyzing trace with hash -272105412, now seen corresponding path program 1 times [2019-10-22 08:59:24,840 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:24,840 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101770267] [2019-10-22 08:59:24,841 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:24,841 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:24,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:24,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:24,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:24,868 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101770267] [2019-10-22 08:59:24,869 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:24,869 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:59:24,869 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103787293] [2019-10-22 08:59:24,869 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:59:24,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:24,869 INFO L82 PathProgramCache]: Analyzing trace with hash 44790, now seen corresponding path program 2 times [2019-10-22 08:59:24,869 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:24,870 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68293416] [2019-10-22 08:59:24,870 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:24,870 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:24,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:24,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:24,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:24,880 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:24,967 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:24,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:59:24,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:59:24,968 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. cyclomatic complexity: 12 Second operand 5 states. [2019-10-22 08:59:25,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:25,018 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2019-10-22 08:59:25,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:59:25,019 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 53 transitions. [2019-10-22 08:59:25,019 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2019-10-22 08:59:25,020 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 53 transitions. [2019-10-22 08:59:25,020 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-10-22 08:59:25,020 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-10-22 08:59:25,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 53 transitions. [2019-10-22 08:59:25,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:59:25,021 INFO L688 BuchiCegarLoop]: Abstraction has 41 states and 53 transitions. [2019-10-22 08:59:25,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 53 transitions. [2019-10-22 08:59:25,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 29. [2019-10-22 08:59:25,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-22 08:59:25,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2019-10-22 08:59:25,023 INFO L711 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2019-10-22 08:59:25,023 INFO L591 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2019-10-22 08:59:25,023 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 08:59:25,023 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 38 transitions. [2019-10-22 08:59:25,024 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-10-22 08:59:25,024 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:25,024 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:25,024 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:25,024 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 08:59:25,025 INFO L791 eck$LassoCheckResult]: Stem: 421#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 417#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, 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~nondet0;havoc main_#t~nondet0;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 := 1; 418#L14-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 424#L17-5 main_#t~short4 := main_~i~0 >= 0; 413#L17-1 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 > main_~key~0; 414#L17-3 assume !main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4; 422#L17-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 423#L14-2 main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 425#L14-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 419#L14-4 main_~k~0 := 1; 415#L23-3 [2019-10-22 08:59:25,025 INFO L793 eck$LassoCheckResult]: Loop: 415#L23-3 assume !!(main_~k~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem7 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * (main_~k~0 - 1), 4);call main_#t~mem8 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~k~0, 4);__VERIFIER_assert_#in~cond := (if main_#t~mem7 <= main_#t~mem8 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 416#L4 assume !(0 == __VERIFIER_assert_~cond); 429#L4-2 havoc main_#t~mem8;havoc main_#t~mem7; 420#L23-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 415#L23-3 [2019-10-22 08:59:25,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:25,025 INFO L82 PathProgramCache]: Analyzing trace with hash 97408492, now seen corresponding path program 1 times [2019-10-22 08:59:25,025 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:25,025 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607604632] [2019-10-22 08:59:25,025 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:25,025 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:25,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:25,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:25,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:25,046 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:25,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:25,046 INFO L82 PathProgramCache]: Analyzing trace with hash 2285066, now seen corresponding path program 2 times [2019-10-22 08:59:25,046 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:25,047 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783213519] [2019-10-22 08:59:25,047 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:25,047 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:25,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:25,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:25,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:25,055 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:25,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:25,056 INFO L82 PathProgramCache]: Analyzing trace with hash 699287157, now seen corresponding path program 1 times [2019-10-22 08:59:25,056 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:25,056 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852065330] [2019-10-22 08:59:25,056 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:25,056 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:25,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:25,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:25,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:25,097 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:25,387 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 81 [2019-10-22 08:59:25,524 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2019-10-22 08:59:25,525 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:59:25,525 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:59:25,526 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:59:25,526 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:59:25,526 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:59:25,526 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:25,526 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:59:25,526 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:59:25,526 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertion_sort-2.c_Iteration6_Lasso [2019-10-22 08:59:25,526 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:59:25,526 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:59:25,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:25,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:25,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:25,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:25,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:25,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:25,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:25,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:25,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:25,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:25,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:25,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:25,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:25,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:26,023 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:59:26,023 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:59:26,024 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:26,024 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:26,024 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:26,024 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:26,024 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:26,025 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:26,025 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:26,025 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:26,025 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:26,026 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:26,026 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:26,030 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:26,031 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:26,031 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:26,031 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:26,031 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:26,031 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:26,032 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:26,032 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:26,032 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:26,033 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:26,033 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:26,033 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:26,033 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:26,033 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:26,033 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:26,033 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:26,034 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:26,034 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:26,035 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:26,035 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:26,035 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:26,036 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:26,036 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:26,037 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:26,037 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:26,038 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:26,038 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:26,038 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:26,038 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:26,038 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:26,044 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:26,044 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:26,045 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:26,045 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:26,046 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:26,046 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:26,046 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:26,046 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:26,047 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:26,048 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:26,048 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:26,048 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:26,048 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:26,049 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:26,049 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:26,049 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:26,049 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:26,049 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:26,049 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:26,050 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:26,050 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:26,050 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:26,050 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:26,051 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:26,051 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:26,051 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:26,051 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:26,051 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:26,051 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:26,052 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:26,053 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:26,053 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:26,053 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:26,053 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:26,053 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:26,053 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:26,054 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:26,054 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:26,060 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:26,061 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:26,061 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:26,061 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:26,062 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:26,062 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:26,064 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:26,064 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:26,114 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:59:26,147 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-10-22 08:59:26,148 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-10-22 08:59:26,148 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:59:26,149 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:59:26,149 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:59:26,149 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#v~0.base)_3, ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~#v~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_~#v~0.base)_3 - 4*ULTIMATE.start_main_~k~0 - 1*ULTIMATE.start_main_~#v~0.offset Supporting invariants [] [2019-10-22 08:59:26,160 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2019-10-22 08:59:26,161 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:59:26,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:26,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:26,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:59:26,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:26,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:26,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:59:26,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:26,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:26,198 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 08:59:26,198 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 38 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-10-22 08:59:26,206 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 38 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 33 states and 43 transitions. Complement of second has 4 states. [2019-10-22 08:59:26,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 08:59:26,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:59:26,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2019-10-22 08:59:26,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 10 letters. Loop has 4 letters. [2019-10-22 08:59:26,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:26,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 14 letters. Loop has 4 letters. [2019-10-22 08:59:26,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:26,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 10 letters. Loop has 8 letters. [2019-10-22 08:59:26,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:26,208 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 43 transitions. [2019-10-22 08:59:26,208 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:59:26,209 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 24 states and 32 transitions. [2019-10-22 08:59:26,209 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-10-22 08:59:26,209 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-10-22 08:59:26,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 32 transitions. [2019-10-22 08:59:26,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:59:26,209 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2019-10-22 08:59:26,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 32 transitions. [2019-10-22 08:59:26,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-10-22 08:59:26,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-22 08:59:26,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2019-10-22 08:59:26,211 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2019-10-22 08:59:26,211 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2019-10-22 08:59:26,211 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 08:59:26,212 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 32 transitions. [2019-10-22 08:59:26,212 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:59:26,212 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:26,212 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:26,212 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1] [2019-10-22 08:59:26,213 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:59:26,213 INFO L791 eck$LassoCheckResult]: Stem: 557#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 555#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, 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~nondet0;havoc main_#t~nondet0;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 := 1; 556#L14-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 562#L17-5 main_#t~short4 := main_~i~0 >= 0; 576#L17-1 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 > main_~key~0; 572#L17-3 assume !main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4; 566#L17-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 567#L14-2 main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 563#L14-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 564#L17-5 main_#t~short4 := main_~i~0 >= 0; 558#L17-1 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 > main_~key~0; 559#L17-3 [2019-10-22 08:59:26,213 INFO L793 eck$LassoCheckResult]: Loop: 559#L17-3 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;call main_#t~mem5 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);call write~int(main_#t~mem5, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4);havoc main_#t~mem5;main_~i~0 := main_~i~0 - 1; 568#L17-5 main_#t~short4 := main_~i~0 >= 0; 571#L17-1 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 > main_~key~0; 559#L17-3 [2019-10-22 08:59:26,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:26,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1275302755, now seen corresponding path program 2 times [2019-10-22 08:59:26,213 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:26,213 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549489574] [2019-10-22 08:59:26,213 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:26,214 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:26,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:26,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:26,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:26,239 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:26,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:26,239 INFO L82 PathProgramCache]: Analyzing trace with hash 55260, now seen corresponding path program 3 times [2019-10-22 08:59:26,239 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:26,240 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078880254] [2019-10-22 08:59:26,240 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:26,240 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:26,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:26,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:26,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:26,248 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:26,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:26,250 INFO L82 PathProgramCache]: Analyzing trace with hash 736351680, now seen corresponding path program 1 times [2019-10-22 08:59:26,250 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:26,250 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252039376] [2019-10-22 08:59:26,250 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:26,250 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:26,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:26,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:26,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:26,287 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:26,727 WARN L191 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 98 [2019-10-22 08:59:26,963 WARN L191 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2019-10-22 08:59:26,966 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:59:26,966 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:59:26,966 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:59:26,966 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:59:26,966 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:59:26,966 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:26,966 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:59:26,966 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:59:26,967 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertion_sort-2.c_Iteration7_Lasso [2019-10-22 08:59:26,967 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:59:26,967 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:59:26,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:26,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:26,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:27,213 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-10-22 08:59:27,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:27,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:27,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:27,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:27,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:27,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:27,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:27,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:27,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:27,639 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:59:27,639 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:59:27,640 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:27,640 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:27,640 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:27,641 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:27,641 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:27,641 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:27,641 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:27,641 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:27,642 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:27,642 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:27,643 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:27,643 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:27,643 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:27,643 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:27,643 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:27,643 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:27,643 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:27,644 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:27,644 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:27,644 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:27,644 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 08:59:27,645 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:59:27,645 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:27,650 INFO L400 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-10-22 08:59:27,650 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-10-22 08:59:27,673 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:27,673 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:27,674 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:27,674 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:27,674 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:27,674 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:27,675 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:27,675 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:27,677 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:27,678 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:27,678 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:27,679 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:27,679 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:27,679 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:27,679 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:27,679 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:27,679 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:27,680 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:27,680 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:27,680 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:27,681 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:27,681 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:27,681 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:27,682 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:27,682 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:27,701 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:59:27,716 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-10-22 08:59:27,716 INFO L444 ModelExtractionUtils]: 10 out of 19 variables were initially zero. Simplification set additionally 7 variables to zero. [2019-10-22 08:59:27,717 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:59:27,717 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:59:27,718 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:59:27,718 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-10-22 08:59:27,744 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-10-22 08:59:27,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:27,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:27,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:59:27,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:27,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:27,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 08:59:27,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:27,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:27,812 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-10-22 08:59:27,812 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-10-22 08:59:27,876 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 52 states and 69 transitions. Complement of second has 9 states. [2019-10-22 08:59:27,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-10-22 08:59:27,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:59:27,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2019-10-22 08:59:27,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 11 letters. Loop has 3 letters. [2019-10-22 08:59:27,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:27,877 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:59:27,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:27,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:27,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:59:27,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:27,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:27,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 08:59:27,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:27,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:27,930 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2019-10-22 08:59:27,930 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-10-22 08:59:27,971 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 43 states and 54 transitions. Complement of second has 9 states. [2019-10-22 08:59:27,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-10-22 08:59:27,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:59:27,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2019-10-22 08:59:27,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 11 letters. Loop has 3 letters. [2019-10-22 08:59:27,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:27,973 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:59:27,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:27,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:27,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:59:27,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:28,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:28,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 08:59:28,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:28,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:28,024 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 3 loop predicates [2019-10-22 08:59:28,024 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-10-22 08:59:28,076 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 77 states and 107 transitions. Complement of second has 10 states. [2019-10-22 08:59:28,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-10-22 08:59:28,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:59:28,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2019-10-22 08:59:28,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 11 letters. Loop has 3 letters. [2019-10-22 08:59:28,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:28,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 14 letters. Loop has 3 letters. [2019-10-22 08:59:28,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:28,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 11 letters. Loop has 6 letters. [2019-10-22 08:59:28,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:28,080 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 107 transitions. [2019-10-22 08:59:28,081 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:59:28,081 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 0 states and 0 transitions. [2019-10-22 08:59:28,081 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:59:28,081 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:59:28,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:59:28,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:59:28,081 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:59:28,081 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:59:28,081 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:59:28,082 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-10-22 08:59:28,082 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:59:28,082 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:59:28,082 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:59:28,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:59:28 BoogieIcfgContainer [2019-10-22 08:59:28,090 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:59:28,091 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:59:28,091 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:59:28,091 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:59:28,091 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:21" (3/4) ... [2019-10-22 08:59:28,094 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:59:28,096 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:59:28,097 INFO L168 Benchmark]: Toolchain (without parser) took 7256.32 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 327.7 MB). Free memory was 943.1 MB in the beginning and 1.0 GB in the end (delta: -62.2 MB). Peak memory consumption was 265.5 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:28,098 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:28,099 INFO L168 Benchmark]: CACSL2BoogieTranslator took 285.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 943.1 MB in the beginning and 1.1 GB in the end (delta: -198.5 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:28,100 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.02 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:28,100 INFO L168 Benchmark]: Boogie Preprocessor took 22.97 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:28,101 INFO L168 Benchmark]: RCFGBuilder took 322.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:28,102 INFO L168 Benchmark]: BuchiAutomizer took 6583.50 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 176.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 112.5 MB). Peak memory consumption was 289.1 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:28,103 INFO L168 Benchmark]: Witness Printer took 5.24 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:28,105 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 285.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 943.1 MB in the beginning and 1.1 GB in the end (delta: -198.5 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.02 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.97 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 322.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6583.50 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 176.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 112.5 MB). Peak memory consumption was 289.1 MB. Max. memory is 11.5 GB. * Witness Printer took 5.24 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (3 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[v] + -1 * v + -4 * j and consists of 4 locations. One deterministic module has affine ranking function 2 * i + 1 and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[v] + -4 * k + -1 * v and consists of 3 locations. One nondeterministic module has affine ranking function i and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.4s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 5.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 38 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 29 states and ocurred in iteration 5. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 116 SDtfs, 159 SDslu, 84 SDs, 0 SdLazy, 165 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital225 mio100 ax100 hnf99 lsp84 ukn80 mio100 lsp65 div200 bol100 ite100 ukn100 eq150 hnf60 smp88 dnf147 smp78 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 29ms VariablesStem: 7 VariablesLoop: 7 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 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...