./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3a877d22 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/array-memsafety/java_BubbleSort-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ba885d2ca843c278430bc3d4272c307ea7df8f1fbcd0da84e81382a8c1939a93 --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 17:25:45,872 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 17:25:45,873 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 17:25:45,904 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 17:25:45,905 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 17:25:45,905 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 17:25:45,906 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 17:25:45,909 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 17:25:45,911 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 17:25:45,912 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 17:25:45,913 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 17:25:45,914 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 17:25:45,915 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 17:25:45,917 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 17:25:45,919 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 17:25:45,921 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 17:25:45,921 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 17:25:45,922 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 17:25:45,924 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 17:25:45,925 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 17:25:45,927 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 17:25:45,931 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 17:25:45,932 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 17:25:45,933 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 17:25:45,934 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 17:25:45,940 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 17:25:45,940 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 17:25:45,941 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 17:25:45,941 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 17:25:45,942 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 17:25:45,942 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 17:25:45,942 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 17:25:45,943 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 17:25:45,944 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 17:25:45,945 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 17:25:45,945 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 17:25:45,946 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 17:25:45,946 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 17:25:45,947 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 17:25:45,947 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 17:25:45,948 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 17:25:45,948 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-15 17:25:45,962 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 17:25:45,963 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 17:25:45,963 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 17:25:45,963 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 17:25:45,964 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 17:25:45,964 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 17:25:45,964 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 17:25:45,964 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-15 17:25:45,964 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-15 17:25:45,965 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-15 17:25:45,975 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-15 17:25:45,975 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-15 17:25:45,975 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-15 17:25:45,975 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 17:25:45,975 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 17:25:45,975 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 17:25:45,976 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 17:25:45,976 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 17:25:45,976 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 17:25:45,976 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-15 17:25:45,976 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-15 17:25:45,976 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-15 17:25:45,976 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 17:25:45,977 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 17:25:45,977 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-15 17:25:45,977 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 17:25:45,977 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-15 17:25:45,977 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 17:25:45,978 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 17:25:45,978 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 17:25:45,978 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 17:25:45,978 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 17:25:45,979 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-15 17:25:45,979 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 -> ba885d2ca843c278430bc3d4272c307ea7df8f1fbcd0da84e81382a8c1939a93 [2021-12-15 17:25:46,145 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 17:25:46,163 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 17:25:46,165 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 17:25:46,165 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 17:25:46,166 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 17:25:46,167 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca-1.i [2021-12-15 17:25:46,212 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c855064cb/1b63435a3d8e400ebdc70fe78859c944/FLAG9d5554f07 [2021-12-15 17:25:46,658 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 17:25:46,663 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca-1.i [2021-12-15 17:25:46,674 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c855064cb/1b63435a3d8e400ebdc70fe78859c944/FLAG9d5554f07 [2021-12-15 17:25:46,685 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c855064cb/1b63435a3d8e400ebdc70fe78859c944 [2021-12-15 17:25:46,687 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 17:25:46,689 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 17:25:46,691 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 17:25:46,691 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 17:25:46,693 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 17:25:46,693 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:25:46" (1/1) ... [2021-12-15 17:25:46,694 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75035a38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:25:46, skipping insertion in model container [2021-12-15 17:25:46,694 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:25:46" (1/1) ... [2021-12-15 17:25:46,699 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 17:25:46,720 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 17:25:46,899 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:25:46,904 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 17:25:46,936 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:25:46,952 INFO L208 MainTranslator]: Completed translation [2021-12-15 17:25:46,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:25:46 WrapperNode [2021-12-15 17:25:46,953 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 17:25:46,954 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 17:25:46,954 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 17:25:46,954 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 17:25:46,958 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:25:46" (1/1) ... [2021-12-15 17:25:46,966 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:25:46" (1/1) ... [2021-12-15 17:25:46,978 INFO L137 Inliner]: procedures = 116, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 62 [2021-12-15 17:25:46,978 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 17:25:46,979 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 17:25:46,979 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 17:25:46,979 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 17:25:46,984 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:25:46" (1/1) ... [2021-12-15 17:25:46,984 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:25:46" (1/1) ... [2021-12-15 17:25:46,986 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:25:46" (1/1) ... [2021-12-15 17:25:46,986 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:25:46" (1/1) ... [2021-12-15 17:25:46,989 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:25:46" (1/1) ... [2021-12-15 17:25:46,992 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:25:46" (1/1) ... [2021-12-15 17:25:46,998 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:25:46" (1/1) ... [2021-12-15 17:25:47,000 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 17:25:47,000 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 17:25:47,000 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 17:25:47,001 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 17:25:47,001 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:25:46" (1/1) ... [2021-12-15 17:25:47,007 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:47,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:47,022 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) [2021-12-15 17:25:47,028 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 [2021-12-15 17:25:47,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-15 17:25:47,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-15 17:25:47,051 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-15 17:25:47,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-15 17:25:47,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 17:25:47,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 17:25:47,106 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 17:25:47,107 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 17:25:47,207 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 17:25:47,211 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 17:25:47,211 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-15 17:25:47,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:25:47 BoogieIcfgContainer [2021-12-15 17:25:47,212 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 17:25:47,213 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-15 17:25:47,213 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-15 17:25:47,219 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-15 17:25:47,220 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:25:47,220 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.12 05:25:46" (1/3) ... [2021-12-15 17:25:47,221 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@df08855 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:25:47, skipping insertion in model container [2021-12-15 17:25:47,221 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:25:47,221 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:25:46" (2/3) ... [2021-12-15 17:25:47,221 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@df08855 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:25:47, skipping insertion in model container [2021-12-15 17:25:47,221 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:25:47,222 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:25:47" (3/3) ... [2021-12-15 17:25:47,222 INFO L388 chiAutomizerObserver]: Analyzing ICFG java_BubbleSort-alloca-1.i [2021-12-15 17:25:47,259 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-15 17:25:47,259 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-15 17:25:47,259 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-15 17:25:47,259 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-15 17:25:47,259 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-15 17:25:47,259 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-15 17:25:47,260 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-15 17:25:47,260 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-15 17:25:47,271 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:25:47,284 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2021-12-15 17:25:47,284 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:25:47,284 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:25:47,290 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-12-15 17:25:47,290 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:25:47,290 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-15 17:25:47,290 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:25:47,292 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2021-12-15 17:25:47,292 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:25:47,292 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:25:47,292 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-12-15 17:25:47,292 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:25:47,297 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 13#L523true assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 14#L523-2true call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 6#L528-3true [2021-12-15 17:25:47,297 INFO L793 eck$LassoCheckResult]: Loop: 6#L528-3true assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 10#L528-2true main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 6#L528-3true [2021-12-15 17:25:47,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:25:47,301 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2021-12-15 17:25:47,306 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:25:47,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767409613] [2021-12-15 17:25:47,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:25:47,307 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:25:47,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:25:47,376 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:25:47,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:25:47,396 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:25:47,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:25:47,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2021-12-15 17:25:47,398 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:25:47,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360023847] [2021-12-15 17:25:47,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:25:47,399 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:25:47,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:25:47,407 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:25:47,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:25:47,412 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:25:47,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:25:47,414 INFO L85 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2021-12-15 17:25:47,414 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:25:47,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906122075] [2021-12-15 17:25:47,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:25:47,414 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:25:47,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:25:47,429 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:25:47,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:25:47,440 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:25:47,670 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 17:25:47,670 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 17:25:47,670 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 17:25:47,670 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 17:25:47,671 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 17:25:47,671 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:47,671 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 17:25:47,671 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 17:25:47,671 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration1_Lasso [2021-12-15 17:25:47,671 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 17:25:47,671 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 17:25:47,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:47,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:47,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:47,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:47,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:47,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:47,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:47,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:47,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:48,004 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 17:25:48,013 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 17:25:48,014 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:48,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:48,015 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) [2021-12-15 17:25:48,015 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 [2021-12-15 17:25:48,017 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 [2021-12-15 17:25:48,023 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:48,024 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:25:48,024 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:25:48,024 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:48,024 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:48,026 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:25:48,026 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:25:48,048 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:25:48,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2021-12-15 17:25:48,064 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:48,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:48,065 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) [2021-12-15 17:25:48,066 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 [2021-12-15 17:25:48,077 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 [2021-12-15 17:25:48,083 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:48,083 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:25:48,083 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:48,083 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:48,085 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:25:48,086 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:25:48,088 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:25:48,106 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 [2021-12-15 17:25:48,106 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:48,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:48,107 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) [2021-12-15 17:25:48,108 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 [2021-12-15 17:25:48,110 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 [2021-12-15 17:25:48,116 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:48,116 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:25:48,116 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:25:48,116 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:48,116 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:48,117 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:25:48,117 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:25:48,119 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:25:48,134 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 [2021-12-15 17:25:48,134 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:48,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:48,135 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) [2021-12-15 17:25:48,135 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 [2021-12-15 17:25:48,136 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 [2021-12-15 17:25:48,142 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:48,142 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:25:48,142 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:48,142 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:48,145 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:25:48,145 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:25:48,155 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:25:48,172 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 [2021-12-15 17:25:48,172 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:48,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:48,173 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) [2021-12-15 17:25:48,174 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 [2021-12-15 17:25:48,175 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 [2021-12-15 17:25:48,180 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:48,181 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:25:48,181 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:25:48,181 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:48,181 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:48,181 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:25:48,181 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:25:48,183 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:25:48,200 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 [2021-12-15 17:25:48,200 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:48,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:48,201 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) [2021-12-15 17:25:48,202 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 [2021-12-15 17:25:48,203 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 [2021-12-15 17:25:48,210 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:48,210 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:25:48,210 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:48,211 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:48,213 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:25:48,213 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:25:48,243 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:25:48,259 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 [2021-12-15 17:25:48,259 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:48,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:48,260 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) [2021-12-15 17:25:48,263 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 [2021-12-15 17:25:48,264 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 [2021-12-15 17:25:48,270 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:48,270 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:25:48,270 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:48,270 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:48,273 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:25:48,273 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:25:48,291 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:25:48,311 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 [2021-12-15 17:25:48,311 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:48,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:48,312 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) [2021-12-15 17:25:48,313 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 [2021-12-15 17:25:48,314 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 [2021-12-15 17:25:48,319 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:48,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:25:48,320 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:48,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:48,321 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:25:48,321 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:25:48,334 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:25:48,353 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 [2021-12-15 17:25:48,353 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:48,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:48,354 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) [2021-12-15 17:25:48,355 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 [2021-12-15 17:25:48,356 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 [2021-12-15 17:25:48,362 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:48,362 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:25:48,362 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:25:48,362 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:48,363 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:48,363 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:25:48,363 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:25:48,364 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:25:48,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2021-12-15 17:25:48,379 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:48,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:48,382 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) [2021-12-15 17:25:48,388 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 [2021-12-15 17:25:48,389 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 [2021-12-15 17:25:48,401 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:48,401 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:25:48,401 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:48,401 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:48,408 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:25:48,408 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:25:48,423 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 17:25:48,465 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2021-12-15 17:25:48,465 INFO L444 ModelExtractionUtils]: 9 out of 22 variables were initially zero. Simplification set additionally 8 variables to zero. [2021-12-15 17:25:48,466 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:48,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:48,484 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) [2021-12-15 17:25:48,511 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 [2021-12-15 17:25:48,511 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 17:25:48,551 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2021-12-15 17:25:48,551 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 17:25:48,551 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc9#1.base)_1, ULTIMATE.start_main_~i~1#1) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc9#1.base)_1 - 2*ULTIMATE.start_main_~i~1#1 Supporting invariants [1*v_rep(select #length ULTIMATE.start_main_#t~malloc9#1.base)_1 - 2*ULTIMATE.start_main_~array_size~0#1 >= 0] [2021-12-15 17:25:48,567 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 [2021-12-15 17:25:48,575 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2021-12-15 17:25:48,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:25:48,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:25:48,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-15 17:25:48,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:25:48,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:25:48,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-15 17:25:48,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:25:48,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:25:48,696 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2021-12-15 17:25:48,698 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:25:48,756 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 35 states and 53 transitions. Complement of second has 9 states. [2021-12-15 17:25:48,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-15 17:25:48,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:25:48,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2021-12-15 17:25:48,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 4 letters. Loop has 2 letters. [2021-12-15 17:25:48,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:25:48,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 6 letters. Loop has 2 letters. [2021-12-15 17:25:48,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:25:48,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 4 letters. Loop has 4 letters. [2021-12-15 17:25:48,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:25:48,774 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 53 transitions. [2021-12-15 17:25:48,778 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-12-15 17:25:48,780 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 13 states and 18 transitions. [2021-12-15 17:25:48,781 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-12-15 17:25:48,781 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-12-15 17:25:48,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2021-12-15 17:25:48,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:25:48,782 INFO L681 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2021-12-15 17:25:48,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2021-12-15 17:25:48,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2021-12-15 17:25:48,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:25:48,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2021-12-15 17:25:48,799 INFO L704 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2021-12-15 17:25:48,799 INFO L587 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2021-12-15 17:25:48,799 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-15 17:25:48,799 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2021-12-15 17:25:48,801 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-12-15 17:25:48,801 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:25:48,801 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:25:48,802 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-12-15 17:25:48,802 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 17:25:48,802 INFO L791 eck$LassoCheckResult]: Stem: 121#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 122#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 123#L523 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 124#L523-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 127#L528-3 assume !(main_~i~1#1 < main_~array_size~0#1); 125#L528-4 assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 126#L515-3 [2021-12-15 17:25:48,802 INFO L793 eck$LassoCheckResult]: Loop: 126#L515-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 130#L516-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 131#L515-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 126#L515-3 [2021-12-15 17:25:48,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:25:48,806 INFO L85 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2021-12-15 17:25:48,806 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:25:48,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321320263] [2021-12-15 17:25:48,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:25:48,806 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:25:48,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:25:48,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:25:48,862 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:25:48,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321320263] [2021-12-15 17:25:48,862 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321320263] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:25:48,862 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:25:48,862 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 17:25:48,863 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29631402] [2021-12-15 17:25:48,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:25:48,864 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:25:48,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:25:48,865 INFO L85 PathProgramCache]: Analyzing trace with hash 60779, now seen corresponding path program 1 times [2021-12-15 17:25:48,865 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:25:48,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762900752] [2021-12-15 17:25:48,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:25:48,865 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:25:48,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:25:48,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:25:48,875 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:25:48,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762900752] [2021-12-15 17:25:48,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762900752] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:25:48,876 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:25:48,876 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 17:25:48,876 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740415415] [2021-12-15 17:25:48,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:25:48,876 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:25:48,877 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:25:48,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:25:48,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:25:48,879 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 7 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) [2021-12-15 17:25:48,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:25:48,889 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2021-12-15 17:25:48,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:25:48,890 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2021-12-15 17:25:48,890 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-12-15 17:25:48,891 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2021-12-15 17:25:48,891 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2021-12-15 17:25:48,891 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2021-12-15 17:25:48,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2021-12-15 17:25:48,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:25:48,891 INFO L681 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2021-12-15 17:25:48,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2021-12-15 17:25:48,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2021-12-15 17:25:48,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:25:48,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2021-12-15 17:25:48,892 INFO L704 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2021-12-15 17:25:48,893 INFO L587 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2021-12-15 17:25:48,893 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-15 17:25:48,893 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2021-12-15 17:25:48,893 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-12-15 17:25:48,893 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:25:48,893 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:25:48,893 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-12-15 17:25:48,894 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-12-15 17:25:48,894 INFO L791 eck$LassoCheckResult]: Stem: 156#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 157#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 158#L523 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 159#L523-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 162#L528-3 assume !(main_~i~1#1 < main_~array_size~0#1); 160#L528-4 assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 161#L515-3 [2021-12-15 17:25:48,894 INFO L793 eck$LassoCheckResult]: Loop: 161#L515-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 165#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 166#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 168#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 169#L516-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 167#L515-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 161#L515-3 [2021-12-15 17:25:48,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:25:48,894 INFO L85 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 2 times [2021-12-15 17:25:48,895 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:25:48,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687012380] [2021-12-15 17:25:48,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:25:48,895 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:25:48,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:25:48,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:25:48,916 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:25:48,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687012380] [2021-12-15 17:25:48,917 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687012380] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:25:48,917 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:25:48,917 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 17:25:48,917 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593520805] [2021-12-15 17:25:48,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:25:48,917 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:25:48,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:25:48,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1812321306, now seen corresponding path program 1 times [2021-12-15 17:25:48,918 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:25:48,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856648923] [2021-12-15 17:25:48,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:25:48,918 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:25:48,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:25:48,924 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:25:48,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:25:48,929 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:25:49,056 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 [2021-12-15 17:25:49,059 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:25:49,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 17:25:49,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-15 17:25:49,060 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:25:49,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:25:49,079 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2021-12-15 17:25:49,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 17:25:49,081 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2021-12-15 17:25:49,082 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-12-15 17:25:49,082 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 19 transitions. [2021-12-15 17:25:49,082 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2021-12-15 17:25:49,083 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2021-12-15 17:25:49,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2021-12-15 17:25:49,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:25:49,083 INFO L681 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2021-12-15 17:25:49,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2021-12-15 17:25:49,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2021-12-15 17:25:49,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:25:49,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2021-12-15 17:25:49,085 INFO L704 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2021-12-15 17:25:49,085 INFO L587 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2021-12-15 17:25:49,085 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-15 17:25:49,085 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2021-12-15 17:25:49,087 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-12-15 17:25:49,087 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:25:49,087 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:25:49,088 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:25:49,088 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-12-15 17:25:49,088 INFO L791 eck$LassoCheckResult]: Stem: 192#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 193#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 194#L523 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 195#L523-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 198#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 199#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 200#L528-3 assume !(main_~i~1#1 < main_~array_size~0#1); 196#L528-4 assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 197#L515-3 [2021-12-15 17:25:49,088 INFO L793 eck$LassoCheckResult]: Loop: 197#L515-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 201#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 202#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 204#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 205#L516-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 203#L515-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 197#L515-3 [2021-12-15 17:25:49,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:25:49,089 INFO L85 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2021-12-15 17:25:49,089 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:25:49,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492093075] [2021-12-15 17:25:49,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:25:49,089 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:25:49,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:25:49,117 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:25:49,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:25:49,129 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:25:49,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:25:49,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1812321306, now seen corresponding path program 2 times [2021-12-15 17:25:49,132 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:25:49,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016945511] [2021-12-15 17:25:49,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:25:49,133 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:25:49,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:25:49,142 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:25:49,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:25:49,153 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:25:49,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:25:49,154 INFO L85 PathProgramCache]: Analyzing trace with hash -256077176, now seen corresponding path program 1 times [2021-12-15 17:25:49,154 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:25:49,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782219567] [2021-12-15 17:25:49,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:25:49,154 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:25:49,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:25:49,267 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:25:49,268 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:25:49,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782219567] [2021-12-15 17:25:49,268 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782219567] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:25:49,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69438737] [2021-12-15 17:25:49,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:25:49,268 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:25:49,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:49,269 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) [2021-12-15 17:25:49,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-15 17:25:49,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:25:49,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-15 17:25:49,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:25:49,373 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 17:25:49,373 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:25:49,404 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 17:25:49,404 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69438737] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:25:49,404 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:25:49,404 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2021-12-15 17:25:49,405 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144619531] [2021-12-15 17:25:49,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:25:49,496 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:25:49,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-15 17:25:49,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-12-15 17:25:49,498 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. cyclomatic complexity: 6 Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 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) [2021-12-15 17:25:49,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:25:49,584 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2021-12-15 17:25:49,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-15 17:25:49,585 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 28 transitions. [2021-12-15 17:25:49,585 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-12-15 17:25:49,585 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 17 states and 20 transitions. [2021-12-15 17:25:49,586 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2021-12-15 17:25:49,586 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2021-12-15 17:25:49,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 20 transitions. [2021-12-15 17:25:49,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:25:49,586 INFO L681 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2021-12-15 17:25:49,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 20 transitions. [2021-12-15 17:25:49,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2021-12-15 17:25:49,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:25:49,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2021-12-15 17:25:49,587 INFO L704 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2021-12-15 17:25:49,587 INFO L587 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2021-12-15 17:25:49,587 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-15 17:25:49,588 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2021-12-15 17:25:49,588 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-12-15 17:25:49,588 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:25:49,588 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:25:49,588 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2021-12-15 17:25:49,588 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-12-15 17:25:49,589 INFO L791 eck$LassoCheckResult]: Stem: 330#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 331#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 334#L523 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 335#L523-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 336#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 337#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 338#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 339#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 345#L528-3 assume !(main_~i~1#1 < main_~array_size~0#1); 332#L528-4 assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 333#L515-3 [2021-12-15 17:25:49,589 INFO L793 eck$LassoCheckResult]: Loop: 333#L515-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 340#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 341#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 343#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 344#L516-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 342#L515-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 333#L515-3 [2021-12-15 17:25:49,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:25:49,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1899756335, now seen corresponding path program 2 times [2021-12-15 17:25:49,589 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:25:49,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692843938] [2021-12-15 17:25:49,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:25:49,590 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:25:49,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:25:49,598 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:25:49,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:25:49,604 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:25:49,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:25:49,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1812321306, now seen corresponding path program 3 times [2021-12-15 17:25:49,604 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:25:49,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932877676] [2021-12-15 17:25:49,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:25:49,605 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:25:49,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:25:49,609 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:25:49,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:25:49,612 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:25:49,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:25:49,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1808202986, now seen corresponding path program 2 times [2021-12-15 17:25:49,613 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:25:49,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737363847] [2021-12-15 17:25:49,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:25:49,613 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:25:49,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:25:49,650 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:25:49,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:25:49,660 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:25:50,010 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 17:25:50,010 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 17:25:50,010 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 17:25:50,010 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 17:25:50,010 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 17:25:50,010 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:50,010 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 17:25:50,010 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 17:25:50,010 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration5_Lasso [2021-12-15 17:25:50,010 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 17:25:50,010 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 17:25:50,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:50,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:50,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:50,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:50,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:50,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:50,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:50,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:50,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:50,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:50,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:50,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:50,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:50,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:50,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:50,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:50,428 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 17:25:50,429 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 17:25:50,429 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:50,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:50,430 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:25:50,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-12-15 17:25:50,433 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 [2021-12-15 17:25:50,439 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:50,439 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:25:50,439 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:50,439 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:50,448 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:25:50,448 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:25:50,464 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 17:25:50,512 INFO L443 ModelExtractionUtils]: Simplification made 21 calls to the SMT solver. [2021-12-15 17:25:50,512 INFO L444 ModelExtractionUtils]: 11 out of 43 variables were initially zero. Simplification set additionally 29 variables to zero. [2021-12-15 17:25:50,512 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:50,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:50,544 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:25:50,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2021-12-15 17:25:50,546 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 17:25:50,583 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-15 17:25:50,584 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 17:25:50,584 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~n#1, ULTIMATE.start_sort_~pass~0#1) = 1*ULTIMATE.start_sort_~n#1 - 1*ULTIMATE.start_sort_~pass~0#1 Supporting invariants [] [2021-12-15 17:25:50,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2021-12-15 17:25:50,612 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2021-12-15 17:25:50,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:25:50,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:25:50,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-15 17:25:50,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:25:50,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:25:50,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-15 17:25:50,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:25:50,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 17:25:50,671 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 [2021-12-15 17:25:50,672 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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) [2021-12-15 17:25:50,681 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 22 states and 28 transitions. Complement of second has 4 states. [2021-12-15 17:25:50,682 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 [2021-12-15 17:25:50,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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) [2021-12-15 17:25:50,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2021-12-15 17:25:50,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 6 letters. [2021-12-15 17:25:50,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:25:50,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 16 letters. Loop has 6 letters. [2021-12-15 17:25:50,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:25:50,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 12 letters. [2021-12-15 17:25:50,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:25:50,685 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 28 transitions. [2021-12-15 17:25:50,686 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-15 17:25:50,688 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 21 states and 27 transitions. [2021-12-15 17:25:50,688 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-12-15 17:25:50,688 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-12-15 17:25:50,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2021-12-15 17:25:50,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:25:50,688 INFO L681 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2021-12-15 17:25:50,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2021-12-15 17:25:50,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2021-12-15 17:25:50,690 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) [2021-12-15 17:25:50,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2021-12-15 17:25:50,690 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2021-12-15 17:25:50,690 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2021-12-15 17:25:50,690 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-15 17:25:50,690 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2021-12-15 17:25:50,691 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-15 17:25:50,691 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:25:50,691 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:25:50,691 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:25:50,691 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 17:25:50,692 INFO L791 eck$LassoCheckResult]: Stem: 464#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 465#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 466#L523 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 467#L523-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 470#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 471#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 472#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 473#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 483#L528-3 assume !(main_~i~1#1 < main_~array_size~0#1); 468#L528-4 assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 469#L515-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 474#L516-3 [2021-12-15 17:25:50,692 INFO L793 eck$LassoCheckResult]: Loop: 474#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 475#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 480#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 474#L516-3 [2021-12-15 17:25:50,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:25:50,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 1 times [2021-12-15 17:25:50,693 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:25:50,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583954231] [2021-12-15 17:25:50,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:25:50,693 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:25:50,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:25:50,715 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:25:50,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:25:50,721 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:25:50,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:25:50,721 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 1 times [2021-12-15 17:25:50,721 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:25:50,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637311278] [2021-12-15 17:25:50,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:25:50,722 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:25:50,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:25:50,725 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:25:50,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:25:50,727 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:25:50,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:25:50,728 INFO L85 PathProgramCache]: Analyzing trace with hash -793648259, now seen corresponding path program 1 times [2021-12-15 17:25:50,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:25:50,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294028063] [2021-12-15 17:25:50,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:25:50,728 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:25:50,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:25:50,746 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:25:50,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:25:50,754 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:25:51,058 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 17:25:51,058 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 17:25:51,058 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 17:25:51,059 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 17:25:51,059 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 17:25:51,059 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:51,059 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 17:25:51,059 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 17:25:51,059 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration6_Lasso [2021-12-15 17:25:51,059 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 17:25:51,059 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 17:25:51,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:51,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2021-12-15 17:25:51,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:51,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:51,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:51,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:51,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:51,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:51,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:51,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:51,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:51,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:51,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:51,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:51,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:51,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:51,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:51,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:51,603 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 17:25:51,603 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 17:25:51,604 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:51,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:51,604 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:25:51,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2021-12-15 17:25:51,607 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 [2021-12-15 17:25:51,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:51,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:25:51,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:51,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:51,614 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:25:51,614 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:25:51,626 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:25:51,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2021-12-15 17:25:51,641 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:51,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:51,642 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:25:51,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2021-12-15 17:25:51,644 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 [2021-12-15 17:25:51,650 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:51,650 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:25:51,650 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:25:51,650 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:51,650 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:51,650 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:25:51,650 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:25:51,651 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:25:51,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2021-12-15 17:25:51,666 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:51,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:51,667 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:25:51,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2021-12-15 17:25:51,669 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 [2021-12-15 17:25:51,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:51,674 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:25:51,675 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:25:51,675 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:51,675 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:51,675 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:25:51,675 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:25:51,690 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:25:51,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2021-12-15 17:25:51,705 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:51,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:51,706 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:25:51,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2021-12-15 17:25:51,708 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 [2021-12-15 17:25:51,714 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:51,714 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:25:51,714 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:51,714 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:51,721 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:25:51,721 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:25:51,723 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:25:51,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2021-12-15 17:25:51,741 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:51,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:51,741 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:25:51,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2021-12-15 17:25:51,747 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 [2021-12-15 17:25:51,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:51,753 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:25:51,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:25:51,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:51,753 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:51,753 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:25:51,753 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:25:51,754 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:25:51,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2021-12-15 17:25:51,771 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:51,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:51,773 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) [2021-12-15 17:25:51,774 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 [2021-12-15 17:25:51,775 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 [2021-12-15 17:25:51,781 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:51,782 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:25:51,782 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:25:51,782 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:51,782 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:51,782 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:25:51,782 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:25:51,783 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:25:51,798 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 [2021-12-15 17:25:51,798 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:51,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:51,799 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) [2021-12-15 17:25:51,801 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 [2021-12-15 17:25:51,804 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 [2021-12-15 17:25:51,809 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:51,810 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:25:51,810 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:51,810 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:51,811 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:25:51,811 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:25:51,823 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:25:51,839 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 [2021-12-15 17:25:51,839 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:51,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:51,840 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) [2021-12-15 17:25:51,841 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 [2021-12-15 17:25:51,842 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 [2021-12-15 17:25:51,847 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:51,848 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:25:51,848 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:51,848 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:51,849 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:25:51,849 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:25:51,850 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:25:51,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2021-12-15 17:25:51,865 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:51,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:51,866 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) [2021-12-15 17:25:51,867 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 [2021-12-15 17:25:51,868 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 [2021-12-15 17:25:51,873 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:51,874 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:25:51,874 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:25:51,874 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:51,874 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:51,874 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:25:51,874 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:25:51,875 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:25:51,890 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 [2021-12-15 17:25:51,890 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:51,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:51,891 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) [2021-12-15 17:25:51,891 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 [2021-12-15 17:25:51,893 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 [2021-12-15 17:25:51,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:51,898 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:25:51,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:25:51,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:51,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:51,898 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:25:51,898 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:25:51,899 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:25:51,914 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 [2021-12-15 17:25:51,914 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:51,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:51,915 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) [2021-12-15 17:25:51,915 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 [2021-12-15 17:25:51,916 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 [2021-12-15 17:25:51,922 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:51,922 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:25:51,922 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:51,922 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:51,925 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:25:51,925 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:25:51,947 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:25:51,962 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 [2021-12-15 17:25:51,963 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:51,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:51,963 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) [2021-12-15 17:25:51,964 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 [2021-12-15 17:25:51,966 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 [2021-12-15 17:25:51,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:51,972 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:25:51,972 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:51,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:51,975 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:25:51,975 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:25:51,990 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:25:52,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2021-12-15 17:25:52,005 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:52,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:52,006 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) [2021-12-15 17:25:52,007 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 [2021-12-15 17:25:52,009 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 [2021-12-15 17:25:52,015 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:52,015 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:25:52,015 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:52,015 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:52,026 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:25:52,026 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:25:52,035 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 17:25:52,061 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2021-12-15 17:25:52,061 INFO L444 ModelExtractionUtils]: 30 out of 40 variables were initially zero. Simplification set additionally 6 variables to zero. [2021-12-15 17:25:52,061 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:52,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:52,072 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) [2021-12-15 17:25:52,073 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 [2021-12-15 17:25:52,074 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 17:25:52,089 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-15 17:25:52,089 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 17:25:52,089 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~i~0#1, ULTIMATE.start_sort_~x#1.offset, v_rep(select #length ULTIMATE.start_sort_~x#1.base)_2) = -4*ULTIMATE.start_sort_~i~0#1 - 1*ULTIMATE.start_sort_~x#1.offset + 1*v_rep(select #length ULTIMATE.start_sort_~x#1.base)_2 Supporting invariants [] [2021-12-15 17:25:52,107 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 [2021-12-15 17:25:52,119 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2021-12-15 17:25:52,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:25:52,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:25:52,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-15 17:25:52,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:25:52,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:25:52,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-15 17:25:52,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:25:52,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:25:52,194 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 [2021-12-15 17:25:52,194 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 26 transitions. cyclomatic complexity: 9 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:25:52,208 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 26 transitions. cyclomatic complexity: 9. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 36 states and 50 transitions. Complement of second has 7 states. [2021-12-15 17:25:52,208 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 [2021-12-15 17:25:52,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:25:52,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2021-12-15 17:25:52,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 3 letters. [2021-12-15 17:25:52,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:25:52,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 14 letters. Loop has 3 letters. [2021-12-15 17:25:52,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:25:52,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 6 letters. [2021-12-15 17:25:52,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:25:52,211 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 50 transitions. [2021-12-15 17:25:52,213 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-15 17:25:52,214 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 26 states and 34 transitions. [2021-12-15 17:25:52,214 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-12-15 17:25:52,214 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2021-12-15 17:25:52,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 34 transitions. [2021-12-15 17:25:52,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:25:52,215 INFO L681 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2021-12-15 17:25:52,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 34 transitions. [2021-12-15 17:25:52,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2021-12-15 17:25:52,216 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) [2021-12-15 17:25:52,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2021-12-15 17:25:52,216 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2021-12-15 17:25:52,216 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2021-12-15 17:25:52,216 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-15 17:25:52,216 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2021-12-15 17:25:52,219 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-15 17:25:52,219 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:25:52,219 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:25:52,221 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:25:52,221 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 17:25:52,221 INFO L791 eck$LassoCheckResult]: Stem: 614#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 615#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 618#L523 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 619#L523-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 620#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 621#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 622#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 623#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 633#L528-3 assume !(main_~i~1#1 < main_~array_size~0#1); 616#L528-4 assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 617#L515-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 626#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 627#L517 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 631#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 632#L516-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 629#L515-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 628#L515-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 624#L516-3 [2021-12-15 17:25:52,221 INFO L793 eck$LassoCheckResult]: Loop: 624#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 625#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 630#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 624#L516-3 [2021-12-15 17:25:52,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:25:52,222 INFO L85 PathProgramCache]: Analyzing trace with hash 221564791, now seen corresponding path program 1 times [2021-12-15 17:25:52,222 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:25:52,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635371665] [2021-12-15 17:25:52,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:25:52,223 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:25:52,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:25:52,274 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 17:25:52,274 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:25:52,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635371665] [2021-12-15 17:25:52,275 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635371665] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:25:52,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655405570] [2021-12-15 17:25:52,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:25:52,276 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:25:52,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:52,277 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 17:25:52,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2021-12-15 17:25:52,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:25:52,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-15 17:25:52,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:25:52,371 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 17:25:52,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:25:52,411 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 17:25:52,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655405570] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:25:52,412 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:25:52,412 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2021-12-15 17:25:52,412 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785061323] [2021-12-15 17:25:52,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:25:52,413 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:25:52,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:25:52,413 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 2 times [2021-12-15 17:25:52,413 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:25:52,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760967378] [2021-12-15 17:25:52,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:25:52,414 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:25:52,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:25:52,417 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:25:52,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:25:52,420 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:25:52,479 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:25:52,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-15 17:25:52,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-12-15 17:25:52,480 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. cyclomatic complexity: 8 Second operand has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:25:52,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:25:52,533 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2021-12-15 17:25:52,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-15 17:25:52,534 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2021-12-15 17:25:52,534 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-15 17:25:52,534 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 23 states and 28 transitions. [2021-12-15 17:25:52,534 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-12-15 17:25:52,534 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2021-12-15 17:25:52,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2021-12-15 17:25:52,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:25:52,535 INFO L681 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2021-12-15 17:25:52,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2021-12-15 17:25:52,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2021-12-15 17:25:52,535 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) [2021-12-15 17:25:52,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2021-12-15 17:25:52,536 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2021-12-15 17:25:52,536 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2021-12-15 17:25:52,536 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-12-15 17:25:52,536 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2021-12-15 17:25:52,536 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-15 17:25:52,536 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:25:52,536 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:25:52,537 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:25:52,537 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 17:25:52,537 INFO L791 eck$LassoCheckResult]: Stem: 782#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 783#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 784#L523 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 785#L523-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 788#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 789#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 790#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 791#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 801#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 803#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 802#L528-3 assume !(main_~i~1#1 < main_~array_size~0#1); 786#L528-4 assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 787#L515-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 794#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 795#L517 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 799#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 800#L516-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 796#L515-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 797#L515-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 792#L516-3 [2021-12-15 17:25:52,537 INFO L793 eck$LassoCheckResult]: Loop: 792#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 793#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 798#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 792#L516-3 [2021-12-15 17:25:52,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:25:52,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1850126805, now seen corresponding path program 2 times [2021-12-15 17:25:52,537 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:25:52,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688507372] [2021-12-15 17:25:52,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:25:52,538 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:25:52,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:25:52,587 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:25:52,587 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:25:52,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688507372] [2021-12-15 17:25:52,587 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688507372] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:25:52,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142851419] [2021-12-15 17:25:52,588 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 17:25:52,588 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:25:52,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:52,589 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 17:25:52,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2021-12-15 17:25:52,632 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 17:25:52,633 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 17:25:52,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-15 17:25:52,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:25:52,677 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-15 17:25:52,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:25:52,698 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-15 17:25:52,698 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142851419] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:25:52,699 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:25:52,699 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 13 [2021-12-15 17:25:52,699 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367726073] [2021-12-15 17:25:52,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:25:52,699 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:25:52,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:25:52,700 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 3 times [2021-12-15 17:25:52,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:25:52,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947976494] [2021-12-15 17:25:52,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:25:52,700 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:25:52,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:25:52,703 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:25:52,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:25:52,708 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:25:52,750 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 [2021-12-15 17:25:52,783 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:25:52,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-15 17:25:52,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-12-15 17:25:52,784 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 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) [2021-12-15 17:25:52,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:25:52,925 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2021-12-15 17:25:52,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-15 17:25:52,926 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 58 transitions. [2021-12-15 17:25:52,926 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-15 17:25:52,927 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 43 states and 56 transitions. [2021-12-15 17:25:52,927 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2021-12-15 17:25:52,927 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2021-12-15 17:25:52,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 56 transitions. [2021-12-15 17:25:52,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:25:52,927 INFO L681 BuchiCegarLoop]: Abstraction has 43 states and 56 transitions. [2021-12-15 17:25:52,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 56 transitions. [2021-12-15 17:25:52,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 25. [2021-12-15 17:25:52,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 states have internal predecessors, (31), 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) [2021-12-15 17:25:52,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2021-12-15 17:25:52,929 INFO L704 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2021-12-15 17:25:52,929 INFO L587 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2021-12-15 17:25:52,929 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-12-15 17:25:52,929 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. [2021-12-15 17:25:52,929 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-15 17:25:52,929 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:25:52,929 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:25:52,930 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:25:52,930 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 17:25:52,930 INFO L791 eck$LassoCheckResult]: Stem: 993#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 994#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 995#L523 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 996#L523-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 999#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 1000#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1001#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 1002#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1012#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 1015#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1014#L528-3 assume !(main_~i~1#1 < main_~array_size~0#1); 997#L528-4 assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 998#L515-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 1007#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1017#L517 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 1011#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 1005#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1006#L517 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 1013#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 1016#L516-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 1009#L515-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 1008#L515-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 1003#L516-3 [2021-12-15 17:25:52,930 INFO L793 eck$LassoCheckResult]: Loop: 1003#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1004#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1010#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 1003#L516-3 [2021-12-15 17:25:52,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:25:52,930 INFO L85 PathProgramCache]: Analyzing trace with hash -135460634, now seen corresponding path program 3 times [2021-12-15 17:25:52,931 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:25:52,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209251728] [2021-12-15 17:25:52,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:25:52,931 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:25:52,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:25:52,940 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:25:52,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:25:52,948 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:25:52,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:25:52,948 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 4 times [2021-12-15 17:25:52,948 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:25:52,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572082498] [2021-12-15 17:25:52,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:25:52,949 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:25:52,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:25:52,952 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:25:52,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:25:52,954 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:25:52,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:25:52,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1761549573, now seen corresponding path program 1 times [2021-12-15 17:25:52,954 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:25:52,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929463893] [2021-12-15 17:25:52,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:25:52,955 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:25:52,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:25:53,121 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 17:25:53,121 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:25:53,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929463893] [2021-12-15 17:25:53,121 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929463893] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:25:53,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799736001] [2021-12-15 17:25:53,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:25:53,121 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:25:53,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:53,122 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 17:25:53,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2021-12-15 17:25:53,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:25:53,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-15 17:25:53,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:25:53,260 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-15 17:25:53,261 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 10 [2021-12-15 17:25:53,271 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-15 17:25:53,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:25:53,347 INFO L354 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2021-12-15 17:25:53,347 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 34 [2021-12-15 17:25:53,392 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-15 17:25:53,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799736001] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:25:53,392 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:25:53,392 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 7] total 21 [2021-12-15 17:25:53,392 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897645686] [2021-12-15 17:25:53,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:25:53,452 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:25:53,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-15 17:25:53,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2021-12-15 17:25:53,452 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. cyclomatic complexity: 9 Second operand has 21 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 21 states have internal predecessors, (48), 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) [2021-12-15 17:25:53,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:25:53,636 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2021-12-15 17:25:53,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-15 17:25:53,636 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 58 transitions. [2021-12-15 17:25:53,637 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-12-15 17:25:53,638 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 58 transitions. [2021-12-15 17:25:53,638 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2021-12-15 17:25:53,638 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2021-12-15 17:25:53,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 58 transitions. [2021-12-15 17:25:53,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:25:53,639 INFO L681 BuchiCegarLoop]: Abstraction has 45 states and 58 transitions. [2021-12-15 17:25:53,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 58 transitions. [2021-12-15 17:25:53,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2021-12-15 17:25:53,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 33 states have internal predecessors, (43), 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) [2021-12-15 17:25:53,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2021-12-15 17:25:53,641 INFO L704 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2021-12-15 17:25:53,641 INFO L587 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2021-12-15 17:25:53,641 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-12-15 17:25:53,641 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 43 transitions. [2021-12-15 17:25:53,641 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-15 17:25:53,641 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:25:53,641 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:25:53,642 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:25:53,642 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 17:25:53,642 INFO L791 eck$LassoCheckResult]: Stem: 1250#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1251#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 1252#L523 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 1253#L523-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 1256#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 1257#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1258#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 1259#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1272#L528-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 1277#L528-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1276#L528-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1254#L528-4 assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 1255#L515-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 1266#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1281#L517 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 1271#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 1262#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1263#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1274#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 1280#L516-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 1264#L515-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 1265#L515-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 1260#L516-3 [2021-12-15 17:25:53,642 INFO L793 eck$LassoCheckResult]: Loop: 1260#L516-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1261#L517 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1270#L516-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 1260#L516-3 [2021-12-15 17:25:53,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:25:53,643 INFO L85 PathProgramCache]: Analyzing trace with hash -137307676, now seen corresponding path program 2 times [2021-12-15 17:25:53,643 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:25:53,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505206795] [2021-12-15 17:25:53,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:25:53,643 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:25:53,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:25:53,651 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:25:53,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:25:53,659 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:25:53,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:25:53,660 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 5 times [2021-12-15 17:25:53,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:25:53,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975365838] [2021-12-15 17:25:53,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:25:53,660 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:25:53,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:25:53,663 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:25:53,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:25:53,665 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:25:53,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:25:53,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1724071097, now seen corresponding path program 3 times [2021-12-15 17:25:53,665 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:25:53,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721800363] [2021-12-15 17:25:53,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:25:53,665 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:25:53,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:25:53,675 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:25:53,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:25:53,686 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:25:54,395 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 17:25:54,396 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 17:25:54,396 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 17:25:54,396 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 17:25:54,396 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 17:25:54,396 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:54,396 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 17:25:54,396 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 17:25:54,396 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration10_Lasso [2021-12-15 17:25:54,396 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 17:25:54,396 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 17:25:54,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:54,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:54,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:54,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:54,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:54,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:54,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:54,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:54,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:54,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:54,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:54,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:54,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:54,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:54,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:54,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:54,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:55,087 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 17:25:55,087 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 17:25:55,087 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:55,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:55,089 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) [2021-12-15 17:25:55,089 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 [2021-12-15 17:25:55,090 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 [2021-12-15 17:25:55,096 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:55,096 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:25:55,096 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:55,096 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:55,097 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:25:55,097 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:25:55,099 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:25:55,114 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2021-12-15 17:25:55,114 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:55,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:55,115 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) [2021-12-15 17:25:55,115 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 [2021-12-15 17:25:55,118 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 [2021-12-15 17:25:55,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:55,123 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:25:55,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:25:55,123 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:55,123 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:55,123 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:25:55,123 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:25:55,124 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:25:55,141 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 [2021-12-15 17:25:55,141 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:55,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:55,142 INFO L229 MonitoredProcess]: Starting monitored process 35 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) [2021-12-15 17:25:55,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2021-12-15 17:25:55,144 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 [2021-12-15 17:25:55,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:55,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:25:55,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:55,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:55,151 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:25:55,151 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:25:55,159 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:25:55,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2021-12-15 17:25:55,178 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:55,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:55,179 INFO L229 MonitoredProcess]: Starting monitored process 36 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) [2021-12-15 17:25:55,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2021-12-15 17:25:55,181 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 [2021-12-15 17:25:55,186 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:55,186 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:25:55,186 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:25:55,186 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:55,186 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:55,186 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:25:55,186 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:25:55,187 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:25:55,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2021-12-15 17:25:55,202 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:55,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:55,203 INFO L229 MonitoredProcess]: Starting monitored process 37 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) [2021-12-15 17:25:55,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2021-12-15 17:25:55,205 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 [2021-12-15 17:25:55,210 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:55,210 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:25:55,210 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:25:55,210 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:55,210 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:55,210 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:25:55,210 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:25:55,211 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:25:55,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2021-12-15 17:25:55,226 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:55,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:55,227 INFO L229 MonitoredProcess]: Starting monitored process 38 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) [2021-12-15 17:25:55,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2021-12-15 17:25:55,228 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 [2021-12-15 17:25:55,233 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:55,234 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:25:55,234 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:25:55,234 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:55,234 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:55,234 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:25:55,234 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:25:55,235 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:25:55,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2021-12-15 17:25:55,250 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:55,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:55,251 INFO L229 MonitoredProcess]: Starting monitored process 39 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) [2021-12-15 17:25:55,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2021-12-15 17:25:55,258 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 [2021-12-15 17:25:55,264 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:55,264 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:25:55,264 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:25:55,264 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:55,264 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:55,264 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:25:55,264 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:25:55,265 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:25:55,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2021-12-15 17:25:55,282 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:55,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:55,283 INFO L229 MonitoredProcess]: Starting monitored process 40 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) [2021-12-15 17:25:55,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2021-12-15 17:25:55,286 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 [2021-12-15 17:25:55,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:55,291 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:25:55,291 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:55,291 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:55,292 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:25:55,292 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:25:55,294 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:25:55,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2021-12-15 17:25:55,309 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:55,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:55,309 INFO L229 MonitoredProcess]: Starting monitored process 41 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) [2021-12-15 17:25:55,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2021-12-15 17:25:55,311 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 [2021-12-15 17:25:55,316 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:55,316 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:25:55,316 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:25:55,317 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:55,317 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:55,317 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:25:55,317 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:25:55,317 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:25:55,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2021-12-15 17:25:55,332 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:55,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:55,333 INFO L229 MonitoredProcess]: Starting monitored process 42 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) [2021-12-15 17:25:55,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2021-12-15 17:25:55,334 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 [2021-12-15 17:25:55,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:55,340 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:25:55,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:25:55,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:55,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:55,340 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:25:55,340 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:25:55,341 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:25:55,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2021-12-15 17:25:55,356 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:55,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:55,357 INFO L229 MonitoredProcess]: Starting monitored process 43 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) [2021-12-15 17:25:55,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2021-12-15 17:25:55,359 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 [2021-12-15 17:25:55,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:55,364 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:25:55,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:55,364 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:55,365 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:25:55,365 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:25:55,367 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:25:55,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2021-12-15 17:25:55,382 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:55,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:55,383 INFO L229 MonitoredProcess]: Starting monitored process 44 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) [2021-12-15 17:25:55,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2021-12-15 17:25:55,385 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 [2021-12-15 17:25:55,390 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:55,390 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:25:55,390 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:25:55,390 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:55,390 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:55,390 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:25:55,390 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:25:55,391 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:25:55,406 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2021-12-15 17:25:55,406 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:55,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:55,406 INFO L229 MonitoredProcess]: Starting monitored process 45 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) [2021-12-15 17:25:55,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2021-12-15 17:25:55,408 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 [2021-12-15 17:25:55,413 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:55,413 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:25:55,413 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:55,413 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:55,415 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:25:55,415 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:25:55,417 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:25:55,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2021-12-15 17:25:55,432 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:55,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:55,433 INFO L229 MonitoredProcess]: Starting monitored process 46 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) [2021-12-15 17:25:55,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2021-12-15 17:25:55,435 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 [2021-12-15 17:25:55,440 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:55,440 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:25:55,440 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:55,440 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:55,442 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:25:55,442 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:25:55,445 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:25:55,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2021-12-15 17:25:55,460 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:55,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:55,461 INFO L229 MonitoredProcess]: Starting monitored process 47 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) [2021-12-15 17:25:55,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2021-12-15 17:25:55,462 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 [2021-12-15 17:25:55,468 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:55,468 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:25:55,468 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:55,468 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:55,478 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:25:55,478 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:25:55,492 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:25:55,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2021-12-15 17:25:55,507 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:55,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:55,508 INFO L229 MonitoredProcess]: Starting monitored process 48 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) [2021-12-15 17:25:55,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2021-12-15 17:25:55,510 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 [2021-12-15 17:25:55,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:55,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:25:55,515 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:55,515 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:55,517 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:25:55,517 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:25:55,518 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:25:55,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2021-12-15 17:25:55,533 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:55,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:55,534 INFO L229 MonitoredProcess]: Starting monitored process 49 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) [2021-12-15 17:25:55,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2021-12-15 17:25:55,536 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 [2021-12-15 17:25:55,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:55,541 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:25:55,541 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:55,541 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:55,550 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:25:55,550 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:25:55,565 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 17:25:55,592 INFO L443 ModelExtractionUtils]: Simplification made 22 calls to the SMT solver. [2021-12-15 17:25:55,593 INFO L444 ModelExtractionUtils]: 9 out of 40 variables were initially zero. Simplification set additionally 25 variables to zero. [2021-12-15 17:25:55,593 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:55,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:55,594 INFO L229 MonitoredProcess]: Starting monitored process 50 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) [2021-12-15 17:25:55,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2021-12-15 17:25:55,596 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 17:25:55,602 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2021-12-15 17:25:55,602 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 17:25:55,602 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~i~0#1, v_rep(select #length ULTIMATE.start_sort_~x#1.base)_3) = -2*ULTIMATE.start_sort_~i~0#1 + 1*v_rep(select #length ULTIMATE.start_sort_~x#1.base)_3 Supporting invariants [-2*ULTIMATE.start_sort_~n#1 + 1*v_rep(select #length ULTIMATE.start_main_~numbers~0#1.base)_4 + 2*ULTIMATE.start_sort_~pass~0#1 >= 0] [2021-12-15 17:25:55,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2021-12-15 17:25:55,653 INFO L297 tatePredicateManager]: 19 out of 22 supporting invariants were superfluous and have been removed [2021-12-15 17:25:55,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:25:55,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:25:55,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-15 17:25:55,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:25:56,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:25:56,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-15 17:25:56,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:25:56,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:25:56,050 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.9 stem predicates 2 loop predicates [2021-12-15 17:25:56,050 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 43 transitions. cyclomatic complexity: 12 Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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) [2021-12-15 17:25:56,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2021-12-15 17:25:56,285 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 43 transitions. cyclomatic complexity: 12. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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) Result 58 states and 78 transitions. Complement of second has 14 states. [2021-12-15 17:25:56,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 8 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-15 17:25:56,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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) [2021-12-15 17:25:56,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 20 transitions. [2021-12-15 17:25:56,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 20 transitions. Stem has 22 letters. Loop has 3 letters. [2021-12-15 17:25:56,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:25:56,291 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-15 17:25:56,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:25:56,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:25:56,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-15 17:25:56,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:25:56,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:25:56,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-15 17:25:56,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:25:56,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:25:56,679 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.9 stem predicates 2 loop predicates [2021-12-15 17:25:56,680 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 43 transitions. cyclomatic complexity: 12 Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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) [2021-12-15 17:25:56,886 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 43 transitions. cyclomatic complexity: 12. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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) Result 58 states and 78 transitions. Complement of second has 14 states. [2021-12-15 17:25:56,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 8 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-15 17:25:56,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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) [2021-12-15 17:25:56,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 20 transitions. [2021-12-15 17:25:56,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 20 transitions. Stem has 22 letters. Loop has 3 letters. [2021-12-15 17:25:56,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:25:56,888 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-15 17:25:56,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:25:56,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:25:56,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-15 17:25:56,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:25:57,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:25:57,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-15 17:25:57,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:25:57,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:25:57,287 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.9 stem predicates 2 loop predicates [2021-12-15 17:25:57,288 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 43 transitions. cyclomatic complexity: 12 Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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) [2021-12-15 17:25:57,547 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 43 transitions. cyclomatic complexity: 12. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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) Result 69 states and 97 transitions. Complement of second has 18 states. [2021-12-15 17:25:57,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 9 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-15 17:25:57,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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) [2021-12-15 17:25:57,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 35 transitions. [2021-12-15 17:25:57,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 35 transitions. Stem has 22 letters. Loop has 3 letters. [2021-12-15 17:25:57,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:25:57,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 35 transitions. Stem has 25 letters. Loop has 3 letters. [2021-12-15 17:25:57,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:25:57,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 35 transitions. Stem has 22 letters. Loop has 6 letters. [2021-12-15 17:25:57,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:25:57,549 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 97 transitions. [2021-12-15 17:25:57,550 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-12-15 17:25:57,550 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 0 states and 0 transitions. [2021-12-15 17:25:57,550 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-12-15 17:25:57,550 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-12-15 17:25:57,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-12-15 17:25:57,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:25:57,550 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-15 17:25:57,550 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-15 17:25:57,550 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-15 17:25:57,550 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-12-15 17:25:57,550 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2021-12-15 17:25:57,550 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-12-15 17:25:57,551 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2021-12-15 17:25:57,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.12 05:25:57 BoogieIcfgContainer [2021-12-15 17:25:57,555 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-12-15 17:25:57,555 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-15 17:25:57,555 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-15 17:25:57,555 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-15 17:25:57,556 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:25:47" (3/4) ... [2021-12-15 17:25:57,557 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-15 17:25:57,557 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-15 17:25:57,558 INFO L158 Benchmark]: Toolchain (without parser) took 10868.93ms. Allocated memory was 86.0MB in the beginning and 163.6MB in the end (delta: 77.6MB). Free memory was 64.1MB in the beginning and 78.3MB in the end (delta: -14.2MB). Peak memory consumption was 63.6MB. Max. memory is 16.1GB. [2021-12-15 17:25:57,558 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 86.0MB. Free memory is still 60.9MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 17:25:57,558 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.01ms. Allocated memory is still 86.0MB. Free memory was 64.0MB in the beginning and 48.6MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-15 17:25:57,558 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.82ms. Allocated memory is still 86.0MB. Free memory was 48.6MB in the beginning and 46.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:25:57,558 INFO L158 Benchmark]: Boogie Preprocessor took 21.01ms. Allocated memory is still 86.0MB. Free memory was 46.6MB in the beginning and 45.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 17:25:57,559 INFO L158 Benchmark]: RCFGBuilder took 212.12ms. Allocated memory was 86.0MB in the beginning and 113.2MB in the end (delta: 27.3MB). Free memory was 45.4MB in the beginning and 89.6MB in the end (delta: -44.1MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. [2021-12-15 17:25:57,559 INFO L158 Benchmark]: BuchiAutomizer took 10341.74ms. Allocated memory was 113.2MB in the beginning and 163.6MB in the end (delta: 50.3MB). Free memory was 89.4MB in the beginning and 78.3MB in the end (delta: 11.1MB). Peak memory consumption was 61.2MB. Max. memory is 16.1GB. [2021-12-15 17:25:57,559 INFO L158 Benchmark]: Witness Printer took 2.28ms. Allocated memory is still 163.6MB. Free memory is still 78.3MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 17:25:57,560 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.13ms. Allocated memory is still 86.0MB. Free memory is still 60.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 262.01ms. Allocated memory is still 86.0MB. Free memory was 64.0MB in the beginning and 48.6MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.82ms. Allocated memory is still 86.0MB. Free memory was 48.6MB in the beginning and 46.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.01ms. Allocated memory is still 86.0MB. Free memory was 46.6MB in the beginning and 45.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 212.12ms. Allocated memory was 86.0MB in the beginning and 113.2MB in the end (delta: 27.3MB). Free memory was 45.4MB in the beginning and 89.6MB in the end (delta: -44.1MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. * BuchiAutomizer took 10341.74ms. Allocated memory was 113.2MB in the beginning and 163.6MB in the end (delta: 50.3MB). Free memory was 89.4MB in the beginning and 78.3MB in the end (delta: 11.1MB). Peak memory consumption was 61.2MB. Max. memory is 16.1GB. * Witness Printer took 2.28ms. Allocated memory is still 163.6MB. Free memory is still 78.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (6 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (array_size * sizeof(int))] + -2 * i and consists of 6 locations. One deterministic module has affine ranking function n + -1 * pass and consists of 3 locations. One deterministic module has affine ranking function -4 * i + -1 * x + unknown-#length-unknown[x] and consists of 4 locations. One nondeterministic module has affine ranking function -2 * i + unknown-#length-unknown[x] and consists of 12 locations. 6 modules have a trivial ranking function, the largest among these consists of 21 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.3s and 11 iterations. TraceHistogramMax:3. Analysis of lassos took 7.4s. Construction of modules took 0.3s. Büchi inclusion checks took 2.3s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 39 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 34 states and ocurred in iteration 9. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 353 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 351 mSDsluCounter, 390 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 280 mSDsCounter, 118 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 656 IncrementalHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 118 mSolverCounterUnsat, 110 mSDtfsCounter, 656 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU3 SILI1 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital235 mio100 ax109 hnf99 lsp87 ukn70 mio100 lsp59 div117 bol100 ite100 ukn100 eq166 hnf85 smp91 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 24ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2021-12-15 17:25:57,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2021-12-15 17:25:57,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2021-12-15 17:25:57,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2021-12-15 17:25:58,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2021-12-15 17:25:58,396 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 Writing output log to file Ultimate.log Result: TRUE