./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 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/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-?-3598765 [2022-07-22 02:17:39,044 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 02:17:39,046 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 02:17:39,073 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 02:17:39,073 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 02:17:39,075 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 02:17:39,076 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 02:17:39,078 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 02:17:39,080 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 02:17:39,080 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 02:17:39,081 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 02:17:39,082 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 02:17:39,083 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 02:17:39,084 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 02:17:39,085 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 02:17:39,086 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 02:17:39,087 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 02:17:39,087 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 02:17:39,089 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 02:17:39,091 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 02:17:39,092 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 02:17:39,097 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 02:17:39,098 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 02:17:39,100 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 02:17:39,101 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 02:17:39,104 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 02:17:39,109 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 02:17:39,109 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 02:17:39,110 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 02:17:39,111 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 02:17:39,112 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 02:17:39,112 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 02:17:39,112 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 02:17:39,113 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 02:17:39,114 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 02:17:39,115 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 02:17:39,115 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 02:17:39,116 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 02:17:39,116 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 02:17:39,116 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 02:17:39,117 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 02:17:39,117 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 02:17:39,118 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-22 02:17:39,139 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 02:17:39,139 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 02:17:39,139 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 02:17:39,140 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 02:17:39,141 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 02:17:39,141 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 02:17:39,141 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 02:17:39,141 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 02:17:39,146 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 02:17:39,146 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 02:17:39,146 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 02:17:39,146 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 02:17:39,146 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 02:17:39,147 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 02:17:39,147 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 02:17:39,147 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 02:17:39,147 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 02:17:39,147 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 02:17:39,147 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 02:17:39,148 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 02:17:39,148 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 02:17:39,148 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 02:17:39,148 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 02:17:39,149 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 02:17:39,149 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 02:17:39,149 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 02:17:39,149 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 02:17:39,149 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 02:17:39,150 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 02:17:39,150 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 02:17:39,150 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 02:17:39,151 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 02:17:39,151 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-22 02:17:39,490 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 02:17:39,518 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 02:17:39,521 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 02:17:39,522 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 02:17:39,522 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 02:17:39,524 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-22 02:17:39,584 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/743a761a4/c7a2fc5cf2164854b2f9153830168dc2/FLAGdf9c89c90 [2022-07-22 02:17:40,007 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 02:17:40,008 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/bubble_sort-1.c [2022-07-22 02:17:40,015 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/743a761a4/c7a2fc5cf2164854b2f9153830168dc2/FLAGdf9c89c90 [2022-07-22 02:17:40,038 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/743a761a4/c7a2fc5cf2164854b2f9153830168dc2 [2022-07-22 02:17:40,041 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 02:17:40,043 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 02:17:40,045 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 02:17:40,045 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 02:17:40,048 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 02:17:40,049 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:17:40" (1/1) ... [2022-07-22 02:17:40,050 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b5d6983 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:17:40, skipping insertion in model container [2022-07-22 02:17:40,050 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:17:40" (1/1) ... [2022-07-22 02:17:40,056 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 02:17:40,072 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 02:17:40,211 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-22 02:17:40,257 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 02:17:40,275 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 02:17:40,300 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-22 02:17:40,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 02:17:40,346 INFO L208 MainTranslator]: Completed translation [2022-07-22 02:17:40,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:17:40 WrapperNode [2022-07-22 02:17:40,347 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 02:17:40,348 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 02:17:40,348 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 02:17:40,348 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 02:17:40,354 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:17:40" (1/1) ... [2022-07-22 02:17:40,371 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:17:40" (1/1) ... [2022-07-22 02:17:40,398 INFO L137 Inliner]: procedures = 17, calls = 29, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 117 [2022-07-22 02:17:40,399 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 02:17:40,400 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 02:17:40,400 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 02:17:40,400 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 02:17:40,407 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:17:40" (1/1) ... [2022-07-22 02:17:40,407 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:17:40" (1/1) ... [2022-07-22 02:17:40,412 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:17:40" (1/1) ... [2022-07-22 02:17:40,419 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:17:40" (1/1) ... [2022-07-22 02:17:40,427 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:17:40" (1/1) ... [2022-07-22 02:17:40,437 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:17:40" (1/1) ... [2022-07-22 02:17:40,439 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:17:40" (1/1) ... [2022-07-22 02:17:40,444 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 02:17:40,447 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 02:17:40,448 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 02:17:40,449 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 02:17:40,450 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:17:40" (1/1) ... [2022-07-22 02:17:40,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:17:40,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:17:40,480 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 02:17:40,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-22 02:17:40,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 02:17:40,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 02:17:40,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 02:17:40,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 02:17:40,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 02:17:40,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 02:17:40,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 02:17:40,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 02:17:40,615 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 02:17:40,616 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 02:17:40,851 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 02:17:40,856 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 02:17:40,866 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-07-22 02:17:40,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:17:40 BoogieIcfgContainer [2022-07-22 02:17:40,868 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 02:17:40,869 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 02:17:40,870 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 02:17:40,872 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 02:17:40,873 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 02:17:40,873 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 02:17:40" (1/3) ... [2022-07-22 02:17:40,874 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5ca32242 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 02:17:40, skipping insertion in model container [2022-07-22 02:17:40,874 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 02:17:40,874 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:17:40" (2/3) ... [2022-07-22 02:17:40,875 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5ca32242 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 02:17:40, skipping insertion in model container [2022-07-22 02:17:40,875 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 02:17:40,875 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:17:40" (3/3) ... [2022-07-22 02:17:40,876 INFO L354 chiAutomizerObserver]: Analyzing ICFG bubble_sort-1.c [2022-07-22 02:17:40,940 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 02:17:40,940 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-22 02:17:40,940 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 02:17:40,940 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 02:17:40,940 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 02:17:40,941 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-22 02:17:40,941 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 02:17:40,941 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 02:17:40,944 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-22 02:17:40,961 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 14 [2022-07-22 02:17:40,962 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:17:40,962 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:17:40,966 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-22 02:17:40,967 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 02:17:40,967 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 02:17:40,968 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-22 02:17:40,970 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 14 [2022-07-22 02:17:40,970 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:17:40,970 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:17:40,970 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-22 02:17:40,970 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 02:17:40,975 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-22 02:17:40,975 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-22 02:17:40,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:17:40,981 INFO L85 PathProgramCache]: Analyzing trace with hash 925670, now seen corresponding path program 1 times [2022-07-22 02:17:40,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:17:40,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802203357] [2022-07-22 02:17:40,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:17:40,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:17:41,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:17:41,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 02:17:41,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:17:41,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802203357] [2022-07-22 02:17:41,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802203357] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:17:41,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:17:41,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 02:17:41,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663559411] [2022-07-22 02:17:41,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:17:41,120 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 02:17:41,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:17:41,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1539, now seen corresponding path program 1 times [2022-07-22 02:17:41,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:17:41,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421093125] [2022-07-22 02:17:41,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:17:41,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:17:41,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:17:41,141 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:17:41,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:17:41,188 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:17:41,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:17:41,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 02:17:41,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 02:17:41,295 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-22 02:17:41,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:17:41,310 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2022-07-22 02:17:41,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 02:17:41,315 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 31 transitions. [2022-07-22 02:17:41,317 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2022-07-22 02:17:41,319 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 19 states and 25 transitions. [2022-07-22 02:17:41,320 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2022-07-22 02:17:41,321 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2022-07-22 02:17:41,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 25 transitions. [2022-07-22 02:17:41,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 02:17:41,322 INFO L369 hiAutomatonCegarLoop]: Abstraction has 19 states and 25 transitions. [2022-07-22 02:17:41,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 25 transitions. [2022-07-22 02:17:41,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2022-07-22 02:17:41,339 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-22 02:17:41,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2022-07-22 02:17:41,340 INFO L392 hiAutomatonCegarLoop]: Abstraction has 18 states and 24 transitions. [2022-07-22 02:17:41,340 INFO L374 stractBuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2022-07-22 02:17:41,340 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 02:17:41,341 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2022-07-22 02:17:41,341 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2022-07-22 02:17:41,341 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:17:41,342 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:17:41,342 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-22 02:17:41,342 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 02:17:41,342 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-22 02:17:41,343 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-22 02:17:41,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:17:41,343 INFO L85 PathProgramCache]: Analyzing trace with hash 889584664, now seen corresponding path program 1 times [2022-07-22 02:17:41,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:17:41,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851666985] [2022-07-22 02:17:41,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:17:41,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:17:41,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:17:41,370 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:17:41,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:17:41,386 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:17:41,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:17:41,387 INFO L85 PathProgramCache]: Analyzing trace with hash 2691, now seen corresponding path program 1 times [2022-07-22 02:17:41,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:17:41,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851336400] [2022-07-22 02:17:41,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:17:41,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:17:41,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:17:41,396 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:17:41,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:17:41,402 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:17:41,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:17:41,403 INFO L85 PathProgramCache]: Analyzing trace with hash 192371930, now seen corresponding path program 1 times [2022-07-22 02:17:41,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:17:41,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51002648] [2022-07-22 02:17:41,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:17:41,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:17:41,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:17:41,422 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:17:41,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:17:41,439 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:17:42,037 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 02:17:42,038 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 02:17:42,038 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 02:17:42,038 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 02:17:42,038 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 02:17:42,039 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:17:42,039 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 02:17:42,039 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 02:17:42,039 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubble_sort-1.c_Iteration2_Lasso [2022-07-22 02:17:42,039 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 02:17:42,039 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 02:17:42,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:17:42,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:17:42,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:17:42,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:17:42,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:17:42,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:17:42,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:17:42,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:17:42,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:17:42,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:17:42,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:17:42,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:17:42,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:17:42,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:17:42,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:17:42,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:17:42,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:17:42,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:17:42,637 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 02:17:42,642 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 02:17:42,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:17:42,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:17:42,646 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 02:17:42,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-22 02:17:42,650 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 02:17:42,657 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:17:42,658 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:17:42,658 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:17:42,658 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:17:42,658 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:17:42,660 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 02:17:42,660 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:17:42,662 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:17:42,679 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-22 02:17:42,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:17:42,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:17:42,681 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 02:17:42,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-22 02:17:42,683 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 02:17:42,690 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:17:42,691 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:17:42,691 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:17:42,691 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:17:42,695 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 02:17:42,695 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 02:17:42,715 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:17:42,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-22 02:17:42,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:17:42,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:17:42,733 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 02:17:42,743 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 02:17:42,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-22 02:17:42,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:17:42,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:17:42,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:17:42,750 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:17:42,752 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 02:17:42,752 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 02:17:42,773 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:17:42,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-07-22 02:17:42,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:17:42,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:17:42,800 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 02:17:42,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-07-22 02:17:42,803 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 02:17:42,809 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:17:42,809 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:17:42,810 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:17:42,810 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:17:42,812 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 02:17:42,813 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 02:17:42,828 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:17:42,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-07-22 02:17:42,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:17:42,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:17:42,848 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 02:17:42,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-07-22 02:17:42,850 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 02:17:42,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:17:42,856 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:17:42,856 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:17:42,857 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:17:42,859 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 02:17:42,859 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 02:17:42,890 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:17:42,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-22 02:17:42,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:17:42,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:17:42,917 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 02:17:42,921 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 02:17:42,928 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:17:42,929 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:17:42,929 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:17:42,929 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:17:42,933 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 02:17:42,933 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 02:17:42,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-07-22 02:17:42,947 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:17:42,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-22 02:17:42,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:17:42,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:17:42,980 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 02:17:42,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-07-22 02:17:42,985 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 02:17:42,993 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:17:42,993 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:17:42,993 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:17:42,993 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:17:42,995 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 02:17:42,996 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 02:17:43,005 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:17:43,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-07-22 02:17:43,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:17:43,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:17:43,027 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 02:17:43,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-07-22 02:17:43,028 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 02:17:43,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:17:43,035 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:17:43,035 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:17:43,035 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:17:43,038 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 02:17:43,038 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 02:17:43,067 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:17:43,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-07-22 02:17:43,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:17:43,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:17:43,090 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 02:17:43,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-07-22 02:17:43,092 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 02:17:43,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:17:43,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:17:43,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:17:43,099 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:17:43,100 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 02:17:43,101 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 02:17:43,112 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:17:43,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-22 02:17:43,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:17:43,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:17:43,133 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 02:17:43,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-07-22 02:17:43,137 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 02:17:43,143 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:17:43,143 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:17:43,143 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:17:43,143 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:17:43,156 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 02:17:43,156 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 02:17:43,168 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 02:17:43,183 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2022-07-22 02:17:43,183 INFO L444 ModelExtractionUtils]: 8 out of 16 variables were initially zero. Simplification set additionally 5 variables to zero. [2022-07-22 02:17:43,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:17:43,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:17:43,186 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 02:17:43,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-07-22 02:17:43,228 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 02:17:43,271 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 02:17:43,271 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 02:17:43,272 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-22 02:17:43,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-07-22 02:17:43,336 INFO L293 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2022-07-22 02:17:43,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:17:43,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:17:43,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 02:17:43,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 02:17:43,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:17:43,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 02:17:43,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 02:17:43,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 02:17:43,428 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-22 02:17:43,429 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-22 02:17:43,474 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-22 02:17:43,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-22 02:17:43,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 02:17:43,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2022-07-22 02:17:43,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 6 letters. Loop has 2 letters. [2022-07-22 02:17:43,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 02:17:43,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 8 letters. Loop has 2 letters. [2022-07-22 02:17:43,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 02:17:43,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 6 letters. Loop has 4 letters. [2022-07-22 02:17:43,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 02:17:43,482 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 40 transitions. [2022-07-22 02:17:43,487 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2022-07-22 02:17:43,487 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 26 states and 36 transitions. [2022-07-22 02:17:43,488 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2022-07-22 02:17:43,489 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2022-07-22 02:17:43,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 36 transitions. [2022-07-22 02:17:43,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 02:17:43,489 INFO L369 hiAutomatonCegarLoop]: Abstraction has 26 states and 36 transitions. [2022-07-22 02:17:43,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 36 transitions. [2022-07-22 02:17:43,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 19. [2022-07-22 02:17:43,492 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-22 02:17:43,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2022-07-22 02:17:43,492 INFO L392 hiAutomatonCegarLoop]: Abstraction has 19 states and 26 transitions. [2022-07-22 02:17:43,492 INFO L374 stractBuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2022-07-22 02:17:43,493 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 02:17:43,493 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2022-07-22 02:17:43,495 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2022-07-22 02:17:43,496 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:17:43,496 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:17:43,496 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 02:17:43,496 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 02:17:43,497 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-22 02:17:43,497 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-22 02:17:43,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:17:43,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1807321784, now seen corresponding path program 1 times [2022-07-22 02:17:43,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:17:43,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557495747] [2022-07-22 02:17:43,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:17:43,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:17:43,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:17:43,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 02:17:43,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:17:43,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557495747] [2022-07-22 02:17:43,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557495747] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:17:43,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:17:43,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 02:17:43,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732805071] [2022-07-22 02:17:43,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:17:43,529 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 02:17:43,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:17:43,529 INFO L85 PathProgramCache]: Analyzing trace with hash 114407, now seen corresponding path program 1 times [2022-07-22 02:17:43,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:17:43,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406069166] [2022-07-22 02:17:43,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:17:43,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:17:43,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:17:43,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 02:17:43,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:17:43,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406069166] [2022-07-22 02:17:43,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406069166] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:17:43,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:17:43,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 02:17:43,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240274368] [2022-07-22 02:17:43,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:17:43,542 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 02:17:43,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:17:43,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 02:17:43,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 02:17:43,543 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-22 02:17:43,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:17:43,554 INFO L93 Difference]: Finished difference Result 20 states and 27 transitions. [2022-07-22 02:17:43,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 02:17:43,555 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 27 transitions. [2022-07-22 02:17:43,555 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-07-22 02:17:43,556 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 27 transitions. [2022-07-22 02:17:43,556 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2022-07-22 02:17:43,556 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2022-07-22 02:17:43,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2022-07-22 02:17:43,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 02:17:43,557 INFO L369 hiAutomatonCegarLoop]: Abstraction has 20 states and 27 transitions. [2022-07-22 02:17:43,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2022-07-22 02:17:43,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-07-22 02:17:43,558 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-22 02:17:43,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2022-07-22 02:17:43,559 INFO L392 hiAutomatonCegarLoop]: Abstraction has 20 states and 27 transitions. [2022-07-22 02:17:43,559 INFO L374 stractBuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2022-07-22 02:17:43,559 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 02:17:43,559 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2022-07-22 02:17:43,560 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-07-22 02:17:43,560 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:17:43,560 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:17:43,560 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 02:17:43,561 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-22 02:17:43,561 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-22 02:17:43,561 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-22 02:17:43,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:17:43,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1807321784, now seen corresponding path program 2 times [2022-07-22 02:17:43,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:17:43,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844790262] [2022-07-22 02:17:43,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:17:43,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:17:43,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:17:43,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 02:17:43,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:17:43,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844790262] [2022-07-22 02:17:43,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844790262] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:17:43,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:17:43,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 02:17:43,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086699674] [2022-07-22 02:17:43,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:17:43,580 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 02:17:43,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:17:43,581 INFO L85 PathProgramCache]: Analyzing trace with hash -884895266, now seen corresponding path program 1 times [2022-07-22 02:17:43,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:17:43,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281927301] [2022-07-22 02:17:43,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:17:43,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:17:43,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:17:43,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 02:17:43,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:17:43,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281927301] [2022-07-22 02:17:43,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281927301] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:17:43,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:17:43,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 02:17:43,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275515032] [2022-07-22 02:17:43,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:17:43,593 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 02:17:43,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:17:43,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 02:17:43,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 02:17:43,595 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-22 02:17:43,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:17:43,610 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2022-07-22 02:17:43,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 02:17:43,611 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 27 transitions. [2022-07-22 02:17:43,611 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-07-22 02:17:43,612 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 27 transitions. [2022-07-22 02:17:43,612 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2022-07-22 02:17:43,612 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2022-07-22 02:17:43,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2022-07-22 02:17:43,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 02:17:43,613 INFO L369 hiAutomatonCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-07-22 02:17:43,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2022-07-22 02:17:43,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2022-07-22 02:17:43,615 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-22 02:17:43,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2022-07-22 02:17:43,616 INFO L392 hiAutomatonCegarLoop]: Abstraction has 20 states and 26 transitions. [2022-07-22 02:17:43,616 INFO L374 stractBuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2022-07-22 02:17:43,616 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-22 02:17:43,616 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2022-07-22 02:17:43,617 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-07-22 02:17:43,618 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:17:43,618 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:17:43,618 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 02:17:43,618 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 02:17:43,619 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-22 02:17:43,619 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-22 02:17:43,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:17:43,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1807321784, now seen corresponding path program 3 times [2022-07-22 02:17:43,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:17:43,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371341242] [2022-07-22 02:17:43,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:17:43,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:17:43,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:17:43,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 02:17:43,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:17:43,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371341242] [2022-07-22 02:17:43,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371341242] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:17:43,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:17:43,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 02:17:43,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683491190] [2022-07-22 02:17:43,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:17:43,655 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 02:17:43,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:17:43,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1669532239, now seen corresponding path program 1 times [2022-07-22 02:17:43,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:17:43,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418648929] [2022-07-22 02:17:43,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:17:43,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:17:43,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:17:43,675 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:17:43,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:17:43,683 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:17:43,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-07-22 02:17:43,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:17:43,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 02:17:43,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 02:17:43,834 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-22 02:17:43,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:17:43,843 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2022-07-22 02:17:43,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 02:17:43,844 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 25 transitions. [2022-07-22 02:17:43,845 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-07-22 02:17:43,845 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 25 transitions. [2022-07-22 02:17:43,845 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2022-07-22 02:17:43,845 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2022-07-22 02:17:43,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 25 transitions. [2022-07-22 02:17:43,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 02:17:43,846 INFO L369 hiAutomatonCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-07-22 02:17:43,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 25 transitions. [2022-07-22 02:17:43,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-07-22 02:17:43,847 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-22 02:17:43,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2022-07-22 02:17:43,847 INFO L392 hiAutomatonCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-07-22 02:17:43,847 INFO L374 stractBuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-07-22 02:17:43,847 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-22 02:17:43,848 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2022-07-22 02:17:43,848 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-07-22 02:17:43,848 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:17:43,848 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:17:43,848 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 02:17:43,848 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 02:17:43,848 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-22 02:17:43,849 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-22 02:17:43,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:17:43,849 INFO L85 PathProgramCache]: Analyzing trace with hash 192371872, now seen corresponding path program 1 times [2022-07-22 02:17:43,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:17:43,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064633205] [2022-07-22 02:17:43,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:17:43,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:17:43,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:17:43,857 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:17:43,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:17:43,871 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:17:43,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:17:43,875 INFO L85 PathProgramCache]: Analyzing trace with hash 3139, now seen corresponding path program 1 times [2022-07-22 02:17:43,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:17:43,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473918925] [2022-07-22 02:17:43,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:17:43,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:17:43,880 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 02:17:43,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [363444427] [2022-07-22 02:17:43,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:17:43,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 02:17:43,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:17:43,885 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-22 02:17:43,885 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-22 02:17:43,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:17:43,918 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:17:43,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:17:43,926 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:17:43,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:17:43,927 INFO L85 PathProgramCache]: Analyzing trace with hash 185777442, now seen corresponding path program 1 times [2022-07-22 02:17:43,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:17:43,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819909596] [2022-07-22 02:17:43,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:17:43,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:17:43,939 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 02:17:43,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [983505560] [2022-07-22 02:17:43,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:17:43,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 02:17:43,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:17:43,946 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-22 02:17:43,966 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-22 02:17:43,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:17:44,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 02:17:44,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 02:17:44,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 02:17:44,030 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 02:17:44,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:17:44,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819909596] [2022-07-22 02:17:44,030 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 02:17:44,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983505560] [2022-07-22 02:17:44,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983505560] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:17:44,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:17:44,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 02:17:44,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995047371] [2022-07-22 02:17:44,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:17:44,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:17:44,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 02:17:44,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-22 02:17:44,174 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-22 02:17:44,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:17:44,236 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2022-07-22 02:17:44,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 02:17:44,243 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 51 transitions. [2022-07-22 02:17:44,243 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 23 [2022-07-22 02:17:44,244 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 51 transitions. [2022-07-22 02:17:44,244 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2022-07-22 02:17:44,244 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2022-07-22 02:17:44,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 51 transitions. [2022-07-22 02:17:44,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 02:17:44,245 INFO L369 hiAutomatonCegarLoop]: Abstraction has 41 states and 51 transitions. [2022-07-22 02:17:44,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 51 transitions. [2022-07-22 02:17:44,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 22. [2022-07-22 02:17:44,246 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-22 02:17:44,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2022-07-22 02:17:44,247 INFO L392 hiAutomatonCegarLoop]: Abstraction has 22 states and 27 transitions. [2022-07-22 02:17:44,247 INFO L374 stractBuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2022-07-22 02:17:44,247 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-22 02:17:44,247 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2022-07-22 02:17:44,248 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-07-22 02:17:44,248 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:17:44,248 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:17:44,248 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 02:17:44,248 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 02:17:44,248 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-22 02:17:44,248 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-22 02:17:44,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:17:44,249 INFO L85 PathProgramCache]: Analyzing trace with hash 185777387, now seen corresponding path program 1 times [2022-07-22 02:17:44,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:17:44,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178947408] [2022-07-22 02:17:44,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:17:44,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:17:44,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:17:44,267 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:17:44,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:17:44,277 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:17:44,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:17:44,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1669532239, now seen corresponding path program 2 times [2022-07-22 02:17:44,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:17:44,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242698937] [2022-07-22 02:17:44,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:17:44,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:17:44,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:17:44,286 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:17:44,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:17:44,297 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:17:44,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:17:44,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1443775097, now seen corresponding path program 1 times [2022-07-22 02:17:44,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:17:44,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840709753] [2022-07-22 02:17:44,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:17:44,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:17:44,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:17:44,367 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-22 02:17:44,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:17:44,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840709753] [2022-07-22 02:17:44,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840709753] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:17:44,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:17:44,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 02:17:44,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119068614] [2022-07-22 02:17:44,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:17:44,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:17:44,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 02:17:44,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 02:17:44,501 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-22 02:17:44,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:17:44,556 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2022-07-22 02:17:44,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 02:17:44,557 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 32 transitions. [2022-07-22 02:17:44,558 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-07-22 02:17:44,558 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 23 states and 27 transitions. [2022-07-22 02:17:44,558 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2022-07-22 02:17:44,559 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2022-07-22 02:17:44,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 27 transitions. [2022-07-22 02:17:44,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 02:17:44,559 INFO L369 hiAutomatonCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-07-22 02:17:44,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 27 transitions. [2022-07-22 02:17:44,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2022-07-22 02:17:44,560 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-22 02:17:44,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2022-07-22 02:17:44,561 INFO L392 hiAutomatonCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-07-22 02:17:44,561 INFO L374 stractBuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-07-22 02:17:44,561 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-22 02:17:44,561 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 25 transitions. [2022-07-22 02:17:44,561 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-07-22 02:17:44,561 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:17:44,561 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:17:44,562 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 02:17:44,562 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 02:17:44,562 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-22 02:17:44,562 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-22 02:17:44,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:17:44,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1465845666, now seen corresponding path program 1 times [2022-07-22 02:17:44,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:17:44,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240821790] [2022-07-22 02:17:44,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:17:44,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:17:44,570 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 02:17:44,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [222554859] [2022-07-22 02:17:44,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:17:44,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 02:17:44,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:17:44,573 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-22 02:17:44,574 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-22 02:17:44,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:17:44,619 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:17:44,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:17:44,637 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:17:44,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:17:44,638 INFO L85 PathProgramCache]: Analyzing trace with hash 3199, now seen corresponding path program 2 times [2022-07-22 02:17:44,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:17:44,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234550241] [2022-07-22 02:17:44,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:17:44,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:17:44,642 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 02:17:44,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1222784127] [2022-07-22 02:17:44,642 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 02:17:44,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 02:17:44,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:17:44,647 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-22 02:17:44,670 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-22 02:17:44,686 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-22 02:17:44,687 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-07-22 02:17:44,687 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:17:44,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:17:44,693 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:17:44,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:17:44,694 INFO L85 PathProgramCache]: Analyzing trace with hash -71585824, now seen corresponding path program 1 times [2022-07-22 02:17:44,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:17:44,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693317729] [2022-07-22 02:17:44,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:17:44,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:17:44,711 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 02:17:44,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [576543962] [2022-07-22 02:17:44,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:17:44,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 02:17:44,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:17:44,719 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-22 02:17:44,742 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-22 02:17:44,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:17:44,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 02:17:44,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 02:17:44,817 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-22 02:17:44,817 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 02:17:44,841 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-22 02:17:44,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:17:44,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693317729] [2022-07-22 02:17:44,842 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 02:17:44,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576543962] [2022-07-22 02:17:44,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [576543962] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 02:17:44,842 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 02:17:44,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-07-22 02:17:44,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048464879] [2022-07-22 02:17:44,843 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 02:17:44,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:17:44,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 02:17:44,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-22 02:17:44,979 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-22 02:17:45,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:17:45,059 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2022-07-22 02:17:45,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 02:17:45,060 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 57 transitions. [2022-07-22 02:17:45,061 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 23 [2022-07-22 02:17:45,061 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 47 states and 57 transitions. [2022-07-22 02:17:45,062 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2022-07-22 02:17:45,062 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2022-07-22 02:17:45,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 57 transitions. [2022-07-22 02:17:45,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 02:17:45,062 INFO L369 hiAutomatonCegarLoop]: Abstraction has 47 states and 57 transitions. [2022-07-22 02:17:45,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 57 transitions. [2022-07-22 02:17:45,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 27. [2022-07-22 02:17:45,064 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-22 02:17:45,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2022-07-22 02:17:45,065 INFO L392 hiAutomatonCegarLoop]: Abstraction has 27 states and 32 transitions. [2022-07-22 02:17:45,065 INFO L374 stractBuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2022-07-22 02:17:45,065 INFO L287 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-22 02:17:45,065 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 32 transitions. [2022-07-22 02:17:45,066 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-07-22 02:17:45,066 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:17:45,066 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:17:45,066 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 02:17:45,066 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 02:17:45,066 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-22 02:17:45,067 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-22 02:17:45,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:17:45,067 INFO L85 PathProgramCache]: Analyzing trace with hash -69873632, now seen corresponding path program 2 times [2022-07-22 02:17:45,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:17:45,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188713230] [2022-07-22 02:17:45,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:17:45,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:17:45,076 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 02:17:45,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1426560103] [2022-07-22 02:17:45,076 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 02:17:45,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 02:17:45,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:17:45,104 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-22 02:17:45,106 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-22 02:17:45,156 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 02:17:45,156 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-07-22 02:17:45,156 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:17:45,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:17:45,175 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:17:45,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:17:45,175 INFO L85 PathProgramCache]: Analyzing trace with hash 3199, now seen corresponding path program 3 times [2022-07-22 02:17:45,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:17:45,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860562968] [2022-07-22 02:17:45,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:17:45,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:17:45,179 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 02:17:45,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [38633696] [2022-07-22 02:17:45,179 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 02:17:45,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 02:17:45,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:17:45,181 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-22 02:17:45,182 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-22 02:17:45,219 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-07-22 02:17:45,220 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-07-22 02:17:45,220 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:17:45,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:17:45,226 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:17:45,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:17:45,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1570918622, now seen corresponding path program 2 times [2022-07-22 02:17:45,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:17:45,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165788564] [2022-07-22 02:17:45,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:17:45,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:17:45,236 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 02:17:45,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1397147860] [2022-07-22 02:17:45,237 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 02:17:45,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 02:17:45,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:17:45,239 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-22 02:17:45,241 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-22 02:17:45,314 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 02:17:45,314 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-07-22 02:17:45,314 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:17:45,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:17:45,340 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:17:46,677 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 02:17:46,677 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 02:17:46,677 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 02:17:46,677 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 02:17:46,677 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 02:17:46,678 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:17:46,678 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 02:17:46,678 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 02:17:46,678 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubble_sort-1.c_Iteration9_Lasso [2022-07-22 02:17:46,678 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 02:17:46,678 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 02:17:46,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:17:46,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:17:46,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:17:46,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:17:47,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:17:47,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:17:47,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:17:47,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:17:47,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:17:47,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:17:47,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:17:47,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:17:47,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:17:47,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:17:47,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:17:48,213 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 02:17:48,214 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 02:17:48,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:17:48,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:17:48,217 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 02:17:48,227 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 02:17:48,234 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:17:48,235 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:17:48,235 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:17:48,235 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:17:48,238 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 02:17:48,238 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 02:17:48,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-07-22 02:17:48,250 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:17:48,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-07-22 02:17:48,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:17:48,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:17:48,273 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 02:17:48,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-07-22 02:17:48,276 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 02:17:48,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:17:48,281 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:17:48,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:17:48,282 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:17:48,282 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:17:48,282 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 02:17:48,283 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:17:48,283 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:17:48,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-07-22 02:17:48,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:17:48,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:17:48,303 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 02:17:48,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-07-22 02:17:48,304 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 02:17:48,310 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:17:48,310 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:17:48,311 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:17:48,311 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:17:48,311 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:17:48,311 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 02:17:48,311 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:17:48,312 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:17:48,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-07-22 02:17:48,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:17:48,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:17:48,332 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 02:17:48,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-07-22 02:17:48,335 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 02:17:48,341 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:17:48,341 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:17:48,341 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:17:48,341 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:17:48,343 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 02:17:48,343 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 02:17:48,345 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:17:48,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-07-22 02:17:48,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:17:48,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:17:48,362 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 02:17:48,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-07-22 02:17:48,364 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 02:17:48,370 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:17:48,370 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:17:48,370 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:17:48,370 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:17:48,371 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 02:17:48,371 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 02:17:48,374 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:17:48,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2022-07-22 02:17:48,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:17:48,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:17:48,391 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 02:17:48,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-07-22 02:17:48,393 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 02:17:48,400 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:17:48,400 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:17:48,400 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:17:48,400 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:17:48,402 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 02:17:48,402 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 02:17:48,405 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:17:48,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-07-22 02:17:48,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:17:48,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:17:48,422 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-22 02:17:48,430 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-22 02:17:48,431 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 02:17:48,437 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:17:48,438 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:17:48,438 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:17:48,438 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:17:48,439 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 02:17:48,439 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 02:17:48,446 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:17:48,461 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-22 02:17:48,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:17:48,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:17:48,463 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-22 02:17:48,464 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-22 02:17:48,465 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 02:17:48,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:17:48,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:17:48,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:17:48,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:17:48,472 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 02:17:48,472 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 02:17:48,475 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:17:48,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-07-22 02:17:48,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:17:48,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:17:48,493 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-22 02:17:48,494 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-22 02:17:48,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-22 02:17:48,501 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:17:48,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:17:48,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:17:48,502 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:17:48,504 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 02:17:48,505 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 02:17:48,523 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:17:48,550 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-22 02:17:48,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:17:48,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:17:48,552 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-22 02:17:48,556 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 02:17:48,564 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:17:48,564 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:17:48,564 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:17:48,564 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:17:48,566 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 02:17:48,566 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 02:17:48,577 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-22 02:17:48,583 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:17:48,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2022-07-22 02:17:48,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:17:48,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:17:48,601 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-22 02:17:48,602 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-22 02:17:48,604 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 02:17:48,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:17:48,610 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:17:48,610 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:17:48,610 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:17:48,612 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 02:17:48,612 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 02:17:48,614 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:17:48,629 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-22 02:17:48,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:17:48,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:17:48,631 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-22 02:17:48,631 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-22 02:17:48,633 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 02:17:48,638 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:17:48,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:17:48,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:17:48,639 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:17:48,640 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 02:17:48,640 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 02:17:48,643 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:17:48,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-07-22 02:17:48,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:17:48,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:17:48,660 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-22 02:17:48,661 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-22 02:17:48,663 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 02:17:48,669 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:17:48,669 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2022-07-22 02:17:48,669 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2022-07-22 02:17:48,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:17:48,702 INFO L401 nArgumentSynthesizer]: We have 36 Motzkin's Theorem applications. [2022-07-22 02:17:48,702 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2022-07-22 02:17:48,788 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 02:17:48,907 INFO L443 ModelExtractionUtils]: Simplification made 32 calls to the SMT solver. [2022-07-22 02:17:48,907 INFO L444 ModelExtractionUtils]: 25 out of 50 variables were initially zero. Simplification set additionally 22 variables to zero. [2022-07-22 02:17:48,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:17:48,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:17:48,909 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-22 02:17:48,910 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-22 02:17:48,910 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 02:17:48,919 INFO L438 nArgumentSynthesizer]: Removed 6 redundant supporting invariants from a total of 6. [2022-07-22 02:17:48,919 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 02:17:48,919 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-22 02:17:48,938 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-22 02:17:48,964 INFO L293 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2022-07-22 02:17:48,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:17:48,998 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-22 02:17:49,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:17:49,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 02:17:49,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 02:17:49,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:17:49,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 02:17:49,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 02:17:49,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 02:17:49,052 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-22 02:17:49,052 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-22 02:17:49,071 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-22 02:17:49,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-22 02:17:49,073 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-22 02:17:49,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-07-22 02:17:49,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 13 letters. Loop has 2 letters. [2022-07-22 02:17:49,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 02:17:49,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 15 letters. Loop has 2 letters. [2022-07-22 02:17:49,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 02:17:49,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 13 letters. Loop has 4 letters. [2022-07-22 02:17:49,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 02:17:49,075 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 48 transitions. [2022-07-22 02:17:49,075 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-07-22 02:17:49,076 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 29 states and 35 transitions. [2022-07-22 02:17:49,076 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2022-07-22 02:17:49,076 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2022-07-22 02:17:49,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 35 transitions. [2022-07-22 02:17:49,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 02:17:49,077 INFO L369 hiAutomatonCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-07-22 02:17:49,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 35 transitions. [2022-07-22 02:17:49,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2022-07-22 02:17:49,078 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-22 02:17:49,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-07-22 02:17:49,079 INFO L392 hiAutomatonCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-07-22 02:17:49,079 INFO L374 stractBuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-07-22 02:17:49,079 INFO L287 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-07-22 02:17:49,079 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 34 transitions. [2022-07-22 02:17:49,079 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-07-22 02:17:49,079 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:17:49,080 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:17:49,080 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 02:17:49,080 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 02:17:49,080 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-22 02:17:49,080 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-22 02:17:49,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:17:49,081 INFO L85 PathProgramCache]: Analyzing trace with hash 2075806767, now seen corresponding path program 1 times [2022-07-22 02:17:49,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:17:49,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135778800] [2022-07-22 02:17:49,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:17:49,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:17:49,089 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 02:17:49,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [72141259] [2022-07-22 02:17:49,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:17:49,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 02:17:49,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:17:49,091 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-22 02:17:49,116 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-22 02:17:49,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:17:49,151 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:17:49,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:17:49,176 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:17:49,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:17:49,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1669532239, now seen corresponding path program 3 times [2022-07-22 02:17:49,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:17:49,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561979133] [2022-07-22 02:17:49,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:17:49,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:17:49,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:17:49,186 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:17:49,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:17:49,197 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:17:49,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:17:49,197 INFO L85 PathProgramCache]: Analyzing trace with hash -548718141, now seen corresponding path program 1 times [2022-07-22 02:17:49,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:17:49,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968372819] [2022-07-22 02:17:49,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:17:49,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:17:49,214 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 02:17:49,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1448491405] [2022-07-22 02:17:49,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:17:49,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 02:17:49,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:17:49,217 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-22 02:17:49,224 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-22 02:17:49,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:17:49,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-22 02:17:49,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 02:17:49,310 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-22 02:17:49,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 02:17:49,334 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-22 02:17:49,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:17:49,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968372819] [2022-07-22 02:17:49,335 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 02:17:49,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448491405] [2022-07-22 02:17:49,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448491405] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 02:17:49,335 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 02:17:49,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-07-22 02:17:49,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255616561] [2022-07-22 02:17:49,336 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 02:17:49,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:17:49,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 02:17:49,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-22 02:17:49,443 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-22 02:17:49,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:17:49,512 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-07-22 02:17:49,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 02:17:49,513 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 41 transitions. [2022-07-22 02:17:49,513 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-07-22 02:17:49,514 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 28 states and 33 transitions. [2022-07-22 02:17:49,514 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2022-07-22 02:17:49,514 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2022-07-22 02:17:49,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 33 transitions. [2022-07-22 02:17:49,514 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 02:17:49,514 INFO L369 hiAutomatonCegarLoop]: Abstraction has 28 states and 33 transitions. [2022-07-22 02:17:49,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 33 transitions. [2022-07-22 02:17:49,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2022-07-22 02:17:49,516 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-22 02:17:49,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-07-22 02:17:49,516 INFO L392 hiAutomatonCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-07-22 02:17:49,516 INFO L374 stractBuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-07-22 02:17:49,516 INFO L287 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-07-22 02:17:49,516 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 29 transitions. [2022-07-22 02:17:49,517 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-07-22 02:17:49,517 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:17:49,517 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:17:49,517 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 02:17:49,517 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 02:17:49,517 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-22 02:17:49,518 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-22 02:17:49,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:17:49,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1273080179, now seen corresponding path program 2 times [2022-07-22 02:17:49,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:17:49,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842974903] [2022-07-22 02:17:49,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:17:49,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:17:49,526 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 02:17:49,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [326288620] [2022-07-22 02:17:49,527 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 02:17:49,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 02:17:49,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:17:49,535 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-22 02:17:49,555 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-22 02:17:49,608 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 02:17:49,608 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-07-22 02:17:49,608 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:17:49,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:17:49,634 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:17:49,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:17:49,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1669532239, now seen corresponding path program 4 times [2022-07-22 02:17:49,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:17:49,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254131914] [2022-07-22 02:17:49,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:17:49,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:17:49,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:17:49,642 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:17:49,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:17:49,646 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:17:49,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:17:49,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1247881215, now seen corresponding path program 2 times [2022-07-22 02:17:49,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:17:49,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013499417] [2022-07-22 02:17:49,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:17:49,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:17:49,655 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 02:17:49,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1432527636] [2022-07-22 02:17:49,656 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 02:17:49,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 02:17:49,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:17:49,663 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-22 02:17:49,671 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-22 02:17:49,733 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 02:17:49,733 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-07-22 02:17:49,733 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:17:49,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:17:49,766 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:17:52,701 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 02:17:52,702 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 02:17:52,702 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 02:17:52,702 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 02:17:52,702 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 02:17:52,702 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:17:52,702 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 02:17:52,702 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 02:17:52,702 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubble_sort-1.c_Iteration11_Lasso [2022-07-22 02:17:52,702 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 02:17:52,702 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 02:17:52,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:17:52,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:17:52,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:17:52,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:17:52,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:17:52,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:17:52,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:17:52,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:17:52,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:17:52,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:17:52,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:17:52,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:17:52,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:17:52,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:17:52,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:17:52,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:17:52,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-22 02:17:52,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:17:52,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:17:52,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:17:52,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-22 02:17:52,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:17:53,511 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-22 02:17:53,519 INFO L158 Benchmark]: Toolchain (without parser) took 13471.49ms. Allocated memory was 56.6MB in the beginning and 104.9MB in the end (delta: 48.2MB). Free memory was 35.5MB in the beginning and 77.0MB in the end (delta: -41.5MB). Peak memory consumption was 60.3MB. Max. memory is 16.1GB. [2022-07-22 02:17:53,520 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 56.6MB. Free memory was 38.7MB in the beginning and 38.7MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 02:17:53,520 INFO L158 Benchmark]: CACSL2BoogieTranslator took 302.65ms. Allocated memory is still 56.6MB. Free memory was 35.3MB in the beginning and 38.9MB in the end (delta: -3.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-22 02:17:53,520 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.20ms. Allocated memory is still 56.6MB. Free memory was 38.9MB in the beginning and 37.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 02:17:53,521 INFO L158 Benchmark]: Boogie Preprocessor took 46.44ms. Allocated memory is still 56.6MB. Free memory was 37.1MB in the beginning and 35.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 02:17:53,521 INFO L158 Benchmark]: RCFGBuilder took 421.57ms. Allocated memory was 56.6MB in the beginning and 71.3MB in the end (delta: 14.7MB). Free memory was 35.6MB in the beginning and 50.8MB in the end (delta: -15.2MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. [2022-07-22 02:17:53,522 INFO L158 Benchmark]: BuchiAutomizer took 12645.02ms. Allocated memory was 71.3MB in the beginning and 104.9MB in the end (delta: 33.6MB). Free memory was 50.5MB in the beginning and 77.0MB in the end (delta: -26.5MB). Peak memory consumption was 61.8MB. Max. memory is 16.1GB. [2022-07-22 02:17:53,523 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.18ms. Allocated memory is still 56.6MB. Free memory was 38.7MB in the beginning and 38.7MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 302.65ms. Allocated memory is still 56.6MB. Free memory was 35.3MB in the beginning and 38.9MB in the end (delta: -3.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.20ms. Allocated memory is still 56.6MB. Free memory was 38.9MB in the beginning and 37.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.44ms. Allocated memory is still 56.6MB. Free memory was 37.1MB in the beginning and 35.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 421.57ms. Allocated memory was 56.6MB in the beginning and 71.3MB in the end (delta: 14.7MB). Free memory was 35.6MB in the beginning and 50.8MB in the end (delta: -15.2MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. * BuchiAutomizer took 12645.02ms. Allocated memory was 71.3MB in the beginning and 104.9MB in the end (delta: 33.6MB). Free memory was 50.5MB in the beginning and 77.0MB in the end (delta: -26.5MB). Peak memory consumption was 61.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: IllegalArgumentException: null de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: IllegalArgumentException: null: de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-22 02:17:53,559 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-22 02:17:53,772 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-22 02:17:53,973 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-22 02:17:54,173 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-22 02:17:54,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-07-22 02:17:54,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-07-22 02:17:54,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-07-22 02:17:54,973 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-22 02:17:55,173 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-22 02:17:55,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-07-22 02:17:55,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-07-22 02:17:55,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-07-22 02:17:55,974 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