./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/loops/insertion_sort_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5e62e16b-4c0f-404f-83fc-240ac24298e3/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5e62e16b-4c0f-404f-83fc-240ac24298e3/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5e62e16b-4c0f-404f-83fc-240ac24298e3/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5e62e16b-4c0f-404f-83fc-240ac24298e3/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loops/insertion_sort_true-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_5e62e16b-4c0f-404f-83fc-240ac24298e3/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5e62e16b-4c0f-404f-83fc-240ac24298e3/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 e74ff11a050ce92aa6d5151e04de4f3f3a890d4c ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 11:50:15,446 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 11:50:15,447 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 11:50:15,453 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 11:50:15,453 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 11:50:15,454 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 11:50:15,454 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 11:50:15,455 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 11:50:15,456 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 11:50:15,457 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 11:50:15,457 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 11:50:15,458 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 11:50:15,458 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 11:50:15,459 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 11:50:15,460 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 11:50:15,460 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 11:50:15,460 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 11:50:15,461 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 11:50:15,463 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 11:50:15,463 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 11:50:15,464 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 11:50:15,465 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 11:50:15,466 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 11:50:15,466 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 11:50:15,466 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 11:50:15,467 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 11:50:15,467 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 11:50:15,468 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 11:50:15,468 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 11:50:15,469 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 11:50:15,469 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 11:50:15,470 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 11:50:15,470 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 11:50:15,470 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 11:50:15,470 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 11:50:15,471 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 11:50:15,471 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5e62e16b-4c0f-404f-83fc-240ac24298e3/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-08 11:50:15,479 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 11:50:15,479 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 11:50:15,480 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 11:50:15,480 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 11:50:15,481 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 11:50:15,481 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-08 11:50:15,481 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-08 11:50:15,481 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-08 11:50:15,481 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-08 11:50:15,481 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-08 11:50:15,481 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-08 11:50:15,482 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 11:50:15,482 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 11:50:15,482 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 11:50:15,482 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 11:50:15,482 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 11:50:15,482 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 11:50:15,483 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-08 11:50:15,483 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-08 11:50:15,483 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-08 11:50:15,483 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 11:50:15,483 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 11:50:15,483 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-08 11:50:15,483 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 11:50:15,484 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-08 11:50:15,484 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 11:50:15,484 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 11:50:15,484 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-08 11:50:15,484 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 11:50:15,484 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 11:50:15,484 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-08 11:50:15,485 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-08 11:50:15,485 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_5e62e16b-4c0f-404f-83fc-240ac24298e3/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 -> e74ff11a050ce92aa6d5151e04de4f3f3a890d4c [2018-12-08 11:50:15,502 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 11:50:15,511 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 11:50:15,514 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 11:50:15,515 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 11:50:15,515 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 11:50:15,516 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5e62e16b-4c0f-404f-83fc-240ac24298e3/bin-2019/uautomizer/../../sv-benchmarks/c/loops/insertion_sort_true-unreach-call_true-termination.i [2018-12-08 11:50:15,559 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5e62e16b-4c0f-404f-83fc-240ac24298e3/bin-2019/uautomizer/data/75594feea/cb24c15063f84dbbb33fe134bdaf7fe7/FLAG1993a022a [2018-12-08 11:50:15,834 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 11:50:15,835 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5e62e16b-4c0f-404f-83fc-240ac24298e3/sv-benchmarks/c/loops/insertion_sort_true-unreach-call_true-termination.i [2018-12-08 11:50:15,838 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5e62e16b-4c0f-404f-83fc-240ac24298e3/bin-2019/uautomizer/data/75594feea/cb24c15063f84dbbb33fe134bdaf7fe7/FLAG1993a022a [2018-12-08 11:50:15,846 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5e62e16b-4c0f-404f-83fc-240ac24298e3/bin-2019/uautomizer/data/75594feea/cb24c15063f84dbbb33fe134bdaf7fe7 [2018-12-08 11:50:15,847 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 11:50:15,848 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 11:50:15,849 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 11:50:15,849 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 11:50:15,851 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 11:50:15,851 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 11:50:15" (1/1) ... [2018-12-08 11:50:15,852 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@870cb06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:50:15, skipping insertion in model container [2018-12-08 11:50:15,852 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 11:50:15" (1/1) ... [2018-12-08 11:50:15,856 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 11:50:15,865 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 11:50:15,951 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 11:50:15,953 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 11:50:15,965 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 11:50:15,976 INFO L195 MainTranslator]: Completed translation [2018-12-08 11:50:15,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:50:15 WrapperNode [2018-12-08 11:50:15,976 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 11:50:15,976 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 11:50:15,976 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 11:50:15,976 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 11:50:15,981 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:50:15" (1/1) ... [2018-12-08 11:50:15,986 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:50:15" (1/1) ... [2018-12-08 11:50:15,998 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 11:50:15,998 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 11:50:15,998 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 11:50:15,998 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 11:50:16,032 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:50:15" (1/1) ... [2018-12-08 11:50:16,032 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:50:15" (1/1) ... [2018-12-08 11:50:16,033 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:50:15" (1/1) ... [2018-12-08 11:50:16,033 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:50:15" (1/1) ... [2018-12-08 11:50:16,036 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:50:15" (1/1) ... [2018-12-08 11:50:16,039 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:50:15" (1/1) ... [2018-12-08 11:50:16,040 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:50:15" (1/1) ... [2018-12-08 11:50:16,041 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 11:50:16,041 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 11:50:16,041 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 11:50:16,041 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 11:50:16,042 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:50:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5e62e16b-4c0f-404f-83fc-240ac24298e3/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-12-08 11:50:16,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 11:50:16,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 11:50:16,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 11:50:16,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 11:50:16,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 11:50:16,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 11:50:16,197 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 11:50:16,197 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-12-08 11:50:16,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 11:50:16 BoogieIcfgContainer [2018-12-08 11:50:16,198 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 11:50:16,198 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-08 11:50:16,199 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-08 11:50:16,202 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-08 11:50:16,202 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 11:50:16,203 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.12 11:50:15" (1/3) ... [2018-12-08 11:50:16,203 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@42e80310 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 11:50:16, skipping insertion in model container [2018-12-08 11:50:16,204 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 11:50:16,204 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:50:15" (2/3) ... [2018-12-08 11:50:16,204 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@42e80310 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 11:50:16, skipping insertion in model container [2018-12-08 11:50:16,204 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 11:50:16,204 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 11:50:16" (3/3) ... [2018-12-08 11:50:16,206 INFO L375 chiAutomizerObserver]: Analyzing ICFG insertion_sort_true-unreach-call_true-termination.i [2018-12-08 11:50:16,250 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 11:50:16,250 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-08 11:50:16,250 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-08 11:50:16,250 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-08 11:50:16,251 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 11:50:16,251 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 11:50:16,251 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-08 11:50:16,251 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 11:50:16,251 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-08 11:50:16,262 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-12-08 11:50:16,279 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-12-08 11:50:16,280 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 11:50:16,280 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 11:50:16,285 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-08 11:50:16,285 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-08 11:50:16,285 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-08 11:50:16,286 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-12-08 11:50:16,287 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-12-08 11:50:16,287 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 11:50:16,287 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 11:50:16,287 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-08 11:50:16,287 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-08 11:50:16,295 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.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; 11#L14-3true [2018-12-08 11:50:16,296 INFO L796 eck$LassoCheckResult]: Loop: 11#L14-3true assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 13#L17-5true assume !true; 12#L17-6true call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 14#L14-2true main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 11#L14-3true [2018-12-08 11:50:16,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:50:16,300 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-12-08 11:50:16,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:50:16,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:50:16,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:50:16,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:50:16,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:50:16,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 11:50:16,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 11:50:16,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:50:16,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1249301, now seen corresponding path program 1 times [2018-12-08 11:50:16,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:50:16,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:50:16,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:50:16,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:50:16,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:50:16,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:50:16,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:50:16,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:50:16,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 11:50:16,407 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-08 11:50:16,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-08 11:50:16,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-08 11:50:16,418 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-12-08 11:50:16,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:50:16,423 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2018-12-08 11:50:16,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-08 11:50:16,424 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 21 transitions. [2018-12-08 11:50:16,425 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-08 11:50:16,428 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 16 transitions. [2018-12-08 11:50:16,429 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-12-08 11:50:16,429 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-12-08 11:50:16,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2018-12-08 11:50:16,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 11:50:16,430 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-12-08 11:50:16,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2018-12-08 11:50:16,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-08 11:50:16,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-08 11:50:16,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2018-12-08 11:50:16,446 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-12-08 11:50:16,447 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-12-08 11:50:16,447 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-08 11:50:16,447 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2018-12-08 11:50:16,447 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-08 11:50:16,447 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 11:50:16,447 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 11:50:16,448 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-08 11:50:16,448 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-08 11:50:16,448 INFO L794 eck$LassoCheckResult]: Stem: 52#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 48#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.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; 49#L14-3 [2018-12-08 11:50:16,448 INFO L796 eck$LassoCheckResult]: Loop: 49#L14-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 55#L17-5 main_#t~short4 := main_~i~0 >= 0; 44#L17-1 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 > main_~key~0; 45#L17-3 assume !main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4; 53#L17-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 54#L14-2 main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 49#L14-3 [2018-12-08 11:50:16,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:50:16,448 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-12-08 11:50:16,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:50:16,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:50:16,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:50:16,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:50:16,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:50:16,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 11:50:16,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 11:50:16,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:50:16,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1188208270, now seen corresponding path program 1 times [2018-12-08 11:50:16,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:50:16,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:50:16,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:50:16,464 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 11:50:16,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:50:16,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 11:50:16,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 11:50:16,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:50:16,489 INFO L82 PathProgramCache]: Analyzing trace with hash 268257488, now seen corresponding path program 1 times [2018-12-08 11:50:16,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:50:16,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:50:16,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:50:16,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:50:16,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:50:16,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 11:50:16,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 11:50:16,623 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2018-12-08 11:50:16,720 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 11:50:16,720 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 11:50:16,720 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 11:50:16,721 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 11:50:16,721 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 11:50:16,721 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 11:50:16,721 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 11:50:16,721 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 11:50:16,721 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertion_sort_true-unreach-call_true-termination.i_Iteration2_Lasso [2018-12-08 11:50:16,721 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 11:50:16,722 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 11:50:16,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:50:16,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:50:16,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:50:16,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:50:16,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:50:16,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:50:16,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:50:16,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:50:16,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:50:16,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:50:16,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:50:16,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:50:16,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:50:16,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:50:17,080 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 11:50:17,083 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 11:50:17,084 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-12-08 11:50:17,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 11:50:17,085 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 11:50:17,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 11:50:17,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 11:50:17,086 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 11:50:17,087 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 11:50:17,087 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 11:50:17,089 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 11:50:17,089 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-12-08 11:50:17,089 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 11:50:17,089 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 11:50:17,089 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 11:50:17,089 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 11:50:17,090 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 11:50:17,090 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 11:50:17,090 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 11:50:17,091 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 11:50:17,091 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-12-08 11:50:17,091 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 11:50:17,091 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 11:50:17,091 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 11:50:17,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 11:50:17,091 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 11:50:17,092 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 11:50:17,092 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 11:50:17,092 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 11:50:17,093 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-12-08 11:50:17,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 11:50:17,093 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 11:50:17,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 11:50:17,093 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 11:50:17,093 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 11:50:17,093 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 11:50:17,094 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 11:50:17,094 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 11:50:17,094 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-12-08 11:50:17,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 11:50:17,094 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 11:50:17,095 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 11:50:17,095 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 11:50:17,095 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 11:50:17,095 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 11:50:17,095 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 11:50:17,095 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 11:50:17,096 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-12-08 11:50:17,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 11:50:17,096 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 11:50:17,096 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 11:50:17,096 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 11:50:17,096 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 11:50:17,097 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 11:50:17,097 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 11:50:17,097 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 11:50:17,098 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-12-08 11:50:17,098 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 11:50:17,098 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 11:50:17,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 11:50:17,098 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 11:50:17,098 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 11:50:17,099 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 11:50:17,099 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 11:50:17,099 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 11:50:17,099 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-12-08 11:50:17,100 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 11:50:17,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 11:50:17,100 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 11:50:17,100 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 11:50:17,101 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 11:50:17,101 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 11:50:17,103 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 11:50:17,103 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-12-08 11:50:17,104 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 11:50:17,104 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 11:50:17,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 11:50:17,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 11:50:17,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 11:50:17,104 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 11:50:17,104 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 11:50:17,105 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 11:50:17,105 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-12-08 11:50:17,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 11:50:17,106 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 11:50:17,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 11:50:17,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 11:50:17,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 11:50:17,106 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 11:50:17,107 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 11:50:17,107 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 11:50:17,107 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-12-08 11:50:17,108 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 11:50:17,108 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 11:50:17,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 11:50:17,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 11:50:17,108 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 11:50:17,109 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 11:50:17,109 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 11:50:17,110 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 11:50:17,110 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-12-08 11:50:17,110 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 11:50:17,110 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 11:50:17,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 11:50:17,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 11:50:17,111 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 11:50:17,111 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 11:50:17,111 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 11:50:17,112 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 11:50:17,112 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-12-08 11:50:17,112 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 11:50:17,112 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 11:50:17,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 11:50:17,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 11:50:17,113 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 11:50:17,113 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 11:50:17,113 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 11:50:17,114 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 11:50:17,114 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-12-08 11:50:17,115 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 11:50:17,115 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 11:50:17,115 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 11:50:17,115 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 11:50:17,116 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 11:50:17,116 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 11:50:17,122 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 11:50:17,122 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-12-08 11:50:17,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 11:50:17,123 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 11:50:17,123 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 11:50:17,123 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 11:50:17,127 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 11:50:17,127 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 11:50:17,163 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 11:50:17,194 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-08 11:50:17,194 INFO L444 ModelExtractionUtils]: 12 out of 19 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-08 11:50:17,196 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 11:50:17,197 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 11:50:17,198 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 11:50:17,198 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-12-08 11:50:17,204 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2018-12-08 11:50:17,208 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-08 11:50:17,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:50:17,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:50:17,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:50:17,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:50:17,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:50:17,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:50:17,260 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-12-08 11:50:17,261 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-12-08 11:50:17,300 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 25 states and 34 transitions. Complement of second has 6 states. [2018-12-08 11:50:17,301 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-12-08 11:50:17,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 11:50:17,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-12-08 11:50:17,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 2 letters. Loop has 6 letters. [2018-12-08 11:50:17,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 11:50:17,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 8 letters. Loop has 6 letters. [2018-12-08 11:50:17,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 11:50:17,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 2 letters. Loop has 12 letters. [2018-12-08 11:50:17,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 11:50:17,304 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 34 transitions. [2018-12-08 11:50:17,305 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-12-08 11:50:17,306 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 18 states and 25 transitions. [2018-12-08 11:50:17,306 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-08 11:50:17,306 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-12-08 11:50:17,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2018-12-08 11:50:17,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 11:50:17,306 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-12-08 11:50:17,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2018-12-08 11:50:17,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-12-08 11:50:17,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-08 11:50:17,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2018-12-08 11:50:17,308 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2018-12-08 11:50:17,308 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2018-12-08 11:50:17,308 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-08 11:50:17,308 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2018-12-08 11:50:17,308 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-12-08 11:50:17,308 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 11:50:17,308 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 11:50:17,308 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-08 11:50:17,309 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 11:50:17,309 INFO L794 eck$LassoCheckResult]: Stem: 147#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 143#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.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; 144#L14-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 151#L17-5 [2018-12-08 11:50:17,309 INFO L796 eck$LassoCheckResult]: Loop: 151#L17-5 main_#t~short4 := main_~i~0 >= 0; 137#L17-1 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 > main_~key~0; 138#L17-3 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;call main_#t~mem5 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);call write~int(main_#t~mem5, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4);havoc main_#t~mem5;main_~i~0 := main_~i~0 - 1; 151#L17-5 [2018-12-08 11:50:17,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:50:17,309 INFO L82 PathProgramCache]: Analyzing trace with hash 29863, now seen corresponding path program 1 times [2018-12-08 11:50:17,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:50:17,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:50:17,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:50:17,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:50:17,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:50:17,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 11:50:17,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 11:50:17,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:50:17,325 INFO L82 PathProgramCache]: Analyzing trace with hash 44790, now seen corresponding path program 1 times [2018-12-08 11:50:17,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:50:17,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:50:17,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:50:17,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:50:17,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:50:17,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 11:50:17,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 11:50:17,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:50:17,334 INFO L82 PathProgramCache]: Analyzing trace with hash 889663632, now seen corresponding path program 1 times [2018-12-08 11:50:17,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:50:17,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:50:17,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:50:17,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:50:17,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:50:17,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 11:50:17,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 11:50:17,502 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 11:50:17,502 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 11:50:17,502 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 11:50:17,502 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 11:50:17,503 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 11:50:17,503 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 11:50:17,503 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 11:50:17,503 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 11:50:17,503 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertion_sort_true-unreach-call_true-termination.i_Iteration3_Lasso [2018-12-08 11:50:17,503 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 11:50:17,503 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 11:50:17,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:50:17,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:50:17,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:50:17,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:50:17,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:50:17,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:50:17,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:50:17,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:50:17,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:50:17,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:50:17,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:50:17,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:50:17,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:50:17,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:50:17,678 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 11:50:17,678 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 11:50:17,679 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-12-08 11:50:17,679 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 11:50:17,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 11:50:17,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 11:50:17,680 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 11:50:17,681 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 11:50:17,681 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 11:50:17,685 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 11:50:17,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-12-08 11:50:17,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 11:50:17,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 11:50:17,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 11:50:17,686 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 11:50:17,688 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 11:50:17,688 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 11:50:17,699 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 11:50:17,708 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-12-08 11:50:17,708 INFO L444 ModelExtractionUtils]: 14 out of 19 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-08 11:50:17,709 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 11:50:17,709 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 11:50:17,710 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 11:50:17,710 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 2*ULTIMATE.start_main_~i~0 + 1 Supporting invariants [] [2018-12-08 11:50:17,713 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2018-12-08 11:50:17,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:50:17,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:50:17,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:50:17,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:50:17,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:50:17,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:50:17,752 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-12-08 11:50:17,752 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 10 Second operand 4 states. [2018-12-08 11:50:17,797 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 10. Second operand 4 states. Result 69 states and 87 transitions. Complement of second has 9 states. [2018-12-08 11:50:17,797 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-12-08 11:50:17,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-08 11:50:17,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2018-12-08 11:50:17,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 3 letters. Loop has 3 letters. [2018-12-08 11:50:17,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 11:50:17,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 6 letters. Loop has 3 letters. [2018-12-08 11:50:17,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 11:50:17,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 3 letters. Loop has 6 letters. [2018-12-08 11:50:17,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 11:50:17,799 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 87 transitions. [2018-12-08 11:50:17,800 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 19 [2018-12-08 11:50:17,802 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 45 states and 58 transitions. [2018-12-08 11:50:17,802 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-12-08 11:50:17,802 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-12-08 11:50:17,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 58 transitions. [2018-12-08 11:50:17,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 11:50:17,802 INFO L705 BuchiCegarLoop]: Abstraction has 45 states and 58 transitions. [2018-12-08 11:50:17,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 58 transitions. [2018-12-08 11:50:17,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 22. [2018-12-08 11:50:17,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-08 11:50:17,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-12-08 11:50:17,805 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-12-08 11:50:17,805 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-12-08 11:50:17,805 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-08 11:50:17,805 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2018-12-08 11:50:17,805 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-12-08 11:50:17,805 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 11:50:17,806 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 11:50:17,806 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-08 11:50:17,806 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-08 11:50:17,806 INFO L794 eck$LassoCheckResult]: Stem: 287#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 283#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.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; 284#L14-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 285#L14-4 main_~k~0 := 1; 281#L23-3 [2018-12-08 11:50:17,806 INFO L796 eck$LassoCheckResult]: Loop: 281#L23-3 assume !!(main_~k~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem7 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * (main_~k~0 - 1), 4);call main_#t~mem8 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~k~0, 4);__VERIFIER_assert_#in~cond := (if main_#t~mem7 <= main_#t~mem8 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 282#L4 assume !(0 == __VERIFIER_assert_~cond); 295#L4-2 havoc main_#t~mem7;havoc main_#t~mem8; 286#L23-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 281#L23-3 [2018-12-08 11:50:17,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:50:17,806 INFO L82 PathProgramCache]: Analyzing trace with hash 925727, now seen corresponding path program 1 times [2018-12-08 11:50:17,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:50:17,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:50:17,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:50:17,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:50:17,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:50:17,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 11:50:17,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 11:50:17,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:50:17,815 INFO L82 PathProgramCache]: Analyzing trace with hash 2285066, now seen corresponding path program 1 times [2018-12-08 11:50:17,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:50:17,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:50:17,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:50:17,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:50:17,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:50:17,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 11:50:17,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 11:50:17,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:50:17,821 INFO L82 PathProgramCache]: Analyzing trace with hash 231194408, now seen corresponding path program 1 times [2018-12-08 11:50:17,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:50:17,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:50:17,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:50:17,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:50:17,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:50:17,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:50:17,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:50:17,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:50:17,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 11:50:18,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 11:50:18,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 11:50:18,012 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. cyclomatic complexity: 13 Second operand 4 states. [2018-12-08 11:50:18,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:50:18,069 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2018-12-08 11:50:18,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 11:50:18,070 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 34 transitions. [2018-12-08 11:50:18,070 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-12-08 11:50:18,071 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 24 states and 32 transitions. [2018-12-08 11:50:18,071 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-08 11:50:18,071 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-08 11:50:18,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 32 transitions. [2018-12-08 11:50:18,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 11:50:18,071 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2018-12-08 11:50:18,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 32 transitions. [2018-12-08 11:50:18,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2018-12-08 11:50:18,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-08 11:50:18,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2018-12-08 11:50:18,073 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2018-12-08 11:50:18,073 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2018-12-08 11:50:18,073 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-08 11:50:18,073 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 30 transitions. [2018-12-08 11:50:18,074 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-12-08 11:50:18,074 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 11:50:18,074 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 11:50:18,074 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:50:18,074 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 11:50:18,075 INFO L794 eck$LassoCheckResult]: Stem: 346#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 342#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.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; 343#L14-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 349#L17-5 main_#t~short4 := main_~i~0 >= 0; 338#L17-1 assume !main_#t~short4; 339#L17-3 assume !main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4; 347#L17-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 348#L14-2 main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 350#L14-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 352#L17-5 [2018-12-08 11:50:18,075 INFO L796 eck$LassoCheckResult]: Loop: 352#L17-5 main_#t~short4 := main_~i~0 >= 0; 336#L17-1 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 > main_~key~0; 337#L17-3 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;call main_#t~mem5 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);call write~int(main_#t~mem5, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4);havoc main_#t~mem5;main_~i~0 := main_~i~0 - 1; 352#L17-5 [2018-12-08 11:50:18,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:50:18,075 INFO L82 PathProgramCache]: Analyzing trace with hash -272105412, now seen corresponding path program 1 times [2018-12-08 11:50:18,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:50:18,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:50:18,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:50:18,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:50:18,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:50:18,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:50:18,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:50:18,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:50:18,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 11:50:18,091 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 11:50:18,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:50:18,091 INFO L82 PathProgramCache]: Analyzing trace with hash 44790, now seen corresponding path program 2 times [2018-12-08 11:50:18,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:50:18,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:50:18,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:50:18,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:50:18,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:50:18,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 11:50:18,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 11:50:18,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 11:50:18,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 11:50:18,165 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. cyclomatic complexity: 12 Second operand 5 states. [2018-12-08 11:50:18,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:50:18,198 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2018-12-08 11:50:18,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 11:50:18,198 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 53 transitions. [2018-12-08 11:50:18,199 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2018-12-08 11:50:18,199 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 53 transitions. [2018-12-08 11:50:18,199 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-12-08 11:50:18,199 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-12-08 11:50:18,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 53 transitions. [2018-12-08 11:50:18,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 11:50:18,199 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 53 transitions. [2018-12-08 11:50:18,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 53 transitions. [2018-12-08 11:50:18,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 29. [2018-12-08 11:50:18,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-08 11:50:18,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2018-12-08 11:50:18,201 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2018-12-08 11:50:18,201 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2018-12-08 11:50:18,201 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-08 11:50:18,201 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 38 transitions. [2018-12-08 11:50:18,201 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-12-08 11:50:18,201 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 11:50:18,201 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 11:50:18,202 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:50:18,202 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-08 11:50:18,202 INFO L794 eck$LassoCheckResult]: Stem: 421#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 417#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.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; 418#L14-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 424#L17-5 main_#t~short4 := main_~i~0 >= 0; 413#L17-1 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 > main_~key~0; 414#L17-3 assume !main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4; 422#L17-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 423#L14-2 main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 425#L14-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 419#L14-4 main_~k~0 := 1; 415#L23-3 [2018-12-08 11:50:18,202 INFO L796 eck$LassoCheckResult]: Loop: 415#L23-3 assume !!(main_~k~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem7 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * (main_~k~0 - 1), 4);call main_#t~mem8 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~k~0, 4);__VERIFIER_assert_#in~cond := (if main_#t~mem7 <= main_#t~mem8 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 416#L4 assume !(0 == __VERIFIER_assert_~cond); 429#L4-2 havoc main_#t~mem7;havoc main_#t~mem8; 420#L23-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 415#L23-3 [2018-12-08 11:50:18,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:50:18,202 INFO L82 PathProgramCache]: Analyzing trace with hash 97408492, now seen corresponding path program 1 times [2018-12-08 11:50:18,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:50:18,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:50:18,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:50:18,203 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 11:50:18,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:50:18,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 11:50:18,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 11:50:18,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:50:18,218 INFO L82 PathProgramCache]: Analyzing trace with hash 2285066, now seen corresponding path program 2 times [2018-12-08 11:50:18,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:50:18,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:50:18,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:50:18,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:50:18,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:50:18,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 11:50:18,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 11:50:18,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:50:18,225 INFO L82 PathProgramCache]: Analyzing trace with hash 699287157, now seen corresponding path program 1 times [2018-12-08 11:50:18,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:50:18,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:50:18,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:50:18,226 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 11:50:18,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:50:18,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 11:50:18,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 11:50:18,413 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 77 [2018-12-08 11:50:18,490 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 11:50:18,490 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 11:50:18,490 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 11:50:18,490 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 11:50:18,490 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 11:50:18,490 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 11:50:18,490 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 11:50:18,491 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 11:50:18,491 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertion_sort_true-unreach-call_true-termination.i_Iteration6_Lasso [2018-12-08 11:50:18,491 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 11:50:18,491 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 11:50:18,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:50:18,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:50:18,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:50:18,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:50:18,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:50:18,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:50:18,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:50:18,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:50:18,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:50:18,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:50:18,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:50:18,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:50:18,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:50:18,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:50:18,769 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 11:50:18,769 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 11:50:18,770 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-12-08 11:50:18,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 11:50:18,770 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 11:50:18,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 11:50:18,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 11:50:18,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 11:50:18,771 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 11:50:18,771 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 11:50:18,771 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 11:50:18,772 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-12-08 11:50:18,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 11:50:18,772 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 11:50:18,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 11:50:18,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 11:50:18,772 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 11:50:18,773 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 11:50:18,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 11:50:18,773 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 11:50:18,773 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-12-08 11:50:18,773 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 11:50:18,773 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 11:50:18,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 11:50:18,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 11:50:18,774 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 11:50:18,774 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 11:50:18,774 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 11:50:18,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 11:50:18,774 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-12-08 11:50:18,774 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 11:50:18,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 11:50:18,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 11:50:18,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 11:50:18,775 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 11:50:18,776 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 11:50:18,776 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 11:50:18,777 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-12-08 11:50:18,777 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 11:50:18,777 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 11:50:18,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 11:50:18,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 11:50:18,777 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 11:50:18,777 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 11:50:18,777 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 11:50:18,778 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 11:50:18,778 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-12-08 11:50:18,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 11:50:18,778 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 11:50:18,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 11:50:18,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 11:50:18,778 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 11:50:18,778 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 11:50:18,778 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 11:50:18,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 11:50:18,779 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-12-08 11:50:18,779 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 11:50:18,779 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 11:50:18,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 11:50:18,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 11:50:18,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 11:50:18,780 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 11:50:18,780 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 11:50:18,780 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 11:50:18,780 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-12-08 11:50:18,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 11:50:18,780 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 11:50:18,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 11:50:18,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 11:50:18,781 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 11:50:18,781 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 11:50:18,781 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 11:50:18,782 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 11:50:18,782 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-12-08 11:50:18,782 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 11:50:18,782 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 11:50:18,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 11:50:18,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 11:50:18,782 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 11:50:18,783 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 11:50:18,783 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 11:50:18,783 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 11:50:18,783 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-12-08 11:50:18,783 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 11:50:18,783 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 11:50:18,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 11:50:18,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 11:50:18,784 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 11:50:18,784 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 11:50:18,784 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 11:50:18,784 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 11:50:18,785 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-12-08 11:50:18,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 11:50:18,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 11:50:18,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 11:50:18,785 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 11:50:18,788 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 11:50:18,788 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 11:50:18,801 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 11:50:18,821 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-12-08 11:50:18,821 INFO L444 ModelExtractionUtils]: 13 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-08 11:50:18,821 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 11:50:18,823 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-12-08 11:50:18,823 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 11:50:18,823 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~#v~0.offset) = -4*ULTIMATE.start_main_~k~0 - 1*ULTIMATE.start_main_~#v~0.offset + 17179869178 Supporting invariants [-1*v_rep(select #length ULTIMATE.start_main_~#v~0.base)_3 + 17179869180 >= 0] [2018-12-08 11:50:18,834 INFO L297 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2018-12-08 11:50:18,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:50:18,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:50:18,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:50:18,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-12-08 11:50:18,868 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 11:50:18,879 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-12-08 11:50:18,880 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:50:18,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-08 11:50:18,897 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-12-08 11:50:18,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:50:18,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:50:18,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:50:18,950 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-12-08 11:50:18,950 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 38 transitions. cyclomatic complexity: 13 Second operand 4 states. [2018-12-08 11:50:18,992 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 38 transitions. cyclomatic complexity: 13. Second operand 4 states. Result 33 states and 43 transitions. Complement of second has 5 states. [2018-12-08 11:50:18,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-08 11:50:18,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-08 11:50:18,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-12-08 11:50:18,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 10 letters. Loop has 4 letters. [2018-12-08 11:50:18,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 11:50:18,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 14 letters. Loop has 4 letters. [2018-12-08 11:50:18,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 11:50:18,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 10 letters. Loop has 8 letters. [2018-12-08 11:50:18,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 11:50:18,994 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 43 transitions. [2018-12-08 11:50:18,994 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 11:50:18,995 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 24 states and 32 transitions. [2018-12-08 11:50:18,995 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-12-08 11:50:18,995 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-12-08 11:50:18,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 32 transitions. [2018-12-08 11:50:18,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 11:50:18,995 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2018-12-08 11:50:18,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 32 transitions. [2018-12-08 11:50:18,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-08 11:50:18,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-08 11:50:18,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2018-12-08 11:50:18,997 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2018-12-08 11:50:18,997 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2018-12-08 11:50:18,997 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-08 11:50:18,997 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 32 transitions. [2018-12-08 11:50:18,997 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 11:50:18,997 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 11:50:18,997 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 11:50:18,998 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1] [2018-12-08 11:50:18,998 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 11:50:18,998 INFO L794 eck$LassoCheckResult]: Stem: 573#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 567#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; 568#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; 574#L17-5 main_#t~short4 := main_~i~0 >= 0; 588#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; 584#L17-3 assume !main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4; 578#L17-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 579#L14-2 main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 575#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; 576#L17-5 main_#t~short4 := main_~i~0 >= 0; 569#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; 570#L17-3 [2018-12-08 11:50:18,998 INFO L796 eck$LassoCheckResult]: Loop: 570#L17-3 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;call main_#t~mem5 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);call write~int(main_#t~mem5, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4);havoc main_#t~mem5;main_~i~0 := main_~i~0 - 1; 580#L17-5 main_#t~short4 := main_~i~0 >= 0; 581#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; 570#L17-3 [2018-12-08 11:50:18,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:50:18,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1275302755, now seen corresponding path program 2 times [2018-12-08 11:50:18,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:50:18,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:50:18,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:50:18,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:50:18,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:50:19,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 11:50:19,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 11:50:19,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:50:19,015 INFO L82 PathProgramCache]: Analyzing trace with hash 55260, now seen corresponding path program 3 times [2018-12-08 11:50:19,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:50:19,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:50:19,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:50:19,016 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 11:50:19,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:50:19,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 11:50:19,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 11:50:19,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:50:19,021 INFO L82 PathProgramCache]: Analyzing trace with hash 736351680, now seen corresponding path program 1 times [2018-12-08 11:50:19,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:50:19,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:50:19,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:50:19,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 11:50:19,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:50:19,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 11:50:19,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 11:50:19,343 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 93 [2018-12-08 11:50:19,533 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2018-12-08 11:50:19,534 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 11:50:19,534 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 11:50:19,535 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 11:50:19,535 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 11:50:19,535 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 11:50:19,535 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 11:50:19,535 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 11:50:19,535 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 11:50:19,535 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertion_sort_true-unreach-call_true-termination.i_Iteration7_Lasso [2018-12-08 11:50:19,535 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 11:50:19,535 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 11:50:19,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:50:19,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:50:19,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:50:19,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:50:19,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:50:19,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:50:19,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:50:19,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:50:19,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:50:19,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:50:19,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:50:19,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 11:50:19,974 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 11:50:19,974 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 11:50:19,974 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-12-08 11:50:19,974 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 11:50:19,974 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 11:50:19,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 11:50:19,974 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 11:50:19,975 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 11:50:19,975 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 11:50:19,976 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 11:50:19,976 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-12-08 11:50:19,977 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 11:50:19,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 11:50:19,977 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 11:50:19,977 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 11:50:19,977 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 11:50:19,977 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 11:50:19,978 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 11:50:19,979 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-12-08 11:50:19,979 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 11:50:19,979 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 11:50:19,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 11:50:19,979 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 11:50:19,980 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 11:50:19,980 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 11:50:19,984 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 11:50:19,991 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-12-08 11:50:19,991 INFO L444 ModelExtractionUtils]: 13 out of 19 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-08 11:50:19,991 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 11:50:19,991 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 11:50:19,991 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 11:50:19,991 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-12-08 11:50:20,002 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2018-12-08 11:50:20,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:50:20,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:50:20,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:50:20,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:50:20,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:50:20,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:50:20,033 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-12-08 11:50:20,033 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-12-08 11:50:20,063 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 52 states and 69 transitions. Complement of second has 9 states. [2018-12-08 11:50:20,063 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-12-08 11:50:20,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-08 11:50:20,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2018-12-08 11:50:20,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 11 letters. Loop has 3 letters. [2018-12-08 11:50:20,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 11:50:20,064 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 11:50:20,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:50:20,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:50:20,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:50:20,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:50:20,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:50:20,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:50:20,097 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-08 11:50:20,097 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-12-08 11:50:20,125 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 43 states and 54 transitions. Complement of second has 9 states. [2018-12-08 11:50:20,125 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-12-08 11:50:20,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-08 11:50:20,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2018-12-08 11:50:20,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 11 letters. Loop has 3 letters. [2018-12-08 11:50:20,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 11:50:20,126 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 11:50:20,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:50:20,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:50:20,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:50:20,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:50:20,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:50:20,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:50:20,160 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-08 11:50:20,160 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-12-08 11:50:20,189 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 77 states and 107 transitions. Complement of second has 10 states. [2018-12-08 11:50:20,189 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-12-08 11:50:20,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-08 11:50:20,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2018-12-08 11:50:20,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 11 letters. Loop has 3 letters. [2018-12-08 11:50:20,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 11:50:20,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 14 letters. Loop has 3 letters. [2018-12-08 11:50:20,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 11:50:20,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 11 letters. Loop has 6 letters. [2018-12-08 11:50:20,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 11:50:20,190 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 107 transitions. [2018-12-08 11:50:20,191 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 11:50:20,191 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 0 states and 0 transitions. [2018-12-08 11:50:20,191 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-08 11:50:20,191 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-08 11:50:20,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-08 11:50:20,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 11:50:20,191 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 11:50:20,191 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 11:50:20,191 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 11:50:20,191 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-08 11:50:20,191 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-08 11:50:20,191 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 11:50:20,191 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-08 11:50:20,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.12 11:50:20 BoogieIcfgContainer [2018-12-08 11:50:20,196 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-08 11:50:20,196 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 11:50:20,196 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 11:50:20,196 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 11:50:20,196 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 11:50:16" (3/4) ... [2018-12-08 11:50:20,198 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-08 11:50:20,199 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 11:50:20,199 INFO L168 Benchmark]: Toolchain (without parser) took 4351.39 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 298.8 MB). Free memory was 960.3 MB in the beginning and 1.1 GB in the end (delta: -118.4 MB). Peak memory consumption was 180.4 MB. Max. memory is 11.5 GB. [2018-12-08 11:50:20,200 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 11:50:20,200 INFO L168 Benchmark]: CACSL2BoogieTranslator took 127.52 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-08 11:50:20,201 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.78 ms. Allocated memory is still 1.0 GB. Free memory was 949.5 MB in the beginning and 944.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-08 11:50:20,201 INFO L168 Benchmark]: Boogie Preprocessor took 42.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 944.2 MB in the beginning and 1.1 GB in the end (delta: -166.8 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2018-12-08 11:50:20,202 INFO L168 Benchmark]: RCFGBuilder took 157.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 11.5 GB. [2018-12-08 11:50:20,202 INFO L168 Benchmark]: BuchiAutomizer took 3997.07 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 177.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.7 MB). Peak memory consumption was 198.4 MB. Max. memory is 11.5 GB. [2018-12-08 11:50:20,203 INFO L168 Benchmark]: Witness Printer took 2.77 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 11:50:20,205 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 127.52 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.5 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 21.78 ms. Allocated memory is still 1.0 GB. Free memory was 949.5 MB in the beginning and 944.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 944.2 MB in the beginning and 1.1 GB in the end (delta: -166.8 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 157.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3997.07 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 177.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.7 MB). Peak memory consumption was 198.4 MB. Max. memory is 11.5 GB. * Witness Printer took 2.77 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (3 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[v] + -1 * v + -4 * j and consists of 4 locations. One deterministic module has affine ranking function 2 * i + 1 and consists of 5 locations. One deterministic module has affine ranking function -4 * k + -1 * v + 17179869178 and consists of 4 locations. One nondeterministic module has affine ranking function i and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.9s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 3.2s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 38 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 29 states and ocurred in iteration 5. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 112 SDtfs, 158 SDslu, 84 SDs, 0 SdLazy, 162 SolverSat, 32 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital221 mio100 ax100 hnf99 lsp85 ukn78 mio100 lsp67 div196 bol100 ite100 ukn100 eq149 hnf60 smp89 dnf152 smp78 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 75ms VariablesStem: 6 VariablesLoop: 10 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...