./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/bubblesort-alloca-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/bubblesort-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash ec853311f8b6ef97341e01f0f96194e2f46c161d2727bd3a328a96a4ccf3856f --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-22 01:38:52,802 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 01:38:52,805 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 01:38:52,845 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 01:38:52,845 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 01:38:52,847 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 01:38:52,850 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 01:38:52,853 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 01:38:52,855 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 01:38:52,859 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 01:38:52,861 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 01:38:52,863 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 01:38:52,863 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 01:38:52,865 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 01:38:52,866 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 01:38:52,871 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 01:38:52,871 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 01:38:52,873 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 01:38:52,874 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 01:38:52,880 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 01:38:52,881 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 01:38:52,882 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 01:38:52,884 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 01:38:52,885 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 01:38:52,886 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 01:38:52,892 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 01:38:52,893 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 01:38:52,893 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 01:38:52,894 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 01:38:52,894 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 01:38:52,895 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 01:38:52,895 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 01:38:52,897 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 01:38:52,898 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 01:38:52,899 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 01:38:52,900 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 01:38:52,900 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 01:38:52,901 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 01:38:52,901 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 01:38:52,901 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 01:38:52,902 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 01:38:52,903 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 01:38:52,908 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-07-22 01:38:52,940 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 01:38:52,941 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 01:38:52,941 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 01:38:52,941 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 01:38:52,942 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 01:38:52,943 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 01:38:52,943 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 01:38:52,943 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 01:38:52,943 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 01:38:52,950 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 01:38:52,950 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 01:38:52,950 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 01:38:52,951 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 01:38:52,951 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 01:38:52,951 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 01:38:52,951 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 01:38:52,951 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 01:38:52,952 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 01:38:52,952 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 01:38:52,952 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 01:38:52,952 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 01:38:52,952 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 01:38:52,953 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 01:38:52,953 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 01:38:52,953 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 01:38:52,953 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 01:38:52,953 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 01:38:52,954 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 01:38:52,956 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 01:38:52,956 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ec853311f8b6ef97341e01f0f96194e2f46c161d2727bd3a328a96a4ccf3856f [2022-07-22 01:38:53,328 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 01:38:53,349 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 01:38:53,353 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 01:38:53,354 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 01:38:53,355 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 01:38:53,361 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/bubblesort-alloca-1.i [2022-07-22 01:38:53,416 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/945550160/04c09371a1444b3ca581fdce0f751537/FLAGb99a306e2 [2022-07-22 01:38:53,857 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 01:38:53,857 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/bubblesort-alloca-1.i [2022-07-22 01:38:53,871 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/945550160/04c09371a1444b3ca581fdce0f751537/FLAGb99a306e2 [2022-07-22 01:38:53,888 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/945550160/04c09371a1444b3ca581fdce0f751537 [2022-07-22 01:38:53,890 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 01:38:53,891 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 01:38:53,894 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 01:38:53,894 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 01:38:53,897 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 01:38:53,898 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 01:38:53" (1/1) ... [2022-07-22 01:38:53,899 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e7325c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:38:53, skipping insertion in model container [2022-07-22 01:38:53,899 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 01:38:53" (1/1) ... [2022-07-22 01:38:53,905 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 01:38:53,944 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 01:38:54,249 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 01:38:54,256 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 01:38:54,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 01:38:54,326 INFO L208 MainTranslator]: Completed translation [2022-07-22 01:38:54,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:38:54 WrapperNode [2022-07-22 01:38:54,327 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 01:38:54,329 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 01:38:54,329 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 01:38:54,329 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 01:38:54,336 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:38:54" (1/1) ... [2022-07-22 01:38:54,355 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:38:54" (1/1) ... [2022-07-22 01:38:54,377 INFO L137 Inliner]: procedures = 111, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 53 [2022-07-22 01:38:54,378 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 01:38:54,379 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 01:38:54,379 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 01:38:54,379 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 01:38:54,386 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:38:54" (1/1) ... [2022-07-22 01:38:54,386 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:38:54" (1/1) ... [2022-07-22 01:38:54,400 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:38:54" (1/1) ... [2022-07-22 01:38:54,401 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:38:54" (1/1) ... [2022-07-22 01:38:54,409 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:38:54" (1/1) ... [2022-07-22 01:38:54,416 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:38:54" (1/1) ... [2022-07-22 01:38:54,421 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:38:54" (1/1) ... [2022-07-22 01:38:54,428 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 01:38:54,429 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 01:38:54,431 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 01:38:54,431 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 01:38:54,432 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:38:54" (1/1) ... [2022-07-22 01:38:54,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:38:54,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:38:54,464 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:38:54,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-22 01:38:54,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 01:38:54,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 01:38:54,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 01:38:54,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 01:38:54,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 01:38:54,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 01:38:54,615 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 01:38:54,616 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 01:38:54,717 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 01:38:54,722 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 01:38:54,722 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-22 01:38:54,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:38:54 BoogieIcfgContainer [2022-07-22 01:38:54,723 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 01:38:54,724 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 01:38:54,724 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 01:38:54,727 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 01:38:54,727 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 01:38:54,728 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 01:38:53" (1/3) ... [2022-07-22 01:38:54,729 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@21ac8f34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 01:38:54, skipping insertion in model container [2022-07-22 01:38:54,729 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 01:38:54,729 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:38:54" (2/3) ... [2022-07-22 01:38:54,729 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@21ac8f34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 01:38:54, skipping insertion in model container [2022-07-22 01:38:54,729 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 01:38:54,729 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:38:54" (3/3) ... [2022-07-22 01:38:54,731 INFO L354 chiAutomizerObserver]: Analyzing ICFG bubblesort-alloca-1.i [2022-07-22 01:38:54,791 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 01:38:54,792 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-22 01:38:54,792 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 01:38:54,792 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 01:38:54,792 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 01:38:54,792 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-22 01:38:54,792 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 01:38:54,792 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 01:38:54,795 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:38:54,809 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-22 01:38:54,809 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:38:54,809 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:38:54,814 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-22 01:38:54,814 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 01:38:54,815 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 01:38:54,815 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:38:54,816 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-22 01:38:54,816 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:38:54,816 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:38:54,817 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-22 01:38:54,817 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 01:38:54,823 INFO L752 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 11#L562true assume !(main_~array_size~0#1 < 1); 13#L562-2true call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;assume { :begin_inline_bubbleSort } true;bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset, bubbleSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc bubbleSort_#t~mem4#1, bubbleSort_#t~mem5#1, bubbleSort_#t~mem6#1, bubbleSort_#t~mem7#1, bubbleSort_#t~post3#1, bubbleSort_#t~post2#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset, bubbleSort_~array_size#1, bubbleSort_~i~0#1, bubbleSort_~j~0#1, bubbleSort_~temp~0#1;bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset := bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset;bubbleSort_~array_size#1 := bubbleSort_#in~array_size#1;havoc bubbleSort_~i~0#1;havoc bubbleSort_~j~0#1;havoc bubbleSort_~temp~0#1;bubbleSort_~i~0#1 := bubbleSort_~array_size#1 - 1; 6#L550-3true [2022-07-22 01:38:54,824 INFO L754 eck$LassoCheckResult]: Loop: 6#L550-3true assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 5#L551-3true assume !true; 12#L550-2true bubbleSort_#t~post2#1 := bubbleSort_~i~0#1;bubbleSort_~i~0#1 := bubbleSort_#t~post2#1 - 1;havoc bubbleSort_#t~post2#1; 6#L550-3true [2022-07-22 01:38:54,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:38:54,829 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2022-07-22 01:38:54,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:38:54,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938519477] [2022-07-22 01:38:54,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:38:54,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:38:54,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:38:54,919 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:38:54,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:38:54,946 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:38:54,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:38:54,948 INFO L85 PathProgramCache]: Analyzing trace with hash 47218, now seen corresponding path program 1 times [2022-07-22 01:38:54,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:38:54,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013667894] [2022-07-22 01:38:54,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:38:54,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:38:54,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:38:54,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:38:54,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:38:54,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013667894] [2022-07-22 01:38:54,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013667894] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:38:54,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:38:54,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 01:38:54,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767501410] [2022-07-22 01:38:54,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:38:54,991 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 01:38:54,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:38:55,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 01:38:55,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 01:38:55,025 INFO L87 Difference]: Start difference. First operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:38:55,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:38:55,034 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2022-07-22 01:38:55,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 01:38:55,039 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2022-07-22 01:38:55,043 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-22 01:38:55,046 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 9 states and 12 transitions. [2022-07-22 01:38:55,047 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-07-22 01:38:55,048 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-07-22 01:38:55,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2022-07-22 01:38:55,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:38:55,049 INFO L369 hiAutomatonCegarLoop]: Abstraction has 9 states and 12 transitions. [2022-07-22 01:38:55,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2022-07-22 01:38:55,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2022-07-22 01:38:55,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:38:55,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2022-07-22 01:38:55,070 INFO L392 hiAutomatonCegarLoop]: Abstraction has 9 states and 12 transitions. [2022-07-22 01:38:55,071 INFO L374 stractBuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2022-07-22 01:38:55,071 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 01:38:55,077 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 12 transitions. [2022-07-22 01:38:55,077 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-22 01:38:55,077 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:38:55,077 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:38:55,078 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-22 01:38:55,078 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 01:38:55,079 INFO L752 eck$LassoCheckResult]: Stem: 34#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 35#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 40#L562 assume !(main_~array_size~0#1 < 1); 41#L562-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;assume { :begin_inline_bubbleSort } true;bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset, bubbleSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc bubbleSort_#t~mem4#1, bubbleSort_#t~mem5#1, bubbleSort_#t~mem6#1, bubbleSort_#t~mem7#1, bubbleSort_#t~post3#1, bubbleSort_#t~post2#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset, bubbleSort_~array_size#1, bubbleSort_~i~0#1, bubbleSort_~j~0#1, bubbleSort_~temp~0#1;bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset := bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset;bubbleSort_~array_size#1 := bubbleSort_#in~array_size#1;havoc bubbleSort_~i~0#1;havoc bubbleSort_~j~0#1;havoc bubbleSort_~temp~0#1;bubbleSort_~i~0#1 := bubbleSort_~array_size#1 - 1; 42#L550-3 [2022-07-22 01:38:55,079 INFO L754 eck$LassoCheckResult]: Loop: 42#L550-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 37#L551-3 assume !(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1); 38#L550-2 bubbleSort_#t~post2#1 := bubbleSort_~i~0#1;bubbleSort_~i~0#1 := bubbleSort_#t~post2#1 - 1;havoc bubbleSort_#t~post2#1; 42#L550-3 [2022-07-22 01:38:55,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:38:55,082 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2022-07-22 01:38:55,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:38:55,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908053295] [2022-07-22 01:38:55,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:38:55,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:38:55,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:38:55,112 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:38:55,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:38:55,140 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:38:55,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:38:55,141 INFO L85 PathProgramCache]: Analyzing trace with hash 46877, now seen corresponding path program 1 times [2022-07-22 01:38:55,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:38:55,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153484856] [2022-07-22 01:38:55,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:38:55,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:38:55,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:38:55,149 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:38:55,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:38:55,158 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:38:55,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:38:55,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1806818489, now seen corresponding path program 1 times [2022-07-22 01:38:55,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:38:55,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11948313] [2022-07-22 01:38:55,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:38:55,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:38:55,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:38:55,181 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:38:55,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:38:55,209 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:38:55,284 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:38:55,285 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:38:55,286 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:38:55,286 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:38:55,286 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 01:38:55,286 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:38:55,286 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:38:55,286 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:38:55,286 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-1.i_Iteration2_Loop [2022-07-22 01:38:55,287 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:38:55,287 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:38:55,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:38:55,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:38:55,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:38:55,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:38:55,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:38:55,414 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:38:55,414 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 01:38:55,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:38:55,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:38:55,418 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:38:55,421 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 01:38:55,421 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:38:55,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-22 01:38:55,455 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 01:38:55,456 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~P_PID_1=1} Honda state: {v_rep~unnamed0~0~P_PID_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 01:38:55,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-07-22 01:38:55,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:38:55,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:38:55,482 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:38:55,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-22 01:38:55,484 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 01:38:55,484 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:38:55,506 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 01:38:55,506 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~P_PGID_1=2} Honda state: {v_rep~unnamed0~0~P_PGID_1=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 01:38:55,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-22 01:38:55,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:38:55,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:38:55,535 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:38:55,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-22 01:38:55,540 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 01:38:55,540 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:38:55,564 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 01:38:55,564 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_bubbleSort_#t~post2#1=0} Honda state: {ULTIMATE.start_bubbleSort_#t~post2#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 01:38:55,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-07-22 01:38:55,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:38:55,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:38:55,591 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:38:55,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-07-22 01:38:55,598 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 01:38:55,599 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:38:55,628 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 01:38:55,628 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~P_ALL_1=0} Honda state: {v_rep~unnamed0~0~P_ALL_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 01:38:55,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-07-22 01:38:55,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:38:55,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:38:55,655 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:38:55,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-07-22 01:38:55,657 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 01:38:55,657 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:38:55,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-22 01:38:55,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:38:55,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:38:55,703 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:38:55,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-07-22 01:38:55,705 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 01:38:55,705 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:38:55,753 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 01:38:55,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-22 01:38:55,760 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:38:55,761 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:38:55,761 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:38:55,761 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:38:55,761 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 01:38:55,761 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:38:55,761 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:38:55,761 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:38:55,761 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-1.i_Iteration2_Loop [2022-07-22 01:38:55,761 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:38:55,761 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:38:55,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:38:55,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:38:55,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:38:55,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:38:55,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:38:55,838 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:38:55,842 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 01:38:55,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:38:55,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:38:55,844 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:38:55,856 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:38:55,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:38:55,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:38:55,866 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:38:55,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:38:55,871 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:38:55,872 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:38:55,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-07-22 01:38:55,892 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:38:55,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-07-22 01:38:55,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:38:55,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:38:55,921 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:38:55,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-07-22 01:38:55,923 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:38:55,929 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:38:55,930 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:38:55,930 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:38:55,930 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:38:55,934 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:38:55,934 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:38:55,947 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:38:55,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-07-22 01:38:55,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:38:55,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:38:55,970 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:38:55,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-07-22 01:38:55,973 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:38:55,979 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:38:55,979 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:38:55,980 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:38:55,980 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:38:55,980 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:38:55,980 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:38:55,981 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:38:55,985 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:38:56,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-22 01:38:56,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:38:56,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:38:56,005 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:38:56,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-07-22 01:38:56,008 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:38:56,014 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:38:56,015 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:38:56,015 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:38:56,015 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:38:56,018 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:38:56,018 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:38:56,021 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:38:56,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-07-22 01:38:56,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:38:56,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:38:56,039 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:38:56,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-07-22 01:38:56,042 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:38:56,049 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:38:56,049 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:38:56,049 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:38:56,049 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:38:56,049 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:38:56,051 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:38:56,051 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:38:56,075 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 01:38:56,079 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 01:38:56,079 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 01:38:56,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:38:56,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:38:56,087 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:38:56,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-22 01:38:56,113 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 01:38:56,113 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 01:38:56,113 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 01:38:56,114 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubbleSort_~i~0#1) = 2*ULTIMATE.start_bubbleSort_~i~0#1 + 1 Supporting invariants [] [2022-07-22 01:38:56,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-07-22 01:38:56,133 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 01:38:56,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:38:56,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:38:56,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 01:38:56,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:38:56,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:38:56,183 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 01:38:56,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:38:56,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:38:56,204 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 [2022-07-22 01:38:56,205 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 12 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:38:56,243 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 12 transitions. cyclomatic complexity: 4. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 15 states and 22 transitions. Complement of second has 4 states. [2022-07-22 01:38:56,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-22 01:38:56,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:38:56,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2022-07-22 01:38:56,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 4 letters. Loop has 3 letters. [2022-07-22 01:38:56,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:38:56,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 7 letters. Loop has 3 letters. [2022-07-22 01:38:56,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:38:56,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 4 letters. Loop has 6 letters. [2022-07-22 01:38:56,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:38:56,252 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 22 transitions. [2022-07-22 01:38:56,253 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-22 01:38:56,255 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 14 states and 20 transitions. [2022-07-22 01:38:56,255 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2022-07-22 01:38:56,255 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-07-22 01:38:56,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 20 transitions. [2022-07-22 01:38:56,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:38:56,256 INFO L369 hiAutomatonCegarLoop]: Abstraction has 14 states and 20 transitions. [2022-07-22 01:38:56,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 20 transitions. [2022-07-22 01:38:56,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2022-07-22 01:38:56,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:38:56,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2022-07-22 01:38:56,258 INFO L392 hiAutomatonCegarLoop]: Abstraction has 13 states and 19 transitions. [2022-07-22 01:38:56,258 INFO L374 stractBuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2022-07-22 01:38:56,259 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 01:38:56,259 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 19 transitions. [2022-07-22 01:38:56,260 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-22 01:38:56,260 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:38:56,260 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:38:56,260 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-22 01:38:56,260 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 01:38:56,261 INFO L752 eck$LassoCheckResult]: Stem: 99#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 100#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 108#L562 assume !(main_~array_size~0#1 < 1); 109#L562-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;assume { :begin_inline_bubbleSort } true;bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset, bubbleSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc bubbleSort_#t~mem4#1, bubbleSort_#t~mem5#1, bubbleSort_#t~mem6#1, bubbleSort_#t~mem7#1, bubbleSort_#t~post3#1, bubbleSort_#t~post2#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset, bubbleSort_~array_size#1, bubbleSort_~i~0#1, bubbleSort_~j~0#1, bubbleSort_~temp~0#1;bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset := bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset;bubbleSort_~array_size#1 := bubbleSort_#in~array_size#1;havoc bubbleSort_~i~0#1;havoc bubbleSort_~j~0#1;havoc bubbleSort_~temp~0#1;bubbleSort_~i~0#1 := bubbleSort_~array_size#1 - 1; 110#L550-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 102#L551-3 [2022-07-22 01:38:56,261 INFO L754 eck$LassoCheckResult]: Loop: 102#L551-3 assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem4#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem5#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 105#L552 assume bubbleSort_#t~mem4#1 > bubbleSort_#t~mem5#1;havoc bubbleSort_#t~mem4#1;havoc bubbleSort_#t~mem5#1;call bubbleSort_#t~mem6#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);bubbleSort_~temp~0#1 := bubbleSort_#t~mem6#1;havoc bubbleSort_#t~mem6#1;call bubbleSort_#t~mem7#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4);call write~int(bubbleSort_#t~mem7#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);havoc bubbleSort_#t~mem7#1;call write~int(bubbleSort_~temp~0#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 101#L551-2 bubbleSort_#t~post3#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post3#1;havoc bubbleSort_#t~post3#1; 102#L551-3 [2022-07-22 01:38:56,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:38:56,261 INFO L85 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2022-07-22 01:38:56,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:38:56,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332469497] [2022-07-22 01:38:56,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:38:56,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:38:56,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:38:56,282 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:38:56,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:38:56,290 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:38:56,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:38:56,291 INFO L85 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 1 times [2022-07-22 01:38:56,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:38:56,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578420515] [2022-07-22 01:38:56,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:38:56,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:38:56,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:38:56,299 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:38:56,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:38:56,306 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:38:56,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:38:56,306 INFO L85 PathProgramCache]: Analyzing trace with hash 176800017, now seen corresponding path program 1 times [2022-07-22 01:38:56,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:38:56,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360114129] [2022-07-22 01:38:56,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:38:56,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:38:56,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:38:56,331 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:38:56,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:38:56,345 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:38:56,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-07-22 01:38:56,736 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:38:56,736 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:38:56,736 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:38:56,737 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:38:56,737 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 01:38:56,738 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:38:56,741 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:38:56,741 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:38:56,741 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-1.i_Iteration3_Lasso [2022-07-22 01:38:56,741 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:38:56,741 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:38:56,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:38:56,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:38:56,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:38:56,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:38:56,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:38:56,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:38:56,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:38:56,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:38:56,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:38:56,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:38:57,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:38:57,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:38:57,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:38:57,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:38:57,271 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:38:57,271 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 01:38:57,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:38:57,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:38:57,273 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:38:57,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-07-22 01:38:57,285 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:38:57,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:38:57,293 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:38:57,293 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:38:57,293 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:38:57,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:38:57,294 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:38:57,294 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:38:57,303 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:38:57,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-07-22 01:38:57,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:38:57,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:38:57,333 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:38:57,342 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:38:57,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:38:57,350 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:38:57,350 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:38:57,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:38:57,355 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:38:57,355 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:38:57,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-07-22 01:38:57,369 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:38:57,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-07-22 01:38:57,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:38:57,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:38:57,396 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:38:57,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-07-22 01:38:57,399 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:38:57,407 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:38:57,407 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:38:57,407 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:38:57,407 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:38:57,410 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:38:57,410 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:38:57,427 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:38:57,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-07-22 01:38:57,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:38:57,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:38:57,458 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:38:57,466 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:38:57,474 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:38:57,474 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:38:57,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:38:57,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:38:57,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:38:57,475 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:38:57,475 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:38:57,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-07-22 01:38:57,495 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:38:57,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-07-22 01:38:57,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:38:57,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:38:57,521 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:38:57,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-07-22 01:38:57,524 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:38:57,530 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:38:57,530 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:38:57,530 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:38:57,530 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:38:57,536 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:38:57,536 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:38:57,568 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:38:57,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-07-22 01:38:57,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:38:57,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:38:57,586 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:38:57,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-07-22 01:38:57,588 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:38:57,595 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:38:57,595 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:38:57,595 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:38:57,595 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:38:57,595 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:38:57,596 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:38:57,596 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:38:57,599 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:38:57,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-07-22 01:38:57,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:38:57,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:38:57,617 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:38:57,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-07-22 01:38:57,623 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:38:57,629 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:38:57,629 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:38:57,629 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:38:57,629 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:38:57,629 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:38:57,630 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:38:57,630 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:38:57,630 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:38:57,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-07-22 01:38:57,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:38:57,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:38:57,649 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:38:57,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-07-22 01:38:57,663 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:38:57,669 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:38:57,669 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:38:57,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:38:57,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:38:57,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:38:57,670 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:38:57,670 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:38:57,676 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:38:57,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-07-22 01:38:57,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:38:57,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:38:57,694 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:38:57,700 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:38:57,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-07-22 01:38:57,706 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:38:57,707 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:38:57,707 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:38:57,707 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:38:57,707 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:38:57,707 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:38:57,707 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:38:57,708 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:38:57,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-07-22 01:38:57,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:38:57,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:38:57,726 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:38:57,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-07-22 01:38:57,728 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:38:57,734 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:38:57,734 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:38:57,734 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:38:57,734 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:38:57,741 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:38:57,741 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:38:57,767 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:38:57,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-07-22 01:38:57,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:38:57,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:38:57,786 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:38:57,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-07-22 01:38:57,788 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:38:57,794 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:38:57,795 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:38:57,795 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:38:57,795 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:38:57,798 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:38:57,798 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:38:57,803 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:38:57,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-07-22 01:38:57,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:38:57,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:38:57,822 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:38:57,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-07-22 01:38:57,824 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:38:57,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:38:57,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:38:57,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:38:57,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:38:57,841 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:38:57,842 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:38:57,861 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 01:38:57,874 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2022-07-22 01:38:57,874 INFO L444 ModelExtractionUtils]: 21 out of 37 variables were initially zero. Simplification set additionally 12 variables to zero. [2022-07-22 01:38:57,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:38:57,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:38:57,880 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:38:57,888 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 01:38:57,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-07-22 01:38:57,913 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 01:38:57,913 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 01:38:57,913 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubbleSort_~j~0#1, ULTIMATE.start_bubbleSort_~i~0#1) = -2*ULTIMATE.start_bubbleSort_~j~0#1 + 2*ULTIMATE.start_bubbleSort_~i~0#1 + 1 Supporting invariants [] [2022-07-22 01:38:57,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-07-22 01:38:57,954 INFO L293 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2022-07-22 01:38:57,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:38:57,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:38:57,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 01:38:57,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:38:57,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:38:58,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 01:38:58,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:38:58,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:38:58,026 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 [2022-07-22 01:38:58,027 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 19 transitions. cyclomatic complexity: 8 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:38:58,049 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 19 transitions. cyclomatic complexity: 8. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 28 states and 41 transitions. Complement of second has 7 states. [2022-07-22 01:38:58,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-22 01:38:58,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:38:58,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2022-07-22 01:38:58,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 5 letters. Loop has 3 letters. [2022-07-22 01:38:58,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:38:58,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 3 letters. [2022-07-22 01:38:58,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:38:58,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 5 letters. Loop has 6 letters. [2022-07-22 01:38:58,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:38:58,051 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 41 transitions. [2022-07-22 01:38:58,060 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-22 01:38:58,062 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 18 states and 26 transitions. [2022-07-22 01:38:58,062 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2022-07-22 01:38:58,063 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2022-07-22 01:38:58,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 26 transitions. [2022-07-22 01:38:58,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:38:58,063 INFO L369 hiAutomatonCegarLoop]: Abstraction has 18 states and 26 transitions. [2022-07-22 01:38:58,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 26 transitions. [2022-07-22 01:38:58,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 13. [2022-07-22 01:38:58,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:38:58,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2022-07-22 01:38:58,065 INFO L392 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2022-07-22 01:38:58,065 INFO L374 stractBuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2022-07-22 01:38:58,065 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 01:38:58,065 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2022-07-22 01:38:58,067 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-22 01:38:58,067 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:38:58,067 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:38:58,067 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2022-07-22 01:38:58,067 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 01:38:58,068 INFO L752 eck$LassoCheckResult]: Stem: 204#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 205#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 213#L562 assume !(main_~array_size~0#1 < 1); 214#L562-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;assume { :begin_inline_bubbleSort } true;bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset, bubbleSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc bubbleSort_#t~mem4#1, bubbleSort_#t~mem5#1, bubbleSort_#t~mem6#1, bubbleSort_#t~mem7#1, bubbleSort_#t~post3#1, bubbleSort_#t~post2#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset, bubbleSort_~array_size#1, bubbleSort_~i~0#1, bubbleSort_~j~0#1, bubbleSort_~temp~0#1;bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset := bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset;bubbleSort_~array_size#1 := bubbleSort_#in~array_size#1;havoc bubbleSort_~i~0#1;havoc bubbleSort_~j~0#1;havoc bubbleSort_~temp~0#1;bubbleSort_~i~0#1 := bubbleSort_~array_size#1 - 1; 215#L550-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 209#L551-3 assume !(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1); 211#L550-2 bubbleSort_#t~post2#1 := bubbleSort_~i~0#1;bubbleSort_~i~0#1 := bubbleSort_#t~post2#1 - 1;havoc bubbleSort_#t~post2#1; 216#L550-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 207#L551-3 [2022-07-22 01:38:58,068 INFO L754 eck$LassoCheckResult]: Loop: 207#L551-3 assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem4#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem5#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 210#L552 assume bubbleSort_#t~mem4#1 > bubbleSort_#t~mem5#1;havoc bubbleSort_#t~mem4#1;havoc bubbleSort_#t~mem5#1;call bubbleSort_#t~mem6#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);bubbleSort_~temp~0#1 := bubbleSort_#t~mem6#1;havoc bubbleSort_#t~mem6#1;call bubbleSort_#t~mem7#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4);call write~int(bubbleSort_#t~mem7#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);havoc bubbleSort_#t~mem7#1;call write~int(bubbleSort_~temp~0#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 206#L551-2 bubbleSort_#t~post3#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post3#1;havoc bubbleSort_#t~post3#1; 207#L551-3 [2022-07-22 01:38:58,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:38:58,068 INFO L85 PathProgramCache]: Analyzing trace with hash 176798328, now seen corresponding path program 2 times [2022-07-22 01:38:58,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:38:58,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689225344] [2022-07-22 01:38:58,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:38:58,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:38:58,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:38:58,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-07-22 01:38:58,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:38:58,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:38:58,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689225344] [2022-07-22 01:38:58,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689225344] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:38:58,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:38:58,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 01:38:58,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378318926] [2022-07-22 01:38:58,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:38:58,138 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 01:38:58,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:38:58,139 INFO L85 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 2 times [2022-07-22 01:38:58,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:38:58,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063265592] [2022-07-22 01:38:58,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:38:58,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:38:58,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:38:58,152 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:38:58,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:38:58,157 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:38:58,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:38:58,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 01:38:58,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-22 01:38:58,252 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:38:58,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:38:58,288 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2022-07-22 01:38:58,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 01:38:58,290 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2022-07-22 01:38:58,295 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-22 01:38:58,296 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 19 states and 26 transitions. [2022-07-22 01:38:58,296 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-07-22 01:38:58,296 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-07-22 01:38:58,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2022-07-22 01:38:58,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:38:58,297 INFO L369 hiAutomatonCegarLoop]: Abstraction has 19 states and 26 transitions. [2022-07-22 01:38:58,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2022-07-22 01:38:58,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 14. [2022-07-22 01:38:58,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:38:58,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2022-07-22 01:38:58,300 INFO L392 hiAutomatonCegarLoop]: Abstraction has 14 states and 19 transitions. [2022-07-22 01:38:58,300 INFO L374 stractBuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2022-07-22 01:38:58,300 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-22 01:38:58,300 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2022-07-22 01:38:58,303 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-22 01:38:58,303 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:38:58,303 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:38:58,304 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:38:58,304 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 01:38:58,304 INFO L752 eck$LassoCheckResult]: Stem: 250#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 251#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 259#L562 assume !(main_~array_size~0#1 < 1); 260#L562-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;assume { :begin_inline_bubbleSort } true;bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset, bubbleSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc bubbleSort_#t~mem4#1, bubbleSort_#t~mem5#1, bubbleSort_#t~mem6#1, bubbleSort_#t~mem7#1, bubbleSort_#t~post3#1, bubbleSort_#t~post2#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset, bubbleSort_~array_size#1, bubbleSort_~i~0#1, bubbleSort_~j~0#1, bubbleSort_~temp~0#1;bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset := bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset;bubbleSort_~array_size#1 := bubbleSort_#in~array_size#1;havoc bubbleSort_~i~0#1;havoc bubbleSort_~j~0#1;havoc bubbleSort_~temp~0#1;bubbleSort_~i~0#1 := bubbleSort_~array_size#1 - 1; 261#L550-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 257#L551-3 assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem4#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem5#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 258#L552 assume !(bubbleSort_#t~mem4#1 > bubbleSort_#t~mem5#1);havoc bubbleSort_#t~mem4#1;havoc bubbleSort_#t~mem5#1; 254#L551-2 bubbleSort_#t~post3#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post3#1;havoc bubbleSort_#t~post3#1; 255#L551-3 assume !(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1); 263#L550-2 bubbleSort_#t~post2#1 := bubbleSort_~i~0#1;bubbleSort_~i~0#1 := bubbleSort_#t~post2#1 - 1;havoc bubbleSort_#t~post2#1; 262#L550-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 253#L551-3 [2022-07-22 01:38:58,304 INFO L754 eck$LassoCheckResult]: Loop: 253#L551-3 assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem4#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem5#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 256#L552 assume bubbleSort_#t~mem4#1 > bubbleSort_#t~mem5#1;havoc bubbleSort_#t~mem4#1;havoc bubbleSort_#t~mem5#1;call bubbleSort_#t~mem6#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);bubbleSort_~temp~0#1 := bubbleSort_#t~mem6#1;havoc bubbleSort_#t~mem6#1;call bubbleSort_#t~mem7#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4);call write~int(bubbleSort_#t~mem7#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);havoc bubbleSort_#t~mem7#1;call write~int(bubbleSort_~temp~0#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 252#L551-2 bubbleSort_#t~post3#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post3#1;havoc bubbleSort_#t~post3#1; 253#L551-3 [2022-07-22 01:38:58,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:38:58,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1421271829, now seen corresponding path program 1 times [2022-07-22 01:38:58,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:38:58,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554378532] [2022-07-22 01:38:58,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:38:58,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:38:58,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:38:58,319 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:38:58,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:38:58,329 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:38:58,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:38:58,330 INFO L85 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 3 times [2022-07-22 01:38:58,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:38:58,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475020240] [2022-07-22 01:38:58,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:38:58,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:38:58,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:38:58,340 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:38:58,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:38:58,349 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:38:58,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:38:58,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1321478696, now seen corresponding path program 1 times [2022-07-22 01:38:58,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:38:58,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830072380] [2022-07-22 01:38:58,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:38:58,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:38:58,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:38:58,413 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:38:58,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:38:58,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830072380] [2022-07-22 01:38:58,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830072380] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 01:38:58,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392906553] [2022-07-22 01:38:58,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:38:58,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 01:38:58,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:38:58,420 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 01:38:58,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-07-22 01:38:58,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:38:58,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 01:38:58,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:38:58,513 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:38:58,513 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 01:38:58,542 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:38:58,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392906553] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 01:38:58,543 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 01:38:58,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2022-07-22 01:38:58,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92145307] [2022-07-22 01:38:58,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 01:38:58,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:38:58,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 01:38:58,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-07-22 01:38:58,626 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:38:58,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:38:58,685 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2022-07-22 01:38:58,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 01:38:58,686 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2022-07-22 01:38:58,686 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-22 01:38:58,687 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 25 states and 34 transitions. [2022-07-22 01:38:58,687 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-07-22 01:38:58,687 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-07-22 01:38:58,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2022-07-22 01:38:58,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:38:58,687 INFO L369 hiAutomatonCegarLoop]: Abstraction has 25 states and 34 transitions. [2022-07-22 01:38:58,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2022-07-22 01:38:58,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2022-07-22 01:38:58,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:38:58,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2022-07-22 01:38:58,689 INFO L392 hiAutomatonCegarLoop]: Abstraction has 17 states and 23 transitions. [2022-07-22 01:38:58,689 INFO L374 stractBuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2022-07-22 01:38:58,689 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-22 01:38:58,689 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2022-07-22 01:38:58,689 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-22 01:38:58,690 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:38:58,690 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:38:58,690 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-22 01:38:58,690 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 01:38:58,690 INFO L752 eck$LassoCheckResult]: Stem: 389#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 390#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 398#L562 assume !(main_~array_size~0#1 < 1); 399#L562-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;assume { :begin_inline_bubbleSort } true;bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset, bubbleSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc bubbleSort_#t~mem4#1, bubbleSort_#t~mem5#1, bubbleSort_#t~mem6#1, bubbleSort_#t~mem7#1, bubbleSort_#t~post3#1, bubbleSort_#t~post2#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset, bubbleSort_~array_size#1, bubbleSort_~i~0#1, bubbleSort_~j~0#1, bubbleSort_~temp~0#1;bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset := bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset;bubbleSort_~array_size#1 := bubbleSort_#in~array_size#1;havoc bubbleSort_~i~0#1;havoc bubbleSort_~j~0#1;havoc bubbleSort_~temp~0#1;bubbleSort_~i~0#1 := bubbleSort_~array_size#1 - 1; 400#L550-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 396#L551-3 assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem4#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem5#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 397#L552 assume !(bubbleSort_#t~mem4#1 > bubbleSort_#t~mem5#1);havoc bubbleSort_#t~mem4#1;havoc bubbleSort_#t~mem5#1; 393#L551-2 bubbleSort_#t~post3#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post3#1;havoc bubbleSort_#t~post3#1; 394#L551-3 assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem4#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem5#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 404#L552 assume !(bubbleSort_#t~mem4#1 > bubbleSort_#t~mem5#1);havoc bubbleSort_#t~mem4#1;havoc bubbleSort_#t~mem5#1; 405#L551-2 bubbleSort_#t~post3#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post3#1;havoc bubbleSort_#t~post3#1; 403#L551-3 assume !(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1); 402#L550-2 bubbleSort_#t~post2#1 := bubbleSort_~i~0#1;bubbleSort_~i~0#1 := bubbleSort_#t~post2#1 - 1;havoc bubbleSort_#t~post2#1; 401#L550-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 392#L551-3 [2022-07-22 01:38:58,690 INFO L754 eck$LassoCheckResult]: Loop: 392#L551-3 assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem4#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem5#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 395#L552 assume bubbleSort_#t~mem4#1 > bubbleSort_#t~mem5#1;havoc bubbleSort_#t~mem4#1;havoc bubbleSort_#t~mem5#1;call bubbleSort_#t~mem6#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);bubbleSort_~temp~0#1 := bubbleSort_#t~mem6#1;havoc bubbleSort_#t~mem6#1;call bubbleSort_#t~mem7#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4);call write~int(bubbleSort_#t~mem7#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);havoc bubbleSort_#t~mem7#1;call write~int(bubbleSort_~temp~0#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 391#L551-2 bubbleSort_#t~post3#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post3#1;havoc bubbleSort_#t~post3#1; 392#L551-3 [2022-07-22 01:38:58,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:38:58,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1373641048, now seen corresponding path program 2 times [2022-07-22 01:38:58,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:38:58,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682902170] [2022-07-22 01:38:58,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:38:58,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:38:58,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:38:58,703 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:38:58,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:38:58,726 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:38:58,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:38:58,730 INFO L85 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 4 times [2022-07-22 01:38:58,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:38:58,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198083694] [2022-07-22 01:38:58,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:38:58,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:38:58,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:38:58,747 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:38:58,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:38:58,756 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:38:58,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:38:58,757 INFO L85 PathProgramCache]: Analyzing trace with hash -307910395, now seen corresponding path program 2 times [2022-07-22 01:38:58,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:38:58,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3045352] [2022-07-22 01:38:58,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:38:58,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:38:58,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:38:59,043 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:38:59,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:38:59,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3045352] [2022-07-22 01:38:59,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3045352] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 01:38:59,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091993918] [2022-07-22 01:38:59,043 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 01:38:59,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 01:38:59,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:38:59,045 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 01:38:59,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-07-22 01:38:59,102 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 01:38:59,102 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 01:38:59,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-22 01:38:59,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:38:59,213 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 01:38:59,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2022-07-22 01:38:59,226 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 01:38:59,227 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 01:38:59,314 INFO L356 Elim1Store]: treesize reduction 56, result has 31.7 percent of original size [2022-07-22 01:38:59,315 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 32 [2022-07-22 01:38:59,366 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 01:38:59,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091993918] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 01:38:59,367 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 01:38:59,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 16 [2022-07-22 01:38:59,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689907264] [2022-07-22 01:38:59,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 01:38:59,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:38:59,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-22 01:38:59,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2022-07-22 01:38:59,447 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 8 Second operand has 16 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:38:59,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:38:59,562 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2022-07-22 01:38:59,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 01:38:59,564 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 50 transitions. [2022-07-22 01:38:59,564 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-07-22 01:38:59,566 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 50 transitions. [2022-07-22 01:38:59,566 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2022-07-22 01:38:59,566 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2022-07-22 01:38:59,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 50 transitions. [2022-07-22 01:38:59,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:38:59,566 INFO L369 hiAutomatonCegarLoop]: Abstraction has 37 states and 50 transitions. [2022-07-22 01:38:59,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 50 transitions. [2022-07-22 01:38:59,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2022-07-22 01:38:59,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 25 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:38:59,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2022-07-22 01:38:59,569 INFO L392 hiAutomatonCegarLoop]: Abstraction has 26 states and 35 transitions. [2022-07-22 01:38:59,569 INFO L374 stractBuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2022-07-22 01:38:59,569 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-22 01:38:59,569 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. [2022-07-22 01:38:59,569 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-22 01:38:59,569 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:38:59,569 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:38:59,570 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:38:59,570 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 01:38:59,570 INFO L752 eck$LassoCheckResult]: Stem: 562#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 563#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 571#L562 assume !(main_~array_size~0#1 < 1); 572#L562-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;assume { :begin_inline_bubbleSort } true;bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset, bubbleSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc bubbleSort_#t~mem4#1, bubbleSort_#t~mem5#1, bubbleSort_#t~mem6#1, bubbleSort_#t~mem7#1, bubbleSort_#t~post3#1, bubbleSort_#t~post2#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset, bubbleSort_~array_size#1, bubbleSort_~i~0#1, bubbleSort_~j~0#1, bubbleSort_~temp~0#1;bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset := bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset;bubbleSort_~array_size#1 := bubbleSort_#in~array_size#1;havoc bubbleSort_~i~0#1;havoc bubbleSort_~j~0#1;havoc bubbleSort_~temp~0#1;bubbleSort_~i~0#1 := bubbleSort_~array_size#1 - 1; 573#L550-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 574#L551-3 assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem4#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem5#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 584#L552 assume !(bubbleSort_#t~mem4#1 > bubbleSort_#t~mem5#1);havoc bubbleSort_#t~mem4#1;havoc bubbleSort_#t~mem5#1; 566#L551-2 bubbleSort_#t~post3#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post3#1;havoc bubbleSort_#t~post3#1; 567#L551-3 assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem4#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem5#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 570#L552 assume bubbleSort_#t~mem4#1 > bubbleSort_#t~mem5#1;havoc bubbleSort_#t~mem4#1;havoc bubbleSort_#t~mem5#1;call bubbleSort_#t~mem6#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);bubbleSort_~temp~0#1 := bubbleSort_#t~mem6#1;havoc bubbleSort_#t~mem6#1;call bubbleSort_#t~mem7#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4);call write~int(bubbleSort_#t~mem7#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);havoc bubbleSort_#t~mem7#1;call write~int(bubbleSort_~temp~0#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 577#L551-2 bubbleSort_#t~post3#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post3#1;havoc bubbleSort_#t~post3#1; 583#L551-3 assume !(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1); 579#L550-2 bubbleSort_#t~post2#1 := bubbleSort_~i~0#1;bubbleSort_~i~0#1 := bubbleSort_#t~post2#1 - 1;havoc bubbleSort_#t~post2#1; 580#L550-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 565#L551-3 [2022-07-22 01:38:59,570 INFO L754 eck$LassoCheckResult]: Loop: 565#L551-3 assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem4#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem5#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 587#L552 assume bubbleSort_#t~mem4#1 > bubbleSort_#t~mem5#1;havoc bubbleSort_#t~mem4#1;havoc bubbleSort_#t~mem5#1;call bubbleSort_#t~mem6#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);bubbleSort_~temp~0#1 := bubbleSort_#t~mem6#1;havoc bubbleSort_#t~mem6#1;call bubbleSort_#t~mem7#1 := read~int(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4);call write~int(bubbleSort_#t~mem7#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);havoc bubbleSort_#t~mem7#1;call write~int(bubbleSort_~temp~0#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 564#L551-2 bubbleSort_#t~post3#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post3#1;havoc bubbleSort_#t~post3#1; 565#L551-3 [2022-07-22 01:38:59,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:38:59,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1371794006, now seen corresponding path program 3 times [2022-07-22 01:38:59,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:38:59,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291101268] [2022-07-22 01:38:59,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:38:59,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:38:59,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:38:59,608 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:38:59,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:38:59,620 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:38:59,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:38:59,621 INFO L85 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 5 times [2022-07-22 01:38:59,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:38:59,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494350411] [2022-07-22 01:38:59,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:38:59,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:38:59,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:38:59,626 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:38:59,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:38:59,630 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:38:59,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:38:59,631 INFO L85 PathProgramCache]: Analyzing trace with hash 501436231, now seen corresponding path program 4 times [2022-07-22 01:38:59,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:38:59,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992767298] [2022-07-22 01:38:59,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:38:59,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:38:59,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:38:59,647 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:38:59,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:38:59,660 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:39:00,185 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:39:00,185 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:39:00,185 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:39:00,185 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:39:00,186 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 01:39:00,186 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:00,186 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:39:00,186 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:39:00,186 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-1.i_Iteration7_Lasso [2022-07-22 01:39:00,186 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:39:00,186 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:39:00,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:39:00,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:39:00,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:39:00,233 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.IllegalArgumentException at de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) at java.base/java.util.AbstractMap.putAll(AbstractMap.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.PureSubstitution.(PureSubstitution.java:81) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.(Substitution.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.apply(Substitution.java:59) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:518) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:342) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:601) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:914) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:823) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:247) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:310) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:146) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:363) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-22 01:39:00,235 INFO L158 Benchmark]: Toolchain (without parser) took 6343.02ms. Allocated memory was 58.7MB in the beginning and 92.3MB in the end (delta: 33.6MB). Free memory was 36.4MB in the beginning and 36.6MB in the end (delta: -153.8kB). Peak memory consumption was 48.0MB. Max. memory is 16.1GB. [2022-07-22 01:39:00,235 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 58.7MB. Free memory is still 40.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 01:39:00,235 INFO L158 Benchmark]: CACSL2BoogieTranslator took 433.85ms. Allocated memory is still 58.7MB. Free memory was 36.3MB in the beginning and 36.4MB in the end (delta: -75.0kB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-22 01:39:00,235 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.75ms. Allocated memory is still 58.7MB. Free memory was 36.2MB in the beginning and 34.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 01:39:00,235 INFO L158 Benchmark]: Boogie Preprocessor took 49.79ms. Allocated memory is still 58.7MB. Free memory was 34.3MB in the beginning and 33.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 01:39:00,236 INFO L158 Benchmark]: RCFGBuilder took 294.15ms. Allocated memory was 58.7MB in the beginning and 75.5MB in the end (delta: 16.8MB). Free memory was 33.0MB in the beginning and 54.9MB in the end (delta: -21.9MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. [2022-07-22 01:39:00,236 INFO L158 Benchmark]: BuchiAutomizer took 5509.65ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 54.9MB in the beginning and 36.6MB in the end (delta: 18.4MB). Peak memory consumption was 49.1MB. Max. memory is 16.1GB. [2022-07-22 01:39:00,238 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 58.7MB. Free memory is still 40.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 433.85ms. Allocated memory is still 58.7MB. Free memory was 36.3MB in the beginning and 36.4MB in the end (delta: -75.0kB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.75ms. Allocated memory is still 58.7MB. Free memory was 36.2MB in the beginning and 34.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.79ms. Allocated memory is still 58.7MB. Free memory was 34.3MB in the beginning and 33.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 294.15ms. Allocated memory was 58.7MB in the beginning and 75.5MB in the end (delta: 16.8MB). Free memory was 33.0MB in the beginning and 54.9MB in the end (delta: -21.9MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. * BuchiAutomizer took 5509.65ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 54.9MB in the beginning and 36.6MB in the end (delta: 18.4MB). Peak memory consumption was 49.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: IllegalArgumentException: null de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: IllegalArgumentException: null: de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-22 01:39:00,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-07-22 01:39:00,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-07-22 01:39:00,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: IllegalArgumentException: null