./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/loops/insertion_sort_false-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_cabee834-81e2-49eb-9758-580cb22435ec/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_cabee834-81e2-49eb-9758-580cb22435ec/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_cabee834-81e2-49eb-9758-580cb22435ec/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_cabee834-81e2-49eb-9758-580cb22435ec/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loops/insertion_sort_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_cabee834-81e2-49eb-9758-580cb22435ec/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_cabee834-81e2-49eb-9758-580cb22435ec/bin-2019/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 9722a10940ebd7a5d75170225a40cd37454d0528 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 06:22:45,377 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 06:22:45,378 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 06:22:45,387 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 06:22:45,387 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 06:22:45,388 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 06:22:45,389 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 06:22:45,390 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 06:22:45,391 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 06:22:45,392 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 06:22:45,393 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 06:22:45,393 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 06:22:45,393 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 06:22:45,394 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 06:22:45,395 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 06:22:45,395 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 06:22:45,396 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 06:22:45,397 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 06:22:45,398 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 06:22:45,400 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 06:22:45,400 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 06:22:45,401 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 06:22:45,402 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 06:22:45,402 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 06:22:45,402 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 06:22:45,403 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 06:22:45,404 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 06:22:45,404 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 06:22:45,405 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 06:22:45,405 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 06:22:45,406 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 06:22:45,406 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 06:22:45,406 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 06:22:45,406 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 06:22:45,407 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 06:22:45,408 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 06:22:45,408 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_cabee834-81e2-49eb-9758-580cb22435ec/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-23 06:22:45,417 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 06:22:45,418 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 06:22:45,418 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 06:22:45,419 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 06:22:45,419 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 06:22:45,419 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 06:22:45,419 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 06:22:45,419 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 06:22:45,419 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 06:22:45,419 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 06:22:45,420 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 06:22:45,420 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 06:22:45,420 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 06:22:45,420 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 06:22:45,420 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 06:22:45,420 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 06:22:45,420 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 06:22:45,421 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 06:22:45,421 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 06:22:45,421 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 06:22:45,421 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 06:22:45,421 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 06:22:45,421 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 06:22:45,421 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 06:22:45,421 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 06:22:45,422 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 06:22:45,422 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 06:22:45,422 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 06:22:45,422 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 06:22:45,422 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 06:22:45,422 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 06:22:45,423 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 06:22:45,423 INFO L133 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_cabee834-81e2-49eb-9758-580cb22435ec/bin-2019/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 -> 9722a10940ebd7a5d75170225a40cd37454d0528 [2018-11-23 06:22:45,447 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 06:22:45,457 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 06:22:45,460 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 06:22:45,461 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 06:22:45,461 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 06:22:45,462 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_cabee834-81e2-49eb-9758-580cb22435ec/bin-2019/uautomizer/../../sv-benchmarks/c/loops/insertion_sort_false-unreach-call_true-termination.i [2018-11-23 06:22:45,510 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cabee834-81e2-49eb-9758-580cb22435ec/bin-2019/uautomizer/data/273644ea7/2ad90df853d74197b4158ad1a716218f/FLAGffa135330 [2018-11-23 06:22:45,828 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 06:22:45,829 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_cabee834-81e2-49eb-9758-580cb22435ec/sv-benchmarks/c/loops/insertion_sort_false-unreach-call_true-termination.i [2018-11-23 06:22:45,833 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cabee834-81e2-49eb-9758-580cb22435ec/bin-2019/uautomizer/data/273644ea7/2ad90df853d74197b4158ad1a716218f/FLAGffa135330 [2018-11-23 06:22:45,842 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_cabee834-81e2-49eb-9758-580cb22435ec/bin-2019/uautomizer/data/273644ea7/2ad90df853d74197b4158ad1a716218f [2018-11-23 06:22:45,844 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 06:22:45,845 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 06:22:45,846 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 06:22:45,846 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 06:22:45,848 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 06:22:45,849 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:22:45" (1/1) ... [2018-11-23 06:22:45,850 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@175cd69f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:22:45, skipping insertion in model container [2018-11-23 06:22:45,851 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:22:45" (1/1) ... [2018-11-23 06:22:45,857 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 06:22:45,872 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 06:22:45,981 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:22:45,984 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 06:22:45,998 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:22:46,012 INFO L195 MainTranslator]: Completed translation [2018-11-23 06:22:46,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:22:46 WrapperNode [2018-11-23 06:22:46,012 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 06:22:46,013 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 06:22:46,013 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 06:22:46,013 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 06:22:46,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:22:46" (1/1) ... [2018-11-23 06:22:46,025 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:22:46" (1/1) ... [2018-11-23 06:22:46,039 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 06:22:46,040 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 06:22:46,040 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 06:22:46,040 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 06:22:46,089 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:22:46" (1/1) ... [2018-11-23 06:22:46,089 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:22:46" (1/1) ... [2018-11-23 06:22:46,091 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:22:46" (1/1) ... [2018-11-23 06:22:46,091 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:22:46" (1/1) ... [2018-11-23 06:22:46,096 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:22:46" (1/1) ... [2018-11-23 06:22:46,100 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:22:46" (1/1) ... [2018-11-23 06:22:46,101 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:22:46" (1/1) ... [2018-11-23 06:22:46,103 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 06:22:46,104 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 06:22:46,104 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 06:22:46,104 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 06:22:46,105 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:22:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cabee834-81e2-49eb-9758-580cb22435ec/bin-2019/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 [2018-11-23 06:22:46,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 06:22:46,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 06:22:46,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 06:22:46,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 06:22:46,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 06:22:46,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 06:22:46,339 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 06:22:46,339 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-11-23 06:22:46,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:22:46 BoogieIcfgContainer [2018-11-23 06:22:46,339 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 06:22:46,340 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 06:22:46,340 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 06:22:46,342 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 06:22:46,343 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 06:22:46,343 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 06:22:45" (1/3) ... [2018-11-23 06:22:46,344 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@200c97ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 06:22:46, skipping insertion in model container [2018-11-23 06:22:46,344 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 06:22:46,345 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:22:46" (2/3) ... [2018-11-23 06:22:46,345 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@200c97ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 06:22:46, skipping insertion in model container [2018-11-23 06:22:46,345 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 06:22:46,345 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:22:46" (3/3) ... [2018-11-23 06:22:46,347 INFO L375 chiAutomizerObserver]: Analyzing ICFG insertion_sort_false-unreach-call_true-termination.i [2018-11-23 06:22:46,399 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 06:22:46,400 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 06:22:46,400 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 06:22:46,400 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 06:22:46,400 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 06:22:46,400 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 06:22:46,400 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 06:22:46,400 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 06:22:46,401 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 06:22:46,414 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2018-11-23 06:22:46,434 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-23 06:22:46,435 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:22:46,435 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:22:46,441 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 06:22:46,441 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 06:22:46,441 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 06:22:46,442 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2018-11-23 06:22:46,443 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-23 06:22:46,443 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:22:46,443 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:22:46,444 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 06:22:46,444 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 06:22:46,451 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#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.alloc(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; 13#L14-3true [2018-11-23 06:22:46,452 INFO L796 eck$LassoCheckResult]: Loop: 13#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; 16#L17-5true assume !true; 14#L17-6true call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 17#L14-2true main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 13#L14-3true [2018-11-23 06:22:46,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:22:46,458 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-23 06:22:46,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:22:46,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:22:46,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:22:46,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:22:46,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:22:46,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:22:46,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:22:46,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:22:46,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1256252, now seen corresponding path program 1 times [2018-11-23 06:22:46,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:22:46,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:22:46,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:22:46,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:22:46,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:22:46,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:22:46,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:22:46,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:22:46,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 06:22:46,593 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 06:22:46,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 06:22:46,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 06:22:46,611 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2018-11-23 06:22:46,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:22:46,616 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2018-11-23 06:22:46,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 06:22:46,618 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2018-11-23 06:22:46,619 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-11-23 06:22:46,623 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 15 states and 19 transitions. [2018-11-23 06:22:46,624 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-23 06:22:46,624 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-23 06:22:46,625 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2018-11-23 06:22:46,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:22:46,625 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-23 06:22:46,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2018-11-23 06:22:46,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-23 06:22:46,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 06:22:46,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2018-11-23 06:22:46,647 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-23 06:22:46,648 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-23 06:22:46,648 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 06:22:46,648 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2018-11-23 06:22:46,648 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-11-23 06:22:46,649 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:22:46,649 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:22:46,649 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 06:22:46,649 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 06:22:46,649 INFO L794 eck$LassoCheckResult]: Stem: 58#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 53#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.alloc(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; 54#L14-3 [2018-11-23 06:22:46,649 INFO L796 eck$LassoCheckResult]: Loop: 54#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; 51#L17-5 main_#t~short4 := main_~i~0 >= 0; 48#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; 49#L17-3 assume !main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4; 59#L17-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 60#L14-2 main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 54#L14-3 [2018-11-23 06:22:46,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:22:46,650 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-23 06:22:46,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:22:46,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:22:46,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:22:46,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:22:46,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:22:46,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:22:46,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:22:46,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:22:46,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1188208494, now seen corresponding path program 1 times [2018-11-23 06:22:46,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:22:46,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:22:46,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:22:46,666 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:22:46,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:22:46,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:22:46,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:22:46,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:22:46,693 INFO L82 PathProgramCache]: Analyzing trace with hash 268257712, now seen corresponding path program 1 times [2018-11-23 06:22:46,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:22:46,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:22:46,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:22:46,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:22:46,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:22:46,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:22:46,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:22:46,871 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2018-11-23 06:22:46,975 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:22:46,976 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:22:46,976 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:22:46,976 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:22:46,976 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 06:22:46,976 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:22:46,976 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:22:46,976 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:22:46,976 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertion_sort_false-unreach-call_true-termination.i_Iteration2_Lasso [2018-11-23 06:22:46,977 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:22:46,977 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:22:46,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:46,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:46,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:47,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:47,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:47,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:47,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:47,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:47,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:47,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:47,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:47,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:47,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:47,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:47,472 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2018-11-23 06:22:47,507 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:22:47,511 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 06:22:47,512 INFO L122 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 [2018-11-23 06:22:47,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:47,514 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:22:47,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:47,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:47,514 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:47,516 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:22:47,516 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:22:47,517 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:47,518 INFO L122 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 [2018-11-23 06:22:47,518 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:47,518 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:22:47,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:47,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:47,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:47,519 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:22:47,519 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:22:47,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:47,520 INFO L122 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 [2018-11-23 06:22:47,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:47,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:22:47,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:47,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:47,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:47,522 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:22:47,522 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:22:47,522 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:47,523 INFO L122 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 [2018-11-23 06:22:47,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:47,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:47,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:47,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:47,526 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:22:47,526 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:22:47,533 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:47,533 INFO L122 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 [2018-11-23 06:22:47,534 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:47,534 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 06:22:47,534 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:47,535 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:47,536 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 06:22:47,536 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:22:47,541 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:47,542 INFO L122 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 [2018-11-23 06:22:47,542 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:47,542 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:22:47,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:47,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:47,543 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:47,543 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:22:47,544 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:22:47,545 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:47,546 INFO L122 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 [2018-11-23 06:22:47,546 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:47,546 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:47,546 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:47,547 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:47,548 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:22:47,549 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:22:47,551 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:47,552 INFO L122 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 [2018-11-23 06:22:47,552 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:47,552 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 06:22:47,552 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:47,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:47,557 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 06:22:47,558 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:22:47,602 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 06:22:47,651 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-23 06:22:47,652 INFO L444 ModelExtractionUtils]: 12 out of 19 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-23 06:22:47,654 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 06:22:47,655 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 06:22:47,655 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 06:22:47,656 INFO L520 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 [] [2018-11-23 06:22:47,674 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2018-11-23 06:22:47,681 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 06:22:47,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:22:47,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:22:47,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:22:47,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:22:47,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:22:47,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:22:47,769 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 [2018-11-23 06:22:47,769 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-23 06:22:47,843 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 29 states and 40 transitions. Complement of second has 6 states. [2018-11-23 06:22:47,844 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 [2018-11-23 06:22:47,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 06:22:47,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2018-11-23 06:22:47,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 2 letters. Loop has 6 letters. [2018-11-23 06:22:47,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:22:47,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 8 letters. Loop has 6 letters. [2018-11-23 06:22:47,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:22:47,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 2 letters. Loop has 12 letters. [2018-11-23 06:22:47,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:22:47,850 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 40 transitions. [2018-11-23 06:22:47,853 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-23 06:22:47,854 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 22 states and 31 transitions. [2018-11-23 06:22:47,855 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-23 06:22:47,855 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-23 06:22:47,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 31 transitions. [2018-11-23 06:22:47,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:22:47,855 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-11-23 06:22:47,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 31 transitions. [2018-11-23 06:22:47,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-23 06:22:47,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 06:22:47,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 30 transitions. [2018-11-23 06:22:47,859 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2018-11-23 06:22:47,859 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2018-11-23 06:22:47,859 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 06:22:47,860 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. [2018-11-23 06:22:47,860 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-23 06:22:47,860 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:22:47,861 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:22:47,861 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-23 06:22:47,861 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 06:22:47,861 INFO L794 eck$LassoCheckResult]: Stem: 162#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 157#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.alloc(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; 158#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; 152#L17-5 [2018-11-23 06:22:47,861 INFO L796 eck$LassoCheckResult]: Loop: 152#L17-5 main_#t~short4 := main_~i~0 >= 0; 147#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; 148#L17-3 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4; 155#L18 assume main_~i~0 < 2;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; 151#L18-2 main_~i~0 := main_~i~0 - 1; 152#L17-5 [2018-11-23 06:22:47,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:22:47,862 INFO L82 PathProgramCache]: Analyzing trace with hash 29863, now seen corresponding path program 1 times [2018-11-23 06:22:47,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:22:47,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:22:47,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:22:47,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:22:47,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:22:47,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:22:47,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:22:47,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:22:47,884 INFO L82 PathProgramCache]: Analyzing trace with hash 43044122, now seen corresponding path program 1 times [2018-11-23 06:22:47,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:22:47,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:22:47,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:22:47,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:22:47,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:22:47,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:22:47,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:22:47,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:22:47,896 INFO L82 PathProgramCache]: Analyzing trace with hash 268259380, now seen corresponding path program 1 times [2018-11-23 06:22:47,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:22:47,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:22:47,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:22:47,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:22:47,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:22:47,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:22:47,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:22:48,160 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:22:48,160 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:22:48,160 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:22:48,160 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:22:48,161 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 06:22:48,161 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:22:48,161 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:22:48,161 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:22:48,161 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertion_sort_false-unreach-call_true-termination.i_Iteration3_Lasso [2018-11-23 06:22:48,161 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:22:48,161 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:22:48,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:48,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:48,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:48,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:48,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:48,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:48,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:48,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:48,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:48,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:48,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:48,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:48,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:48,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:48,385 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:22:48,386 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 06:22:48,386 INFO L122 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 [2018-11-23 06:22:48,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:48,387 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:22:48,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:48,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:48,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:48,388 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:22:48,388 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:22:48,388 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:48,390 INFO L122 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 [2018-11-23 06:22:48,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:48,391 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:22:48,391 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:48,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:48,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:48,394 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:22:48,395 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:22:48,395 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:48,396 INFO L122 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 [2018-11-23 06:22:48,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:48,396 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:22:48,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:48,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:48,397 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:48,397 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:22:48,397 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:22:48,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:48,398 INFO L122 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 [2018-11-23 06:22:48,398 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:48,398 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:22:48,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:48,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:48,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:48,399 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:22:48,399 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:22:48,400 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:48,400 INFO L122 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 [2018-11-23 06:22:48,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:48,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:48,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:48,401 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:48,403 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:22:48,403 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:22:48,404 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:48,405 INFO L122 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 [2018-11-23 06:22:48,405 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:48,405 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:22:48,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:48,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:48,406 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:48,406 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:22:48,406 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:22:48,407 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:48,407 INFO L122 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 [2018-11-23 06:22:48,408 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:48,408 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:22:48,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:48,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:48,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:48,408 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:22:48,409 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:22:48,409 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:48,409 INFO L122 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 [2018-11-23 06:22:48,410 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:48,410 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:22:48,410 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:48,410 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:48,410 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:48,411 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:22:48,411 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:22:48,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:48,412 INFO L122 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 [2018-11-23 06:22:48,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:48,412 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:22:48,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:48,413 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:48,413 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:48,413 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:22:48,413 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:22:48,414 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:48,414 INFO L122 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 [2018-11-23 06:22:48,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:48,415 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:22:48,415 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:48,415 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:48,415 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:48,415 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:22:48,415 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:22:48,416 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:48,416 INFO L122 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 [2018-11-23 06:22:48,417 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:48,417 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:48,417 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:48,417 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:48,419 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:22:48,419 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:22:48,434 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 06:22:48,442 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-23 06:22:48,442 INFO L444 ModelExtractionUtils]: 11 out of 19 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-23 06:22:48,442 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 06:22:48,443 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 06:22:48,444 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 06:22:48,444 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, v_rep(select #length ULTIMATE.start_main_~#v~0.base)_2) = 16*ULTIMATE.start_main_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_~#v~0.base)_2 Supporting invariants [] [2018-11-23 06:22:48,459 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2018-11-23 06:22:48,462 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 06:22:48,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:22:48,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:22:48,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:22:48,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:22:48,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:22:48,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:22:48,575 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 [2018-11-23 06:22:48,575 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-11-23 06:22:48,640 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 94 states and 125 transitions. Complement of second has 9 states. [2018-11-23 06:22:48,640 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 [2018-11-23 06:22:48,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 06:22:48,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2018-11-23 06:22:48,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 3 letters. Loop has 5 letters. [2018-11-23 06:22:48,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:22:48,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 8 letters. Loop has 5 letters. [2018-11-23 06:22:48,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:22:48,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 3 letters. Loop has 10 letters. [2018-11-23 06:22:48,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:22:48,642 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 125 transitions. [2018-11-23 06:22:48,643 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 26 [2018-11-23 06:22:48,645 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 73 states and 99 transitions. [2018-11-23 06:22:48,645 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2018-11-23 06:22:48,645 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2018-11-23 06:22:48,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 99 transitions. [2018-11-23 06:22:48,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:22:48,645 INFO L705 BuchiCegarLoop]: Abstraction has 73 states and 99 transitions. [2018-11-23 06:22:48,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 99 transitions. [2018-11-23 06:22:48,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 51. [2018-11-23 06:22:48,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 06:22:48,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 73 transitions. [2018-11-23 06:22:48,649 INFO L728 BuchiCegarLoop]: Abstraction has 51 states and 73 transitions. [2018-11-23 06:22:48,649 INFO L608 BuchiCegarLoop]: Abstraction has 51 states and 73 transitions. [2018-11-23 06:22:48,649 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 06:22:48,649 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 73 transitions. [2018-11-23 06:22:48,650 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-11-23 06:22:48,650 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:22:48,650 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:22:48,650 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 06:22:48,650 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 06:22:48,651 INFO L794 eck$LassoCheckResult]: Stem: 338#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 333#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.alloc(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; 334#L14-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 335#L14-4 main_~k~0 := 1; 336#L24-3 [2018-11-23 06:22:48,651 INFO L796 eck$LassoCheckResult]: Loop: 336#L24-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; 337#L4 assume !(0 == __VERIFIER_assert_~cond); 348#L4-2 havoc main_#t~mem7;havoc main_#t~mem8; 345#L24-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 336#L24-3 [2018-11-23 06:22:48,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:22:48,651 INFO L82 PathProgramCache]: Analyzing trace with hash 925734, now seen corresponding path program 1 times [2018-11-23 06:22:48,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:22:48,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:22:48,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:22:48,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:22:48,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:22:48,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:22:48,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:22:48,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:22:48,663 INFO L82 PathProgramCache]: Analyzing trace with hash 2500554, now seen corresponding path program 1 times [2018-11-23 06:22:48,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:22:48,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:22:48,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:22:48,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:22:48,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:22:48,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:22:48,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:22:48,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:22:48,671 INFO L82 PathProgramCache]: Analyzing trace with hash 237874543, now seen corresponding path program 1 times [2018-11-23 06:22:48,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:22:48,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:22:48,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:22:48,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:22:48,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:22:48,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:22:48,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:22:48,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:22:48,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 06:22:48,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 06:22:48,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 06:22:48,878 INFO L87 Difference]: Start difference. First operand 51 states and 73 transitions. cyclomatic complexity: 29 Second operand 4 states. [2018-11-23 06:22:48,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:22:48,933 INFO L93 Difference]: Finished difference Result 55 states and 76 transitions. [2018-11-23 06:22:48,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 06:22:48,934 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 76 transitions. [2018-11-23 06:22:48,935 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-11-23 06:22:48,935 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 53 states and 74 transitions. [2018-11-23 06:22:48,936 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-23 06:22:48,936 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-23 06:22:48,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 74 transitions. [2018-11-23 06:22:48,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:22:48,936 INFO L705 BuchiCegarLoop]: Abstraction has 53 states and 74 transitions. [2018-11-23 06:22:48,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 74 transitions. [2018-11-23 06:22:48,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2018-11-23 06:22:48,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 06:22:48,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 72 transitions. [2018-11-23 06:22:48,939 INFO L728 BuchiCegarLoop]: Abstraction has 51 states and 72 transitions. [2018-11-23 06:22:48,939 INFO L608 BuchiCegarLoop]: Abstraction has 51 states and 72 transitions. [2018-11-23 06:22:48,939 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 06:22:48,940 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 72 transitions. [2018-11-23 06:22:48,940 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-11-23 06:22:48,940 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:22:48,940 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:22:48,941 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 06:22:48,941 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 06:22:48,941 INFO L794 eck$LassoCheckResult]: Stem: 455#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 450#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.alloc(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; 451#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; 456#L17-5 main_#t~short4 := main_~i~0 >= 0; 439#L17-1 [2018-11-23 06:22:48,941 INFO L796 eck$LassoCheckResult]: Loop: 439#L17-1 assume !main_#t~short4; 440#L17-3 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4; 448#L18 assume main_~i~0 < 2;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; 444#L18-2 main_~i~0 := main_~i~0 - 1; 445#L17-5 main_#t~short4 := main_~i~0 >= 0; 439#L17-1 [2018-11-23 06:22:48,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:22:48,941 INFO L82 PathProgramCache]: Analyzing trace with hash 925768, now seen corresponding path program 1 times [2018-11-23 06:22:48,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:22:48,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:22:48,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:22:48,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:22:48,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:22:48,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:22:48,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:22:48,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:22:48,953 INFO L82 PathProgramCache]: Analyzing trace with hash 47903044, now seen corresponding path program 1 times [2018-11-23 06:22:48,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:22:48,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:22:48,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:22:48,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:22:48,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:22:48,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:22:48,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:22:48,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:22:48,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 06:22:48,958 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 06:22:48,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 06:22:48,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 06:22:48,959 INFO L87 Difference]: Start difference. First operand 51 states and 72 transitions. cyclomatic complexity: 28 Second operand 3 states. [2018-11-23 06:22:48,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:22:48,968 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2018-11-23 06:22:48,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 06:22:48,971 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 53 transitions. [2018-11-23 06:22:48,971 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-23 06:22:48,972 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 30 states and 39 transitions. [2018-11-23 06:22:48,972 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-23 06:22:48,972 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-23 06:22:48,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 39 transitions. [2018-11-23 06:22:48,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:22:48,972 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2018-11-23 06:22:48,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 39 transitions. [2018-11-23 06:22:48,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2018-11-23 06:22:48,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 06:22:48,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2018-11-23 06:22:48,977 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2018-11-23 06:22:48,977 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2018-11-23 06:22:48,977 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 06:22:48,977 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 37 transitions. [2018-11-23 06:22:48,977 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-23 06:22:48,977 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:22:48,977 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:22:48,978 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:22:48,978 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 06:22:48,978 INFO L794 eck$LassoCheckResult]: Stem: 553#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 548#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.alloc(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; 549#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; 540#L17-5 main_#t~short4 := main_~i~0 >= 0; 543#L17-1 assume !main_#t~short4; 544#L17-3 assume !main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4; 554#L17-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 555#L14-2 main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 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; 538#L17-5 [2018-11-23 06:22:48,978 INFO L796 eck$LassoCheckResult]: Loop: 538#L17-5 main_#t~short4 := main_~i~0 >= 0; 541#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; 542#L17-3 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4; 545#L18 assume main_~i~0 < 2;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; 537#L18-2 main_~i~0 := main_~i~0 - 1; 538#L17-5 [2018-11-23 06:22:48,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:22:48,978 INFO L82 PathProgramCache]: Analyzing trace with hash -272098468, now seen corresponding path program 1 times [2018-11-23 06:22:48,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:22:48,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:22:48,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:22:48,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:22:48,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:22:48,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:22:48,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:22:48,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:22:48,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 06:22:48,997 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 06:22:48,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:22:48,998 INFO L82 PathProgramCache]: Analyzing trace with hash 43044122, now seen corresponding path program 2 times [2018-11-23 06:22:48,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:22:48,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:22:48,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:22:48,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:22:48,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:22:49,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:22:49,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:22:49,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 06:22:49,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 06:22:49,075 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-11-23 06:22:49,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:22:49,116 INFO L93 Difference]: Finished difference Result 53 states and 69 transitions. [2018-11-23 06:22:49,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 06:22:49,117 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 69 transitions. [2018-11-23 06:22:49,118 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-11-23 06:22:49,118 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 53 states and 69 transitions. [2018-11-23 06:22:49,118 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-23 06:22:49,119 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-23 06:22:49,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 69 transitions. [2018-11-23 06:22:49,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:22:49,119 INFO L705 BuchiCegarLoop]: Abstraction has 53 states and 69 transitions. [2018-11-23 06:22:49,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 69 transitions. [2018-11-23 06:22:49,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 32. [2018-11-23 06:22:49,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 06:22:49,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2018-11-23 06:22:49,121 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2018-11-23 06:22:49,121 INFO L608 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2018-11-23 06:22:49,121 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 06:22:49,121 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 42 transitions. [2018-11-23 06:22:49,122 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-23 06:22:49,122 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:22:49,122 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:22:49,122 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:22:49,122 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 06:22:49,123 INFO L794 eck$LassoCheckResult]: Stem: 645#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 640#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.alloc(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; 641#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; 646#L17-5 main_#t~short4 := main_~i~0 >= 0; 632#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; 633#L17-3 assume !main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4; 649#L17-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 650#L14-2 main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 647#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; 635#L17-5 [2018-11-23 06:22:49,123 INFO L796 eck$LassoCheckResult]: Loop: 635#L17-5 main_#t~short4 := main_~i~0 >= 0; 630#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; 631#L17-3 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4; 638#L18 assume main_~i~0 < 2;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; 634#L18-2 main_~i~0 := main_~i~0 - 1; 635#L17-5 [2018-11-23 06:22:49,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:22:49,123 INFO L82 PathProgramCache]: Analyzing trace with hash -273945510, now seen corresponding path program 2 times [2018-11-23 06:22:49,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:22:49,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:22:49,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:22:49,124 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:22:49,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:22:49,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:22:49,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:22:49,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:22:49,145 INFO L82 PathProgramCache]: Analyzing trace with hash 43044122, now seen corresponding path program 3 times [2018-11-23 06:22:49,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:22:49,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:22:49,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:22:49,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:22:49,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:22:49,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:22:49,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:22:49,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:22:49,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1968681057, now seen corresponding path program 1 times [2018-11-23 06:22:49,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:22:49,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:22:49,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:22:49,152 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:22:49,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:22:49,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:22:49,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:22:49,374 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 78 [2018-11-23 06:22:49,439 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:22:49,439 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:22:49,439 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:22:49,439 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:22:49,439 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 06:22:49,440 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:22:49,440 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:22:49,440 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:22:49,440 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertion_sort_false-unreach-call_true-termination.i_Iteration7_Lasso [2018-11-23 06:22:49,440 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:22:49,440 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:22:49,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:49,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:49,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:49,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:49,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:49,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:49,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:49,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:49,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:49,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:49,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:49,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:49,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:49,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:49,684 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:22:49,685 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 06:22:49,685 INFO L122 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 [2018-11-23 06:22:49,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:49,686 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:22:49,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:49,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:49,686 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:49,686 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:22:49,686 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:22:49,687 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:49,687 INFO L122 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 [2018-11-23 06:22:49,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:49,688 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:22:49,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:49,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:49,688 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:49,688 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:22:49,688 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:22:49,689 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:49,689 INFO L122 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 [2018-11-23 06:22:49,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:49,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:49,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:49,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:49,691 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:22:49,691 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:22:49,692 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:49,692 INFO L122 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 [2018-11-23 06:22:49,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:49,693 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:22:49,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:49,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:49,693 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:49,693 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:22:49,694 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:22:49,694 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:49,694 INFO L122 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 [2018-11-23 06:22:49,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:49,695 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:22:49,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:49,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:49,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:49,695 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:22:49,695 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:22:49,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:49,696 INFO L122 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 [2018-11-23 06:22:49,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:49,697 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:22:49,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:49,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:49,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:49,697 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:22:49,697 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:22:49,698 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:49,698 INFO L122 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 [2018-11-23 06:22:49,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:49,698 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:22:49,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:49,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:49,699 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:49,699 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:22:49,699 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:22:49,699 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:49,700 INFO L122 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 [2018-11-23 06:22:49,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:49,700 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:22:49,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:49,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:49,700 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:49,701 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:22:49,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:22:49,701 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:49,701 INFO L122 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 [2018-11-23 06:22:49,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:49,702 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:22:49,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:49,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:49,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:49,702 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:22:49,702 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:22:49,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:49,703 INFO L122 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 [2018-11-23 06:22:49,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:49,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:49,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:49,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:49,706 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:22:49,706 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:22:49,718 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 06:22:49,730 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-23 06:22:49,730 INFO L444 ModelExtractionUtils]: 13 out of 19 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-23 06:22:49,730 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 06:22:49,731 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 06:22:49,731 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 06:22:49,732 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, v_rep(select #length ULTIMATE.start_main_~#v~0.base)_3) = 16*ULTIMATE.start_main_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_~#v~0.base)_3 Supporting invariants [] [2018-11-23 06:22:49,771 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2018-11-23 06:22:49,772 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 06:22:49,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:22:49,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:22:49,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:22:49,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:22:49,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:22:49,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:22:49,842 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 [2018-11-23 06:22:49,843 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 42 transitions. cyclomatic complexity: 14 Second operand 4 states. [2018-11-23 06:22:49,895 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 42 transitions. cyclomatic complexity: 14. Second operand 4 states. Result 74 states and 93 transitions. Complement of second has 9 states. [2018-11-23 06:22:49,898 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 [2018-11-23 06:22:49,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 06:22:49,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2018-11-23 06:22:49,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 9 letters. Loop has 5 letters. [2018-11-23 06:22:49,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:22:49,899 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 06:22:49,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:22:49,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:22:49,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:22:49,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:22:49,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:22:49,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:22:49,978 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-23 06:22:49,979 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 42 transitions. cyclomatic complexity: 14 Second operand 5 states. [2018-11-23 06:22:50,036 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 42 transitions. cyclomatic complexity: 14. Second operand 5 states. Result 74 states and 93 transitions. Complement of second has 9 states. [2018-11-23 06:22:50,037 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 [2018-11-23 06:22:50,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 06:22:50,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2018-11-23 06:22:50,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 9 letters. Loop has 5 letters. [2018-11-23 06:22:50,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:22:50,038 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 06:22:50,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:22:50,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:22:50,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:22:50,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:22:50,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:22:50,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:22:50,097 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-23 06:22:50,097 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 42 transitions. cyclomatic complexity: 14 Second operand 5 states. [2018-11-23 06:22:50,152 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 42 transitions. cyclomatic complexity: 14. Second operand 5 states. Result 75 states and 98 transitions. Complement of second has 8 states. [2018-11-23 06:22:50,153 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 [2018-11-23 06:22:50,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 06:22:50,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2018-11-23 06:22:50,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 45 transitions. Stem has 9 letters. Loop has 5 letters. [2018-11-23 06:22:50,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:22:50,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 45 transitions. Stem has 14 letters. Loop has 5 letters. [2018-11-23 06:22:50,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:22:50,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 45 transitions. Stem has 9 letters. Loop has 10 letters. [2018-11-23 06:22:50,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:22:50,154 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 98 transitions. [2018-11-23 06:22:50,155 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-23 06:22:50,156 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 39 states and 49 transitions. [2018-11-23 06:22:50,156 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-23 06:22:50,156 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-23 06:22:50,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 49 transitions. [2018-11-23 06:22:50,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:22:50,156 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 49 transitions. [2018-11-23 06:22:50,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 49 transitions. [2018-11-23 06:22:50,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 20. [2018-11-23 06:22:50,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 06:22:50,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2018-11-23 06:22:50,160 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2018-11-23 06:22:50,160 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2018-11-23 06:22:50,161 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-23 06:22:50,161 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2018-11-23 06:22:50,161 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 06:22:50,161 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:22:50,161 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:22:50,163 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:22:50,164 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 06:22:50,164 INFO L794 eck$LassoCheckResult]: Stem: 1098#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1093#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.alloc(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; 1094#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; 1101#L17-5 main_#t~short4 := main_~i~0 >= 0; 1090#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; 1091#L17-3 assume !main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4; 1099#L17-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 1100#L14-2 main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 1102#L14-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 1095#L14-4 main_~k~0 := 1; 1096#L24-3 [2018-11-23 06:22:50,164 INFO L796 eck$LassoCheckResult]: Loop: 1096#L24-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; 1097#L4 assume !(0 == __VERIFIER_assert_~cond); 1105#L4-2 havoc main_#t~mem7;havoc main_#t~mem8; 1103#L24-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 1096#L24-3 [2018-11-23 06:22:50,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:22:50,164 INFO L82 PathProgramCache]: Analyzing trace with hash 97623763, now seen corresponding path program 1 times [2018-11-23 06:22:50,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:22:50,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:22:50,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:22:50,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:22:50,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:22:50,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:22:50,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:22:50,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:22:50,178 INFO L82 PathProgramCache]: Analyzing trace with hash 2500554, now seen corresponding path program 2 times [2018-11-23 06:22:50,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:22:50,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:22:50,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:22:50,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:22:50,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:22:50,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:22:50,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:22:50,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:22:50,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1938296220, now seen corresponding path program 1 times [2018-11-23 06:22:50,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:22:50,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:22:50,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:22:50,187 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:22:50,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:22:50,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:22:50,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:22:50,453 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:22:50,453 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:22:50,453 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:22:50,453 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:22:50,453 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 06:22:50,453 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:22:50,453 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:22:50,453 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:22:50,453 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertion_sort_false-unreach-call_true-termination.i_Iteration8_Lasso [2018-11-23 06:22:50,453 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:22:50,453 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:22:50,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:50,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:50,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:50,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:50,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:50,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:50,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:50,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:50,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:50,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:50,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:50,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:50,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:50,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:50,800 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:22:50,800 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 06:22:50,801 INFO L122 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 [2018-11-23 06:22:50,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:50,801 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:22:50,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:50,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:50,802 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:50,802 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:22:50,802 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:22:50,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:50,803 INFO L122 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 [2018-11-23 06:22:50,803 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:50,803 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:22:50,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:50,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:50,803 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:50,804 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:22:50,804 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:22:50,804 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:50,804 INFO L122 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 [2018-11-23 06:22:50,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:50,805 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:22:50,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:50,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:50,805 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:50,805 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:22:50,805 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:22:50,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:50,810 INFO L122 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 [2018-11-23 06:22:50,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:50,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:50,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:50,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:50,812 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:22:50,812 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:22:50,813 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:50,813 INFO L122 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 [2018-11-23 06:22:50,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:50,814 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:22:50,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:50,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:50,815 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:50,815 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:22:50,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:22:50,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:50,816 INFO L122 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 [2018-11-23 06:22:50,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:50,816 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:22:50,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:50,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:50,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:50,817 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:22:50,817 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:22:50,817 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:50,817 INFO L122 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 [2018-11-23 06:22:50,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:50,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:50,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:50,819 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:50,820 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:22:50,820 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:22:50,821 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:50,821 INFO L122 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 [2018-11-23 06:22:50,822 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:50,822 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:22:50,823 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:50,823 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:50,823 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:50,823 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:22:50,823 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:22:50,824 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:50,825 INFO L122 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 [2018-11-23 06:22:50,825 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:50,825 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:22:50,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:50,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:50,826 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:50,827 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:22:50,827 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:22:50,827 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:50,828 INFO L122 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 [2018-11-23 06:22:50,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:50,828 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:22:50,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:50,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:50,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:50,829 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:22:50,829 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:22:50,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:50,829 INFO L122 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 [2018-11-23 06:22:50,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:50,830 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:22:50,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:50,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:50,830 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:50,831 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:22:50,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:22:50,831 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:50,832 INFO L122 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 [2018-11-23 06:22:50,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:50,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:50,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:50,832 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:50,833 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:22:50,833 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:22:50,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:50,837 INFO L122 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 [2018-11-23 06:22:50,837 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:50,838 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 06:22:50,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:50,838 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:50,839 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 06:22:50,839 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:22:50,840 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:50,841 INFO L122 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 [2018-11-23 06:22:50,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:50,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:50,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:50,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:50,845 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:22:50,846 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:22:50,870 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 06:22:50,881 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 06:22:50,881 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 06:22:50,881 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 06:22:50,883 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 06:22:50,884 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 06:22:50,884 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0, v_rep(select #length ULTIMATE.start_main_~#v~0.base)_4, ULTIMATE.start_main_~#v~0.offset) = -4*ULTIMATE.start_main_~k~0 + 1*v_rep(select #length ULTIMATE.start_main_~#v~0.base)_4 - 1*ULTIMATE.start_main_~#v~0.offset Supporting invariants [] [2018-11-23 06:22:50,938 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2018-11-23 06:22:50,939 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 06:22:50,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:22:50,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:22:50,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:22:50,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:22:50,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:22:50,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:22:50,971 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 [2018-11-23 06:22:50,971 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 25 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-23 06:22:50,976 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 25 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 24 states and 30 transitions. Complement of second has 4 states. [2018-11-23 06:22:50,976 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 [2018-11-23 06:22:50,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 06:22:50,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2018-11-23 06:22:50,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 10 letters. Loop has 4 letters. [2018-11-23 06:22:50,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:22:50,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 14 letters. Loop has 4 letters. [2018-11-23 06:22:50,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:22:50,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 10 letters. Loop has 8 letters. [2018-11-23 06:22:50,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:22:50,978 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 30 transitions. [2018-11-23 06:22:50,978 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 06:22:50,978 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 0 states and 0 transitions. [2018-11-23 06:22:50,978 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 06:22:50,979 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 06:22:50,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 06:22:50,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:22:50,979 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 06:22:50,979 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 06:22:50,979 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 06:22:50,979 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-23 06:22:50,979 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 06:22:50,979 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 06:22:50,979 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 06:22:50,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 06:22:50 BoogieIcfgContainer [2018-11-23 06:22:50,985 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 06:22:50,986 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 06:22:50,986 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 06:22:50,986 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 06:22:50,986 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:22:46" (3/4) ... [2018-11-23 06:22:50,989 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 06:22:50,989 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 06:22:50,991 INFO L168 Benchmark]: Toolchain (without parser) took 5146.13 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 347.6 MB). Free memory was 962.9 MB in the beginning and 1.2 GB in the end (delta: -270.7 MB). Peak memory consumption was 76.9 MB. Max. memory is 11.5 GB. [2018-11-23 06:22:50,992 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:22:50,992 INFO L168 Benchmark]: CACSL2BoogieTranslator took 166.67 ms. Allocated memory is still 1.0 GB. Free memory was 962.9 MB in the beginning and 952.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 06:22:50,993 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.89 ms. Allocated memory is still 1.0 GB. Free memory was 952.1 MB in the beginning and 946.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 06:22:50,994 INFO L168 Benchmark]: Boogie Preprocessor took 63.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 946.8 MB in the beginning and 1.2 GB in the end (delta: -205.9 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2018-11-23 06:22:50,994 INFO L168 Benchmark]: RCFGBuilder took 235.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2018-11-23 06:22:50,995 INFO L168 Benchmark]: BuchiAutomizer took 4645.53 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 186.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -99.0 MB). Peak memory consumption was 87.2 MB. Max. memory is 11.5 GB. [2018-11-23 06:22:50,996 INFO L168 Benchmark]: Witness Printer took 3.97 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:22:50,998 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 166.67 ms. Allocated memory is still 1.0 GB. Free memory was 962.9 MB in the beginning and 952.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.89 ms. Allocated memory is still 1.0 GB. Free memory was 952.1 MB in the beginning and 946.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 63.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 946.8 MB in the beginning and 1.2 GB in the end (delta: -205.9 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 235.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4645.53 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 186.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -99.0 MB). Peak memory consumption was 87.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.97 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 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 - 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 8 terminating modules (4 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 16 * i + unknown-#length-unknown[v] and consists of 5 locations. One deterministic module has affine ranking function -4 * k + unknown-#length-unknown[v] + -1 * v and consists of 3 locations. One nondeterministic module has affine ranking function 16 * i + unknown-#length-unknown[v] and consists of 5 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.6s and 9 iterations. TraceHistogramMax:2. Analysis of lassos took 3.5s. Construction of modules took 0.2s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 67 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 51 states and ocurred in iteration 3. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 161 SDtfs, 291 SDslu, 151 SDs, 0 SdLazy, 220 SolverSat, 35 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital167 mio100 ax100 hnf99 lsp95 ukn68 mio100 lsp79 div191 bol100 ite100 ukn100 eq149 hnf61 smp88 dnf122 smp90 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...