./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/bubblesort-alloca-2.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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/array-memsafety/bubblesort-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash 71daa4447a811360729951159d42c752715aafb50c3ad4dcb2ed5d242a4f4a78 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:34:42,848 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:34:42,855 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:34:42,894 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:34:42,895 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:34:42,897 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:34:42,898 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:34:42,899 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:34:42,900 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:34:42,901 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:34:42,901 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:34:42,902 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:34:42,902 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:34:42,903 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:34:42,904 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:34:42,904 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:34:42,905 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:34:42,905 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:34:42,906 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:34:42,907 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:34:42,908 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:34:42,911 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:34:42,912 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:34:42,913 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:34:42,915 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:34:42,917 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:34:42,917 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:34:42,918 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:34:42,919 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:34:42,919 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:34:42,919 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:34:42,920 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:34:42,921 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:34:42,922 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:34:42,922 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:34:42,923 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:34:42,923 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:34:42,923 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:34:42,923 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:34:42,924 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:34:42,924 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:34:42,925 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-02-21 04:34:42,952 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:34:42,952 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:34:42,953 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:34:42,953 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:34:42,954 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:34:42,954 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:34:42,954 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:34:42,954 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:34:42,954 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:34:42,954 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:34:42,954 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:34:42,954 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:34:42,955 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:34:42,955 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:34:42,955 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:34:42,955 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:34:42,955 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:34:42,955 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:34:42,955 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:34:42,956 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:34:42,956 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:34:42,956 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:34:42,956 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:34:42,956 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:34:42,956 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:34:42,956 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:34:42,956 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:34:42,957 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:34:42,957 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:34:42,957 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:34:42,957 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:34:42,958 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:34:42,960 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 71daa4447a811360729951159d42c752715aafb50c3ad4dcb2ed5d242a4f4a78 [2022-02-21 04:34:43,158 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:34:43,183 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:34:43,186 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:34:43,187 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:34:43,191 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:34:43,193 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/bubblesort-alloca-2.i [2022-02-21 04:34:43,258 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cab9d2610/4234d3bee3104301889cc24221ef2745/FLAG6d4cb6def [2022-02-21 04:34:43,593 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:34:43,594 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/bubblesort-alloca-2.i [2022-02-21 04:34:43,614 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cab9d2610/4234d3bee3104301889cc24221ef2745/FLAG6d4cb6def [2022-02-21 04:34:43,966 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cab9d2610/4234d3bee3104301889cc24221ef2745 [2022-02-21 04:34:43,969 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:34:43,970 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:34:43,973 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:34:43,973 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:34:43,975 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:34:43,976 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:34:43" (1/1) ... [2022-02-21 04:34:43,978 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77e6aac2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:43, skipping insertion in model container [2022-02-21 04:34:43,978 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:34:43" (1/1) ... [2022-02-21 04:34:43,982 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:34:44,016 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:34:44,234 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:34:44,239 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:34:44,283 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:34:44,300 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:34:44,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:44 WrapperNode [2022-02-21 04:34:44,300 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:34:44,302 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:34:44,302 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:34:44,302 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:34:44,307 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:44" (1/1) ... [2022-02-21 04:34:44,320 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:44" (1/1) ... [2022-02-21 04:34:44,341 INFO L137 Inliner]: procedures = 116, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 63 [2022-02-21 04:34:44,342 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:34:44,343 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:34:44,343 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:34:44,344 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:34:44,348 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:44" (1/1) ... [2022-02-21 04:34:44,349 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:44" (1/1) ... [2022-02-21 04:34:44,364 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:44" (1/1) ... [2022-02-21 04:34:44,365 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:44" (1/1) ... [2022-02-21 04:34:44,368 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:44" (1/1) ... [2022-02-21 04:34:44,376 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:44" (1/1) ... [2022-02-21 04:34:44,378 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:44" (1/1) ... [2022-02-21 04:34:44,380 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:34:44,381 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:34:44,381 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:34:44,381 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:34:44,388 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:44" (1/1) ... [2022-02-21 04:34:44,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:44,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:44,412 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-02-21 04:34:44,414 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-02-21 04:34:44,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 04:34:44,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 04:34:44,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 04:34:44,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 04:34:44,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:34:44,438 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:34:44,530 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:34:44,542 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:34:44,741 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:34:44,745 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:34:44,746 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-21 04:34:44,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:34:44 BoogieIcfgContainer [2022-02-21 04:34:44,748 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:34:44,748 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:34:44,749 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:34:44,751 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:34:44,752 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:34:44,752 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:34:43" (1/3) ... [2022-02-21 04:34:44,753 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3228e1f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:34:44, skipping insertion in model container [2022-02-21 04:34:44,754 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:34:44,754 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:34:44" (2/3) ... [2022-02-21 04:34:44,754 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3228e1f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:34:44, skipping insertion in model container [2022-02-21 04:34:44,754 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:34:44,754 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:34:44" (3/3) ... [2022-02-21 04:34:44,755 INFO L388 chiAutomizerObserver]: Analyzing ICFG bubblesort-alloca-2.i [2022-02-21 04:34:44,798 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:34:44,798 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:34:44,798 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:34:44,798 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:34:44,798 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:34:44,798 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:34:44,799 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:34:44,799 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:34:44,811 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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-02-21 04:34:44,836 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-02-21 04:34:44,837 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:44,837 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:44,841 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 04:34:44,841 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:34:44,841 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:34:44,841 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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-02-21 04:34:44,845 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-02-21 04:34:44,845 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:44,845 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:44,846 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 04:34:44,846 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:34:44,851 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 10#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_#t~nondet11#1, main_#t~post10#1, main_~k~0#1, 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; 12#L527true assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 13#L527-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;main_~k~0#1 := 0; 16#L532-3true [2022-02-21 04:34:44,851 INFO L793 eck$LassoCheckResult]: Loop: 16#L532-3true assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet11#1; 5#L532-2true main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 16#L532-3true [2022-02-21 04:34:44,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:44,854 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2022-02-21 04:34:44,861 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:44,861 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714079633] [2022-02-21 04:34:44,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:44,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:44,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:44,924 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:44,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:44,952 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:44,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:44,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2022-02-21 04:34:44,955 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:44,955 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135498191] [2022-02-21 04:34:44,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:44,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:44,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:44,984 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:44,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:44,995 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:44,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:44,998 INFO L85 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2022-02-21 04:34:44,998 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:44,998 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818963459] [2022-02-21 04:34:44,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:44,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:45,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:45,044 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:45,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:45,058 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:45,309 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:34:45,309 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:34:45,309 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:34:45,310 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:34:45,310 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:34:45,310 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:45,310 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:34:45,310 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:34:45,311 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-2.i_Iteration1_Lasso [2022-02-21 04:34:45,311 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:34:45,311 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:34:45,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-02-21 04:34:45,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:45,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:45,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:45,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:45,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:45,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:45,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:45,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:45,768 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:34:45,771 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:34:45,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:45,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:45,775 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-02-21 04:34:45,785 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-02-21 04:34:45,789 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-02-21 04:34:45,796 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:45,797 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:45,797 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:45,797 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:45,797 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:45,799 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:34:45,799 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:34:45,810 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:45,827 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-02-21 04:34:45,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:45,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:45,832 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-02-21 04:34:45,839 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-02-21 04:34:45,840 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-02-21 04:34:45,848 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:45,848 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:45,848 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:45,849 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:45,853 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:34:45,853 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:34:45,886 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:45,911 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-02-21 04:34:45,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:45,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:45,913 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-02-21 04:34:45,914 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-02-21 04:34:45,917 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-02-21 04:34:45,924 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:45,924 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:45,924 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:45,924 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:45,925 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:45,926 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:34:45,926 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:34:45,934 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:45,952 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-02-21 04:34:45,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:45,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:45,954 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-02-21 04:34:45,955 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-02-21 04:34:45,956 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-02-21 04:34:45,963 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:45,963 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:45,963 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:45,963 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:45,965 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:34:45,965 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:34:45,987 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:46,003 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-02-21 04:34:46,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:46,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:46,005 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-02-21 04:34:46,011 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-02-21 04:34:46,024 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-02-21 04:34:46,031 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:46,031 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:46,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:46,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:46,033 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:34:46,034 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:34:46,047 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:46,063 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-02-21 04:34:46,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:46,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:46,065 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-02-21 04:34:46,066 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-02-21 04:34:46,067 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-02-21 04:34:46,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:46,074 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:46,074 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:46,074 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:46,078 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:34:46,078 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:34:46,090 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:46,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2022-02-21 04:34:46,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:46,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:46,141 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-02-21 04:34:46,141 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-02-21 04:34:46,142 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-02-21 04:34:46,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:46,149 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:46,149 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:46,149 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:46,157 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:34:46,157 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:34:46,177 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:34:46,207 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2022-02-21 04:34:46,208 INFO L444 ModelExtractionUtils]: 8 out of 22 variables were initially zero. Simplification set additionally 9 variables to zero. [2022-02-21 04:34:46,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:46,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:46,218 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-02-21 04:34:46,244 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:34:46,251 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-02-21 04:34:46,269 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-02-21 04:34:46,269 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:34:46,269 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc9#1.base)_1, ULTIMATE.start_main_~k~0#1) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc9#1.base)_1 - 2*ULTIMATE.start_main_~k~0#1 Supporting invariants [1*v_rep(select #length ULTIMATE.start_main_#t~malloc9#1.base)_1 - 2*ULTIMATE.start_main_~array_size~0#1 >= 0] [2022-02-21 04:34:46,301 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-02-21 04:34:46,322 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2022-02-21 04:34:46,329 INFO L390 LassoCheck]: Loop: "assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet11#1;" "main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" [2022-02-21 04:34:46,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:46,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:46,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:46,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 04:34:46,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:46,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:34:46,423 INFO L290 TraceCheckUtils]: 0: Hoare triple {26#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {26#unseeded} is VALID [2022-02-21 04:34:46,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#unseeded} 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_#t~nondet11#1, main_#t~post10#1, main_~k~0#1, 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; {26#unseeded} is VALID [2022-02-21 04:34:46,428 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#unseeded} assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); {75#(and unseeded (not (< |ULTIMATE.start_main_~array_size~0#1| 1)))} is VALID [2022-02-21 04:34:46,429 INFO L290 TraceCheckUtils]: 3: Hoare triple {75#(and unseeded (not (< |ULTIMATE.start_main_~array_size~0#1| 1)))} 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;main_~k~0#1 := 0; {60#(and unseeded (>= (+ (* (- 2) |ULTIMATE.start_main_~array_size~0#1|) (select |#length| |ULTIMATE.start_main_#t~malloc9#1.base|)) 0))} is VALID [2022-02-21 04:34:46,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:46,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 04:34:46,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:46,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:34:46,473 INFO L290 TraceCheckUtils]: 0: Hoare triple {61#(and (>= (+ (* (- 2) |ULTIMATE.start_main_~array_size~0#1|) (select |#length| |ULTIMATE.start_main_#t~malloc9#1.base|)) 0) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~k~0#1|) (select |#length| |ULTIMATE.start_main_#t~malloc9#1.base|))))} assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet11#1; {79#(and (< |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~array_size~0#1|) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~k~0#1|) (select |#length| |ULTIMATE.start_main_#t~malloc9#1.base|))) (>= (+ (* |ULTIMATE.start_main_~array_size~0#1| (- 2)) (select |#length| |ULTIMATE.start_main_#t~malloc9#1.base|)) 0))} is VALID [2022-02-21 04:34:46,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {79#(and (< |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~array_size~0#1|) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~k~0#1|) (select |#length| |ULTIMATE.start_main_#t~malloc9#1.base|))) (>= (+ (* |ULTIMATE.start_main_~array_size~0#1| (- 2)) (select |#length| |ULTIMATE.start_main_#t~malloc9#1.base|)) 0))} main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {63#(and (>= (+ (* (- 2) |ULTIMATE.start_main_~array_size~0#1|) (select |#length| |ULTIMATE.start_main_#t~malloc9#1.base|)) 0) (or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~k~0#1|) (select |#length| |ULTIMATE.start_main_#t~malloc9#1.base|)))) unseeded))} is VALID [2022-02-21 04:34:46,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:34:46,489 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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-02-21 04:34:46,498 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:34:46,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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) Stem has 4 letters. Loop has 2 letters. [2022-02-21 04:34:46,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:46,504 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2022-02-21 04:34:46,505 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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-02-21 04:34:46,609 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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). Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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 35 states and 53 transitions. Complement of second has 9 states. [2022-02-21 04:34:46,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 04:34:46,610 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:34:46,610 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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-02-21 04:34:46,612 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-02-21 04:34:46,613 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:46,613 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:46,613 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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-02-21 04:34:46,624 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 04:34:46,624 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:46,624 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:46,624 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 53 transitions. [2022-02-21 04:34:46,628 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 04:34:46,628 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:46,628 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:46,630 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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-02-21 04:34:46,631 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-02-21 04:34:46,633 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2022-02-21 04:34:46,633 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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-02-21 04:34:46,635 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 04:34:46,637 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 04:34:46,638 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 35 states and 53 transitions. cyclomatic complexity: 22 [2022-02-21 04:34:46,640 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 04:34:46,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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) Stem has 4 letters. Loop has 2 letters. [2022-02-21 04:34:46,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:46,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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) Stem has 4 letters. Loop has 2 letters. [2022-02-21 04:34:46,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:46,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 22 Stem has 4 letters. Loop has 2 letters. [2022-02-21 04:34:46,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:46,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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) Stem has 2 letters. Loop has 2 letters. [2022-02-21 04:34:46,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:46,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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) Stem has 2 letters. Loop has 2 letters. [2022-02-21 04:34:46,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:46,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 22 Stem has 2 letters. Loop has 2 letters. [2022-02-21 04:34:46,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:46,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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) Stem has 6 letters. Loop has 3 letters. [2022-02-21 04:34:46,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:46,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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) Stem has 6 letters. Loop has 3 letters. [2022-02-21 04:34:46,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:46,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 22 Stem has 6 letters. Loop has 3 letters. [2022-02-21 04:34:46,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:46,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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) Stem has 35 letters. Loop has 35 letters. [2022-02-21 04:34:46,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:46,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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) Stem has 35 letters. Loop has 35 letters. [2022-02-21 04:34:46,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:46,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 22 Stem has 35 letters. Loop has 35 letters. [2022-02-21 04:34:46,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:46,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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) Stem has 16 letters. Loop has 16 letters. [2022-02-21 04:34:46,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:46,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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) Stem has 16 letters. Loop has 16 letters. [2022-02-21 04:34:46,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:46,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 22 Stem has 16 letters. Loop has 16 letters. [2022-02-21 04:34:46,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:46,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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) Stem has 6 letters. Loop has 6 letters. [2022-02-21 04:34:46,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:46,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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) Stem has 6 letters. Loop has 6 letters. [2022-02-21 04:34:46,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:46,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 22 Stem has 6 letters. Loop has 6 letters. [2022-02-21 04:34:46,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:46,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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) Stem has 8 letters. Loop has 3 letters. [2022-02-21 04:34:46,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:46,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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) Stem has 8 letters. Loop has 3 letters. [2022-02-21 04:34:46,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:46,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 22 Stem has 8 letters. Loop has 3 letters. [2022-02-21 04:34:46,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:46,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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) Stem has 8 letters. Loop has 3 letters. [2022-02-21 04:34:46,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:46,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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) Stem has 8 letters. Loop has 3 letters. [2022-02-21 04:34:46,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:46,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 22 Stem has 8 letters. Loop has 3 letters. [2022-02-21 04:34:46,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:46,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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) Stem has 6 letters. Loop has 3 letters. [2022-02-21 04:34:46,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:46,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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) Stem has 6 letters. Loop has 3 letters. [2022-02-21 04:34:46,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:46,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 22 Stem has 6 letters. Loop has 3 letters. [2022-02-21 04:34:46,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:46,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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) Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:34:46,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:46,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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) Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:34:46,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:46,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 22 Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:34:46,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:46,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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) Stem has 7 letters. Loop has 3 letters. [2022-02-21 04:34:46,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:46,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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) Stem has 7 letters. Loop has 3 letters. [2022-02-21 04:34:46,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:46,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 22 Stem has 7 letters. Loop has 3 letters. [2022-02-21 04:34:46,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:46,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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) Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:34:46,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:46,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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) Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:34:46,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:46,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 22 Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:34:46,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:46,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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) Stem has 4 letters. Loop has 2 letters. [2022-02-21 04:34:46,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:46,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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) Stem has 4 letters. Loop has 2 letters. [2022-02-21 04:34:46,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:46,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 22 Stem has 4 letters. Loop has 2 letters. [2022-02-21 04:34:46,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:46,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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) Stem has 3 letters. Loop has 1 letters. [2022-02-21 04:34:46,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:46,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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) Stem has 3 letters. Loop has 1 letters. [2022-02-21 04:34:46,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:46,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 22 Stem has 3 letters. Loop has 1 letters. [2022-02-21 04:34:46,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:46,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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) Stem has 2 letters. Loop has 2 letters. [2022-02-21 04:34:46,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:46,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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) Stem has 2 letters. Loop has 2 letters. [2022-02-21 04:34:46,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:46,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 22 Stem has 2 letters. Loop has 2 letters. [2022-02-21 04:34:46,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:46,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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) Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:34:46,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:46,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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) Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:34:46,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:46,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 22 Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:34:46,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:46,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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) Stem has 7 letters. Loop has 3 letters. [2022-02-21 04:34:46,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:46,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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) Stem has 7 letters. Loop has 3 letters. [2022-02-21 04:34:46,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:46,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 22 Stem has 7 letters. Loop has 3 letters. [2022-02-21 04:34:46,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:46,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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) Stem has 8 letters. Loop has 3 letters. [2022-02-21 04:34:46,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:46,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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) Stem has 8 letters. Loop has 3 letters. [2022-02-21 04:34:46,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:46,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 22 Stem has 8 letters. Loop has 3 letters. [2022-02-21 04:34:46,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:46,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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) Stem has 8 letters. Loop has 3 letters. [2022-02-21 04:34:46,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:46,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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) Stem has 8 letters. Loop has 3 letters. [2022-02-21 04:34:46,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:46,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 22 Stem has 8 letters. Loop has 3 letters. [2022-02-21 04:34:46,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:46,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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) Stem has 6 letters. Loop has 3 letters. [2022-02-21 04:34:46,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:46,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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) Stem has 6 letters. Loop has 3 letters. [2022-02-21 04:34:46,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:46,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 53 transitions. cyclomatic complexity: 22 Stem has 6 letters. Loop has 3 letters. [2022-02-21 04:34:46,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:46,673 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:34:46,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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-02-21 04:34:46,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2022-02-21 04:34:46,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 4 letters. Loop has 2 letters. [2022-02-21 04:34:46,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:46,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:34:46,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:46,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:34:46,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:46,682 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 53 transitions. cyclomatic complexity: 22 [2022-02-21 04:34:46,686 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 04:34:46,689 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 13 states and 18 transitions. [2022-02-21 04:34:46,690 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-02-21 04:34:46,690 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-02-21 04:34:46,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2022-02-21 04:34:46,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:34:46,692 INFO L681 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2022-02-21 04:34:46,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2022-02-21 04:34:46,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-02-21 04:34:46,709 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:34:46,709 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states and 18 transitions. Second 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-02-21 04:34:46,711 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states and 18 transitions. Second 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-02-21 04:34:46,712 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. Second 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-02-21 04:34:46,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:34:46,714 INFO L93 Difference]: Finished difference Result 13 states and 18 transitions. [2022-02-21 04:34:46,714 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 18 transitions. [2022-02-21 04:34:46,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:34:46,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:34:46,715 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 13 states and 18 transitions. [2022-02-21 04:34:46,715 INFO L87 Difference]: Start difference. First 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) Second operand 13 states and 18 transitions. [2022-02-21 04:34:46,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:34:46,718 INFO L93 Difference]: Finished difference Result 13 states and 18 transitions. [2022-02-21 04:34:46,718 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 18 transitions. [2022-02-21 04:34:46,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:34:46,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:34:46,719 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:34:46,719 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:34:46,719 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-02-21 04:34:46,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2022-02-21 04:34:46,727 INFO L704 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2022-02-21 04:34:46,727 INFO L587 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2022-02-21 04:34:46,727 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:34:46,727 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2022-02-21 04:34:46,728 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 04:34:46,728 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:46,728 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:46,728 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-02-21 04:34:46,728 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 04:34:46,728 INFO L791 eck$LassoCheckResult]: Stem: 134#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 135#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_#t~nondet11#1, main_#t~post10#1, main_~k~0#1, 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; 132#L527 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 133#L527-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;main_~k~0#1 := 0; 138#L532-3 assume !(main_~k~0#1 < main_~array_size~0#1); 139#L532-4 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; 140#L515-3 [2022-02-21 04:34:46,729 INFO L793 eck$LassoCheckResult]: Loop: 140#L515-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 141#L516-3 assume !(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1); 142#L515-2 bubbleSort_#t~post2#1 := bubbleSort_~i~0#1;bubbleSort_~i~0#1 := bubbleSort_#t~post2#1 - 1;havoc bubbleSort_#t~post2#1; 140#L515-3 [2022-02-21 04:34:46,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:46,729 INFO L85 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2022-02-21 04:34:46,730 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:46,730 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321866642] [2022-02-21 04:34:46,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:46,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:46,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:46,775 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-02-21 04:34:46,814 INFO L290 TraceCheckUtils]: 0: Hoare triple {174#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {174#true} is VALID [2022-02-21 04:34:46,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {174#true} 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_#t~nondet11#1, main_#t~post10#1, main_~k~0#1, 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; {174#true} is VALID [2022-02-21 04:34:46,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {174#true} assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); {176#(<= 1 |ULTIMATE.start_main_~array_size~0#1|)} is VALID [2022-02-21 04:34:46,815 INFO L290 TraceCheckUtils]: 3: Hoare triple {176#(<= 1 |ULTIMATE.start_main_~array_size~0#1|)} 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;main_~k~0#1 := 0; {177#(and (= |ULTIMATE.start_main_~k~0#1| 0) (<= 1 |ULTIMATE.start_main_~array_size~0#1|))} is VALID [2022-02-21 04:34:46,816 INFO L290 TraceCheckUtils]: 4: Hoare triple {177#(and (= |ULTIMATE.start_main_~k~0#1| 0) (<= 1 |ULTIMATE.start_main_~array_size~0#1|))} assume !(main_~k~0#1 < main_~array_size~0#1); {175#false} is VALID [2022-02-21 04:34:46,816 INFO L290 TraceCheckUtils]: 5: Hoare triple {175#false} 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; {175#false} is VALID [2022-02-21 04:34:46,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:34:46,817 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:34:46,817 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321866642] [2022-02-21 04:34:46,817 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321866642] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:34:46,817 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:34:46,818 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 04:34:46,818 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245077631] [2022-02-21 04:34:46,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:34:46,820 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:34:46,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:46,820 INFO L85 PathProgramCache]: Analyzing trace with hash 60779, now seen corresponding path program 1 times [2022-02-21 04:34:46,820 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:46,821 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751127753] [2022-02-21 04:34:46,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:46,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:46,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:46,825 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:46,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:46,828 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:46,848 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:34:46,849 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:34:46,849 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:34:46,849 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:34:46,849 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:34:46,849 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:46,849 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:34:46,849 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:34:46,849 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-2.i_Iteration2_Loop [2022-02-21 04:34:46,850 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:34:46,850 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:34:46,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:46,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:46,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:46,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:46,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:46,939 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:34:46,940 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 04:34:46,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:46,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:46,942 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-02-21 04:34:46,943 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-02-21 04:34:46,945 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:34:46,945 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:34:46,967 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:34:46,968 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-02-21 04:34:46,983 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-02-21 04:34:46,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:46,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:46,985 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-02-21 04:34:46,986 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-02-21 04:34:46,988 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:34:46,988 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:34:47,015 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:34:47,016 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~P_PGID_2=2} Honda state: {v_rep~unnamed0~0~P_PGID_2=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:34:47,032 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-02-21 04:34:47,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:47,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:47,034 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-02-21 04:34:47,036 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-02-21 04:34:47,037 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:34:47,037 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:34:47,058 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:34:47,058 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~P_PID_2=1} Honda state: {v_rep~unnamed0~0~P_PID_2=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:34:47,076 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-02-21 04:34:47,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:47,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:47,078 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-02-21 04:34:47,080 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-02-21 04:34:47,081 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:34:47,082 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:34:47,124 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-02-21 04:34:47,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:47,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:47,126 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-02-21 04:34:47,130 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 04:34:47,130 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:34:47,151 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-02-21 04:34:47,160 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 04:34:47,171 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-02-21 04:34:47,171 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:34:47,171 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:34:47,171 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:34:47,172 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:34:47,172 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:34:47,172 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:47,172 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:34:47,172 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:34:47,172 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-2.i_Iteration2_Loop [2022-02-21 04:34:47,172 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:34:47,172 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:34:47,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:47,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:47,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:47,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:47,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:47,251 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:34:47,251 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:34:47,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:47,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:47,252 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-02-21 04:34:47,254 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-02-21 04:34:47,255 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-02-21 04:34:47,262 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:47,262 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:47,262 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:47,262 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:47,264 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:34:47,264 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:34:47,279 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:47,297 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-02-21 04:34:47,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:47,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:47,298 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-02-21 04:34:47,299 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-02-21 04:34:47,301 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-02-21 04:34:47,307 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:47,307 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:47,307 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:47,307 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:47,308 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:47,308 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:34:47,308 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:34:47,319 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:47,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2022-02-21 04:34:47,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:47,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:47,337 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-02-21 04:34:47,338 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-02-21 04:34:47,340 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-02-21 04:34:47,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:47,346 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:47,346 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:47,346 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:47,348 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:34:47,348 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:34:47,357 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:47,375 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-02-21 04:34:47,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:47,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:47,378 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-02-21 04:34:47,379 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-02-21 04:34:47,380 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-02-21 04:34:47,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:47,387 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:47,387 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:47,387 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:47,389 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:34:47,389 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:34:47,404 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:34:47,422 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-02-21 04:34:47,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:47,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:47,424 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-02-21 04:34:47,427 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-02-21 04:34:47,430 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-02-21 04:34:47,436 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:34:47,436 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:34:47,437 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:34:47,437 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:34:47,437 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:34:47,438 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:34:47,438 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:34:47,449 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:34:47,451 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 04:34:47,451 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 04:34:47,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:47,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:47,452 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-02-21 04:34:47,460 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:34:47,460 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 04:34:47,460 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:34:47,460 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-02-21 04:34:47,469 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-02-21 04:34:47,479 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-02-21 04:34:47,484 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 04:34:47,488 INFO L390 LassoCheck]: Loop: "assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1;" "assume !(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);" "bubbleSort_#t~post2#1 := bubbleSort_~i~0#1;bubbleSort_~i~0#1 := bubbleSort_#t~post2#1 - 1;havoc bubbleSort_#t~post2#1;" [2022-02-21 04:34:47,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:47,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:47,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:47,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 04:34:47,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:47,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:34:47,525 INFO L290 TraceCheckUtils]: 0: Hoare triple {180#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {180#unseeded} is VALID [2022-02-21 04:34:47,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {180#unseeded} 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_#t~nondet11#1, main_#t~post10#1, main_~k~0#1, 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; {180#unseeded} is VALID [2022-02-21 04:34:47,526 INFO L290 TraceCheckUtils]: 2: Hoare triple {180#unseeded} assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); {180#unseeded} is VALID [2022-02-21 04:34:47,527 INFO L290 TraceCheckUtils]: 3: Hoare triple {180#unseeded} 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;main_~k~0#1 := 0; {180#unseeded} is VALID [2022-02-21 04:34:47,527 INFO L290 TraceCheckUtils]: 4: Hoare triple {180#unseeded} assume !(main_~k~0#1 < main_~array_size~0#1); {180#unseeded} is VALID [2022-02-21 04:34:47,528 INFO L290 TraceCheckUtils]: 5: Hoare triple {180#unseeded} 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; {180#unseeded} is VALID [2022-02-21 04:34:47,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:47,533 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:34:47,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:47,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:34:47,566 INFO L290 TraceCheckUtils]: 0: Hoare triple {183#(>= oldRank0 (+ (* 2 |ULTIMATE.start_bubbleSort_~i~0#1|) 1))} assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; {213#(and (>= oldRank0 (+ (* |ULTIMATE.start_bubbleSort_~i~0#1| 2) 1)) (<= 0 |ULTIMATE.start_bubbleSort_~i~0#1|))} is VALID [2022-02-21 04:34:47,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {213#(and (>= oldRank0 (+ (* |ULTIMATE.start_bubbleSort_~i~0#1| 2) 1)) (<= 0 |ULTIMATE.start_bubbleSort_~i~0#1|))} assume !(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1); {213#(and (>= oldRank0 (+ (* |ULTIMATE.start_bubbleSort_~i~0#1| 2) 1)) (<= 0 |ULTIMATE.start_bubbleSort_~i~0#1|))} is VALID [2022-02-21 04:34:47,568 INFO L290 TraceCheckUtils]: 2: Hoare triple {213#(and (>= oldRank0 (+ (* |ULTIMATE.start_bubbleSort_~i~0#1| 2) 1)) (<= 0 |ULTIMATE.start_bubbleSort_~i~0#1|))} bubbleSort_#t~post2#1 := bubbleSort_~i~0#1;bubbleSort_~i~0#1 := bubbleSort_#t~post2#1 - 1;havoc bubbleSort_#t~post2#1; {193#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* 2 |ULTIMATE.start_bubbleSort_~i~0#1|) 1))))} is VALID [2022-02-21 04:34:47,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:34:47,569 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-02-21 04:34:47,573 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:34:47,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) Stem has 6 letters. Loop has 3 letters. [2022-02-21 04:34:47,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:47,573 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-02-21 04:34:47,573 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-02-21 04:34:47,606 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 18 transitions. cyclomatic complexity: 7. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 19 states and 28 transitions. Complement of second has 4 states. [2022-02-21 04:34:47,607 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-02-21 04:34:47,607 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:34:47,607 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. cyclomatic complexity: 7 [2022-02-21 04:34:47,607 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:47,607 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:47,607 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-02-21 04:34:47,608 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:34:47,608 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:47,608 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:47,608 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 28 transitions. [2022-02-21 04:34:47,610 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:34:47,610 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:47,611 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:47,611 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 18 transitions. cyclomatic complexity: 7 [2022-02-21 04:34:47,613 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 04:34:47,613 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-02-21 04:34:47,614 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:34:47,614 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:34:47,614 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 19 states and 28 transitions. cyclomatic complexity: 12 [2022-02-21 04:34:47,615 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 04:34:47,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 3 letters. [2022-02-21 04:34:47,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:47,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) Stem has 6 letters. Loop has 3 letters. [2022-02-21 04:34:47,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:47,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 12 Stem has 6 letters. Loop has 3 letters. [2022-02-21 04:34:47,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:47,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:34:47,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:47,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:34:47,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:47,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:34:47,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:47,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 8 letters. Loop has 3 letters. [2022-02-21 04:34:47,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:47,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) Stem has 8 letters. Loop has 3 letters. [2022-02-21 04:34:47,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:47,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 3 letters. [2022-02-21 04:34:47,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:47,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 19 letters. Loop has 19 letters. [2022-02-21 04:34:47,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:47,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) Stem has 19 letters. Loop has 19 letters. [2022-02-21 04:34:47,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:47,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 12 Stem has 19 letters. Loop has 19 letters. [2022-02-21 04:34:47,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:47,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 13 letters. Loop has 13 letters. [2022-02-21 04:34:47,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:47,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) Stem has 13 letters. Loop has 13 letters. [2022-02-21 04:34:47,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:47,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 12 Stem has 13 letters. Loop has 13 letters. [2022-02-21 04:34:47,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:47,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:34:47,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:47,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:34:47,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:47,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 12 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:34:47,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:47,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:34:47,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:47,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:34:47,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:47,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 12 Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:34:47,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:47,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 3 letters. [2022-02-21 04:34:47,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:47,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) Stem has 6 letters. Loop has 3 letters. [2022-02-21 04:34:47,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:47,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 12 Stem has 6 letters. Loop has 3 letters. [2022-02-21 04:34:47,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:47,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 3 letters. [2022-02-21 04:34:47,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:47,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) Stem has 7 letters. Loop has 3 letters. [2022-02-21 04:34:47,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:47,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 12 Stem has 7 letters. Loop has 3 letters. [2022-02-21 04:34:47,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:47,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 8 letters. Loop has 3 letters. [2022-02-21 04:34:47,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:47,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) Stem has 8 letters. Loop has 3 letters. [2022-02-21 04:34:47,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:47,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 3 letters. [2022-02-21 04:34:47,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:47,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 8 letters. Loop has 3 letters. [2022-02-21 04:34:47,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:47,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) Stem has 8 letters. Loop has 3 letters. [2022-02-21 04:34:47,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:47,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 3 letters. [2022-02-21 04:34:47,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:47,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:34:47,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:47,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:34:47,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:47,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:34:47,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:47,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 8 letters. Loop has 3 letters. [2022-02-21 04:34:47,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:47,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) Stem has 8 letters. Loop has 3 letters. [2022-02-21 04:34:47,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:47,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 3 letters. [2022-02-21 04:34:47,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:47,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:34:47,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:47,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:34:47,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:47,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 12 Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:34:47,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:47,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 10 letters. Loop has 3 letters. [2022-02-21 04:34:47,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:47,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) Stem has 10 letters. Loop has 3 letters. [2022-02-21 04:34:47,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:47,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 12 Stem has 10 letters. Loop has 3 letters. [2022-02-21 04:34:47,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:47,631 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:34:47,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-02-21 04:34:47,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2022-02-21 04:34:47,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 6 letters. Loop has 3 letters. [2022-02-21 04:34:47,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:47,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:34:47,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:47,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 6 letters. Loop has 6 letters. [2022-02-21 04:34:47,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:34:47,632 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 28 transitions. cyclomatic complexity: 12 [2022-02-21 04:34:47,633 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:34:47,634 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 18 states and 26 transitions. [2022-02-21 04:34:47,634 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-02-21 04:34:47,634 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-02-21 04:34:47,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 26 transitions. [2022-02-21 04:34:47,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:34:47,634 INFO L681 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2022-02-21 04:34:47,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 26 transitions. [2022-02-21 04:34:47,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2022-02-21 04:34:47,635 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:34:47,635 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states and 26 transitions. Second operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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-02-21 04:34:47,636 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states and 26 transitions. Second operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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-02-21 04:34:47,636 INFO L87 Difference]: Start difference. First operand 18 states and 26 transitions. Second operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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-02-21 04:34:47,636 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:34:47,638 INFO L93 Difference]: Finished difference Result 18 states and 26 transitions. [2022-02-21 04:34:47,638 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 26 transitions. [2022-02-21 04:34:47,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:34:47,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:34:47,638 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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 18 states and 26 transitions. [2022-02-21 04:34:47,638 INFO L87 Difference]: Start difference. First operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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 18 states and 26 transitions. [2022-02-21 04:34:47,638 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:34:47,639 INFO L93 Difference]: Finished difference Result 19 states and 28 transitions. [2022-02-21 04:34:47,639 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 28 transitions. [2022-02-21 04:34:47,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:34:47,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:34:47,640 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:34:47,640 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:34:47,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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-02-21 04:34:47,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2022-02-21 04:34:47,640 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2022-02-21 04:34:47,640 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:34:47,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 04:34:47,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 04:34:47,643 INFO L87 Difference]: Start difference. First operand 17 states and 25 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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-02-21 04:34:47,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:34:47,674 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2022-02-21 04:34:47,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 04:34:47,674 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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-02-21 04:34:47,701 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-02-21 04:34:47,706 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:34:47,707 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 25 transitions. [2022-02-21 04:34:47,708 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:34:47,708 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 25 transitions. [2022-02-21 04:34:47,709 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-02-21 04:34:47,709 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-02-21 04:34:47,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2022-02-21 04:34:47,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:34:47,709 INFO L681 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2022-02-21 04:34:47,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2022-02-21 04:34:47,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2022-02-21 04:34:47,710 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:34:47,710 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states and 25 transitions. Second operand has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 16 states have internal predecessors, (24), 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-02-21 04:34:47,710 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states and 25 transitions. Second operand has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 16 states have internal predecessors, (24), 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-02-21 04:34:47,710 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 16 states have internal predecessors, (24), 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-02-21 04:34:47,711 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:34:47,712 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2022-02-21 04:34:47,712 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2022-02-21 04:34:47,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:34:47,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:34:47,712 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 16 states have internal predecessors, (24), 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 18 states and 25 transitions. [2022-02-21 04:34:47,712 INFO L87 Difference]: Start difference. First operand has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 16 states have internal predecessors, (24), 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 18 states and 25 transitions. [2022-02-21 04:34:47,713 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:34:47,714 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2022-02-21 04:34:47,714 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2022-02-21 04:34:47,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:34:47,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:34:47,714 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:34:47,714 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:34:47,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 16 states have internal predecessors, (24), 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-02-21 04:34:47,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2022-02-21 04:34:47,715 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2022-02-21 04:34:47,715 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2022-02-21 04:34:47,715 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:34:47,715 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2022-02-21 04:34:47,715 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:34:47,715 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:47,716 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:47,716 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:34:47,716 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 04:34:47,716 INFO L791 eck$LassoCheckResult]: Stem: 372#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 373#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_#t~nondet11#1, main_#t~post10#1, main_~k~0#1, 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; 370#L527 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 371#L527-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;main_~k~0#1 := 0; 374#L532-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet11#1; 375#L532-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 376#L532-3 assume !(main_~k~0#1 < main_~array_size~0#1); 377#L532-4 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; 378#L515-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 379#L516-3 [2022-02-21 04:34:47,716 INFO L793 eck$LassoCheckResult]: Loop: 379#L516-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); 380#L517 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); 385#L516-2 bubbleSort_#t~post3#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post3#1;havoc bubbleSort_#t~post3#1; 379#L516-3 [2022-02-21 04:34:47,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:47,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1185641744, now seen corresponding path program 1 times [2022-02-21 04:34:47,717 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:47,717 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691714318] [2022-02-21 04:34:47,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:47,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:47,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:47,729 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:47,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:47,738 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:47,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:47,739 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 1 times [2022-02-21 04:34:47,739 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:47,739 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383545485] [2022-02-21 04:34:47,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:47,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:47,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:47,759 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:47,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:47,764 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:47,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:47,764 INFO L85 PathProgramCache]: Analyzing trace with hash -357807973, now seen corresponding path program 1 times [2022-02-21 04:34:47,764 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:47,765 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388594022] [2022-02-21 04:34:47,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:47,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:47,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:47,823 INFO L290 TraceCheckUtils]: 0: Hoare triple {483#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {483#true} is VALID [2022-02-21 04:34:47,823 INFO L290 TraceCheckUtils]: 1: Hoare triple {483#true} 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_#t~nondet11#1, main_#t~post10#1, main_~k~0#1, 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; {483#true} is VALID [2022-02-21 04:34:47,823 INFO L290 TraceCheckUtils]: 2: Hoare triple {483#true} assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); {483#true} is VALID [2022-02-21 04:34:47,824 INFO L290 TraceCheckUtils]: 3: Hoare triple {483#true} 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;main_~k~0#1 := 0; {485#(= |ULTIMATE.start_main_~k~0#1| 0)} is VALID [2022-02-21 04:34:47,824 INFO L290 TraceCheckUtils]: 4: Hoare triple {485#(= |ULTIMATE.start_main_~k~0#1| 0)} assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet11#1; {485#(= |ULTIMATE.start_main_~k~0#1| 0)} is VALID [2022-02-21 04:34:47,824 INFO L290 TraceCheckUtils]: 5: Hoare triple {485#(= |ULTIMATE.start_main_~k~0#1| 0)} main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {486#(<= |ULTIMATE.start_main_~k~0#1| 1)} is VALID [2022-02-21 04:34:47,825 INFO L290 TraceCheckUtils]: 6: Hoare triple {486#(<= |ULTIMATE.start_main_~k~0#1| 1)} assume !(main_~k~0#1 < main_~array_size~0#1); {487#(<= |ULTIMATE.start_main_~array_size~0#1| 1)} is VALID [2022-02-21 04:34:47,826 INFO L290 TraceCheckUtils]: 7: Hoare triple {487#(<= |ULTIMATE.start_main_~array_size~0#1| 1)} 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; {488#(<= |ULTIMATE.start_bubbleSort_~i~0#1| 0)} is VALID [2022-02-21 04:34:47,826 INFO L290 TraceCheckUtils]: 8: Hoare triple {488#(<= |ULTIMATE.start_bubbleSort_~i~0#1| 0)} assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; {489#(and (<= |ULTIMATE.start_bubbleSort_~i~0#1| 0) (= (+ |ULTIMATE.start_bubbleSort_~j~0#1| (- 1)) 0))} is VALID [2022-02-21 04:34:47,827 INFO L290 TraceCheckUtils]: 9: Hoare triple {489#(and (<= |ULTIMATE.start_bubbleSort_~i~0#1| 0) (= (+ |ULTIMATE.start_bubbleSort_~j~0#1| (- 1)) 0))} 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); {484#false} is VALID [2022-02-21 04:34:47,827 INFO L290 TraceCheckUtils]: 10: Hoare triple {484#false} 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); {484#false} is VALID [2022-02-21 04:34:47,827 INFO L290 TraceCheckUtils]: 11: Hoare triple {484#false} bubbleSort_#t~post3#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post3#1;havoc bubbleSort_#t~post3#1; {484#false} is VALID [2022-02-21 04:34:47,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:34:47,827 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:34:47,827 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388594022] [2022-02-21 04:34:47,828 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388594022] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 04:34:47,828 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035658673] [2022-02-21 04:34:47,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:47,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 04:34:47,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:34:47,829 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 04:34:47,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-02-21 04:34:47,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:47,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 04:34:47,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:34:47,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:34:47,995 INFO L290 TraceCheckUtils]: 0: Hoare triple {483#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {483#true} is VALID [2022-02-21 04:34:47,995 INFO L290 TraceCheckUtils]: 1: Hoare triple {483#true} 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_#t~nondet11#1, main_#t~post10#1, main_~k~0#1, 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; {483#true} is VALID [2022-02-21 04:34:47,995 INFO L290 TraceCheckUtils]: 2: Hoare triple {483#true} assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); {483#true} is VALID [2022-02-21 04:34:47,996 INFO L290 TraceCheckUtils]: 3: Hoare triple {483#true} 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;main_~k~0#1 := 0; {502#(<= |ULTIMATE.start_main_~k~0#1| 0)} is VALID [2022-02-21 04:34:47,996 INFO L290 TraceCheckUtils]: 4: Hoare triple {502#(<= |ULTIMATE.start_main_~k~0#1| 0)} assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet11#1; {502#(<= |ULTIMATE.start_main_~k~0#1| 0)} is VALID [2022-02-21 04:34:47,997 INFO L290 TraceCheckUtils]: 5: Hoare triple {502#(<= |ULTIMATE.start_main_~k~0#1| 0)} main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {486#(<= |ULTIMATE.start_main_~k~0#1| 1)} is VALID [2022-02-21 04:34:47,997 INFO L290 TraceCheckUtils]: 6: Hoare triple {486#(<= |ULTIMATE.start_main_~k~0#1| 1)} assume !(main_~k~0#1 < main_~array_size~0#1); {487#(<= |ULTIMATE.start_main_~array_size~0#1| 1)} is VALID [2022-02-21 04:34:47,998 INFO L290 TraceCheckUtils]: 7: Hoare triple {487#(<= |ULTIMATE.start_main_~array_size~0#1| 1)} 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; {488#(<= |ULTIMATE.start_bubbleSort_~i~0#1| 0)} is VALID [2022-02-21 04:34:47,998 INFO L290 TraceCheckUtils]: 8: Hoare triple {488#(<= |ULTIMATE.start_bubbleSort_~i~0#1| 0)} assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; {518#(and (<= 1 |ULTIMATE.start_bubbleSort_~j~0#1|) (<= |ULTIMATE.start_bubbleSort_~i~0#1| 0))} is VALID [2022-02-21 04:34:47,999 INFO L290 TraceCheckUtils]: 9: Hoare triple {518#(and (<= 1 |ULTIMATE.start_bubbleSort_~j~0#1|) (<= |ULTIMATE.start_bubbleSort_~i~0#1| 0))} 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); {484#false} is VALID [2022-02-21 04:34:47,999 INFO L290 TraceCheckUtils]: 10: Hoare triple {484#false} 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); {484#false} is VALID [2022-02-21 04:34:47,999 INFO L290 TraceCheckUtils]: 11: Hoare triple {484#false} bubbleSort_#t~post3#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post3#1;havoc bubbleSort_#t~post3#1; {484#false} is VALID [2022-02-21 04:34:47,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:34:48,000 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 04:34:48,088 INFO L290 TraceCheckUtils]: 11: Hoare triple {484#false} bubbleSort_#t~post3#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post3#1;havoc bubbleSort_#t~post3#1; {484#false} is VALID [2022-02-21 04:34:48,088 INFO L290 TraceCheckUtils]: 10: Hoare triple {484#false} 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); {484#false} is VALID [2022-02-21 04:34:48,089 INFO L290 TraceCheckUtils]: 9: Hoare triple {534#(not (<= |ULTIMATE.start_bubbleSort_~j~0#1| |ULTIMATE.start_bubbleSort_~i~0#1|))} 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); {484#false} is VALID [2022-02-21 04:34:48,089 INFO L290 TraceCheckUtils]: 8: Hoare triple {488#(<= |ULTIMATE.start_bubbleSort_~i~0#1| 0)} assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; {534#(not (<= |ULTIMATE.start_bubbleSort_~j~0#1| |ULTIMATE.start_bubbleSort_~i~0#1|))} is VALID [2022-02-21 04:34:48,090 INFO L290 TraceCheckUtils]: 7: Hoare triple {487#(<= |ULTIMATE.start_main_~array_size~0#1| 1)} 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; {488#(<= |ULTIMATE.start_bubbleSort_~i~0#1| 0)} is VALID [2022-02-21 04:34:48,093 INFO L290 TraceCheckUtils]: 6: Hoare triple {486#(<= |ULTIMATE.start_main_~k~0#1| 1)} assume !(main_~k~0#1 < main_~array_size~0#1); {487#(<= |ULTIMATE.start_main_~array_size~0#1| 1)} is VALID [2022-02-21 04:34:48,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {502#(<= |ULTIMATE.start_main_~k~0#1| 0)} main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {486#(<= |ULTIMATE.start_main_~k~0#1| 1)} is VALID [2022-02-21 04:34:48,094 INFO L290 TraceCheckUtils]: 4: Hoare triple {502#(<= |ULTIMATE.start_main_~k~0#1| 0)} assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet11#1; {502#(<= |ULTIMATE.start_main_~k~0#1| 0)} is VALID [2022-02-21 04:34:48,094 INFO L290 TraceCheckUtils]: 3: Hoare triple {483#true} 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;main_~k~0#1 := 0; {502#(<= |ULTIMATE.start_main_~k~0#1| 0)} is VALID [2022-02-21 04:34:48,095 INFO L290 TraceCheckUtils]: 2: Hoare triple {483#true} assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); {483#true} is VALID [2022-02-21 04:34:48,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {483#true} 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_#t~nondet11#1, main_#t~post10#1, main_~k~0#1, 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; {483#true} is VALID [2022-02-21 04:34:48,095 INFO L290 TraceCheckUtils]: 0: Hoare triple {483#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {483#true} is VALID [2022-02-21 04:34:48,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:34:48,095 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2035658673] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 04:34:48,095 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 04:34:48,096 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2022-02-21 04:34:48,096 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773829206] [2022-02-21 04:34:48,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 04:34:48,179 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:34:48,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-21 04:34:48,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-02-21 04:34:48,180 INFO L87 Difference]: Start difference. First operand 17 states and 24 transitions. cyclomatic complexity: 10 Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 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-02-21 04:34:48,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:34:48,341 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2022-02-21 04:34:48,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-21 04:34:48,341 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 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-02-21 04:34:48,356 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:34:48,357 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 41 transitions. [2022-02-21 04:34:48,358 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:34:48,358 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 20 states and 26 transitions. [2022-02-21 04:34:48,358 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-02-21 04:34:48,358 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-02-21 04:34:48,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2022-02-21 04:34:48,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:34:48,359 INFO L681 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2022-02-21 04:34:48,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2022-02-21 04:34:48,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-02-21 04:34:48,360 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:34:48,360 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states and 26 transitions. Second operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 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-02-21 04:34:48,360 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states and 26 transitions. Second operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 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-02-21 04:34:48,360 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 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-02-21 04:34:48,361 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:34:48,361 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2022-02-21 04:34:48,361 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2022-02-21 04:34:48,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:34:48,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:34:48,362 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 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 20 states and 26 transitions. [2022-02-21 04:34:48,362 INFO L87 Difference]: Start difference. First operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 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 20 states and 26 transitions. [2022-02-21 04:34:48,362 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:34:48,363 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2022-02-21 04:34:48,363 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2022-02-21 04:34:48,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:34:48,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:34:48,364 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:34:48,364 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:34:48,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 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-02-21 04:34:48,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2022-02-21 04:34:48,365 INFO L704 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2022-02-21 04:34:48,365 INFO L587 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2022-02-21 04:34:48,365 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:34:48,365 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2022-02-21 04:34:48,365 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:34:48,365 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:34:48,365 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:34:48,366 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:34:48,366 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 04:34:48,366 INFO L791 eck$LassoCheckResult]: Stem: 602#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 603#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_#t~nondet11#1, main_#t~post10#1, main_~k~0#1, 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; 600#L527 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 601#L527-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;main_~k~0#1 := 0; 606#L532-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet11#1; 604#L532-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 605#L532-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet11#1; 617#L532-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 618#L532-3 assume !(main_~k~0#1 < main_~array_size~0#1); 607#L532-4 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; 608#L515-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 609#L516-3 [2022-02-21 04:34:48,366 INFO L793 eck$LassoCheckResult]: Loop: 609#L516-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); 610#L517 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); 615#L516-2 bubbleSort_#t~post3#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post3#1;havoc bubbleSort_#t~post3#1; 609#L516-3 [2022-02-21 04:34:48,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:48,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 2 times [2022-02-21 04:34:48,367 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:48,367 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620233248] [2022-02-21 04:34:48,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:48,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:48,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:48,380 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:48,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:48,390 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:48,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:48,391 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 2 times [2022-02-21 04:34:48,391 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:48,391 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15858938] [2022-02-21 04:34:48,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:48,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:48,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:48,398 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:48,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:48,402 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:48,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:34:48,403 INFO L85 PathProgramCache]: Analyzing trace with hash -793648259, now seen corresponding path program 2 times [2022-02-21 04:34:48,403 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:34:48,403 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490254697] [2022-02-21 04:34:48,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:34:48,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:34:48,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:48,422 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:34:48,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:34:48,449 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:34:48,771 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:34:48,771 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:34:48,771 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:34:48,771 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:34:48,771 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:34:48,771 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:34:48,772 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:34:48,772 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:34:48,772 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-2.i_Iteration4_Lasso [2022-02-21 04:34:48,772 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:34:48,772 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:34:48,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-02-21 04:34:48,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-02-21 04:34:48,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:48,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:48,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:48,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:48,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:48,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:34:48,816 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: v_rep(select (select #memory_int ULTIMATE.start_bubbleSort_~numbers#1.base) (+ ULTIMATE.start_bubbleSort_~numbers#1.offset (* ULTIMATE.start_bubbleSort_~j~0#1 4)))_1 was not added to the transformula! at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminatorUtils.getReplacementVar(MapEliminatorUtils.java:260) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:509) 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:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:953) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:862) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:252) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:457) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:397) 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-02-21 04:34:48,820 INFO L158 Benchmark]: Toolchain (without parser) took 4848.83ms. Allocated memory was 107.0MB in the beginning and 136.3MB in the end (delta: 29.4MB). Free memory was 75.2MB in the beginning and 66.8MB in the end (delta: 8.4MB). Peak memory consumption was 70.0MB. Max. memory is 16.1GB. [2022-02-21 04:34:48,820 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 81.8MB. Free memory was 40.4MB in the beginning and 40.4MB in the end (delta: 44.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:34:48,820 INFO L158 Benchmark]: CACSL2BoogieTranslator took 327.78ms. Allocated memory is still 107.0MB. Free memory was 75.0MB in the beginning and 77.7MB in the end (delta: -2.7MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. [2022-02-21 04:34:48,821 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.38ms. Allocated memory is still 107.0MB. Free memory was 77.7MB in the beginning and 75.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:34:48,821 INFO L158 Benchmark]: Boogie Preprocessor took 36.85ms. Allocated memory is still 107.0MB. Free memory was 75.6MB in the beginning and 73.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:34:48,821 INFO L158 Benchmark]: RCFGBuilder took 367.40ms. Allocated memory is still 107.0MB. Free memory was 73.9MB in the beginning and 61.2MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-21 04:34:48,822 INFO L158 Benchmark]: BuchiAutomizer took 4070.12ms. Allocated memory was 107.0MB in the beginning and 136.3MB in the end (delta: 29.4MB). Free memory was 61.2MB in the beginning and 66.8MB in the end (delta: -5.6MB). Peak memory consumption was 56.0MB. Max. memory is 16.1GB. [2022-02-21 04:34:48,823 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 81.8MB. Free memory was 40.4MB in the beginning and 40.4MB in the end (delta: 44.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 327.78ms. Allocated memory is still 107.0MB. Free memory was 75.0MB in the beginning and 77.7MB in the end (delta: -2.7MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.38ms. Allocated memory is still 107.0MB. Free memory was 77.7MB in the beginning and 75.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.85ms. Allocated memory is still 107.0MB. Free memory was 75.6MB in the beginning and 73.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 367.40ms. Allocated memory is still 107.0MB. Free memory was 73.9MB in the beginning and 61.2MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 4070.12ms. Allocated memory was 107.0MB in the beginning and 136.3MB in the end (delta: 29.4MB). Free memory was 61.2MB in the beginning and 66.8MB in the end (delta: -5.6MB). Peak memory consumption was 56.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: v_rep(select (select #memory_int ULTIMATE.start_bubbleSort_~numbers#1.base) (+ ULTIMATE.start_bubbleSort_~numbers#1.offset (* ULTIMATE.start_bubbleSort_~j~0#1 4)))_1 was not added to the transformula! de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: v_rep(select (select #memory_int ULTIMATE.start_bubbleSort_~numbers#1.base) (+ ULTIMATE.start_bubbleSort_~numbers#1.offset (* ULTIMATE.start_bubbleSort_~j~0#1 4)))_1 was not added to the transformula!: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminatorUtils.getReplacementVar(MapEliminatorUtils.java:260) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-21 04:34:48,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-02-21 04:34:49,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, 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*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: v_rep(select (select #memory_int ULTIMATE.start_bubbleSort_~numbers#1.base) (+ ULTIMATE.start_bubbleSort_~numbers#1.offset (* ULTIMATE.start_bubbleSort_~j~0#1 4)))_1 was not added to the transformula!