./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/selectionSort_recursive_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_51543dd8-8e1e-433a-a00f-c3d3fe1f3479/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_51543dd8-8e1e-433a-a00f-c3d3fe1f3479/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_51543dd8-8e1e-433a-a00f-c3d3fe1f3479/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_51543dd8-8e1e-433a-a00f-c3d3fe1f3479/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/selectionSort_recursive_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_51543dd8-8e1e-433a-a00f-c3d3fe1f3479/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_51543dd8-8e1e-433a-a00f-c3d3fe1f3479/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 64bit --witnessprinter.graph.data.programhash 6ac1507c93933134ec25f982abf479335179fe0d ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-01 14:59:22,923 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 14:59:22,925 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 14:59:22,931 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 14:59:22,931 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 14:59:22,931 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 14:59:22,932 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 14:59:22,933 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 14:59:22,934 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 14:59:22,934 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 14:59:22,935 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 14:59:22,935 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 14:59:22,935 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 14:59:22,936 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 14:59:22,936 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 14:59:22,937 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 14:59:22,937 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 14:59:22,938 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 14:59:22,939 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 14:59:22,939 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 14:59:22,940 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 14:59:22,941 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 14:59:22,942 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 14:59:22,942 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 14:59:22,942 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 14:59:22,942 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 14:59:22,943 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 14:59:22,943 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 14:59:22,944 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 14:59:22,944 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 14:59:22,944 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 14:59:22,945 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 14:59:22,945 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 14:59:22,945 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 14:59:22,945 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 14:59:22,946 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 14:59:22,946 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_51543dd8-8e1e-433a-a00f-c3d3fe1f3479/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-01 14:59:22,953 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 14:59:22,953 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 14:59:22,954 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 14:59:22,954 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 14:59:22,954 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 14:59:22,954 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-01 14:59:22,954 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-01 14:59:22,955 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-01 14:59:22,955 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-01 14:59:22,955 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-01 14:59:22,955 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-01 14:59:22,955 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 14:59:22,955 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-01 14:59:22,955 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 14:59:22,955 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 14:59:22,956 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-01 14:59:22,956 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-01 14:59:22,956 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-01 14:59:22,956 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 14:59:22,956 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-01 14:59:22,956 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 14:59:22,956 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-01 14:59:22,957 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 14:59:22,957 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 14:59:22,957 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-01 14:59:22,957 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 14:59:22,957 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 14:59:22,957 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-01 14:59:22,958 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-01 14:59:22,958 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_51543dd8-8e1e-433a-a00f-c3d3fe1f3479/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6ac1507c93933134ec25f982abf479335179fe0d [2018-12-01 14:59:22,974 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 14:59:22,981 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 14:59:22,983 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 14:59:22,984 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 14:59:22,984 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 14:59:22,984 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_51543dd8-8e1e-433a-a00f-c3d3fe1f3479/bin-2019/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/selectionSort_recursive_true-termination.c.i [2018-12-01 14:59:23,018 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_51543dd8-8e1e-433a-a00f-c3d3fe1f3479/bin-2019/uautomizer/data/d4ba995fb/c6bec8ba758a466aa8af9e8ce4914af3/FLAGff7a5a9d6 [2018-12-01 14:59:23,386 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 14:59:23,386 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_51543dd8-8e1e-433a-a00f-c3d3fe1f3479/sv-benchmarks/c/termination-recursive-malloc/selectionSort_recursive_true-termination.c.i [2018-12-01 14:59:23,390 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_51543dd8-8e1e-433a-a00f-c3d3fe1f3479/bin-2019/uautomizer/data/d4ba995fb/c6bec8ba758a466aa8af9e8ce4914af3/FLAGff7a5a9d6 [2018-12-01 14:59:23,748 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_51543dd8-8e1e-433a-a00f-c3d3fe1f3479/bin-2019/uautomizer/data/d4ba995fb/c6bec8ba758a466aa8af9e8ce4914af3 [2018-12-01 14:59:23,749 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 14:59:23,750 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 14:59:23,751 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 14:59:23,751 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 14:59:23,753 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 14:59:23,753 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 02:59:23" (1/1) ... [2018-12-01 14:59:23,755 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48c8a763 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:59:23, skipping insertion in model container [2018-12-01 14:59:23,755 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 02:59:23" (1/1) ... [2018-12-01 14:59:23,759 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 14:59:23,769 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 14:59:23,853 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 14:59:23,859 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 14:59:23,870 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 14:59:23,878 INFO L195 MainTranslator]: Completed translation [2018-12-01 14:59:23,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:59:23 WrapperNode [2018-12-01 14:59:23,879 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 14:59:23,879 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 14:59:23,879 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 14:59:23,879 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 14:59:23,884 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:59:23" (1/1) ... [2018-12-01 14:59:23,888 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:59:23" (1/1) ... [2018-12-01 14:59:23,899 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 14:59:23,899 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 14:59:23,899 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 14:59:23,899 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 14:59:23,905 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:59:23" (1/1) ... [2018-12-01 14:59:23,905 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:59:23" (1/1) ... [2018-12-01 14:59:23,906 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:59:23" (1/1) ... [2018-12-01 14:59:23,906 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:59:23" (1/1) ... [2018-12-01 14:59:23,937 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:59:23" (1/1) ... [2018-12-01 14:59:23,941 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:59:23" (1/1) ... [2018-12-01 14:59:23,942 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:59:23" (1/1) ... [2018-12-01 14:59:23,943 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 14:59:23,943 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 14:59:23,943 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 14:59:23,944 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 14:59:23,944 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:59:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_51543dd8-8e1e-433a-a00f-c3d3fe1f3479/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-01 14:59:23,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-01 14:59:23,977 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-01 14:59:23,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 14:59:23,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 14:59:23,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-01 14:59:23,978 INFO L130 BoogieDeclarations]: Found specification of procedure selectionSort [2018-12-01 14:59:23,978 INFO L138 BoogieDeclarations]: Found implementation of procedure selectionSort [2018-12-01 14:59:23,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-01 14:59:24,104 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 14:59:24,104 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-12-01 14:59:24,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 02:59:24 BoogieIcfgContainer [2018-12-01 14:59:24,104 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 14:59:24,105 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-01 14:59:24,105 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-01 14:59:24,107 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-01 14:59:24,108 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 14:59:24,108 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.12 02:59:23" (1/3) ... [2018-12-01 14:59:24,109 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@33ef4d3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 02:59:24, skipping insertion in model container [2018-12-01 14:59:24,109 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 14:59:24,109 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:59:23" (2/3) ... [2018-12-01 14:59:24,110 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@33ef4d3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 02:59:24, skipping insertion in model container [2018-12-01 14:59:24,110 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 14:59:24,110 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 02:59:24" (3/3) ... [2018-12-01 14:59:24,111 INFO L375 chiAutomizerObserver]: Analyzing ICFG selectionSort_recursive_true-termination.c.i [2018-12-01 14:59:24,155 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 14:59:24,155 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-01 14:59:24,155 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-01 14:59:24,155 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-01 14:59:24,155 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 14:59:24,155 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 14:59:24,155 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-01 14:59:24,156 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 14:59:24,156 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-01 14:59:24,164 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-12-01 14:59:24,182 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-12-01 14:59:24,182 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 14:59:24,182 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 14:59:24,188 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-01 14:59:24,188 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-01 14:59:24,188 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-01 14:59:24,188 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-12-01 14:59:24,190 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-12-01 14:59:24,190 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 14:59:24,190 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 14:59:24,190 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-01 14:59:24,190 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-01 14:59:24,195 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6; 9#L31true assume !(main_~n~0 < 1);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; 16#L36-3true [2018-12-01 14:59:24,195 INFO L796 eck$LassoCheckResult]: Loop: 16#L36-3true assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 20#L36-2true main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 16#L36-3true [2018-12-01 14:59:24,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:59:24,198 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-12-01 14:59:24,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:59:24,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:59:24,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:59:24,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:59:24,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:59:24,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:59:24,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:59:24,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:59:24,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1443, now seen corresponding path program 1 times [2018-12-01 14:59:24,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:59:24,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:59:24,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:59:24,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:59:24,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:59:24,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:59:24,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:59:24,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:59:24,281 INFO L82 PathProgramCache]: Analyzing trace with hash 28695942, now seen corresponding path program 1 times [2018-12-01 14:59:24,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:59:24,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:59:24,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:59:24,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:59:24,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:59:24,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:59:24,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:59:24,405 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 14:59:24,406 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 14:59:24,406 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 14:59:24,406 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 14:59:24,406 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 14:59:24,406 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 14:59:24,406 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 14:59:24,406 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 14:59:24,407 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionSort_recursive_true-termination.c.i_Iteration1_Lasso [2018-12-01 14:59:24,407 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 14:59:24,407 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 14:59:24,421 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-01 14:59:24,425 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-01 14:59:24,429 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-01 14:59:24,431 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-01 14:59:24,488 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-01 14:59:24,490 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-01 14:59:24,592 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 14:59:24,597 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 14:59:24,598 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-01 14:59:24,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:59:24,600 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:59:24,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:59:24,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:59:24,600 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:59:24,602 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:59:24,602 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:59:24,604 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:59:24,604 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-01 14:59:24,604 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:59:24,604 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:59:24,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:59:24,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:59:24,605 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:59:24,605 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:59:24,605 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:59:24,606 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:59:24,606 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-01 14:59:24,607 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:59:24,607 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:59:24,607 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:59:24,607 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:59:24,609 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 14:59:24,609 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 14:59:24,613 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:59:24,613 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-01 14:59:24,614 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:59:24,614 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:59:24,614 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:59:24,614 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:59:24,616 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 14:59:24,616 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 14:59:24,633 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:59:24,634 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-01 14:59:24,634 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:59:24,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:59:24,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:59:24,635 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:59:24,638 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 14:59:24,639 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 14:59:24,676 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 14:59:24,695 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-01 14:59:24,696 INFO L444 ModelExtractionUtils]: 13 out of 22 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-12-01 14:59:24,697 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 14:59:24,699 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-01 14:59:24,699 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 14:59:24,700 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~n~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-12-01 14:59:24,713 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-12-01 14:59:24,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:59:24,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:59:24,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 14:59:24,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:59:24,748 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 14:59:24,757 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-01 14:59:24,766 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-01 14:59:24,766 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states. Second operand 3 states. [2018-12-01 14:59:24,795 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states.. Second operand 3 states. Result 39 states and 53 transitions. Complement of second has 9 states. [2018-12-01 14:59:24,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-01 14:59:24,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 14:59:24,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2018-12-01 14:59:24,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 3 letters. Loop has 2 letters. [2018-12-01 14:59:24,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 14:59:24,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 5 letters. Loop has 2 letters. [2018-12-01 14:59:24,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 14:59:24,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 3 letters. Loop has 4 letters. [2018-12-01 14:59:24,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 14:59:24,800 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 53 transitions. [2018-12-01 14:59:24,802 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-01 14:59:24,805 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 14 states and 19 transitions. [2018-12-01 14:59:24,806 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-01 14:59:24,806 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-12-01 14:59:24,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2018-12-01 14:59:24,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 14:59:24,807 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-12-01 14:59:24,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2018-12-01 14:59:24,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-12-01 14:59:24,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-01 14:59:24,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2018-12-01 14:59:24,822 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-12-01 14:59:24,823 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-12-01 14:59:24,823 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-01 14:59:24,823 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2018-12-01 14:59:24,823 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-01 14:59:24,823 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 14:59:24,823 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 14:59:24,823 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-01 14:59:24,823 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-01 14:59:24,824 INFO L794 eck$LassoCheckResult]: Stem: 125#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 122#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6; 120#L31 assume !(main_~n~0 < 1);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; 121#L36-3 assume !(main_~i~0 < main_~n~0); 115#L36-4 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 118#selectionSortENTRY [2018-12-01 14:59:24,824 INFO L796 eck$LassoCheckResult]: Loop: 118#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 119#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 123#L14-3 assume !(~index~0 < ~size); 124#L14-4 call #t~mem4 := read~int(~array.base, ~array.offset + 4 * ~startIndex, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~startIndex, 4);havoc #t~mem5;call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~minIndex~0, 4); 116#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 118#selectionSortENTRY [2018-12-01 14:59:24,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:59:24,824 INFO L82 PathProgramCache]: Analyzing trace with hash 28695915, now seen corresponding path program 1 times [2018-12-01 14:59:24,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:59:24,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:59:24,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:59:24,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:59:24,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:59:24,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:59:24,849 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-01 14:59:24,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:59:24,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 14:59:24,851 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-01 14:59:24,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:59:24,852 INFO L82 PathProgramCache]: Analyzing trace with hash 53570596, now seen corresponding path program 1 times [2018-12-01 14:59:24,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:59:24,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:59:24,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:59:24,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:59:24,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:59:24,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:59:24,861 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-01 14:59:24,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:59:24,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 14:59:24,861 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-01 14:59:24,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 14:59:24,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 14:59:24,864 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-12-01 14:59:24,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:59:24,874 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2018-12-01 14:59:24,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 14:59:24,874 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2018-12-01 14:59:24,875 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-01 14:59:24,875 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 19 transitions. [2018-12-01 14:59:24,875 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-12-01 14:59:24,875 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-12-01 14:59:24,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2018-12-01 14:59:24,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 14:59:24,876 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-12-01 14:59:24,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2018-12-01 14:59:24,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-01 14:59:24,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-01 14:59:24,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2018-12-01 14:59:24,877 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-12-01 14:59:24,877 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-12-01 14:59:24,877 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-01 14:59:24,877 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2018-12-01 14:59:24,877 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-01 14:59:24,878 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 14:59:24,878 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 14:59:24,878 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-01 14:59:24,878 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 14:59:24,878 INFO L794 eck$LassoCheckResult]: Stem: 161#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 156#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6; 157#L31 assume !(main_~n~0 < 1);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; 158#L36-3 assume !(main_~i~0 < main_~n~0); 152#L36-4 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 154#selectionSortENTRY [2018-12-01 14:59:24,878 INFO L796 eck$LassoCheckResult]: Loop: 154#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 155#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 159#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 150#L16 assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~minIndex~0 := ~index~0; 153#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 162#L14-3 assume !(~index~0 < ~size); 160#L14-4 call #t~mem4 := read~int(~array.base, ~array.offset + 4 * ~startIndex, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~startIndex, 4);havoc #t~mem5;call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~minIndex~0, 4); 151#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 154#selectionSortENTRY [2018-12-01 14:59:24,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:59:24,878 INFO L82 PathProgramCache]: Analyzing trace with hash 28695915, now seen corresponding path program 2 times [2018-12-01 14:59:24,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:59:24,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:59:24,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:59:24,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:59:24,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:59:24,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:59:24,891 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-01 14:59:24,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:59:24,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 14:59:24,891 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-01 14:59:24,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:59:24,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1756570492, now seen corresponding path program 1 times [2018-12-01 14:59:24,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:59:24,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:59:24,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:59:24,892 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 14:59:24,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:59:24,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:59:24,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:59:25,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 14:59:25,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 14:59:25,108 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-12-01 14:59:25,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:59:25,114 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2018-12-01 14:59:25,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 14:59:25,114 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 19 transitions. [2018-12-01 14:59:25,115 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-01 14:59:25,115 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 19 transitions. [2018-12-01 14:59:25,115 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-12-01 14:59:25,116 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-12-01 14:59:25,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2018-12-01 14:59:25,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 14:59:25,116 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-12-01 14:59:25,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2018-12-01 14:59:25,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-12-01 14:59:25,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-01 14:59:25,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2018-12-01 14:59:25,117 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2018-12-01 14:59:25,117 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2018-12-01 14:59:25,118 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-01 14:59:25,118 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2018-12-01 14:59:25,118 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-01 14:59:25,118 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 14:59:25,118 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 14:59:25,119 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-01 14:59:25,119 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 14:59:25,119 INFO L794 eck$LassoCheckResult]: Stem: 198#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 193#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6; 194#L31 assume !(main_~n~0 < 1);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; 195#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 200#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 201#L36-3 assume !(main_~i~0 < main_~n~0); 188#L36-4 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 191#selectionSortENTRY [2018-12-01 14:59:25,119 INFO L796 eck$LassoCheckResult]: Loop: 191#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 192#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 196#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 187#L16 assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~minIndex~0 := ~index~0; 190#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 199#L14-3 assume !(~index~0 < ~size); 197#L14-4 call #t~mem4 := read~int(~array.base, ~array.offset + 4 * ~startIndex, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~startIndex, 4);havoc #t~mem5;call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~minIndex~0, 4); 189#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 191#selectionSortENTRY [2018-12-01 14:59:25,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:59:25,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1806996941, now seen corresponding path program 1 times [2018-12-01 14:59:25,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:59:25,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:59:25,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:59:25,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:59:25,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:59:25,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:59:25,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:59:25,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:59:25,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1756570492, now seen corresponding path program 2 times [2018-12-01 14:59:25,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:59:25,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:59:25,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:59:25,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:59:25,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:59:25,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:59:25,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:59:25,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:59:25,139 INFO L82 PathProgramCache]: Analyzing trace with hash 170190416, now seen corresponding path program 1 times [2018-12-01 14:59:25,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:59:25,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:59:25,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:59:25,140 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 14:59:25,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:59:25,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:59:25,193 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-01 14:59:25,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 14:59:25,194 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_51543dd8-8e1e-433a-a00f-c3d3fe1f3479/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 14:59:25,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:59:25,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:59:25,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 14:59:25,246 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-01 14:59:25,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 14:59:25,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-12-01 14:59:25,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-01 14:59:25,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-12-01 14:59:25,456 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. cyclomatic complexity: 5 Second operand 10 states. [2018-12-01 14:59:25,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:59:25,510 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2018-12-01 14:59:25,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 14:59:25,510 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 24 transitions. [2018-12-01 14:59:25,511 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-01 14:59:25,511 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 21 transitions. [2018-12-01 14:59:25,511 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-12-01 14:59:25,511 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-12-01 14:59:25,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2018-12-01 14:59:25,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 14:59:25,512 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-12-01 14:59:25,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2018-12-01 14:59:25,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-12-01 14:59:25,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-01 14:59:25,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2018-12-01 14:59:25,513 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-12-01 14:59:25,513 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-12-01 14:59:25,513 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-01 14:59:25,513 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2018-12-01 14:59:25,514 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-01 14:59:25,514 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 14:59:25,514 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 14:59:25,514 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2018-12-01 14:59:25,514 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 14:59:25,515 INFO L794 eck$LassoCheckResult]: Stem: 295#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 290#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6; 291#L31 assume !(main_~n~0 < 1);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; 292#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 297#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 298#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 299#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 300#L36-3 assume !(main_~i~0 < main_~n~0); 285#L36-4 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 288#selectionSortENTRY [2018-12-01 14:59:25,515 INFO L796 eck$LassoCheckResult]: Loop: 288#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 289#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 293#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 284#L16 assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~minIndex~0 := ~index~0; 287#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 296#L14-3 assume !(~index~0 < ~size); 294#L14-4 call #t~mem4 := read~int(~array.base, ~array.offset + 4 * ~startIndex, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~startIndex, 4);havoc #t~mem5;call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~minIndex~0, 4); 286#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 288#selectionSortENTRY [2018-12-01 14:59:25,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:59:25,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1357299119, now seen corresponding path program 2 times [2018-12-01 14:59:25,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:59:25,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:59:25,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:59:25,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:59:25,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:59:25,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:59:25,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:59:25,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:59:25,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1756570492, now seen corresponding path program 3 times [2018-12-01 14:59:25,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:59:25,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:59:25,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:59:25,528 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 14:59:25,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:59:25,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:59:25,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:59:25,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:59:25,537 INFO L82 PathProgramCache]: Analyzing trace with hash -290845646, now seen corresponding path program 2 times [2018-12-01 14:59:25,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:59:25,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:59:25,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:59:25,538 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 14:59:25,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:59:25,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:59:25,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:59:25,918 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 14:59:25,919 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 14:59:25,919 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 14:59:25,919 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 14:59:25,919 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 14:59:25,919 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 14:59:25,919 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 14:59:25,919 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 14:59:25,919 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionSort_recursive_true-termination.c.i_Iteration5_Lasso [2018-12-01 14:59:25,920 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 14:59:25,920 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 14:59:25,923 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-01 14:59:25,924 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-01 14:59:25,925 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-01 14:59:25,926 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-01 14:59:25,927 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-01 14:59:25,928 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-01 14:59:25,929 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-01 14:59:25,930 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-01 14:59:25,931 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-01 14:59:25,932 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-01 14:59:25,933 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-01 14:59:25,934 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-01 14:59:25,935 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-01 14:59:25,936 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-01 14:59:25,937 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-01 14:59:25,938 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-01 14:59:25,939 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-01 14:59:25,940 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-01 14:59:25,941 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-01 14:59:26,003 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-01 14:59:26,004 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-01 14:59:26,005 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-01 14:59:26,005 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-01 14:59:26,006 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-01 14:59:26,007 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-01 14:59:26,008 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-01 14:59:26,009 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-01 14:59:26,010 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-01 14:59:26,011 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-01 14:59:26,012 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-01 14:59:26,123 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 14:59:26,124 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 14:59:26,124 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-01 14:59:26,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:59:26,124 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:59:26,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:59:26,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:59:26,125 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:59:26,125 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:59:26,125 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:59:26,125 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:59:26,125 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-01 14:59:26,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:59:26,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:59:26,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:59:26,126 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:59:26,126 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 14:59:26,126 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 14:59:26,127 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:59:26,127 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-01 14:59:26,128 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:59:26,128 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:59:26,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:59:26,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:59:26,128 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:59:26,128 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:59:26,128 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:59:26,128 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:59:26,129 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-01 14:59:26,129 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:59:26,129 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:59:26,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:59:26,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:59:26,129 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:59:26,129 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:59:26,129 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:59:26,129 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:59:26,130 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-01 14:59:26,130 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:59:26,130 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:59:26,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:59:26,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:59:26,130 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:59:26,130 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:59:26,130 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:59:26,131 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:59:26,131 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-01 14:59:26,131 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:59:26,131 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:59:26,131 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:59:26,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:59:26,131 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:59:26,131 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:59:26,131 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:59:26,132 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:59:26,132 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-01 14:59:26,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:59:26,132 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:59:26,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:59:26,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:59:26,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:59:26,133 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:59:26,133 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:59:26,133 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:59:26,133 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-01 14:59:26,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:59:26,133 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:59:26,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:59:26,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:59:26,134 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:59:26,134 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:59:26,134 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:59:26,134 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:59:26,134 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-01 14:59:26,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:59:26,135 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:59:26,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:59:26,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:59:26,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:59:26,135 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:59:26,135 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:59:26,135 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:59:26,136 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-01 14:59:26,136 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:59:26,136 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:59:26,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:59:26,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:59:26,136 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:59:26,136 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:59:26,136 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:59:26,137 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:59:26,137 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-01 14:59:26,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:59:26,137 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:59:26,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:59:26,137 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:59:26,137 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:59:26,138 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:59:26,138 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:59:26,138 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:59:26,138 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-01 14:59:26,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:59:26,138 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:59:26,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:59:26,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:59:26,139 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:59:26,139 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:59:26,139 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:59:26,139 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:59:26,139 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-01 14:59:26,140 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:59:26,140 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:59:26,140 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:59:26,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:59:26,140 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:59:26,140 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:59:26,140 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:59:26,141 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:59:26,141 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-01 14:59:26,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:59:26,141 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:59:26,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:59:26,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:59:26,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:59:26,142 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:59:26,142 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:59:26,142 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:59:26,142 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-01 14:59:26,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:59:26,143 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:59:26,143 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:59:26,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:59:26,143 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:59:26,143 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:59:26,143 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:59:26,143 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:59:26,144 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-01 14:59:26,144 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:59:26,144 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:59:26,144 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:59:26,144 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:59:26,145 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 14:59:26,145 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 14:59:26,146 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:59:26,146 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-01 14:59:26,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:59:26,146 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:59:26,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:59:26,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:59:26,146 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:59:26,147 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:59:26,147 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:59:26,147 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:59:26,147 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-01 14:59:26,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:59:26,147 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:59:26,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:59:26,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:59:26,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:59:26,148 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:59:26,148 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:59:26,148 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:59:26,148 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-01 14:59:26,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:59:26,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:59:26,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:59:26,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:59:26,150 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 14:59:26,150 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 14:59:26,153 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:59:26,154 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-01 14:59:26,154 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:59:26,154 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:59:26,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:59:26,154 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:59:26,155 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 14:59:26,155 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 14:59:26,167 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 14:59:26,177 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-01 14:59:26,177 INFO L444 ModelExtractionUtils]: 7 out of 16 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-12-01 14:59:26,178 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 14:59:26,178 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-01 14:59:26,178 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 14:59:26,178 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(selectionSort_#in~startIndex, v_rep(select #length selectionSort_#in~array.base)_1, selectionSort_#in~array.offset) = -4*selectionSort_#in~startIndex + 1*v_rep(select #length selectionSort_#in~array.base)_1 - 1*selectionSort_#in~array.offset Supporting invariants [] [2018-12-01 14:59:26,181 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2018-12-01 14:59:26,182 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-01 14:59:26,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:59:26,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:59:26,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 14:59:26,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:59:26,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 14:59:26,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:59:26,259 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-12-01 14:59:26,259 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 5 states. [2018-12-01 14:59:26,346 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 39 states and 48 transitions. Complement of second has 15 states. [2018-12-01 14:59:26,347 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-01 14:59:26,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-01 14:59:26,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2018-12-01 14:59:26,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 9 letters. Loop has 8 letters. [2018-12-01 14:59:26,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 14:59:26,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 17 letters. Loop has 8 letters. [2018-12-01 14:59:26,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 14:59:26,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 9 letters. Loop has 16 letters. [2018-12-01 14:59:26,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 14:59:26,349 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 48 transitions. [2018-12-01 14:59:26,350 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-12-01 14:59:26,350 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 35 states and 44 transitions. [2018-12-01 14:59:26,350 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-12-01 14:59:26,350 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-12-01 14:59:26,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 44 transitions. [2018-12-01 14:59:26,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 14:59:26,351 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 44 transitions. [2018-12-01 14:59:26,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 44 transitions. [2018-12-01 14:59:26,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 22. [2018-12-01 14:59:26,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-01 14:59:26,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2018-12-01 14:59:26,352 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2018-12-01 14:59:26,352 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2018-12-01 14:59:26,352 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-01 14:59:26,352 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 28 transitions. [2018-12-01 14:59:26,353 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-01 14:59:26,353 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 14:59:26,353 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 14:59:26,353 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 14:59:26,353 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-01 14:59:26,353 INFO L794 eck$LassoCheckResult]: Stem: 453#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 447#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6; 448#L31 assume !(main_~n~0 < 1);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; 449#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 455#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 456#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 457#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 458#L36-3 assume !(main_~i~0 < main_~n~0); 438#L36-4 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 443#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 445#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 450#L14-3 [2018-12-01 14:59:26,353 INFO L796 eck$LassoCheckResult]: Loop: 450#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 437#L16 assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~minIndex~0 := ~index~0; 439#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 450#L14-3 [2018-12-01 14:59:26,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:59:26,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1305603789, now seen corresponding path program 1 times [2018-12-01 14:59:26,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:59:26,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:59:26,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:59:26,355 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 14:59:26,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:59:26,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:59:26,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:59:26,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:59:26,363 INFO L82 PathProgramCache]: Analyzing trace with hash 67625, now seen corresponding path program 1 times [2018-12-01 14:59:26,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:59:26,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:59:26,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:59:26,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:59:26,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:59:26,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:59:26,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:59:26,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:59:26,368 INFO L82 PathProgramCache]: Analyzing trace with hash -18607689, now seen corresponding path program 1 times [2018-12-01 14:59:26,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:59:26,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:59:26,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:59:26,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:59:26,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:59:26,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:59:26,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:59:26,657 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 14:59:26,657 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 14:59:26,657 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 14:59:26,657 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 14:59:26,657 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 14:59:26,657 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 14:59:26,657 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 14:59:26,657 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 14:59:26,657 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionSort_recursive_true-termination.c.i_Iteration6_Lasso [2018-12-01 14:59:26,657 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 14:59:26,657 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 14:59:26,658 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-01 14:59:26,660 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-01 14:59:26,661 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-01 14:59:26,661 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-01 14:59:26,663 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-01 14:59:26,664 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-01 14:59:26,664 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-01 14:59:26,665 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-01 14:59:26,673 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-01 14:59:26,674 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-01 14:59:26,674 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-01 14:59:26,675 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-01 14:59:26,676 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-01 14:59:26,677 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-01 14:59:26,678 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-01 14:59:26,678 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-01 14:59:26,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-01 14:59:26,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-01 14:59:26,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-01 14:59:26,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-01 14:59:26,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-01 14:59:26,921 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 14:59:26,921 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 14:59:26,921 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-01 14:59:26,922 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:59:26,922 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:59:26,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:59:26,922 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:59:26,922 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:59:26,922 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:59:26,922 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:59:26,923 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:59:26,923 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-01 14:59:26,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:59:26,923 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:59:26,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:59:26,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:59:26,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:59:26,923 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:59:26,924 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:59:26,924 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:59:26,924 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-01 14:59:26,924 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:59:26,924 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:59:26,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:59:26,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:59:26,924 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:59:26,925 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:59:26,925 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:59:26,925 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:59:26,925 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-01 14:59:26,925 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:59:26,925 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:59:26,925 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:59:26,925 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:59:26,926 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 14:59:26,926 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 14:59:26,927 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:59:26,927 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-01 14:59:26,927 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:59:26,927 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:59:26,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:59:26,927 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:59:26,928 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:59:26,928 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:59:26,928 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:59:26,928 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:59:26,928 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-01 14:59:26,929 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:59:26,929 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:59:26,929 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:59:26,929 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:59:26,929 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:59:26,929 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:59:26,929 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:59:26,930 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:59:26,930 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-01 14:59:26,931 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:59:26,931 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:59:26,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:59:26,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:59:26,931 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:59:26,931 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:59:26,931 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:59:26,932 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:59:26,932 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-01 14:59:26,932 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:59:26,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:59:26,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:59:26,933 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:59:26,933 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 14:59:26,933 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 14:59:26,934 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:59:26,935 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-01 14:59:26,935 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:59:26,935 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:59:26,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:59:26,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:59:26,936 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:59:26,936 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:59:26,936 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:59:26,936 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:59:26,937 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-01 14:59:26,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:59:26,937 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:59:26,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:59:26,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:59:26,937 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:59:26,938 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:59:26,938 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:59:26,938 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:59:26,938 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-01 14:59:26,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:59:26,939 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:59:26,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:59:26,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:59:26,939 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:59:26,939 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:59:26,939 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:59:26,940 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:59:26,940 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-01 14:59:26,940 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:59:26,940 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:59:26,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:59:26,940 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:59:26,941 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:59:26,941 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:59:26,941 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:59:26,941 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:59:26,941 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-01 14:59:26,942 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:59:26,942 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:59:26,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:59:26,942 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:59:26,942 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:59:26,942 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:59:26,942 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:59:26,943 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:59:26,943 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-01 14:59:26,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:59:26,944 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:59:26,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:59:26,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:59:26,944 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:59:26,944 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:59:26,944 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:59:26,944 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:59:26,945 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-01 14:59:26,945 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:59:26,945 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:59:26,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:59:26,945 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:59:26,948 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 14:59:26,948 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 14:59:26,964 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 14:59:26,979 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-01 14:59:26,979 INFO L444 ModelExtractionUtils]: 27 out of 34 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-01 14:59:26,979 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 14:59:26,980 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-01 14:59:26,980 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 14:59:26,980 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(selectionSort_~index~0, selectionSort_~array.offset, v_rep(select #length selectionSort_~array.base)_1) = -4*selectionSort_~index~0 - 1*selectionSort_~array.offset + 1*v_rep(select #length selectionSort_~array.base)_1 Supporting invariants [] [2018-12-01 14:59:26,987 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-12-01 14:59:26,988 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-01 14:59:26,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:59:27,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:59:27,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 14:59:27,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:59:27,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 14:59:27,018 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-01 14:59:27,018 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-01 14:59:27,018 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-12-01 14:59:27,033 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 40 states and 53 transitions. Complement of second has 8 states. [2018-12-01 14:59:27,034 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-01 14:59:27,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 14:59:27,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-12-01 14:59:27,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 3 letters. [2018-12-01 14:59:27,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 14:59:27,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 14 letters. Loop has 3 letters. [2018-12-01 14:59:27,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 14:59:27,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 6 letters. [2018-12-01 14:59:27,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 14:59:27,035 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 53 transitions. [2018-12-01 14:59:27,035 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-01 14:59:27,036 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 29 states and 36 transitions. [2018-12-01 14:59:27,036 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-01 14:59:27,036 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-01 14:59:27,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 36 transitions. [2018-12-01 14:59:27,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 14:59:27,036 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2018-12-01 14:59:27,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 36 transitions. [2018-12-01 14:59:27,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. [2018-12-01 14:59:27,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-01 14:59:27,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2018-12-01 14:59:27,037 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-12-01 14:59:27,037 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-12-01 14:59:27,037 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-01 14:59:27,037 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2018-12-01 14:59:27,037 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-01 14:59:27,037 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 14:59:27,037 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 14:59:27,038 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 14:59:27,038 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-01 14:59:27,038 INFO L794 eck$LassoCheckResult]: Stem: 598#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 592#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6; 593#L31 assume !(main_~n~0 < 1);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; 594#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 600#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 601#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 602#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 603#L36-3 assume !(main_~i~0 < main_~n~0); 586#L36-4 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 588#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 589#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 596#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 585#L16 assume !(#t~mem2 < #t~mem3);havoc #t~mem3;havoc #t~mem2; 587#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 599#L14-3 assume !(~index~0 < ~size); 597#L14-4 call #t~mem4 := read~int(~array.base, ~array.offset + 4 * ~startIndex, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~startIndex, 4);havoc #t~mem5;call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~minIndex~0, 4); 583#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 590#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 591#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 595#L14-3 [2018-12-01 14:59:27,038 INFO L796 eck$LassoCheckResult]: Loop: 595#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 582#L16 assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~minIndex~0 := ~index~0; 584#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 595#L14-3 [2018-12-01 14:59:27,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:59:27,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1445216632, now seen corresponding path program 1 times [2018-12-01 14:59:27,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:59:27,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:59:27,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:59:27,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:59:27,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:59:27,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:59:27,071 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-01 14:59:27,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 14:59:27,071 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_51543dd8-8e1e-433a-a00f-c3d3fe1f3479/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 14:59:27,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:59:27,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:59:27,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 14:59:27,148 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-01 14:59:27,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 14:59:27,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 14 [2018-12-01 14:59:27,163 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-01 14:59:27,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:59:27,163 INFO L82 PathProgramCache]: Analyzing trace with hash 67625, now seen corresponding path program 2 times [2018-12-01 14:59:27,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:59:27,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:59:27,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:59:27,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:59:27,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:59:27,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:59:27,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:59:27,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-01 14:59:27,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-12-01 14:59:27,196 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand 15 states. [2018-12-01 14:59:27,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:59:27,318 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2018-12-01 14:59:27,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-01 14:59:27,319 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 64 transitions. [2018-12-01 14:59:27,320 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-01 14:59:27,320 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 36 states and 45 transitions. [2018-12-01 14:59:27,320 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-12-01 14:59:27,321 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-12-01 14:59:27,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 45 transitions. [2018-12-01 14:59:27,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 14:59:27,321 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2018-12-01 14:59:27,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 45 transitions. [2018-12-01 14:59:27,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2018-12-01 14:59:27,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-01 14:59:27,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2018-12-01 14:59:27,323 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2018-12-01 14:59:27,323 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2018-12-01 14:59:27,323 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-01 14:59:27,323 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 33 transitions. [2018-12-01 14:59:27,324 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-01 14:59:27,324 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 14:59:27,324 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 14:59:27,324 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 14:59:27,325 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-01 14:59:27,325 INFO L794 eck$LassoCheckResult]: Stem: 760#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 753#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6; 754#L31 assume !(main_~n~0 < 1);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; 755#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 762#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 769#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 765#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 763#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 764#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 766#L36-3 assume !(main_~i~0 < main_~n~0); 747#L36-4 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 749#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 750#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 758#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 768#L16 assume !(#t~mem2 < #t~mem3);havoc #t~mem3;havoc #t~mem2; 761#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 757#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 746#L16 assume !(#t~mem2 < #t~mem3);havoc #t~mem3;havoc #t~mem2; 748#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 767#L14-3 assume !(~index~0 < ~size); 759#L14-4 call #t~mem4 := read~int(~array.base, ~array.offset + 4 * ~startIndex, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~startIndex, 4);havoc #t~mem5;call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~minIndex~0, 4); 744#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 751#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 752#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 756#L14-3 [2018-12-01 14:59:27,325 INFO L796 eck$LassoCheckResult]: Loop: 756#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 743#L16 assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~minIndex~0 := ~index~0; 745#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 756#L14-3 [2018-12-01 14:59:27,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:59:27,325 INFO L82 PathProgramCache]: Analyzing trace with hash 349648920, now seen corresponding path program 2 times [2018-12-01 14:59:27,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:59:27,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:59:27,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:59:27,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 14:59:27,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:59:27,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:59:27,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:59:27,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:59:27,347 INFO L82 PathProgramCache]: Analyzing trace with hash 67625, now seen corresponding path program 3 times [2018-12-01 14:59:27,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:59:27,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:59:27,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:59:27,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 14:59:27,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:59:27,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:59:27,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:59:27,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:59:27,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1095320754, now seen corresponding path program 1 times [2018-12-01 14:59:27,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:59:27,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:59:27,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:59:27,354 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 14:59:27,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:59:27,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:59:27,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:59:27,559 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2018-12-01 14:59:27,871 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 85 [2018-12-01 14:59:28,088 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 101 [2018-12-01 14:59:28,125 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 14:59:28,125 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 14:59:28,125 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 14:59:28,125 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 14:59:28,125 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 14:59:28,125 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 14:59:28,125 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 14:59:28,126 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 14:59:28,126 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionSort_recursive_true-termination.c.i_Iteration8_Lasso [2018-12-01 14:59:28,126 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 14:59:28,126 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 14:59:28,128 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-01 14:59:28,130 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-01 14:59:28,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 14:59:28,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 14:59:28,132 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-01 14:59:28,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 14:59:28,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 14:59:28,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 14:59:28,135 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-01 14:59:28,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 14:59:28,137 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-01 14:59:28,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 14:59:28,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 14:59:28,140 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-01 14:59:28,141 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-01 14:59:28,141 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-01 14:59:28,142 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-01 14:59:28,143 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-01 14:59:28,144 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-01 14:59:28,144 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-01 14:59:28,145 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-01 14:59:28,239 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-01 14:59:28,240 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-01 14:59:28,241 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-01 14:59:28,387 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 14:59:28,387 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 14:59:28,388 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-01 14:59:28,388 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:59:28,388 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:59:28,388 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:59:28,388 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:59:28,389 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 14:59:28,389 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 14:59:28,390 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:59:28,390 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 14:59:28,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:59:28,390 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:59:28,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:59:28,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:59:28,390 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:59:28,390 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:59:28,390 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:59:28,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:59:28,391 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-01 14:59:28,391 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:59:28,391 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:59:28,391 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:59:28,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:59:28,391 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:59:28,391 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:59:28,391 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:59:28,392 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:59:28,392 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-01 14:59:28,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:59:28,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:59:28,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:59:28,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:59:28,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:59:28,392 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:59:28,392 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:59:28,392 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:59:28,393 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-01 14:59:28,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:59:28,393 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:59:28,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:59:28,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:59:28,393 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:59:28,393 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:59:28,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:59:28,393 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:59:28,394 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-01 14:59:28,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:59:28,394 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:59:28,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:59:28,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:59:28,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:59:28,394 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:59:28,394 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:59:28,394 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:59:28,394 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-01 14:59:28,395 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:59:28,395 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:59:28,395 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:59:28,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:59:28,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:59:28,395 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:59:28,395 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:59:28,395 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:59:28,395 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-01 14:59:28,395 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:59:28,395 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:59:28,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:59:28,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:59:28,396 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:59:28,396 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:59:28,396 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:59:28,396 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:59:28,396 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 14:59:28,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:59:28,396 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:59:28,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:59:28,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:59:28,397 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:59:28,397 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:59:28,397 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:59:28,397 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:59:28,397 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-01 14:59:28,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:59:28,397 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:59:28,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:59:28,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:59:28,398 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:59:28,398 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:59:28,398 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:59:28,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:59:28,398 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 14:59:28,398 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:59:28,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:59:28,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:59:28,398 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:59:28,399 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 14:59:28,399 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 14:59:28,399 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:59:28,399 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-01 14:59:28,400 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:59:28,400 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:59:28,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:59:28,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:59:28,400 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:59:28,400 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:59:28,400 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:59:28,400 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:59:28,400 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 14:59:28,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:59:28,401 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:59:28,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:59:28,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:59:28,401 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:59:28,401 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:59:28,401 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:59:28,401 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:59:28,401 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-01 14:59:28,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:59:28,402 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:59:28,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:59:28,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:59:28,402 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:59:28,402 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:59:28,402 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:59:28,402 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:59:28,402 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-01 14:59:28,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:59:28,403 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:59:28,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:59:28,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:59:28,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:59:28,403 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:59:28,403 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:59:28,403 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:59:28,403 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-01 14:59:28,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:59:28,404 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:59:28,404 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:59:28,404 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:59:28,404 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:59:28,404 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:59:28,404 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:59:28,404 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:59:28,404 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-01 14:59:28,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:59:28,404 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:59:28,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:59:28,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:59:28,405 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:59:28,405 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:59:28,405 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:59:28,405 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:59:28,405 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 14:59:28,405 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:59:28,405 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:59:28,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:59:28,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:59:28,406 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:59:28,406 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:59:28,406 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:59:28,406 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:59:28,406 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-01 14:59:28,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:59:28,407 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 14:59:28,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:59:28,407 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:59:28,407 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 14:59:28,407 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 14:59:28,409 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:59:28,409 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 14:59:28,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:59:28,409 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:59:28,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:59:28,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:59:28,409 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:59:28,409 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:59:28,410 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:59:28,410 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:59:28,410 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-01 14:59:28,410 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:59:28,410 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:59:28,410 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:59:28,410 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:59:28,411 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 14:59:28,411 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 14:59:28,412 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:59:28,413 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-01 14:59:28,413 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:59:28,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:59:28,413 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:59:28,413 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:59:28,413 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 14:59:28,413 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 14:59:28,414 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:59:28,414 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 14:59:28,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:59:28,414 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:59:28,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:59:28,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:59:28,414 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:59:28,415 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:59:28,415 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:59:28,415 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:59:28,415 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-01 14:59:28,415 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:59:28,415 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:59:28,415 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:59:28,415 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:59:28,416 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 14:59:28,416 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 14:59:28,428 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 14:59:28,446 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-12-01 14:59:28,446 INFO L444 ModelExtractionUtils]: 24 out of 34 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-12-01 14:59:28,447 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 14:59:28,447 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-01 14:59:28,447 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 14:59:28,448 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(selectionSort_~index~0, selectionSort_~array.offset, v_rep(select #length selectionSort_~array.base)_2) = -4*selectionSort_~index~0 - 1*selectionSort_~array.offset + 1*v_rep(select #length selectionSort_~array.base)_2 Supporting invariants [] [2018-12-01 14:59:28,464 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2018-12-01 14:59:28,464 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-01 14:59:28,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:59:28,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:59:28,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 14:59:28,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:59:28,491 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 14:59:28,497 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-01 14:59:28,498 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-01 14:59:28,498 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-12-01 14:59:28,510 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 43 states and 55 transitions. Complement of second has 8 states. [2018-12-01 14:59:28,510 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-01 14:59:28,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 14:59:28,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-12-01 14:59:28,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 24 letters. Loop has 3 letters. [2018-12-01 14:59:28,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 14:59:28,511 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 14:59:28,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:59:28,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:59:28,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 14:59:28,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:59:28,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 14:59:28,544 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-01 14:59:28,544 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-01 14:59:28,544 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-12-01 14:59:28,554 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 43 states and 55 transitions. Complement of second has 8 states. [2018-12-01 14:59:28,554 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-01 14:59:28,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 14:59:28,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-12-01 14:59:28,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 24 letters. Loop has 3 letters. [2018-12-01 14:59:28,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 14:59:28,555 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 14:59:28,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:59:28,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:59:28,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 14:59:28,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:59:28,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 14:59:28,592 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-01 14:59:28,593 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-01 14:59:28,593 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-12-01 14:59:28,605 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 36 states and 47 transitions. Complement of second has 7 states. [2018-12-01 14:59:28,606 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-01 14:59:28,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 14:59:28,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2018-12-01 14:59:28,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 24 letters. Loop has 3 letters. [2018-12-01 14:59:28,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 14:59:28,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 27 letters. Loop has 3 letters. [2018-12-01 14:59:28,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 14:59:28,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 24 letters. Loop has 6 letters. [2018-12-01 14:59:28,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 14:59:28,607 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 47 transitions. [2018-12-01 14:59:28,608 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-01 14:59:28,608 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 0 states and 0 transitions. [2018-12-01 14:59:28,608 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-01 14:59:28,608 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-01 14:59:28,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-01 14:59:28,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 14:59:28,608 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 14:59:28,608 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 14:59:28,608 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 14:59:28,608 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-01 14:59:28,608 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-01 14:59:28,609 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-01 14:59:28,609 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-01 14:59:28,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.12 02:59:28 BoogieIcfgContainer [2018-12-01 14:59:28,613 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-01 14:59:28,613 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 14:59:28,613 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 14:59:28,613 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 14:59:28,614 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 02:59:24" (3/4) ... [2018-12-01 14:59:28,616 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-01 14:59:28,616 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 14:59:28,616 INFO L168 Benchmark]: Toolchain (without parser) took 4866.57 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 223.3 MB). Free memory was 953.3 MB in the beginning and 1.2 GB in the end (delta: -213.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 11.5 GB. [2018-12-01 14:59:28,617 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 14:59:28,617 INFO L168 Benchmark]: CACSL2BoogieTranslator took 128.05 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 942.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-01 14:59:28,617 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.08 ms. Allocated memory is still 1.0 GB. Free memory was 942.6 MB in the beginning and 939.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-01 14:59:28,618 INFO L168 Benchmark]: Boogie Preprocessor took 43.94 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -160.3 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2018-12-01 14:59:28,618 INFO L168 Benchmark]: RCFGBuilder took 160.88 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.4 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. [2018-12-01 14:59:28,618 INFO L168 Benchmark]: BuchiAutomizer took 4508.57 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 121.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -81.7 MB). Peak memory consumption was 39.4 MB. Max. memory is 11.5 GB. [2018-12-01 14:59:28,619 INFO L168 Benchmark]: Witness Printer took 2.57 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 14:59:28,621 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 128.05 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 942.6 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 20.08 ms. Allocated memory is still 1.0 GB. Free memory was 942.6 MB in the beginning and 939.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.94 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -160.3 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 160.88 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.4 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4508.57 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 121.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -81.7 MB). Peak memory consumption was 39.4 MB. Max. memory is 11.5 GB. * Witness Printer took 2.57 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (4 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function n + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -4 * \old(startIndex) + unknown-#length-unknown[array] + -1 * array and consists of 5 locations. One deterministic module has affine ranking function -4 * index + -1 * array + unknown-#length-unknown[array] and consists of 4 locations. One nondeterministic module has affine ranking function -4 * index + -1 * array + unknown-#length-unknown[array] and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.4s and 9 iterations. TraceHistogramMax:3. Analysis of lassos took 3.7s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 31 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 27 states and ocurred in iteration 7. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/1 HoareTripleCheckerStatistics: 112 SDtfs, 139 SDslu, 116 SDs, 0 SdLazy, 265 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU2 SILI1 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital171 mio100 ax100 hnf99 lsp96 ukn69 mio100 lsp66 div100 bol100 ite100 ukn100 eq161 hnf89 smp95 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 2ms VariablesStem: 2 VariablesLoop: 2 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...