./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loops/bubble_sort-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/loops/bubble_sort-1.c -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 121046493a5b65b32f3b8bf8adee655ff03b45acd38f0a8519ee3c99065fa840 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 15:38:11,211 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 15:38:11,213 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 15:38:11,248 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 15:38:11,249 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 15:38:11,250 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 15:38:11,252 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 15:38:11,253 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 15:38:11,255 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 15:38:11,258 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 15:38:11,258 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 15:38:11,260 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 15:38:11,260 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 15:38:11,261 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 15:38:11,262 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 15:38:11,264 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 15:38:11,265 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 15:38:11,266 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 15:38:11,267 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 15:38:11,271 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 15:38:11,272 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 15:38:11,273 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 15:38:11,274 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 15:38:11,274 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 15:38:11,276 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 15:38:11,280 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 15:38:11,281 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 15:38:11,281 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 15:38:11,282 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 15:38:11,282 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 15:38:11,283 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 15:38:11,284 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 15:38:11,285 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 15:38:11,285 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 15:38:11,286 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 15:38:11,286 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 15:38:11,286 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 15:38:11,287 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 15:38:11,287 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 15:38:11,287 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 15:38:11,288 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 15:38:11,289 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 15:38:11,290 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-14 15:38:11,314 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 15:38:11,314 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 15:38:11,315 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 15:38:11,315 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 15:38:11,316 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 15:38:11,316 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 15:38:11,316 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 15:38:11,316 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-14 15:38:11,317 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-14 15:38:11,317 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-14 15:38:11,317 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-14 15:38:11,317 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-14 15:38:11,318 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-14 15:38:11,318 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 15:38:11,318 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 15:38:11,318 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 15:38:11,318 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 15:38:11,318 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 15:38:11,318 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 15:38:11,318 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-14 15:38:11,319 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-14 15:38:11,319 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-14 15:38:11,319 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 15:38:11,319 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 15:38:11,319 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-14 15:38:11,319 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 15:38:11,319 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-14 15:38:11,320 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 15:38:11,320 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 15:38:11,320 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 15:38:11,320 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 15:38:11,321 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-14 15:38:11,321 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 -> 121046493a5b65b32f3b8bf8adee655ff03b45acd38f0a8519ee3c99065fa840 [2022-07-14 15:38:11,542 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 15:38:11,576 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 15:38:11,578 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 15:38:11,579 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 15:38:11,580 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 15:38:11,581 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/bubble_sort-1.c [2022-07-14 15:38:11,623 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df806dbe3/5db1df452af3444681477484a4c36c55/FLAG7cbc16132 [2022-07-14 15:38:11,967 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 15:38:11,968 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/bubble_sort-1.c [2022-07-14 15:38:11,973 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df806dbe3/5db1df452af3444681477484a4c36c55/FLAG7cbc16132 [2022-07-14 15:38:11,986 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df806dbe3/5db1df452af3444681477484a4c36c55 [2022-07-14 15:38:11,988 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 15:38:11,989 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 15:38:11,991 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 15:38:11,991 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 15:38:11,993 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 15:38:11,994 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 03:38:11" (1/1) ... [2022-07-14 15:38:11,995 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67c29672 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:38:11, skipping insertion in model container [2022-07-14 15:38:11,995 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 03:38:11" (1/1) ... [2022-07-14 15:38:12,015 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 15:38:12,037 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 15:38:12,188 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/bubble_sort-1.c[325,338] [2022-07-14 15:38:12,226 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 15:38:12,237 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 15:38:12,244 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/bubble_sort-1.c[325,338] [2022-07-14 15:38:12,265 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 15:38:12,274 INFO L208 MainTranslator]: Completed translation [2022-07-14 15:38:12,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:38:12 WrapperNode [2022-07-14 15:38:12,274 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 15:38:12,275 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 15:38:12,275 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 15:38:12,275 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 15:38:12,279 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:38:12" (1/1) ... [2022-07-14 15:38:12,290 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:38:12" (1/1) ... [2022-07-14 15:38:12,311 INFO L137 Inliner]: procedures = 17, calls = 29, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 117 [2022-07-14 15:38:12,311 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 15:38:12,312 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 15:38:12,312 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 15:38:12,312 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 15:38:12,317 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:38:12" (1/1) ... [2022-07-14 15:38:12,317 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:38:12" (1/1) ... [2022-07-14 15:38:12,319 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:38:12" (1/1) ... [2022-07-14 15:38:12,319 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:38:12" (1/1) ... [2022-07-14 15:38:12,323 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:38:12" (1/1) ... [2022-07-14 15:38:12,325 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:38:12" (1/1) ... [2022-07-14 15:38:12,326 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:38:12" (1/1) ... [2022-07-14 15:38:12,327 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 15:38:12,328 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 15:38:12,328 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 15:38:12,328 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 15:38:12,329 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:38:12" (1/1) ... [2022-07-14 15:38:12,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:38:12,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:38:12,353 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:38:12,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-14 15:38:12,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 15:38:12,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 15:38:12,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 15:38:12,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 15:38:12,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 15:38:12,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 15:38:12,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 15:38:12,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 15:38:12,427 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 15:38:12,429 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 15:38:12,597 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 15:38:12,608 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 15:38:12,608 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-07-14 15:38:12,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 03:38:12 BoogieIcfgContainer [2022-07-14 15:38:12,609 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 15:38:12,610 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-14 15:38:12,610 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-14 15:38:12,612 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-14 15:38:12,628 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 15:38:12,628 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.07 03:38:11" (1/3) ... [2022-07-14 15:38:12,629 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@455a4a78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 03:38:12, skipping insertion in model container [2022-07-14 15:38:12,629 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 15:38:12,629 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:38:12" (2/3) ... [2022-07-14 15:38:12,629 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@455a4a78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 03:38:12, skipping insertion in model container [2022-07-14 15:38:12,629 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 15:38:12,629 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 03:38:12" (3/3) ... [2022-07-14 15:38:12,630 INFO L354 chiAutomizerObserver]: Analyzing ICFG bubble_sort-1.c [2022-07-14 15:38:12,693 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-14 15:38:12,693 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-14 15:38:12,693 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-14 15:38:12,694 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-14 15:38:12,694 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-14 15:38:12,694 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-14 15:38:12,694 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-14 15:38:12,694 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-14 15:38:12,704 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 27 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 26 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:38:12,718 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 14 [2022-07-14 15:38:12,720 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:38:12,720 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:38:12,724 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-14 15:38:12,724 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-14 15:38:12,724 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-14 15:38:12,725 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 27 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 26 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:38:12,729 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 14 [2022-07-14 15:38:12,729 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:38:12,729 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:38:12,729 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-14 15:38:12,729 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-14 15:38:12,735 INFO L752 eck$LassoCheckResult]: Stem: 18#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;main_~argc#1 := main_#in~argc#1;main_~#argv#1.base, main_~#argv#1.offset := main_#in~argv#1.base, main_#in~argv#1.offset;assume { :begin_inline_q1 } true;q1_#in~argc#1, q1_#in~argv#1.base, q1_#in~argv#1.offset := main_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;havoc q1_#t~nondet16#1, q1_#t~switch17#1, q1_#t~pre18#1, q1_#t~pre19#1, q1_#t~pre20#1, q1_#t~nondet22#1, q1_#t~mem23#1, q1_#t~mem24#1, q1_#t~post21#1, q1_~r~0#1, q1_~temp~0#1, q1_~argc#1, q1_~argv#1.base, q1_~argv#1.offset, q1_~N~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset, q1_~i~1#1;q1_~argc#1 := q1_#in~argc#1;q1_~argv#1.base, q1_~argv#1.offset := q1_#in~argv#1.base, q1_#in~argv#1.offset; 5#L56true assume !(q1_~argc#1 < 2);q1_~N~0#1 := q1_#t~nondet16#1;havoc q1_#t~nondet16#1;call q1_~#a~1#1.base, q1_~#a~1#1.offset := #Ultimate.allocOnStack(4 * q1_~N~0#1);havoc q1_~i~1#1;q1_#t~switch17#1 := false; 26#L65true assume q1_#t~switch17#1;q1_~i~1#1 := 0; 10#L66-3true [2022-07-14 15:38:12,735 INFO L754 eck$LassoCheckResult]: Loop: 10#L66-3true assume !!(q1_~i~1#1 < q1_~N~0#1);call write~int(q1_~i~1#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4); 11#L66-2true q1_#t~pre18#1 := 1 + q1_~i~1#1;q1_~i~1#1 := 1 + q1_~i~1#1;havoc q1_#t~pre18#1; 10#L66-3true [2022-07-14 15:38:12,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:38:12,744 INFO L85 PathProgramCache]: Analyzing trace with hash 925670, now seen corresponding path program 1 times [2022-07-14 15:38:12,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:38:12,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026505643] [2022-07-14 15:38:12,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:38:12,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:38:12,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:38:12,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:38:12,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:38:12,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026505643] [2022-07-14 15:38:12,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026505643] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:38:12,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:38:12,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 15:38:12,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015976585] [2022-07-14 15:38:12,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:38:12,904 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 15:38:12,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:38:12,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1539, now seen corresponding path program 1 times [2022-07-14 15:38:12,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:38:12,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365314693] [2022-07-14 15:38:12,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:38:12,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:38:12,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:38:12,922 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:38:12,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:38:12,948 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:38:13,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:38:13,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 15:38:13,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 15:38:13,029 INFO L87 Difference]: Start difference. First operand has 27 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 26 states have internal predecessors, (44), 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 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:38:13,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:38:13,044 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2022-07-14 15:38:13,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 15:38:13,048 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 31 transitions. [2022-07-14 15:38:13,049 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2022-07-14 15:38:13,052 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 19 states and 25 transitions. [2022-07-14 15:38:13,052 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2022-07-14 15:38:13,053 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2022-07-14 15:38:13,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 25 transitions. [2022-07-14 15:38:13,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:38:13,053 INFO L369 hiAutomatonCegarLoop]: Abstraction has 19 states and 25 transitions. [2022-07-14 15:38:13,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 25 transitions. [2022-07-14 15:38:13,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2022-07-14 15:38:13,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 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-07-14 15:38:13,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2022-07-14 15:38:13,070 INFO L392 hiAutomatonCegarLoop]: Abstraction has 18 states and 24 transitions. [2022-07-14 15:38:13,070 INFO L374 stractBuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2022-07-14 15:38:13,070 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-14 15:38:13,070 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2022-07-14 15:38:13,072 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2022-07-14 15:38:13,072 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:38:13,072 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:38:13,073 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-14 15:38:13,073 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-14 15:38:13,073 INFO L752 eck$LassoCheckResult]: Stem: 60#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 61#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;main_~argc#1 := main_#in~argc#1;main_~#argv#1.base, main_~#argv#1.offset := main_#in~argv#1.base, main_#in~argv#1.offset;assume { :begin_inline_q1 } true;q1_#in~argc#1, q1_#in~argv#1.base, q1_#in~argv#1.offset := main_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;havoc q1_#t~nondet16#1, q1_#t~switch17#1, q1_#t~pre18#1, q1_#t~pre19#1, q1_#t~pre20#1, q1_#t~nondet22#1, q1_#t~mem23#1, q1_#t~mem24#1, q1_#t~post21#1, q1_~r~0#1, q1_~temp~0#1, q1_~argc#1, q1_~argv#1.base, q1_~argv#1.offset, q1_~N~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset, q1_~i~1#1;q1_~argc#1 := q1_#in~argc#1;q1_~argv#1.base, q1_~argv#1.offset := q1_#in~argv#1.base, q1_#in~argv#1.offset; 64#L56 assume !(q1_~argc#1 < 2);q1_~N~0#1 := q1_#t~nondet16#1;havoc q1_#t~nondet16#1;call q1_~#a~1#1.base, q1_~#a~1#1.offset := #Ultimate.allocOnStack(4 * q1_~N~0#1);havoc q1_~i~1#1;q1_#t~switch17#1 := false; 65#L65 assume !q1_#t~switch17#1;q1_#t~switch17#1 := q1_#t~switch17#1; 77#L69 assume !q1_#t~switch17#1;q1_#t~switch17#1 := true; 76#L73 assume q1_#t~switch17#1;q1_~i~1#1 := 0; 71#L74-3 [2022-07-14 15:38:13,073 INFO L754 eck$LassoCheckResult]: Loop: 71#L74-3 assume !!(q1_~i~1#1 < q1_~N~0#1);call write~int(q1_~i~1#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4); 70#L74-2 q1_#t~pre20#1 := 1 + q1_~i~1#1;q1_~i~1#1 := 1 + q1_~i~1#1;havoc q1_#t~pre20#1; 71#L74-3 [2022-07-14 15:38:13,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:38:13,074 INFO L85 PathProgramCache]: Analyzing trace with hash 889584664, now seen corresponding path program 1 times [2022-07-14 15:38:13,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:38:13,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544058558] [2022-07-14 15:38:13,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:38:13,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:38:13,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:38:13,085 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:38:13,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:38:13,094 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:38:13,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:38:13,095 INFO L85 PathProgramCache]: Analyzing trace with hash 2691, now seen corresponding path program 1 times [2022-07-14 15:38:13,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:38:13,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426118301] [2022-07-14 15:38:13,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:38:13,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:38:13,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:38:13,101 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:38:13,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:38:13,106 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:38:13,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:38:13,107 INFO L85 PathProgramCache]: Analyzing trace with hash 192371930, now seen corresponding path program 1 times [2022-07-14 15:38:13,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:38:13,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940557864] [2022-07-14 15:38:13,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:38:13,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:38:13,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:38:13,133 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:38:13,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:38:13,145 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:38:13,594 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 15:38:13,595 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 15:38:13,595 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 15:38:13,595 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 15:38:13,595 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 15:38:13,595 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:38:13,595 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 15:38:13,595 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 15:38:13,596 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubble_sort-1.c_Iteration2_Lasso [2022-07-14 15:38:13,596 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 15:38:13,596 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 15:38:13,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:13,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:13,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:13,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:13,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:13,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:13,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:13,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:13,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:13,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:13,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:13,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:13,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:13,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:13,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:13,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:13,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-07-14 15:38:13,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-07-14 15:38:14,023 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 15:38:14,026 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 15:38:14,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:38:14,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:38:14,028 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:38:14,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-14 15:38:14,033 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:38:14,043 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:38:14,044 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:38:14,044 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:38:14,044 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:38:14,044 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:38:14,046 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:38:14,046 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:38:14,068 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:38:14,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-14 15:38:14,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:38:14,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:38:14,108 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:38:14,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-14 15:38:14,111 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:38:14,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:38:14,118 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:38:14,118 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:38:14,118 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:38:14,121 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:38:14,121 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:38:14,136 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:38:14,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-14 15:38:14,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:38:14,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:38:14,161 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:38:14,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-14 15:38:14,163 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:38:14,170 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:38:14,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:38:14,171 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:38:14,171 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:38:14,173 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:38:14,173 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:38:14,186 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:38:14,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-07-14 15:38:14,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:38:14,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:38:14,205 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:38:14,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-07-14 15:38:14,208 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:38:14,214 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:38:14,215 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:38:14,215 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:38:14,215 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:38:14,217 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:38:14,217 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:38:14,223 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:38:14,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-07-14 15:38:14,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:38:14,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:38:14,243 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:38:14,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-07-14 15:38:14,245 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:38:14,251 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:38:14,251 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:38:14,251 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:38:14,251 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:38:14,253 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:38:14,253 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:38:14,268 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:38:14,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2022-07-14 15:38:14,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:38:14,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:38:14,289 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:38:14,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-07-14 15:38:14,291 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:38:14,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:38:14,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:38:14,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:38:14,297 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:38:14,299 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:38:14,299 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:38:14,309 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:38:14,326 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-07-14 15:38:14,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:38:14,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:38:14,328 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:38:14,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-07-14 15:38:14,330 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:38:14,336 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:38:14,337 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:38:14,337 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:38:14,339 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:38:14,341 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:38:14,341 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:38:14,363 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:38:14,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2022-07-14 15:38:14,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:38:14,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:38:14,380 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:38:14,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-07-14 15:38:14,382 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:38:14,388 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:38:14,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:38:14,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:38:14,388 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:38:14,393 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:38:14,393 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:38:14,408 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:38:14,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-07-14 15:38:14,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:38:14,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:38:14,444 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:38:14,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-07-14 15:38:14,447 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:38:14,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:38:14,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:38:14,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:38:14,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:38:14,456 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:38:14,456 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:38:14,471 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:38:14,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-14 15:38:14,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:38:14,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:38:14,489 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:38:14,495 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:38:14,501 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:38:14,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:38:14,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:38:14,502 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:38:14,516 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:38:14,516 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:38:14,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-07-14 15:38:14,535 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 15:38:14,559 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2022-07-14 15:38:14,559 INFO L444 ModelExtractionUtils]: 8 out of 16 variables were initially zero. Simplification set additionally 5 variables to zero. [2022-07-14 15:38:14,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:38:14,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:38:14,562 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:38:14,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-07-14 15:38:14,564 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 15:38:14,587 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-14 15:38:14,587 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 15:38:14,588 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_q1_~i~1#1, ULTIMATE.start_q1_~N~0#1) = -1*ULTIMATE.start_q1_~i~1#1 + 1*ULTIMATE.start_q1_~N~0#1 Supporting invariants [] [2022-07-14 15:38:14,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-07-14 15:38:14,648 INFO L293 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2022-07-14 15:38:14,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:38:14,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:38:14,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 15:38:14,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:38:14,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:38:14,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 15:38:14,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:38:14,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:38:14,751 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-14 15:38:14,752 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 9 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:38:14,784 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 9. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 28 states and 40 transitions. Complement of second has 7 states. [2022-07-14 15:38:14,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-14 15:38:14,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:38:14,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2022-07-14 15:38:14,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 6 letters. Loop has 2 letters. [2022-07-14 15:38:14,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:38:14,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 8 letters. Loop has 2 letters. [2022-07-14 15:38:14,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:38:14,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 6 letters. Loop has 4 letters. [2022-07-14 15:38:14,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:38:14,791 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 40 transitions. [2022-07-14 15:38:14,797 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2022-07-14 15:38:14,797 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 26 states and 36 transitions. [2022-07-14 15:38:14,798 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2022-07-14 15:38:14,798 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2022-07-14 15:38:14,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 36 transitions. [2022-07-14 15:38:14,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:38:14,799 INFO L369 hiAutomatonCegarLoop]: Abstraction has 26 states and 36 transitions. [2022-07-14 15:38:14,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 36 transitions. [2022-07-14 15:38:14,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 19. [2022-07-14 15:38:14,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:38:14,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2022-07-14 15:38:14,801 INFO L392 hiAutomatonCegarLoop]: Abstraction has 19 states and 26 transitions. [2022-07-14 15:38:14,802 INFO L374 stractBuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2022-07-14 15:38:14,802 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-14 15:38:14,802 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2022-07-14 15:38:14,803 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2022-07-14 15:38:14,803 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:38:14,803 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:38:14,804 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:38:14,804 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 15:38:14,804 INFO L752 eck$LassoCheckResult]: Stem: 178#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 179#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;main_~argc#1 := main_#in~argc#1;main_~#argv#1.base, main_~#argv#1.offset := main_#in~argv#1.base, main_#in~argv#1.offset;assume { :begin_inline_q1 } true;q1_#in~argc#1, q1_#in~argv#1.base, q1_#in~argv#1.offset := main_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;havoc q1_#t~nondet16#1, q1_#t~switch17#1, q1_#t~pre18#1, q1_#t~pre19#1, q1_#t~pre20#1, q1_#t~nondet22#1, q1_#t~mem23#1, q1_#t~mem24#1, q1_#t~post21#1, q1_~r~0#1, q1_~temp~0#1, q1_~argc#1, q1_~argv#1.base, q1_~argv#1.offset, q1_~N~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset, q1_~i~1#1;q1_~argc#1 := q1_#in~argc#1;q1_~argv#1.base, q1_~argv#1.offset := q1_#in~argv#1.base, q1_#in~argv#1.offset; 182#L56 assume !(q1_~argc#1 < 2);q1_~N~0#1 := q1_#t~nondet16#1;havoc q1_#t~nondet16#1;call q1_~#a~1#1.base, q1_~#a~1#1.offset := #Ultimate.allocOnStack(4 * q1_~N~0#1);havoc q1_~i~1#1;q1_#t~switch17#1 := false; 183#L65 assume !q1_#t~switch17#1;q1_#t~switch17#1 := q1_#t~switch17#1; 196#L69 assume !q1_#t~switch17#1;q1_#t~switch17#1 := true; 194#L73 assume !q1_#t~switch17#1; 180#L63 havoc q1_#t~switch17#1;assume { :begin_inline_bubblesort } true;bubblesort_#in~size#1, bubblesort_#in~item#1.base, bubblesort_#in~item#1.offset := q1_~N~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset;havoc bubblesort_#t~mem6#1, bubblesort_#t~mem7#1, bubblesort_#t~mem8#1, bubblesort_#t~mem9#1, bubblesort_#t~pre5#1, bubblesort_#t~pre4#1, bubblesort_~size#1, bubblesort_~item#1.base, bubblesort_~item#1.offset, bubblesort_~a~0#1, bubblesort_~b~0#1, bubblesort_~t~0#1;bubblesort_~size#1 := bubblesort_#in~size#1;bubblesort_~item#1.base, bubblesort_~item#1.offset := bubblesort_#in~item#1.base, bubblesort_#in~item#1.offset;havoc bubblesort_~a~0#1;havoc bubblesort_~b~0#1;havoc bubblesort_~t~0#1;bubblesort_~a~0#1 := 1; 181#L18-3 [2022-07-14 15:38:14,804 INFO L754 eck$LassoCheckResult]: Loop: 181#L18-3 assume !!(bubblesort_~a~0#1 < bubblesort_~size#1);bubblesort_~b~0#1 := bubblesort_~size#1 - 1; 192#L20-3 assume !(bubblesort_~b~0#1 >= bubblesort_~a~0#1); 191#L18-2 bubblesort_#t~pre4#1 := 1 + bubblesort_~a~0#1;bubblesort_~a~0#1 := 1 + bubblesort_~a~0#1;havoc bubblesort_#t~pre4#1; 181#L18-3 [2022-07-14 15:38:14,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:38:14,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1807321784, now seen corresponding path program 1 times [2022-07-14 15:38:14,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:38:14,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459756346] [2022-07-14 15:38:14,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:38:14,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:38:14,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:38:14,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:38:14,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:38:14,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459756346] [2022-07-14 15:38:14,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459756346] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:38:14,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:38:14,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 15:38:14,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312322654] [2022-07-14 15:38:14,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:38:14,829 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 15:38:14,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:38:14,829 INFO L85 PathProgramCache]: Analyzing trace with hash 114407, now seen corresponding path program 1 times [2022-07-14 15:38:14,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:38:14,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768434154] [2022-07-14 15:38:14,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:38:14,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:38:14,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:38:14,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:38:14,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:38:14,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768434154] [2022-07-14 15:38:14,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768434154] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:38:14,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:38:14,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 15:38:14,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755460405] [2022-07-14 15:38:14,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:38:14,848 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 15:38:14,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:38:14,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 15:38:14,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 15:38:14,849 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. cyclomatic complexity: 10 Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:38:14,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:38:14,861 INFO L93 Difference]: Finished difference Result 20 states and 27 transitions. [2022-07-14 15:38:14,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 15:38:14,862 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 27 transitions. [2022-07-14 15:38:14,862 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-07-14 15:38:14,863 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 27 transitions. [2022-07-14 15:38:14,863 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2022-07-14 15:38:14,863 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2022-07-14 15:38:14,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2022-07-14 15:38:14,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:38:14,863 INFO L369 hiAutomatonCegarLoop]: Abstraction has 20 states and 27 transitions. [2022-07-14 15:38:14,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2022-07-14 15:38:14,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-07-14 15:38:14,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.35) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:38:14,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2022-07-14 15:38:14,879 INFO L392 hiAutomatonCegarLoop]: Abstraction has 20 states and 27 transitions. [2022-07-14 15:38:14,879 INFO L374 stractBuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2022-07-14 15:38:14,880 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-14 15:38:14,880 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2022-07-14 15:38:14,880 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-07-14 15:38:14,880 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:38:14,880 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:38:14,880 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:38:14,880 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-14 15:38:14,880 INFO L752 eck$LassoCheckResult]: Stem: 224#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 225#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;main_~argc#1 := main_#in~argc#1;main_~#argv#1.base, main_~#argv#1.offset := main_#in~argv#1.base, main_#in~argv#1.offset;assume { :begin_inline_q1 } true;q1_#in~argc#1, q1_#in~argv#1.base, q1_#in~argv#1.offset := main_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;havoc q1_#t~nondet16#1, q1_#t~switch17#1, q1_#t~pre18#1, q1_#t~pre19#1, q1_#t~pre20#1, q1_#t~nondet22#1, q1_#t~mem23#1, q1_#t~mem24#1, q1_#t~post21#1, q1_~r~0#1, q1_~temp~0#1, q1_~argc#1, q1_~argv#1.base, q1_~argv#1.offset, q1_~N~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset, q1_~i~1#1;q1_~argc#1 := q1_#in~argc#1;q1_~argv#1.base, q1_~argv#1.offset := q1_#in~argv#1.base, q1_#in~argv#1.offset; 228#L56 assume !(q1_~argc#1 < 2);q1_~N~0#1 := q1_#t~nondet16#1;havoc q1_#t~nondet16#1;call q1_~#a~1#1.base, q1_~#a~1#1.offset := #Ultimate.allocOnStack(4 * q1_~N~0#1);havoc q1_~i~1#1;q1_#t~switch17#1 := false; 229#L65 assume !q1_#t~switch17#1;q1_#t~switch17#1 := q1_#t~switch17#1; 243#L69 assume !q1_#t~switch17#1;q1_#t~switch17#1 := true; 241#L73 assume !q1_#t~switch17#1; 226#L63 havoc q1_#t~switch17#1;assume { :begin_inline_bubblesort } true;bubblesort_#in~size#1, bubblesort_#in~item#1.base, bubblesort_#in~item#1.offset := q1_~N~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset;havoc bubblesort_#t~mem6#1, bubblesort_#t~mem7#1, bubblesort_#t~mem8#1, bubblesort_#t~mem9#1, bubblesort_#t~pre5#1, bubblesort_#t~pre4#1, bubblesort_~size#1, bubblesort_~item#1.base, bubblesort_~item#1.offset, bubblesort_~a~0#1, bubblesort_~b~0#1, bubblesort_~t~0#1;bubblesort_~size#1 := bubblesort_#in~size#1;bubblesort_~item#1.base, bubblesort_~item#1.offset := bubblesort_#in~item#1.base, bubblesort_#in~item#1.offset;havoc bubblesort_~a~0#1;havoc bubblesort_~b~0#1;havoc bubblesort_~t~0#1;bubblesort_~a~0#1 := 1; 227#L18-3 [2022-07-14 15:38:14,881 INFO L754 eck$LassoCheckResult]: Loop: 227#L18-3 assume !!(bubblesort_~a~0#1 < bubblesort_~size#1);bubblesort_~b~0#1 := bubblesort_~size#1 - 1; 238#L20-3 assume !!(bubblesort_~b~0#1 >= bubblesort_~a~0#1); 239#L23 assume !(bubblesort_~b~0#1 - 1 < bubblesort_~size#1 && bubblesort_~b~0#1 < bubblesort_~size#1); 233#L20-2 bubblesort_#t~pre5#1 := bubblesort_~b~0#1 - 1;bubblesort_~b~0#1 := bubblesort_~b~0#1 - 1;havoc bubblesort_#t~pre5#1; 240#L20-3 assume !(bubblesort_~b~0#1 >= bubblesort_~a~0#1); 237#L18-2 bubblesort_#t~pre4#1 := 1 + bubblesort_~a~0#1;bubblesort_~a~0#1 := 1 + bubblesort_~a~0#1;havoc bubblesort_#t~pre4#1; 227#L18-3 [2022-07-14 15:38:14,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:38:14,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1807321784, now seen corresponding path program 2 times [2022-07-14 15:38:14,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:38:14,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406397542] [2022-07-14 15:38:14,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:38:14,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:38:14,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:38:14,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:38:14,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:38:14,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406397542] [2022-07-14 15:38:14,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406397542] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:38:14,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:38:14,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 15:38:14,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630423363] [2022-07-14 15:38:14,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:38:14,901 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 15:38:14,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:38:14,901 INFO L85 PathProgramCache]: Analyzing trace with hash -884895266, now seen corresponding path program 1 times [2022-07-14 15:38:14,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:38:14,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753022099] [2022-07-14 15:38:14,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:38:14,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:38:14,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:38:14,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:38:14,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:38:14,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753022099] [2022-07-14 15:38:14,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753022099] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:38:14,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:38:14,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 15:38:14,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462446781] [2022-07-14 15:38:14,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:38:14,925 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 15:38:14,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:38:14,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 15:38:14,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 15:38:14,927 INFO L87 Difference]: Start difference. First operand 20 states and 27 transitions. cyclomatic complexity: 10 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 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-07-14 15:38:14,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:38:14,937 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2022-07-14 15:38:14,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 15:38:14,938 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 27 transitions. [2022-07-14 15:38:14,939 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-07-14 15:38:14,940 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 27 transitions. [2022-07-14 15:38:14,940 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2022-07-14 15:38:14,940 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2022-07-14 15:38:14,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2022-07-14 15:38:14,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:38:14,940 INFO L369 hiAutomatonCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-07-14 15:38:14,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2022-07-14 15:38:14,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2022-07-14 15:38:14,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:38:14,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2022-07-14 15:38:14,941 INFO L392 hiAutomatonCegarLoop]: Abstraction has 20 states and 26 transitions. [2022-07-14 15:38:14,941 INFO L374 stractBuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2022-07-14 15:38:14,941 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-14 15:38:14,941 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2022-07-14 15:38:14,942 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-07-14 15:38:14,942 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:38:14,942 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:38:14,942 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:38:14,942 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:38:14,942 INFO L752 eck$LassoCheckResult]: Stem: 272#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 273#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;main_~argc#1 := main_#in~argc#1;main_~#argv#1.base, main_~#argv#1.offset := main_#in~argv#1.base, main_#in~argv#1.offset;assume { :begin_inline_q1 } true;q1_#in~argc#1, q1_#in~argv#1.base, q1_#in~argv#1.offset := main_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;havoc q1_#t~nondet16#1, q1_#t~switch17#1, q1_#t~pre18#1, q1_#t~pre19#1, q1_#t~pre20#1, q1_#t~nondet22#1, q1_#t~mem23#1, q1_#t~mem24#1, q1_#t~post21#1, q1_~r~0#1, q1_~temp~0#1, q1_~argc#1, q1_~argv#1.base, q1_~argv#1.offset, q1_~N~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset, q1_~i~1#1;q1_~argc#1 := q1_#in~argc#1;q1_~argv#1.base, q1_~argv#1.offset := q1_#in~argv#1.base, q1_#in~argv#1.offset; 276#L56 assume !(q1_~argc#1 < 2);q1_~N~0#1 := q1_#t~nondet16#1;havoc q1_#t~nondet16#1;call q1_~#a~1#1.base, q1_~#a~1#1.offset := #Ultimate.allocOnStack(4 * q1_~N~0#1);havoc q1_~i~1#1;q1_#t~switch17#1 := false; 277#L65 assume !q1_#t~switch17#1;q1_#t~switch17#1 := q1_#t~switch17#1; 291#L69 assume !q1_#t~switch17#1;q1_#t~switch17#1 := true; 289#L73 assume !q1_#t~switch17#1; 274#L63 havoc q1_#t~switch17#1;assume { :begin_inline_bubblesort } true;bubblesort_#in~size#1, bubblesort_#in~item#1.base, bubblesort_#in~item#1.offset := q1_~N~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset;havoc bubblesort_#t~mem6#1, bubblesort_#t~mem7#1, bubblesort_#t~mem8#1, bubblesort_#t~mem9#1, bubblesort_#t~pre5#1, bubblesort_#t~pre4#1, bubblesort_~size#1, bubblesort_~item#1.base, bubblesort_~item#1.offset, bubblesort_~a~0#1, bubblesort_~b~0#1, bubblesort_~t~0#1;bubblesort_~size#1 := bubblesort_#in~size#1;bubblesort_~item#1.base, bubblesort_~item#1.offset := bubblesort_#in~item#1.base, bubblesort_#in~item#1.offset;havoc bubblesort_~a~0#1;havoc bubblesort_~b~0#1;havoc bubblesort_~t~0#1;bubblesort_~a~0#1 := 1; 275#L18-3 [2022-07-14 15:38:14,942 INFO L754 eck$LassoCheckResult]: Loop: 275#L18-3 assume !!(bubblesort_~a~0#1 < bubblesort_~size#1);bubblesort_~b~0#1 := bubblesort_~size#1 - 1; 286#L20-3 assume !!(bubblesort_~b~0#1 >= bubblesort_~a~0#1); 287#L23 assume bubblesort_~b~0#1 - 1 < bubblesort_~size#1 && bubblesort_~b~0#1 < bubblesort_~size#1;call bubblesort_#t~mem6#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * (bubblesort_~b~0#1 - 1), 4);call bubblesort_#t~mem7#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * bubblesort_~b~0#1, 4); 280#L25 assume bubblesort_#t~mem6#1 > bubblesort_#t~mem7#1;havoc bubblesort_#t~mem6#1;havoc bubblesort_#t~mem7#1;call bubblesort_#t~mem8#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * (bubblesort_~b~0#1 - 1), 4);bubblesort_~t~0#1 := bubblesort_#t~mem8#1;havoc bubblesort_#t~mem8#1;call bubblesort_#t~mem9#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * bubblesort_~b~0#1, 4);call write~int(bubblesort_#t~mem9#1, bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * (bubblesort_~b~0#1 - 1), 4);havoc bubblesort_#t~mem9#1;call write~int(bubblesort_~t~0#1, bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * bubblesort_~b~0#1, 4); 281#L20-2 bubblesort_#t~pre5#1 := bubblesort_~b~0#1 - 1;bubblesort_~b~0#1 := bubblesort_~b~0#1 - 1;havoc bubblesort_#t~pre5#1; 288#L20-3 assume !(bubblesort_~b~0#1 >= bubblesort_~a~0#1); 285#L18-2 bubblesort_#t~pre4#1 := 1 + bubblesort_~a~0#1;bubblesort_~a~0#1 := 1 + bubblesort_~a~0#1;havoc bubblesort_#t~pre4#1; 275#L18-3 [2022-07-14 15:38:14,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:38:14,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1807321784, now seen corresponding path program 3 times [2022-07-14 15:38:14,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:38:14,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216850474] [2022-07-14 15:38:14,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:38:14,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:38:14,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:38:14,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:38:14,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:38:14,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216850474] [2022-07-14 15:38:14,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216850474] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:38:14,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:38:14,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 15:38:14,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911361584] [2022-07-14 15:38:14,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:38:14,959 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 15:38:14,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:38:14,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1669532239, now seen corresponding path program 1 times [2022-07-14 15:38:14,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:38:14,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914198493] [2022-07-14 15:38:14,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:38:14,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:38:14,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:38:14,966 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:38:14,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:38:14,972 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:38:15,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:38:15,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 15:38:15,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 15:38:15,069 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. cyclomatic complexity: 9 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:38:15,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:38:15,075 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2022-07-14 15:38:15,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 15:38:15,076 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 25 transitions. [2022-07-14 15:38:15,076 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-07-14 15:38:15,076 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 25 transitions. [2022-07-14 15:38:15,076 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2022-07-14 15:38:15,076 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2022-07-14 15:38:15,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 25 transitions. [2022-07-14 15:38:15,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:38:15,077 INFO L369 hiAutomatonCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-07-14 15:38:15,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 25 transitions. [2022-07-14 15:38:15,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-07-14 15:38:15,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.25) internal successors, (25), 19 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-07-14 15:38:15,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2022-07-14 15:38:15,078 INFO L392 hiAutomatonCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-07-14 15:38:15,078 INFO L374 stractBuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-07-14 15:38:15,078 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-14 15:38:15,078 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2022-07-14 15:38:15,078 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-07-14 15:38:15,078 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:38:15,078 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:38:15,079 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:38:15,079 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-14 15:38:15,079 INFO L752 eck$LassoCheckResult]: Stem: 318#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 319#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;main_~argc#1 := main_#in~argc#1;main_~#argv#1.base, main_~#argv#1.offset := main_#in~argv#1.base, main_#in~argv#1.offset;assume { :begin_inline_q1 } true;q1_#in~argc#1, q1_#in~argv#1.base, q1_#in~argv#1.offset := main_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;havoc q1_#t~nondet16#1, q1_#t~switch17#1, q1_#t~pre18#1, q1_#t~pre19#1, q1_#t~pre20#1, q1_#t~nondet22#1, q1_#t~mem23#1, q1_#t~mem24#1, q1_#t~post21#1, q1_~r~0#1, q1_~temp~0#1, q1_~argc#1, q1_~argv#1.base, q1_~argv#1.offset, q1_~N~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset, q1_~i~1#1;q1_~argc#1 := q1_#in~argc#1;q1_~argv#1.base, q1_~argv#1.offset := q1_#in~argv#1.base, q1_#in~argv#1.offset; 322#L56 assume !(q1_~argc#1 < 2);q1_~N~0#1 := q1_#t~nondet16#1;havoc q1_#t~nondet16#1;call q1_~#a~1#1.base, q1_~#a~1#1.offset := #Ultimate.allocOnStack(4 * q1_~N~0#1);havoc q1_~i~1#1;q1_#t~switch17#1 := false; 323#L65 assume !q1_#t~switch17#1;q1_#t~switch17#1 := q1_#t~switch17#1; 337#L69 assume !q1_#t~switch17#1;q1_#t~switch17#1 := true; 335#L73 assume q1_#t~switch17#1;q1_~i~1#1 := 0; 336#L74-3 assume !(q1_~i~1#1 < q1_~N~0#1); 330#L74-4 q1_~i~1#1 := 0; 325#L76-3 [2022-07-14 15:38:15,079 INFO L754 eck$LassoCheckResult]: Loop: 325#L76-3 assume !!(q1_~i~1#1 < q1_~N~0#1);q1_~r~0#1 := q1_~i~1#1 + (if q1_#t~nondet22#1 < 0 && 0 != q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) then (if q1_~N~0#1 - q1_~i~1#1 < 0 then q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) + (q1_~N~0#1 - q1_~i~1#1) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) - (q1_~N~0#1 - q1_~i~1#1)) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1));havoc q1_#t~nondet22#1;call q1_#t~mem23#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);q1_~temp~0#1 := q1_#t~mem23#1;havoc q1_#t~mem23#1;call q1_#t~mem24#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4);call write~int(q1_#t~mem24#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);havoc q1_#t~mem24#1;call write~int(q1_~temp~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4); 324#L76-2 q1_#t~post21#1 := q1_~i~1#1;q1_~i~1#1 := 1 + q1_#t~post21#1;havoc q1_#t~post21#1; 325#L76-3 [2022-07-14 15:38:15,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:38:15,079 INFO L85 PathProgramCache]: Analyzing trace with hash 192371872, now seen corresponding path program 1 times [2022-07-14 15:38:15,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:38:15,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225585459] [2022-07-14 15:38:15,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:38:15,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:38:15,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:38:15,086 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:38:15,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:38:15,092 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:38:15,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:38:15,092 INFO L85 PathProgramCache]: Analyzing trace with hash 3139, now seen corresponding path program 1 times [2022-07-14 15:38:15,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:38:15,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419174856] [2022-07-14 15:38:15,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:38:15,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:38:15,095 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-14 15:38:15,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [562955259] [2022-07-14 15:38:15,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:38:15,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:38:15,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:38:15,097 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 15:38:15,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-14 15:38:15,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:38:15,124 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:38:15,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:38:15,156 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:38:15,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:38:15,157 INFO L85 PathProgramCache]: Analyzing trace with hash 185777442, now seen corresponding path program 1 times [2022-07-14 15:38:15,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:38:15,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233900091] [2022-07-14 15:38:15,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:38:15,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:38:15,163 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-14 15:38:15,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1426870968] [2022-07-14 15:38:15,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:38:15,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:38:15,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:38:15,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-07-14 15:38:15,209 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 15:38:15,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-14 15:38:15,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:38:15,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 15:38:15,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:38:15,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:38:15,270 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 15:38:15,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:38:15,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233900091] [2022-07-14 15:38:15,270 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-14 15:38:15,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426870968] [2022-07-14 15:38:15,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426870968] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:38:15,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:38:15,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 15:38:15,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338311922] [2022-07-14 15:38:15,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:38:15,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:38:15,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 15:38:15,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-14 15:38:15,380 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. cyclomatic complexity: 8 Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:38:15,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:38:15,422 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2022-07-14 15:38:15,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 15:38:15,426 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 51 transitions. [2022-07-14 15:38:15,426 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 23 [2022-07-14 15:38:15,427 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 51 transitions. [2022-07-14 15:38:15,427 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2022-07-14 15:38:15,427 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2022-07-14 15:38:15,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 51 transitions. [2022-07-14 15:38:15,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:38:15,427 INFO L369 hiAutomatonCegarLoop]: Abstraction has 41 states and 51 transitions. [2022-07-14 15:38:15,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 51 transitions. [2022-07-14 15:38:15,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 22. [2022-07-14 15:38:15,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:38:15,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2022-07-14 15:38:15,429 INFO L392 hiAutomatonCegarLoop]: Abstraction has 22 states and 27 transitions. [2022-07-14 15:38:15,429 INFO L374 stractBuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2022-07-14 15:38:15,429 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-14 15:38:15,429 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2022-07-14 15:38:15,429 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-07-14 15:38:15,429 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:38:15,429 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:38:15,429 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:38:15,429 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:38:15,430 INFO L752 eck$LassoCheckResult]: Stem: 420#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 421#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;main_~argc#1 := main_#in~argc#1;main_~#argv#1.base, main_~#argv#1.offset := main_#in~argv#1.base, main_#in~argv#1.offset;assume { :begin_inline_q1 } true;q1_#in~argc#1, q1_#in~argv#1.base, q1_#in~argv#1.offset := main_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;havoc q1_#t~nondet16#1, q1_#t~switch17#1, q1_#t~pre18#1, q1_#t~pre19#1, q1_#t~pre20#1, q1_#t~nondet22#1, q1_#t~mem23#1, q1_#t~mem24#1, q1_#t~post21#1, q1_~r~0#1, q1_~temp~0#1, q1_~argc#1, q1_~argv#1.base, q1_~argv#1.offset, q1_~N~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset, q1_~i~1#1;q1_~argc#1 := q1_#in~argc#1;q1_~argv#1.base, q1_~argv#1.offset := q1_#in~argv#1.base, q1_#in~argv#1.offset; 424#L56 assume !(q1_~argc#1 < 2);q1_~N~0#1 := q1_#t~nondet16#1;havoc q1_#t~nondet16#1;call q1_~#a~1#1.base, q1_~#a~1#1.offset := #Ultimate.allocOnStack(4 * q1_~N~0#1);havoc q1_~i~1#1;q1_#t~switch17#1 := false; 425#L65 assume !q1_#t~switch17#1;q1_#t~switch17#1 := q1_#t~switch17#1; 440#L69 assume !q1_#t~switch17#1;q1_#t~switch17#1 := true; 438#L73 assume q1_#t~switch17#1;q1_~i~1#1 := 0; 439#L74-3 assume !(q1_~i~1#1 < q1_~N~0#1); 432#L74-4 q1_~i~1#1 := 0; 433#L76-3 assume !(q1_~i~1#1 < q1_~N~0#1); 422#L63 havoc q1_#t~switch17#1;assume { :begin_inline_bubblesort } true;bubblesort_#in~size#1, bubblesort_#in~item#1.base, bubblesort_#in~item#1.offset := q1_~N~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset;havoc bubblesort_#t~mem6#1, bubblesort_#t~mem7#1, bubblesort_#t~mem8#1, bubblesort_#t~mem9#1, bubblesort_#t~pre5#1, bubblesort_#t~pre4#1, bubblesort_~size#1, bubblesort_~item#1.base, bubblesort_~item#1.offset, bubblesort_~a~0#1, bubblesort_~b~0#1, bubblesort_~t~0#1;bubblesort_~size#1 := bubblesort_#in~size#1;bubblesort_~item#1.base, bubblesort_~item#1.offset := bubblesort_#in~item#1.base, bubblesort_#in~item#1.offset;havoc bubblesort_~a~0#1;havoc bubblesort_~b~0#1;havoc bubblesort_~t~0#1;bubblesort_~a~0#1 := 1; 423#L18-3 [2022-07-14 15:38:15,430 INFO L754 eck$LassoCheckResult]: Loop: 423#L18-3 assume !!(bubblesort_~a~0#1 < bubblesort_~size#1);bubblesort_~b~0#1 := bubblesort_~size#1 - 1; 435#L20-3 assume !!(bubblesort_~b~0#1 >= bubblesort_~a~0#1); 436#L23 assume bubblesort_~b~0#1 - 1 < bubblesort_~size#1 && bubblesort_~b~0#1 < bubblesort_~size#1;call bubblesort_#t~mem6#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * (bubblesort_~b~0#1 - 1), 4);call bubblesort_#t~mem7#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * bubblesort_~b~0#1, 4); 428#L25 assume bubblesort_#t~mem6#1 > bubblesort_#t~mem7#1;havoc bubblesort_#t~mem6#1;havoc bubblesort_#t~mem7#1;call bubblesort_#t~mem8#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * (bubblesort_~b~0#1 - 1), 4);bubblesort_~t~0#1 := bubblesort_#t~mem8#1;havoc bubblesort_#t~mem8#1;call bubblesort_#t~mem9#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * bubblesort_~b~0#1, 4);call write~int(bubblesort_#t~mem9#1, bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * (bubblesort_~b~0#1 - 1), 4);havoc bubblesort_#t~mem9#1;call write~int(bubblesort_~t~0#1, bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * bubblesort_~b~0#1, 4); 429#L20-2 bubblesort_#t~pre5#1 := bubblesort_~b~0#1 - 1;bubblesort_~b~0#1 := bubblesort_~b~0#1 - 1;havoc bubblesort_#t~pre5#1; 437#L20-3 assume !(bubblesort_~b~0#1 >= bubblesort_~a~0#1); 434#L18-2 bubblesort_#t~pre4#1 := 1 + bubblesort_~a~0#1;bubblesort_~a~0#1 := 1 + bubblesort_~a~0#1;havoc bubblesort_#t~pre4#1; 423#L18-3 [2022-07-14 15:38:15,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:38:15,430 INFO L85 PathProgramCache]: Analyzing trace with hash 185777387, now seen corresponding path program 1 times [2022-07-14 15:38:15,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:38:15,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607586562] [2022-07-14 15:38:15,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:38:15,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:38:15,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:38:15,437 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:38:15,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:38:15,443 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:38:15,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:38:15,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1669532239, now seen corresponding path program 2 times [2022-07-14 15:38:15,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:38:15,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126291371] [2022-07-14 15:38:15,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:38:15,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:38:15,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:38:15,448 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:38:15,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:38:15,452 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:38:15,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:38:15,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1443775097, now seen corresponding path program 1 times [2022-07-14 15:38:15,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:38:15,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693639158] [2022-07-14 15:38:15,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:38:15,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:38:15,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:38:15,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 15:38:15,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:38:15,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693639158] [2022-07-14 15:38:15,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693639158] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:38:15,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:38:15,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 15:38:15,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852104273] [2022-07-14 15:38:15,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:38:15,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:38:15,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 15:38:15,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 15:38:15,581 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:38:15,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:38:15,623 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2022-07-14 15:38:15,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 15:38:15,623 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 32 transitions. [2022-07-14 15:38:15,624 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-07-14 15:38:15,624 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 23 states and 27 transitions. [2022-07-14 15:38:15,624 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2022-07-14 15:38:15,624 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2022-07-14 15:38:15,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 27 transitions. [2022-07-14 15:38:15,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:38:15,624 INFO L369 hiAutomatonCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-07-14 15:38:15,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 27 transitions. [2022-07-14 15:38:15,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2022-07-14 15:38:15,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 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-07-14 15:38:15,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2022-07-14 15:38:15,625 INFO L392 hiAutomatonCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-07-14 15:38:15,625 INFO L374 stractBuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-07-14 15:38:15,626 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-14 15:38:15,626 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 25 transitions. [2022-07-14 15:38:15,626 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-07-14 15:38:15,626 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:38:15,626 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:38:15,626 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:38:15,626 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-14 15:38:15,626 INFO L752 eck$LassoCheckResult]: Stem: 483#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 484#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;main_~argc#1 := main_#in~argc#1;main_~#argv#1.base, main_~#argv#1.offset := main_#in~argv#1.base, main_#in~argv#1.offset;assume { :begin_inline_q1 } true;q1_#in~argc#1, q1_#in~argv#1.base, q1_#in~argv#1.offset := main_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;havoc q1_#t~nondet16#1, q1_#t~switch17#1, q1_#t~pre18#1, q1_#t~pre19#1, q1_#t~pre20#1, q1_#t~nondet22#1, q1_#t~mem23#1, q1_#t~mem24#1, q1_#t~post21#1, q1_~r~0#1, q1_~temp~0#1, q1_~argc#1, q1_~argv#1.base, q1_~argv#1.offset, q1_~N~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset, q1_~i~1#1;q1_~argc#1 := q1_#in~argc#1;q1_~argv#1.base, q1_~argv#1.offset := q1_#in~argv#1.base, q1_#in~argv#1.offset; 487#L56 assume !(q1_~argc#1 < 2);q1_~N~0#1 := q1_#t~nondet16#1;havoc q1_#t~nondet16#1;call q1_~#a~1#1.base, q1_~#a~1#1.offset := #Ultimate.allocOnStack(4 * q1_~N~0#1);havoc q1_~i~1#1;q1_#t~switch17#1 := false; 488#L65 assume !q1_#t~switch17#1;q1_#t~switch17#1 := q1_#t~switch17#1; 503#L69 assume !q1_#t~switch17#1;q1_#t~switch17#1 := true; 501#L73 assume q1_#t~switch17#1;q1_~i~1#1 := 0; 502#L74-3 assume !!(q1_~i~1#1 < q1_~N~0#1);call write~int(q1_~i~1#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4); 493#L74-2 q1_#t~pre20#1 := 1 + q1_~i~1#1;q1_~i~1#1 := 1 + q1_~i~1#1;havoc q1_#t~pre20#1; 494#L74-3 assume !(q1_~i~1#1 < q1_~N~0#1); 495#L74-4 q1_~i~1#1 := 0; 496#L76-3 assume !!(q1_~i~1#1 < q1_~N~0#1);q1_~r~0#1 := q1_~i~1#1 + (if q1_#t~nondet22#1 < 0 && 0 != q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) then (if q1_~N~0#1 - q1_~i~1#1 < 0 then q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) + (q1_~N~0#1 - q1_~i~1#1) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) - (q1_~N~0#1 - q1_~i~1#1)) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1));havoc q1_#t~nondet22#1;call q1_#t~mem23#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);q1_~temp~0#1 := q1_#t~mem23#1;havoc q1_#t~mem23#1;call q1_#t~mem24#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4);call write~int(q1_#t~mem24#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);havoc q1_#t~mem24#1;call write~int(q1_~temp~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4); 489#L76-2 [2022-07-14 15:38:15,626 INFO L754 eck$LassoCheckResult]: Loop: 489#L76-2 q1_#t~post21#1 := q1_~i~1#1;q1_~i~1#1 := 1 + q1_#t~post21#1;havoc q1_#t~post21#1; 490#L76-3 assume !!(q1_~i~1#1 < q1_~N~0#1);q1_~r~0#1 := q1_~i~1#1 + (if q1_#t~nondet22#1 < 0 && 0 != q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) then (if q1_~N~0#1 - q1_~i~1#1 < 0 then q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) + (q1_~N~0#1 - q1_~i~1#1) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) - (q1_~N~0#1 - q1_~i~1#1)) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1));havoc q1_#t~nondet22#1;call q1_#t~mem23#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);q1_~temp~0#1 := q1_#t~mem23#1;havoc q1_#t~mem23#1;call q1_#t~mem24#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4);call write~int(q1_#t~mem24#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);havoc q1_#t~mem24#1;call write~int(q1_~temp~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4); 489#L76-2 [2022-07-14 15:38:15,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:38:15,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1465845666, now seen corresponding path program 1 times [2022-07-14 15:38:15,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:38:15,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825749745] [2022-07-14 15:38:15,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:38:15,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:38:15,633 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-14 15:38:15,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1474796291] [2022-07-14 15:38:15,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:38:15,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:38:15,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:38:15,635 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 15:38:15,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-14 15:38:15,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:38:15,680 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:38:15,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:38:15,694 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:38:15,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:38:15,695 INFO L85 PathProgramCache]: Analyzing trace with hash 3199, now seen corresponding path program 2 times [2022-07-14 15:38:15,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:38:15,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202417605] [2022-07-14 15:38:15,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:38:15,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:38:15,699 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-14 15:38:15,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [809996534] [2022-07-14 15:38:15,700 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 15:38:15,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:38:15,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:38:15,711 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 15:38:15,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-14 15:38:15,739 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-14 15:38:15,739 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-07-14 15:38:15,739 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:38:15,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:38:15,745 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:38:15,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:38:15,745 INFO L85 PathProgramCache]: Analyzing trace with hash -71585824, now seen corresponding path program 1 times [2022-07-14 15:38:15,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:38:15,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612830377] [2022-07-14 15:38:15,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:38:15,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:38:15,775 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-14 15:38:15,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1970706151] [2022-07-14 15:38:15,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:38:15,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:38:15,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:38:15,803 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 15:38:15,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-14 15:38:15,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:38:15,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 15:38:15,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:38:15,900 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:38:15,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 15:38:15,926 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:38:15,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:38:15,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612830377] [2022-07-14 15:38:15,927 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-14 15:38:15,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970706151] [2022-07-14 15:38:15,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1970706151] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 15:38:15,927 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 15:38:15,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-07-14 15:38:15,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166811733] [2022-07-14 15:38:15,929 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 15:38:16,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:38:16,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 15:38:16,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-14 15:38:16,081 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. cyclomatic complexity: 7 Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:38:16,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:38:16,144 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2022-07-14 15:38:16,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 15:38:16,145 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 57 transitions. [2022-07-14 15:38:16,145 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 23 [2022-07-14 15:38:16,146 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 47 states and 57 transitions. [2022-07-14 15:38:16,146 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2022-07-14 15:38:16,146 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2022-07-14 15:38:16,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 57 transitions. [2022-07-14 15:38:16,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:38:16,146 INFO L369 hiAutomatonCegarLoop]: Abstraction has 47 states and 57 transitions. [2022-07-14 15:38:16,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 57 transitions. [2022-07-14 15:38:16,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 27. [2022-07-14 15:38:16,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 26 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:38:16,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2022-07-14 15:38:16,148 INFO L392 hiAutomatonCegarLoop]: Abstraction has 27 states and 32 transitions. [2022-07-14 15:38:16,148 INFO L374 stractBuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2022-07-14 15:38:16,148 INFO L287 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-14 15:38:16,148 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 32 transitions. [2022-07-14 15:38:16,148 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-07-14 15:38:16,148 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:38:16,148 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:38:16,148 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:38:16,148 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-14 15:38:16,149 INFO L752 eck$LassoCheckResult]: Stem: 643#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 644#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;main_~argc#1 := main_#in~argc#1;main_~#argv#1.base, main_~#argv#1.offset := main_#in~argv#1.base, main_#in~argv#1.offset;assume { :begin_inline_q1 } true;q1_#in~argc#1, q1_#in~argv#1.base, q1_#in~argv#1.offset := main_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;havoc q1_#t~nondet16#1, q1_#t~switch17#1, q1_#t~pre18#1, q1_#t~pre19#1, q1_#t~pre20#1, q1_#t~nondet22#1, q1_#t~mem23#1, q1_#t~mem24#1, q1_#t~post21#1, q1_~r~0#1, q1_~temp~0#1, q1_~argc#1, q1_~argv#1.base, q1_~argv#1.offset, q1_~N~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset, q1_~i~1#1;q1_~argc#1 := q1_#in~argc#1;q1_~argv#1.base, q1_~argv#1.offset := q1_#in~argv#1.base, q1_#in~argv#1.offset; 647#L56 assume !(q1_~argc#1 < 2);q1_~N~0#1 := q1_#t~nondet16#1;havoc q1_#t~nondet16#1;call q1_~#a~1#1.base, q1_~#a~1#1.offset := #Ultimate.allocOnStack(4 * q1_~N~0#1);havoc q1_~i~1#1;q1_#t~switch17#1 := false; 648#L65 assume !q1_#t~switch17#1;q1_#t~switch17#1 := q1_#t~switch17#1; 664#L69 assume !q1_#t~switch17#1;q1_#t~switch17#1 := true; 662#L73 assume q1_#t~switch17#1;q1_~i~1#1 := 0; 663#L74-3 assume !!(q1_~i~1#1 < q1_~N~0#1);call write~int(q1_~i~1#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4); 653#L74-2 q1_#t~pre20#1 := 1 + q1_~i~1#1;q1_~i~1#1 := 1 + q1_~i~1#1;havoc q1_#t~pre20#1; 654#L74-3 assume !!(q1_~i~1#1 < q1_~N~0#1);call write~int(q1_~i~1#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4); 665#L74-2 q1_#t~pre20#1 := 1 + q1_~i~1#1;q1_~i~1#1 := 1 + q1_~i~1#1;havoc q1_#t~pre20#1; 669#L74-3 assume !(q1_~i~1#1 < q1_~N~0#1); 668#L74-4 q1_~i~1#1 := 0; 657#L76-3 assume !!(q1_~i~1#1 < q1_~N~0#1);q1_~r~0#1 := q1_~i~1#1 + (if q1_#t~nondet22#1 < 0 && 0 != q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) then (if q1_~N~0#1 - q1_~i~1#1 < 0 then q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) + (q1_~N~0#1 - q1_~i~1#1) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) - (q1_~N~0#1 - q1_~i~1#1)) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1));havoc q1_#t~nondet22#1;call q1_#t~mem23#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);q1_~temp~0#1 := q1_#t~mem23#1;havoc q1_#t~mem23#1;call q1_#t~mem24#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4);call write~int(q1_#t~mem24#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);havoc q1_#t~mem24#1;call write~int(q1_~temp~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4); 649#L76-2 [2022-07-14 15:38:16,149 INFO L754 eck$LassoCheckResult]: Loop: 649#L76-2 q1_#t~post21#1 := q1_~i~1#1;q1_~i~1#1 := 1 + q1_#t~post21#1;havoc q1_#t~post21#1; 650#L76-3 assume !!(q1_~i~1#1 < q1_~N~0#1);q1_~r~0#1 := q1_~i~1#1 + (if q1_#t~nondet22#1 < 0 && 0 != q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) then (if q1_~N~0#1 - q1_~i~1#1 < 0 then q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) + (q1_~N~0#1 - q1_~i~1#1) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) - (q1_~N~0#1 - q1_~i~1#1)) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1));havoc q1_#t~nondet22#1;call q1_#t~mem23#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);q1_~temp~0#1 := q1_#t~mem23#1;havoc q1_#t~mem23#1;call q1_#t~mem24#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4);call write~int(q1_#t~mem24#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);havoc q1_#t~mem24#1;call write~int(q1_~temp~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4); 649#L76-2 [2022-07-14 15:38:16,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:38:16,149 INFO L85 PathProgramCache]: Analyzing trace with hash -69873632, now seen corresponding path program 2 times [2022-07-14 15:38:16,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:38:16,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590712717] [2022-07-14 15:38:16,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:38:16,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:38:16,155 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-14 15:38:16,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2103563589] [2022-07-14 15:38:16,155 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 15:38:16,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:38:16,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:38:16,168 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 15:38:16,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-14 15:38:16,209 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 15:38:16,209 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-07-14 15:38:16,210 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:38:16,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:38:16,229 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:38:16,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:38:16,230 INFO L85 PathProgramCache]: Analyzing trace with hash 3199, now seen corresponding path program 3 times [2022-07-14 15:38:16,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:38:16,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23337186] [2022-07-14 15:38:16,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:38:16,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:38:16,233 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-14 15:38:16,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [207803635] [2022-07-14 15:38:16,233 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-14 15:38:16,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:38:16,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:38:16,236 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 15:38:16,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-07-14 15:38:16,290 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-07-14 15:38:16,290 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-07-14 15:38:16,290 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:38:16,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:38:16,296 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:38:16,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:38:16,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1570918622, now seen corresponding path program 2 times [2022-07-14 15:38:16,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:38:16,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85845903] [2022-07-14 15:38:16,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:38:16,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:38:16,307 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-14 15:38:16,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [715664093] [2022-07-14 15:38:16,307 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 15:38:16,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:38:16,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:38:16,309 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 15:38:16,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-07-14 15:38:16,364 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 15:38:16,365 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-07-14 15:38:16,365 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:38:16,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:38:16,383 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:38:17,514 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 15:38:17,515 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 15:38:17,515 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 15:38:17,515 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 15:38:17,515 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 15:38:17,515 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:38:17,515 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 15:38:17,515 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 15:38:17,515 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubble_sort-1.c_Iteration9_Lasso [2022-07-14 15:38:17,515 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 15:38:17,515 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 15:38:17,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:17,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:17,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:17,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:17,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:17,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:17,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:17,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:17,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:17,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:17,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:17,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:17,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:17,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:17,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:18,917 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 15:38:18,917 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 15:38:18,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:38:18,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:38:18,925 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:38:18,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-07-14 15:38:18,926 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:38:18,932 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:38:18,933 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:38:18,933 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:38:18,933 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:38:18,935 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:38:18,935 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:38:18,950 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:38:18,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-07-14 15:38:18,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:38:18,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:38:18,976 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:38:18,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-07-14 15:38:18,978 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:38:18,984 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:38:18,984 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:38:18,985 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:38:18,985 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:38:18,985 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:38:18,985 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:38:18,985 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:38:18,986 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:38:19,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-07-14 15:38:19,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:38:19,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:38:19,004 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:38:19,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-07-14 15:38:19,006 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:38:19,012 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:38:19,012 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:38:19,012 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:38:19,012 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:38:19,012 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:38:19,013 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:38:19,013 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:38:19,027 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:38:19,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-07-14 15:38:19,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:38:19,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:38:19,044 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:38:19,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-07-14 15:38:19,047 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:38:19,053 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:38:19,053 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:38:19,053 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:38:19,053 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:38:19,055 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:38:19,055 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:38:19,067 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:38:19,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-07-14 15:38:19,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:38:19,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:38:19,085 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:38:19,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-07-14 15:38:19,087 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:38:19,093 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:38:19,093 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:38:19,093 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:38:19,093 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:38:19,094 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:38:19,094 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:38:19,109 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:38:19,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-07-14 15:38:19,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:38:19,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:38:19,127 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:38:19,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-07-14 15:38:19,129 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:38:19,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:38:19,136 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:38:19,136 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:38:19,136 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:38:19,137 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:38:19,137 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:38:19,152 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:38:19,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-07-14 15:38:19,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:38:19,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:38:19,169 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:38:19,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-07-14 15:38:19,171 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:38:19,177 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:38:19,177 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:38:19,177 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:38:19,177 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:38:19,178 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:38:19,178 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:38:19,185 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:38:19,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-07-14 15:38:19,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:38:19,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:38:19,204 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:38:19,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-07-14 15:38:19,207 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:38:19,213 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:38:19,213 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:38:19,213 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:38:19,213 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:38:19,215 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:38:19,215 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:38:19,217 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:38:19,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2022-07-14 15:38:19,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:38:19,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:38:19,237 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:38:19,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-07-14 15:38:19,238 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:38:19,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:38:19,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:38:19,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:38:19,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:38:19,246 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:38:19,246 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:38:19,251 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:38:19,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-07-14 15:38:19,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:38:19,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:38:19,271 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:38:19,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-07-14 15:38:19,315 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:38:19,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:38:19,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:38:19,322 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:38:19,322 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:38:19,323 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:38:19,323 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:38:19,330 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:38:19,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-07-14 15:38:19,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:38:19,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:38:19,360 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:38:19,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-07-14 15:38:19,362 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:38:19,368 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:38:19,368 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:38:19,368 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:38:19,368 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:38:19,370 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:38:19,370 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:38:19,385 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:38:19,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2022-07-14 15:38:19,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:38:19,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:38:19,402 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:38:19,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-07-14 15:38:19,404 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:38:19,410 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:38:19,410 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:38:19,410 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:38:19,410 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:38:19,412 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:38:19,412 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:38:19,427 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:38:19,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2022-07-14 15:38:19,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:38:19,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:38:19,444 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:38:19,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-07-14 15:38:19,446 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:38:19,452 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:38:19,452 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2022-07-14 15:38:19,452 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2022-07-14 15:38:19,452 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:38:19,496 INFO L401 nArgumentSynthesizer]: We have 36 Motzkin's Theorem applications. [2022-07-14 15:38:19,496 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2022-07-14 15:38:19,559 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 15:38:19,659 INFO L443 ModelExtractionUtils]: Simplification made 32 calls to the SMT solver. [2022-07-14 15:38:19,659 INFO L444 ModelExtractionUtils]: 25 out of 50 variables were initially zero. Simplification set additionally 22 variables to zero. [2022-07-14 15:38:19,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:38:19,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:38:19,660 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:38:19,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-07-14 15:38:19,662 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 15:38:19,671 INFO L438 nArgumentSynthesizer]: Removed 6 redundant supporting invariants from a total of 6. [2022-07-14 15:38:19,671 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 15:38:19,671 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_q1_~N~0#1, ULTIMATE.start_q1_~i~1#1) = 1*ULTIMATE.start_q1_~N~0#1 - 1*ULTIMATE.start_q1_~i~1#1 Supporting invariants [] [2022-07-14 15:38:19,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-07-14 15:38:19,713 INFO L293 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2022-07-14 15:38:19,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:38:19,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:38:19,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 15:38:19,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:38:19,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:38:19,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 15:38:19,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:38:19,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:38:19,763 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-14 15:38:19,763 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 32 transitions. cyclomatic complexity: 8 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:38:19,776 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 32 transitions. cyclomatic complexity: 8. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 38 states and 48 transitions. Complement of second has 4 states. [2022-07-14 15:38:19,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-14 15:38:19,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:38:19,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-07-14 15:38:19,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 13 letters. Loop has 2 letters. [2022-07-14 15:38:19,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:38:19,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 15 letters. Loop has 2 letters. [2022-07-14 15:38:19,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:38:19,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 13 letters. Loop has 4 letters. [2022-07-14 15:38:19,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:38:19,778 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 48 transitions. [2022-07-14 15:38:19,779 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-07-14 15:38:19,779 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 29 states and 35 transitions. [2022-07-14 15:38:19,779 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2022-07-14 15:38:19,779 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2022-07-14 15:38:19,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 35 transitions. [2022-07-14 15:38:19,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 15:38:19,780 INFO L369 hiAutomatonCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-07-14 15:38:19,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 35 transitions. [2022-07-14 15:38:19,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2022-07-14 15:38:19,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:38:19,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-07-14 15:38:19,781 INFO L392 hiAutomatonCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-07-14 15:38:19,781 INFO L374 stractBuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-07-14 15:38:19,781 INFO L287 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-07-14 15:38:19,782 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 34 transitions. [2022-07-14 15:38:19,782 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-07-14 15:38:19,782 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:38:19,782 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:38:19,782 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:38:19,782 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:38:19,783 INFO L752 eck$LassoCheckResult]: Stem: 817#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 818#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;main_~argc#1 := main_#in~argc#1;main_~#argv#1.base, main_~#argv#1.offset := main_#in~argv#1.base, main_#in~argv#1.offset;assume { :begin_inline_q1 } true;q1_#in~argc#1, q1_#in~argv#1.base, q1_#in~argv#1.offset := main_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;havoc q1_#t~nondet16#1, q1_#t~switch17#1, q1_#t~pre18#1, q1_#t~pre19#1, q1_#t~pre20#1, q1_#t~nondet22#1, q1_#t~mem23#1, q1_#t~mem24#1, q1_#t~post21#1, q1_~r~0#1, q1_~temp~0#1, q1_~argc#1, q1_~argv#1.base, q1_~argv#1.offset, q1_~N~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset, q1_~i~1#1;q1_~argc#1 := q1_#in~argc#1;q1_~argv#1.base, q1_~argv#1.offset := q1_#in~argv#1.base, q1_#in~argv#1.offset; 821#L56 assume !(q1_~argc#1 < 2);q1_~N~0#1 := q1_#t~nondet16#1;havoc q1_#t~nondet16#1;call q1_~#a~1#1.base, q1_~#a~1#1.offset := #Ultimate.allocOnStack(4 * q1_~N~0#1);havoc q1_~i~1#1;q1_#t~switch17#1 := false; 822#L65 assume !q1_#t~switch17#1;q1_#t~switch17#1 := q1_#t~switch17#1; 839#L69 assume !q1_#t~switch17#1;q1_#t~switch17#1 := true; 837#L73 assume q1_#t~switch17#1;q1_~i~1#1 := 0; 838#L74-3 assume !!(q1_~i~1#1 < q1_~N~0#1);call write~int(q1_~i~1#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4); 840#L74-2 q1_#t~pre20#1 := 1 + q1_~i~1#1;q1_~i~1#1 := 1 + q1_~i~1#1;havoc q1_#t~pre20#1; 841#L74-3 assume !(q1_~i~1#1 < q1_~N~0#1); 831#L74-4 q1_~i~1#1 := 0; 832#L76-3 assume !!(q1_~i~1#1 < q1_~N~0#1);q1_~r~0#1 := q1_~i~1#1 + (if q1_#t~nondet22#1 < 0 && 0 != q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) then (if q1_~N~0#1 - q1_~i~1#1 < 0 then q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) + (q1_~N~0#1 - q1_~i~1#1) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) - (q1_~N~0#1 - q1_~i~1#1)) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1));havoc q1_#t~nondet22#1;call q1_#t~mem23#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);q1_~temp~0#1 := q1_#t~mem23#1;havoc q1_#t~mem23#1;call q1_#t~mem24#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4);call write~int(q1_#t~mem24#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);havoc q1_#t~mem24#1;call write~int(q1_~temp~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4); 823#L76-2 q1_#t~post21#1 := q1_~i~1#1;q1_~i~1#1 := 1 + q1_#t~post21#1;havoc q1_#t~post21#1; 824#L76-3 assume !(q1_~i~1#1 < q1_~N~0#1); 819#L63 havoc q1_#t~switch17#1;assume { :begin_inline_bubblesort } true;bubblesort_#in~size#1, bubblesort_#in~item#1.base, bubblesort_#in~item#1.offset := q1_~N~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset;havoc bubblesort_#t~mem6#1, bubblesort_#t~mem7#1, bubblesort_#t~mem8#1, bubblesort_#t~mem9#1, bubblesort_#t~pre5#1, bubblesort_#t~pre4#1, bubblesort_~size#1, bubblesort_~item#1.base, bubblesort_~item#1.offset, bubblesort_~a~0#1, bubblesort_~b~0#1, bubblesort_~t~0#1;bubblesort_~size#1 := bubblesort_#in~size#1;bubblesort_~item#1.base, bubblesort_~item#1.offset := bubblesort_#in~item#1.base, bubblesort_#in~item#1.offset;havoc bubblesort_~a~0#1;havoc bubblesort_~b~0#1;havoc bubblesort_~t~0#1;bubblesort_~a~0#1 := 1; 820#L18-3 [2022-07-14 15:38:19,783 INFO L754 eck$LassoCheckResult]: Loop: 820#L18-3 assume !!(bubblesort_~a~0#1 < bubblesort_~size#1);bubblesort_~b~0#1 := bubblesort_~size#1 - 1; 834#L20-3 assume !!(bubblesort_~b~0#1 >= bubblesort_~a~0#1); 835#L23 assume bubblesort_~b~0#1 - 1 < bubblesort_~size#1 && bubblesort_~b~0#1 < bubblesort_~size#1;call bubblesort_#t~mem6#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * (bubblesort_~b~0#1 - 1), 4);call bubblesort_#t~mem7#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * bubblesort_~b~0#1, 4); 827#L25 assume bubblesort_#t~mem6#1 > bubblesort_#t~mem7#1;havoc bubblesort_#t~mem6#1;havoc bubblesort_#t~mem7#1;call bubblesort_#t~mem8#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * (bubblesort_~b~0#1 - 1), 4);bubblesort_~t~0#1 := bubblesort_#t~mem8#1;havoc bubblesort_#t~mem8#1;call bubblesort_#t~mem9#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * bubblesort_~b~0#1, 4);call write~int(bubblesort_#t~mem9#1, bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * (bubblesort_~b~0#1 - 1), 4);havoc bubblesort_#t~mem9#1;call write~int(bubblesort_~t~0#1, bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * bubblesort_~b~0#1, 4); 828#L20-2 bubblesort_#t~pre5#1 := bubblesort_~b~0#1 - 1;bubblesort_~b~0#1 := bubblesort_~b~0#1 - 1;havoc bubblesort_#t~pre5#1; 836#L20-3 assume !(bubblesort_~b~0#1 >= bubblesort_~a~0#1); 833#L18-2 bubblesort_#t~pre4#1 := 1 + bubblesort_~a~0#1;bubblesort_~a~0#1 := 1 + bubblesort_~a~0#1;havoc bubblesort_#t~pre4#1; 820#L18-3 [2022-07-14 15:38:19,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:38:19,783 INFO L85 PathProgramCache]: Analyzing trace with hash 2075806767, now seen corresponding path program 1 times [2022-07-14 15:38:19,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:38:19,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992922566] [2022-07-14 15:38:19,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:38:19,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:38:19,789 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-14 15:38:19,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [136475116] [2022-07-14 15:38:19,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:38:19,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:38:19,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:38:19,791 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 15:38:19,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-07-14 15:38:19,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:38:19,853 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:38:19,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:38:19,871 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:38:19,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:38:19,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1669532239, now seen corresponding path program 3 times [2022-07-14 15:38:19,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:38:19,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918125915] [2022-07-14 15:38:19,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:38:19,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:38:19,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:38:19,881 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:38:19,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:38:19,894 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:38:19,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:38:19,895 INFO L85 PathProgramCache]: Analyzing trace with hash -548718141, now seen corresponding path program 1 times [2022-07-14 15:38:19,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:38:19,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895832948] [2022-07-14 15:38:19,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:38:19,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:38:19,910 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-14 15:38:19,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [919306016] [2022-07-14 15:38:19,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:38:19,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:38:19,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:38:19,919 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 15:38:19,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-07-14 15:38:19,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:38:19,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 15:38:19,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:38:19,991 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-14 15:38:19,991 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 15:38:20,008 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-14 15:38:20,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:38:20,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895832948] [2022-07-14 15:38:20,009 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-14 15:38:20,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919306016] [2022-07-14 15:38:20,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919306016] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 15:38:20,009 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 15:38:20,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-07-14 15:38:20,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243000545] [2022-07-14 15:38:20,009 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 15:38:20,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:38:20,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 15:38:20,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-14 15:38:20,104 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. cyclomatic complexity: 9 Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:38:20,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:38:20,191 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-07-14 15:38:20,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 15:38:20,191 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 41 transitions. [2022-07-14 15:38:20,192 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-07-14 15:38:20,192 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 28 states and 33 transitions. [2022-07-14 15:38:20,192 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2022-07-14 15:38:20,192 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2022-07-14 15:38:20,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 33 transitions. [2022-07-14 15:38:20,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 15:38:20,192 INFO L369 hiAutomatonCegarLoop]: Abstraction has 28 states and 33 transitions. [2022-07-14 15:38:20,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 33 transitions. [2022-07-14 15:38:20,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2022-07-14 15:38:20,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:38:20,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-07-14 15:38:20,193 INFO L392 hiAutomatonCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-07-14 15:38:20,193 INFO L374 stractBuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-07-14 15:38:20,194 INFO L287 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-07-14 15:38:20,194 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 29 transitions. [2022-07-14 15:38:20,194 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-07-14 15:38:20,194 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:38:20,194 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:38:20,194 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:38:20,194 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:38:20,194 INFO L752 eck$LassoCheckResult]: Stem: 1018#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 1019#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;main_~argc#1 := main_#in~argc#1;main_~#argv#1.base, main_~#argv#1.offset := main_#in~argv#1.base, main_#in~argv#1.offset;assume { :begin_inline_q1 } true;q1_#in~argc#1, q1_#in~argv#1.base, q1_#in~argv#1.offset := main_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;havoc q1_#t~nondet16#1, q1_#t~switch17#1, q1_#t~pre18#1, q1_#t~pre19#1, q1_#t~pre20#1, q1_#t~nondet22#1, q1_#t~mem23#1, q1_#t~mem24#1, q1_#t~post21#1, q1_~r~0#1, q1_~temp~0#1, q1_~argc#1, q1_~argv#1.base, q1_~argv#1.offset, q1_~N~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset, q1_~i~1#1;q1_~argc#1 := q1_#in~argc#1;q1_~argv#1.base, q1_~argv#1.offset := q1_#in~argv#1.base, q1_#in~argv#1.offset; 1022#L56 assume !(q1_~argc#1 < 2);q1_~N~0#1 := q1_#t~nondet16#1;havoc q1_#t~nondet16#1;call q1_~#a~1#1.base, q1_~#a~1#1.offset := #Ultimate.allocOnStack(4 * q1_~N~0#1);havoc q1_~i~1#1;q1_#t~switch17#1 := false; 1023#L65 assume !q1_#t~switch17#1;q1_#t~switch17#1 := q1_#t~switch17#1; 1040#L69 assume !q1_#t~switch17#1;q1_#t~switch17#1 := true; 1038#L73 assume q1_#t~switch17#1;q1_~i~1#1 := 0; 1039#L74-3 assume !!(q1_~i~1#1 < q1_~N~0#1);call write~int(q1_~i~1#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4); 1030#L74-2 q1_#t~pre20#1 := 1 + q1_~i~1#1;q1_~i~1#1 := 1 + q1_~i~1#1;havoc q1_#t~pre20#1; 1031#L74-3 assume !!(q1_~i~1#1 < q1_~N~0#1);call write~int(q1_~i~1#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4); 1041#L74-2 q1_#t~pre20#1 := 1 + q1_~i~1#1;q1_~i~1#1 := 1 + q1_~i~1#1;havoc q1_#t~pre20#1; 1042#L74-3 assume !(q1_~i~1#1 < q1_~N~0#1); 1032#L74-4 q1_~i~1#1 := 0; 1033#L76-3 assume !!(q1_~i~1#1 < q1_~N~0#1);q1_~r~0#1 := q1_~i~1#1 + (if q1_#t~nondet22#1 < 0 && 0 != q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) then (if q1_~N~0#1 - q1_~i~1#1 < 0 then q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) + (q1_~N~0#1 - q1_~i~1#1) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) - (q1_~N~0#1 - q1_~i~1#1)) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1));havoc q1_#t~nondet22#1;call q1_#t~mem23#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);q1_~temp~0#1 := q1_#t~mem23#1;havoc q1_#t~mem23#1;call q1_#t~mem24#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4);call write~int(q1_#t~mem24#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);havoc q1_#t~mem24#1;call write~int(q1_~temp~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4); 1024#L76-2 q1_#t~post21#1 := q1_~i~1#1;q1_~i~1#1 := 1 + q1_#t~post21#1;havoc q1_#t~post21#1; 1025#L76-3 assume !!(q1_~i~1#1 < q1_~N~0#1);q1_~r~0#1 := q1_~i~1#1 + (if q1_#t~nondet22#1 < 0 && 0 != q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) then (if q1_~N~0#1 - q1_~i~1#1 < 0 then q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) + (q1_~N~0#1 - q1_~i~1#1) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) - (q1_~N~0#1 - q1_~i~1#1)) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1));havoc q1_#t~nondet22#1;call q1_#t~mem23#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);q1_~temp~0#1 := q1_#t~mem23#1;havoc q1_#t~mem23#1;call q1_#t~mem24#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4);call write~int(q1_#t~mem24#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);havoc q1_#t~mem24#1;call write~int(q1_~temp~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4); 1026#L76-2 q1_#t~post21#1 := q1_~i~1#1;q1_~i~1#1 := 1 + q1_#t~post21#1;havoc q1_#t~post21#1; 1027#L76-3 assume !(q1_~i~1#1 < q1_~N~0#1); 1020#L63 havoc q1_#t~switch17#1;assume { :begin_inline_bubblesort } true;bubblesort_#in~size#1, bubblesort_#in~item#1.base, bubblesort_#in~item#1.offset := q1_~N~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset;havoc bubblesort_#t~mem6#1, bubblesort_#t~mem7#1, bubblesort_#t~mem8#1, bubblesort_#t~mem9#1, bubblesort_#t~pre5#1, bubblesort_#t~pre4#1, bubblesort_~size#1, bubblesort_~item#1.base, bubblesort_~item#1.offset, bubblesort_~a~0#1, bubblesort_~b~0#1, bubblesort_~t~0#1;bubblesort_~size#1 := bubblesort_#in~size#1;bubblesort_~item#1.base, bubblesort_~item#1.offset := bubblesort_#in~item#1.base, bubblesort_#in~item#1.offset;havoc bubblesort_~a~0#1;havoc bubblesort_~b~0#1;havoc bubblesort_~t~0#1;bubblesort_~a~0#1 := 1; 1021#L18-3 [2022-07-14 15:38:20,194 INFO L754 eck$LassoCheckResult]: Loop: 1021#L18-3 assume !!(bubblesort_~a~0#1 < bubblesort_~size#1);bubblesort_~b~0#1 := bubblesort_~size#1 - 1; 1035#L20-3 assume !!(bubblesort_~b~0#1 >= bubblesort_~a~0#1); 1036#L23 assume bubblesort_~b~0#1 - 1 < bubblesort_~size#1 && bubblesort_~b~0#1 < bubblesort_~size#1;call bubblesort_#t~mem6#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * (bubblesort_~b~0#1 - 1), 4);call bubblesort_#t~mem7#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * bubblesort_~b~0#1, 4); 1028#L25 assume bubblesort_#t~mem6#1 > bubblesort_#t~mem7#1;havoc bubblesort_#t~mem6#1;havoc bubblesort_#t~mem7#1;call bubblesort_#t~mem8#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * (bubblesort_~b~0#1 - 1), 4);bubblesort_~t~0#1 := bubblesort_#t~mem8#1;havoc bubblesort_#t~mem8#1;call bubblesort_#t~mem9#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * bubblesort_~b~0#1, 4);call write~int(bubblesort_#t~mem9#1, bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * (bubblesort_~b~0#1 - 1), 4);havoc bubblesort_#t~mem9#1;call write~int(bubblesort_~t~0#1, bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * bubblesort_~b~0#1, 4); 1029#L20-2 bubblesort_#t~pre5#1 := bubblesort_~b~0#1 - 1;bubblesort_~b~0#1 := bubblesort_~b~0#1 - 1;havoc bubblesort_#t~pre5#1; 1037#L20-3 assume !(bubblesort_~b~0#1 >= bubblesort_~a~0#1); 1034#L18-2 bubblesort_#t~pre4#1 := 1 + bubblesort_~a~0#1;bubblesort_~a~0#1 := 1 + bubblesort_~a~0#1;havoc bubblesort_#t~pre4#1; 1021#L18-3 [2022-07-14 15:38:20,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:38:20,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1273080179, now seen corresponding path program 2 times [2022-07-14 15:38:20,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:38:20,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974775333] [2022-07-14 15:38:20,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:38:20,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:38:20,203 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-14 15:38:20,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2130077587] [2022-07-14 15:38:20,203 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 15:38:20,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:38:20,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:38:20,221 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 15:38:20,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-07-14 15:38:20,271 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 15:38:20,271 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-07-14 15:38:20,271 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:38:20,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:38:20,292 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:38:20,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:38:20,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1669532239, now seen corresponding path program 4 times [2022-07-14 15:38:20,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:38:20,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820059464] [2022-07-14 15:38:20,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:38:20,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:38:20,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:38:20,297 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:38:20,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:38:20,300 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:38:20,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:38:20,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1247881215, now seen corresponding path program 2 times [2022-07-14 15:38:20,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:38:20,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494318176] [2022-07-14 15:38:20,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:38:20,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:38:20,306 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-14 15:38:20,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [756524725] [2022-07-14 15:38:20,306 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 15:38:20,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:38:20,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:38:20,308 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 15:38:20,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-07-14 15:38:20,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-07-14 15:38:20,387 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 15:38:20,388 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-07-14 15:38:20,388 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:38:20,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:38:20,413 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:38:23,204 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 15:38:23,204 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 15:38:23,204 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 15:38:23,204 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 15:38:23,204 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 15:38:23,204 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:38:23,204 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 15:38:23,204 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 15:38:23,204 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubble_sort-1.c_Iteration11_Lasso [2022-07-14 15:38:23,204 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 15:38:23,204 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 15:38:23,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:23,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:23,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:23,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:23,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:23,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:23,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:23,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:23,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:23,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:23,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:23,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:23,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:23,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:23,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:23,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:23,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:23,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:23,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:23,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:23,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:23,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:38:23,890 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.IllegalArgumentException at de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) at java.base/java.util.AbstractMap.putAll(AbstractMap.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.PureSubstitution.(PureSubstitution.java:81) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.(Substitution.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.apply(Substitution.java:59) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:518) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:342) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:111) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:601) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:914) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:823) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:247) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:310) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:146) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:363) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-14 15:38:23,894 INFO L158 Benchmark]: Toolchain (without parser) took 11904.25ms. Allocated memory was 86.0MB in the beginning and 192.9MB in the end (delta: 107.0MB). Free memory was 46.9MB in the beginning and 93.3MB in the end (delta: -46.4MB). Peak memory consumption was 89.0MB. Max. memory is 16.1GB. [2022-07-14 15:38:23,894 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 86.0MB. Free memory was 63.6MB in the beginning and 63.5MB in the end (delta: 44.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 15:38:23,894 INFO L158 Benchmark]: CACSL2BoogieTranslator took 283.26ms. Allocated memory is still 86.0MB. Free memory was 46.7MB in the beginning and 60.3MB in the end (delta: -13.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-14 15:38:23,894 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.40ms. Allocated memory is still 86.0MB. Free memory was 60.1MB in the beginning and 58.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 15:38:23,894 INFO L158 Benchmark]: Boogie Preprocessor took 15.92ms. Allocated memory is still 86.0MB. Free memory was 58.4MB in the beginning and 56.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 15:38:23,895 INFO L158 Benchmark]: RCFGBuilder took 281.56ms. Allocated memory is still 86.0MB. Free memory was 56.9MB in the beginning and 43.9MB in the end (delta: 13.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-14 15:38:23,895 INFO L158 Benchmark]: BuchiAutomizer took 11282.80ms. Allocated memory was 86.0MB in the beginning and 192.9MB in the end (delta: 107.0MB). Free memory was 43.9MB in the beginning and 93.3MB in the end (delta: -49.4MB). Peak memory consumption was 86.9MB. Max. memory is 16.1GB. [2022-07-14 15:38:23,896 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 86.0MB. Free memory was 63.6MB in the beginning and 63.5MB in the end (delta: 44.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 283.26ms. Allocated memory is still 86.0MB. Free memory was 46.7MB in the beginning and 60.3MB in the end (delta: -13.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.40ms. Allocated memory is still 86.0MB. Free memory was 60.1MB in the beginning and 58.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 15.92ms. Allocated memory is still 86.0MB. Free memory was 58.4MB in the beginning and 56.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 281.56ms. Allocated memory is still 86.0MB. Free memory was 56.9MB in the beginning and 43.9MB in the end (delta: 13.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 11282.80ms. Allocated memory was 86.0MB in the beginning and 192.9MB in the end (delta: 107.0MB). Free memory was 43.9MB in the beginning and 93.3MB in the end (delta: -49.4MB). Peak memory consumption was 86.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: IllegalArgumentException: null de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: IllegalArgumentException: null: de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-14 15:38:23,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-07-14 15:38:24,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-07-14 15:38:24,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-07-14 15:38:24,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2022-07-14 15:38:24,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-07-14 15:38:24,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-07-14 15:38:25,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-07-14 15:38:25,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-14 15:38:25,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-07-14 15:38:25,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-14 15:38:25,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-14 15:38:26,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-14 15:38:26,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*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: IllegalArgumentException: null