./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/java_BubbleSort-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-memory-alloca/java_BubbleSort-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash a88178fc87721f9fcc743f79bc2a47ff45a89438b0709780ae0f715015934520 --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 17:03:17,453 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 17:03:17,455 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 17:03:17,479 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 17:03:17,479 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 17:03:17,480 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 17:03:17,480 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 17:03:17,482 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 17:03:17,483 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 17:03:17,483 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 17:03:17,484 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 17:03:17,485 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 17:03:17,485 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 17:03:17,486 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 17:03:17,487 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 17:03:17,488 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 17:03:17,488 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 17:03:17,489 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 17:03:17,490 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 17:03:17,492 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 17:03:17,493 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 17:03:17,494 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 17:03:17,495 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 17:03:17,495 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 17:03:17,497 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 17:03:17,497 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 17:03:17,498 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 17:03:17,498 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 17:03:17,499 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 17:03:17,499 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 17:03:17,499 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 17:03:17,500 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 17:03:17,501 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 17:03:17,501 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 17:03:17,502 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 17:03:17,502 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 17:03:17,502 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 17:03:17,503 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 17:03:17,503 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 17:03:17,503 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 17:03:17,504 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 17:03:17,504 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2021-12-15 17:03:17,528 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 17:03:17,528 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 17:03:17,528 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 17:03:17,529 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 17:03:17,529 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 17:03:17,529 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 17:03:17,539 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 17:03:17,539 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-15 17:03:17,539 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-15 17:03:17,539 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-15 17:03:17,540 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-15 17:03:17,540 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-15 17:03:17,540 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-15 17:03:17,540 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 17:03:17,540 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 17:03:17,540 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 17:03:17,541 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 17:03:17,541 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-15 17:03:17,541 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-15 17:03:17,541 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-15 17:03:17,541 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 17:03:17,541 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-15 17:03:17,541 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 17:03:17,542 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-15 17:03:17,542 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 17:03:17,543 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 17:03:17,543 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 17:03:17,543 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 17:03:17,543 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 17:03:17,544 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-15 17:03:17,544 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a88178fc87721f9fcc743f79bc2a47ff45a89438b0709780ae0f715015934520 [2021-12-15 17:03:17,683 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 17:03:17,699 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 17:03:17,701 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 17:03:17,702 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 17:03:17,702 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 17:03:17,703 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/java_BubbleSort-alloca-2.i [2021-12-15 17:03:17,751 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81fc5b10f/5c33bc40af27406a9add0395a10fbfb2/FLAG02b577f7c [2021-12-15 17:03:18,194 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 17:03:18,195 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/java_BubbleSort-alloca-2.i [2021-12-15 17:03:18,209 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81fc5b10f/5c33bc40af27406a9add0395a10fbfb2/FLAG02b577f7c [2021-12-15 17:03:18,576 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81fc5b10f/5c33bc40af27406a9add0395a10fbfb2 [2021-12-15 17:03:18,578 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 17:03:18,578 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 17:03:18,583 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 17:03:18,583 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 17:03:18,585 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 17:03:18,586 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:03:18" (1/1) ... [2021-12-15 17:03:18,588 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20625a4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:03:18, skipping insertion in model container [2021-12-15 17:03:18,588 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:03:18" (1/1) ... [2021-12-15 17:03:18,595 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 17:03:18,616 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 17:03:18,858 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:03:18,863 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 17:03:18,904 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:03:18,924 INFO L208 MainTranslator]: Completed translation [2021-12-15 17:03:18,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:03:18 WrapperNode [2021-12-15 17:03:18,926 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 17:03:18,927 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 17:03:18,927 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 17:03:18,927 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 17:03:18,933 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:03:18" (1/1) ... [2021-12-15 17:03:18,947 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:03:18" (1/1) ... [2021-12-15 17:03:18,961 INFO L137 Inliner]: procedures = 111, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 62 [2021-12-15 17:03:18,962 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 17:03:18,962 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 17:03:18,962 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 17:03:18,963 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 17:03:18,967 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:03:18" (1/1) ... [2021-12-15 17:03:18,967 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:03:18" (1/1) ... [2021-12-15 17:03:18,980 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:03:18" (1/1) ... [2021-12-15 17:03:18,981 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:03:18" (1/1) ... [2021-12-15 17:03:18,984 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:03:18" (1/1) ... [2021-12-15 17:03:18,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:03:18" (1/1) ... [2021-12-15 17:03:18,993 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:03:18" (1/1) ... [2021-12-15 17:03:18,994 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 17:03:18,995 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 17:03:18,995 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 17:03:18,995 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 17:03:18,996 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:03:18" (1/1) ... [2021-12-15 17:03:19,000 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:19,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:19,016 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:03:19,019 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:03:19,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-15 17:03:19,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-15 17:03:19,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-15 17:03:19,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-15 17:03:19,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 17:03:19,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 17:03:19,098 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 17:03:19,099 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 17:03:19,170 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 17:03:19,173 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 17:03:19,173 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-15 17:03:19,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:03:19 BoogieIcfgContainer [2021-12-15 17:03:19,175 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 17:03:19,175 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-15 17:03:19,175 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-15 17:03:19,177 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-15 17:03:19,178 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:03:19,178 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.12 05:03:18" (1/3) ... [2021-12-15 17:03:19,179 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@55b0217b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:03:19, skipping insertion in model container [2021-12-15 17:03:19,179 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:03:19,179 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:03:18" (2/3) ... [2021-12-15 17:03:19,179 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@55b0217b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:03:19, skipping insertion in model container [2021-12-15 17:03:19,179 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:03:19,180 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:03:19" (3/3) ... [2021-12-15 17:03:19,180 INFO L388 chiAutomizerObserver]: Analyzing ICFG java_BubbleSort-alloca-2.i [2021-12-15 17:03:19,249 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-15 17:03:19,249 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-15 17:03:19,249 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-15 17:03:19,250 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-15 17:03:19,250 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-15 17:03:19,250 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-15 17:03:19,250 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-15 17:03:19,250 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-15 17:03:19,258 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:03:19,278 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2021-12-15 17:03:19,278 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:03:19,279 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:03:19,282 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-12-15 17:03:19,282 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:03:19,282 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-15 17:03:19,282 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:03:19,283 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2021-12-15 17:03:19,284 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:03:19,284 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:03:19,284 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-12-15 17:03:19,284 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:03:19,292 INFO L791 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~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#L558true assume !(main_~array_size~0#1 < 1); 8#L558-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; 15#L562-3true [2021-12-15 17:03:19,295 INFO L793 eck$LassoCheckResult]: Loop: 15#L562-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; 17#L562-2true main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 15#L562-3true [2021-12-15 17:03:19,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:03:19,302 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2021-12-15 17:03:19,311 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:03:19,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558122538] [2021-12-15 17:03:19,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:03:19,312 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:03:19,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:19,394 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:03:19,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:19,423 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:03:19,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:03:19,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2021-12-15 17:03:19,425 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:03:19,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046787357] [2021-12-15 17:03:19,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:03:19,426 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:03:19,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:19,440 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:03:19,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:19,450 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:03:19,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:03:19,452 INFO L85 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2021-12-15 17:03:19,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:03:19,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126181973] [2021-12-15 17:03:19,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:03:19,453 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:03:19,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:19,473 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:03:19,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:19,498 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:03:19,698 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 17:03:19,698 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 17:03:19,698 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 17:03:19,698 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 17:03:19,698 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 17:03:19,699 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:19,699 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 17:03:19,699 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 17:03:19,699 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-2.i_Iteration1_Lasso [2021-12-15 17:03:19,700 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 17:03:19,700 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 17:03:19,715 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:03:19,718 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:03:19,721 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:03:19,747 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:03:19,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:03:19,818 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:03:19,821 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:03:19,823 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:03:19,824 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:03:19,990 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 17:03:19,993 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 17:03:19,994 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:19,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:19,995 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:03:20,000 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:03:20,000 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:03:20,008 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:20,008 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:03:20,009 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:20,009 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:20,009 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:20,011 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:03:20,011 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:03:20,027 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:03:20,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-12-15 17:03:20,051 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:20,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:20,060 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:03:20,061 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:03:20,063 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:03:20,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:20,069 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:20,069 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:20,069 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:20,072 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:03:20,073 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:03:20,087 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:03:20,103 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:03:20,104 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:20,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:20,105 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:03:20,106 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:03:20,107 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:03:20,113 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:20,113 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:03:20,113 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:20,113 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:20,113 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:20,114 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:03:20,114 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:03:20,135 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:03:20,150 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:03:20,150 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:20,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:20,151 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:03:20,152 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:03:20,153 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:03:20,158 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:20,159 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:20,159 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:20,159 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:20,161 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:03:20,161 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:03:20,179 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:03:20,196 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:03:20,196 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:20,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:20,197 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:03:20,218 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:03:20,218 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:03:20,224 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:20,224 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:03:20,224 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:20,224 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:20,224 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:20,224 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:03:20,224 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:03:20,225 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:03:20,240 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:03:20,240 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:20,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:20,242 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:03:20,243 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:03:20,245 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:03:20,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:20,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:20,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:20,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:20,273 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:03:20,273 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:03:20,278 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:03:20,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2021-12-15 17:03:20,306 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:20,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:20,307 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:03:20,342 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:03:20,347 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:03:20,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:20,350 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:20,350 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:20,350 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:20,354 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:03:20,354 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:03:20,369 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:03:20,385 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:03:20,385 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:20,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:20,387 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:03:20,393 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:03:20,407 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:03:20,413 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:20,413 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:20,413 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:20,413 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:20,415 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:03:20,415 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:03:20,418 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:03:20,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2021-12-15 17:03:20,439 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:20,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:20,440 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:03:20,441 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:03:20,448 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:03:20,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:20,454 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:03:20,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:20,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:20,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:20,455 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:03:20,455 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:03:20,471 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:03:20,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-12-15 17:03:20,486 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:20,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:20,520 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:03:20,521 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:03:20,522 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:03:20,528 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:20,529 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:20,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:20,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:20,534 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:03:20,534 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:03:20,550 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 17:03:20,570 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2021-12-15 17:03:20,570 INFO L444 ModelExtractionUtils]: 8 out of 22 variables were initially zero. Simplification set additionally 9 variables to zero. [2021-12-15 17:03:20,571 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:20,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:20,587 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:03:20,588 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:03:20,590 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 17:03:20,616 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2021-12-15 17:03:20,616 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 17:03:20,617 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1#1, v_rep(select #length ULTIMATE.start_main_#t~malloc9#1.base)_1) = -2*ULTIMATE.start_main_~i~1#1 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc9#1.base)_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:03:20,635 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:03:20,644 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2021-12-15 17:03:20,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:03:20,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:03:20,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-15 17:03:20,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:03:20,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:03:20,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-15 17:03:20,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:03:20,754 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:03:20,781 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:03:20,782 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:03:20,845 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:03:20,846 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:03:20,849 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:03:20,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2021-12-15 17:03:20,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 4 letters. Loop has 2 letters. [2021-12-15 17:03:20,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:03:20,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 6 letters. Loop has 2 letters. [2021-12-15 17:03:20,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:03:20,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 4 letters. Loop has 4 letters. [2021-12-15 17:03:20,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:03:20,852 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 53 transitions. [2021-12-15 17:03:20,854 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-12-15 17:03:20,856 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 13 states and 18 transitions. [2021-12-15 17:03:20,857 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-12-15 17:03:20,857 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-12-15 17:03:20,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2021-12-15 17:03:20,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:03:20,858 INFO L681 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2021-12-15 17:03:20,908 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:03:20,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2021-12-15 17:03:20,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2021-12-15 17:03:20,914 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:03:20,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2021-12-15 17:03:20,915 INFO L704 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2021-12-15 17:03:20,915 INFO L587 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2021-12-15 17:03:20,915 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-15 17:03:20,915 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2021-12-15 17:03:20,916 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-12-15 17:03:20,916 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:03:20,916 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:03:20,916 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-12-15 17:03:20,916 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 17:03:20,917 INFO L791 eck$LassoCheckResult]: Stem: 123#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 124#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; 127#L558 assume !(main_~array_size~0#1 < 1); 128#L558-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; 131#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 121#L562-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; 122#L550-3 [2021-12-15 17:03:20,917 INFO L793 eck$LassoCheckResult]: Loop: 122#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 126#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 129#L550-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 122#L550-3 [2021-12-15 17:03:20,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:03:20,917 INFO L85 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2021-12-15 17:03:20,917 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:03:20,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022675786] [2021-12-15 17:03:20,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:03:20,918 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:03:20,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:03:20,959 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:03:20,959 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:03:20,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022675786] [2021-12-15 17:03:20,960 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022675786] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:03:20,960 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:03:20,960 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 17:03:20,961 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763711938] [2021-12-15 17:03:20,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:03:20,963 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:03:20,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:03:20,964 INFO L85 PathProgramCache]: Analyzing trace with hash 60779, now seen corresponding path program 1 times [2021-12-15 17:03:20,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:03:20,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598328214] [2021-12-15 17:03:20,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:03:20,964 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:03:20,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:03:20,994 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:03:20,995 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:03:20,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598328214] [2021-12-15 17:03:20,995 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598328214] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:03:20,995 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:03:20,995 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 17:03:20,995 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562130494] [2021-12-15 17:03:20,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:03:20,996 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:03:20,996 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:03:20,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:03:20,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:03:20,999 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:03:21,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:03:21,028 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2021-12-15 17:03:21,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:03:21,029 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2021-12-15 17:03:21,029 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-12-15 17:03:21,029 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2021-12-15 17:03:21,030 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2021-12-15 17:03:21,030 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2021-12-15 17:03:21,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2021-12-15 17:03:21,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:03:21,030 INFO L681 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2021-12-15 17:03:21,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2021-12-15 17:03:21,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2021-12-15 17:03:21,031 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:03:21,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2021-12-15 17:03:21,032 INFO L704 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2021-12-15 17:03:21,032 INFO L587 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2021-12-15 17:03:21,032 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-15 17:03:21,032 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2021-12-15 17:03:21,032 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-12-15 17:03:21,033 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:03:21,033 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:03:21,033 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-12-15 17:03:21,033 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-12-15 17:03:21,033 INFO L791 eck$LassoCheckResult]: Stem: 158#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 159#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; 162#L558 assume !(main_~array_size~0#1 < 1); 163#L558-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; 166#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 156#L562-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; 157#L550-3 [2021-12-15 17:03:21,034 INFO L793 eck$LassoCheckResult]: Loop: 157#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 164#L551-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); 165#L552 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); 160#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 161#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 169#L550-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 157#L550-3 [2021-12-15 17:03:21,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:03:21,034 INFO L85 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 2 times [2021-12-15 17:03:21,034 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:03:21,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577311949] [2021-12-15 17:03:21,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:03:21,035 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:03:21,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:03:21,068 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:03:21,068 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:03:21,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577311949] [2021-12-15 17:03:21,068 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577311949] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:03:21,069 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:03:21,069 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 17:03:21,069 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227438055] [2021-12-15 17:03:21,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:03:21,069 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:03:21,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:03:21,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1812321306, now seen corresponding path program 1 times [2021-12-15 17:03:21,069 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:03:21,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786079083] [2021-12-15 17:03:21,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:03:21,070 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:03:21,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:21,076 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:03:21,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:21,081 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:03:21,210 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:03:21,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 17:03:21,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-15 17:03:21,211 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:03:21,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:03:21,228 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2021-12-15 17:03:21,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 17:03:21,229 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2021-12-15 17:03:21,229 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-12-15 17:03:21,230 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 19 transitions. [2021-12-15 17:03:21,230 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2021-12-15 17:03:21,230 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2021-12-15 17:03:21,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2021-12-15 17:03:21,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:03:21,230 INFO L681 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2021-12-15 17:03:21,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2021-12-15 17:03:21,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2021-12-15 17:03:21,231 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:03:21,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2021-12-15 17:03:21,232 INFO L704 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2021-12-15 17:03:21,232 INFO L587 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2021-12-15 17:03:21,232 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-15 17:03:21,232 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2021-12-15 17:03:21,232 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-12-15 17:03:21,232 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:03:21,232 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:03:21,233 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:03:21,233 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-12-15 17:03:21,233 INFO L791 eck$LassoCheckResult]: Stem: 194#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 195#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; 198#L558 assume !(main_~array_size~0#1 < 1); 199#L558-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; 202#L562-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; 203#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 204#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 192#L562-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; 193#L550-3 [2021-12-15 17:03:21,233 INFO L793 eck$LassoCheckResult]: Loop: 193#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 200#L551-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); 201#L552 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); 196#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 197#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 205#L550-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 193#L550-3 [2021-12-15 17:03:21,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:03:21,233 INFO L85 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2021-12-15 17:03:21,234 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:03:21,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283942677] [2021-12-15 17:03:21,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:03:21,234 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:03:21,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:21,243 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:03:21,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:21,252 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:03:21,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:03:21,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1812321306, now seen corresponding path program 2 times [2021-12-15 17:03:21,252 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:03:21,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387270836] [2021-12-15 17:03:21,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:03:21,253 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:03:21,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:21,259 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:03:21,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:21,265 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:03:21,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:03:21,265 INFO L85 PathProgramCache]: Analyzing trace with hash -256077176, now seen corresponding path program 1 times [2021-12-15 17:03:21,266 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:03:21,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006996500] [2021-12-15 17:03:21,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:03:21,266 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:03:21,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:03:21,351 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:03:21,351 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:03:21,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006996500] [2021-12-15 17:03:21,351 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006996500] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:03:21,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006566940] [2021-12-15 17:03:21,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:03:21,352 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:03:21,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:21,372 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:03:21,373 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:03:21,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:03:21,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-15 17:03:21,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:03:21,468 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:03:21,468 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:03:21,497 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:03:21,497 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006566940] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:03:21,497 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:03:21,497 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2021-12-15 17:03:21,497 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474485] [2021-12-15 17:03:21,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:03:21,603 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:03:21,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-15 17:03:21,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-12-15 17:03:21,605 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:03:21,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:03:21,675 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2021-12-15 17:03:21,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-15 17:03:21,675 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 28 transitions. [2021-12-15 17:03:21,676 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-12-15 17:03:21,676 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 17 states and 20 transitions. [2021-12-15 17:03:21,676 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2021-12-15 17:03:21,676 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2021-12-15 17:03:21,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 20 transitions. [2021-12-15 17:03:21,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:03:21,677 INFO L681 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2021-12-15 17:03:21,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 20 transitions. [2021-12-15 17:03:21,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2021-12-15 17:03:21,678 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:03:21,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2021-12-15 17:03:21,678 INFO L704 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2021-12-15 17:03:21,678 INFO L587 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2021-12-15 17:03:21,678 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-15 17:03:21,678 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2021-12-15 17:03:21,678 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-12-15 17:03:21,678 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:03:21,678 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:03:21,678 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2021-12-15 17:03:21,679 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-12-15 17:03:21,679 INFO L791 eck$LassoCheckResult]: Stem: 332#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 333#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; 336#L558 assume !(main_~array_size~0#1 < 1); 337#L558-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; 340#L562-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; 341#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 342#L562-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; 343#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 345#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 330#L562-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; 331#L550-3 [2021-12-15 17:03:21,679 INFO L793 eck$LassoCheckResult]: Loop: 331#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 338#L551-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); 339#L552 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); 334#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 335#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 344#L550-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 331#L550-3 [2021-12-15 17:03:21,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:03:21,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1899756335, now seen corresponding path program 2 times [2021-12-15 17:03:21,679 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:03:21,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430655555] [2021-12-15 17:03:21,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:03:21,679 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:03:21,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:21,686 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:03:21,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:21,692 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:03:21,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:03:21,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1812321306, now seen corresponding path program 3 times [2021-12-15 17:03:21,693 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:03:21,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563559855] [2021-12-15 17:03:21,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:03:21,693 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:03:21,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:21,697 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:03:21,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:21,701 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:03:21,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:03:21,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1808202986, now seen corresponding path program 2 times [2021-12-15 17:03:21,701 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:03:21,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143370031] [2021-12-15 17:03:21,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:03:21,702 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:03:21,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:21,712 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:03:21,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:21,722 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:03:22,027 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 17:03:22,028 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 17:03:22,028 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 17:03:22,028 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 17:03:22,028 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 17:03:22,028 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:22,028 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 17:03:22,028 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 17:03:22,028 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-2.i_Iteration5_Lasso [2021-12-15 17:03:22,028 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 17:03:22,028 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 17:03:22,030 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:03:22,200 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:03:22,202 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:03:22,205 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:03:22,206 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:03:22,208 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:03:22,209 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:03:22,211 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:03:22,213 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:03:22,215 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:03:22,216 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:03:22,218 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:03:22,219 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:03:22,221 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:03:22,222 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:03:22,224 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:03:22,465 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 17:03:22,465 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 17:03:22,465 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:22,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:22,466 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:03:22,469 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:03:22,502 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:03:22,509 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:22,510 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:22,510 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:22,510 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:22,539 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:03:22,539 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:03:22,551 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 17:03:22,618 INFO L443 ModelExtractionUtils]: Simplification made 21 calls to the SMT solver. [2021-12-15 17:03:22,618 INFO L444 ModelExtractionUtils]: 11 out of 43 variables were initially zero. Simplification set additionally 29 variables to zero. [2021-12-15 17:03:22,619 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:22,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:22,620 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:03:22,622 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:03:22,624 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 17:03:22,630 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-15 17:03:22,630 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 17:03:22,631 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:03:22,649 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:03:22,664 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2021-12-15 17:03:22,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:03:22,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:03:22,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-15 17:03:22,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:03:22,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:03:22,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-15 17:03:22,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:03:22,732 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:03:22,732 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:03:22,732 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:03:22,740 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:03:22,740 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:03:22,741 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:03:22,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2021-12-15 17:03:22,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 6 letters. [2021-12-15 17:03:22,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:03:22,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 16 letters. Loop has 6 letters. [2021-12-15 17:03:22,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:03:22,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 12 letters. [2021-12-15 17:03:22,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:03:22,741 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 28 transitions. [2021-12-15 17:03:22,742 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-15 17:03:22,742 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 21 states and 27 transitions. [2021-12-15 17:03:22,742 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-12-15 17:03:22,742 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-12-15 17:03:22,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2021-12-15 17:03:22,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:03:22,742 INFO L681 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2021-12-15 17:03:22,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2021-12-15 17:03:22,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2021-12-15 17:03:22,743 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:03:22,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2021-12-15 17:03:22,744 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2021-12-15 17:03:22,744 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2021-12-15 17:03:22,744 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-15 17:03:22,744 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2021-12-15 17:03:22,744 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-15 17:03:22,744 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:03:22,744 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:03:22,744 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:03:22,744 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 17:03:22,744 INFO L791 eck$LassoCheckResult]: Stem: 466#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 467#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; 472#L558 assume !(main_~array_size~0#1 < 1); 473#L558-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; 478#L562-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; 479#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 480#L562-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; 481#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 483#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 464#L562-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; 465#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 469#L551-3 [2021-12-15 17:03:22,744 INFO L793 eck$LassoCheckResult]: Loop: 469#L551-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); 474#L552 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); 468#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 469#L551-3 [2021-12-15 17:03:22,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:03:22,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 1 times [2021-12-15 17:03:22,745 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:03:22,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762179403] [2021-12-15 17:03:22,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:03:22,745 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:03:22,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:22,752 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:03:22,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:22,757 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:03:22,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:03:22,757 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 1 times [2021-12-15 17:03:22,758 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:03:22,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123009092] [2021-12-15 17:03:22,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:03:22,758 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:03:22,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:22,761 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:03:22,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:22,763 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:03:22,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:03:22,763 INFO L85 PathProgramCache]: Analyzing trace with hash -793648259, now seen corresponding path program 1 times [2021-12-15 17:03:22,764 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:03:22,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260252877] [2021-12-15 17:03:22,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:03:22,764 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:03:22,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:22,771 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:03:22,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:22,778 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:03:23,068 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 17:03:23,068 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 17:03:23,068 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 17:03:23,068 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 17:03:23,068 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 17:03:23,068 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:23,068 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 17:03:23,068 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 17:03:23,068 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-2.i_Iteration6_Lasso [2021-12-15 17:03:23,081 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 17:03:23,081 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 17:03:23,083 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:03:23,100 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:03:23,102 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:03:23,103 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:03:23,105 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:03:23,107 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:03:23,108 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:03:23,110 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:03:23,111 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:03:23,113 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:03:23,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:03:23,116 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:03:23,289 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:03:23,291 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:03:23,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:03:23,293 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:03:23,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:03:23,296 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:03:23,522 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 17:03:23,522 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 17:03:23,522 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:23,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:23,523 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:03:23,530 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:03:23,531 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:03:23,537 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:23,537 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:23,537 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:23,537 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:23,539 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:03:23,539 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:03:23,541 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:03:23,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2021-12-15 17:03:23,557 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:23,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:23,557 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:03:23,558 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:03:23,559 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:03:23,565 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:23,565 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:03:23,565 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:23,565 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:23,565 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:23,567 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:03:23,567 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:03:23,576 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:03:23,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2021-12-15 17:03:23,591 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:23,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:23,592 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:03:23,593 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:03:23,595 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:03:23,600 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:23,600 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:03:23,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:23,600 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:23,600 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:23,601 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:03:23,601 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:03:23,602 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:03:23,616 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2021-12-15 17:03:23,617 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:23,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:23,618 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:03:23,618 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:03:23,620 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:03:23,625 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:23,625 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:23,625 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:23,626 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:23,627 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:03:23,627 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:03:23,635 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:03:23,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2021-12-15 17:03:23,650 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:23,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:23,651 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:03:23,656 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:03:23,661 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:23,662 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:03:23,662 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:23,662 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:23,662 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:23,662 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:03:23,662 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:03:23,674 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:03:23,674 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:03:23,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2021-12-15 17:03:23,692 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:23,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:23,693 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:03:23,695 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:03:23,696 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:03:23,701 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:23,701 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:03:23,701 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:23,702 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:23,702 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:23,702 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:03:23,702 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:03:23,706 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:03:23,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2021-12-15 17:03:23,721 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:23,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:23,722 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:03:23,724 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:03:23,725 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:03:23,730 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:23,730 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:23,730 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:23,730 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:23,751 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:03:23,751 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:03:23,753 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:03:23,769 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:03:23,769 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:23,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:23,770 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:03:23,771 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:03:23,772 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:03:23,777 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:23,777 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:23,777 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:23,777 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:23,779 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:03:23,779 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:03:23,795 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:03:23,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2021-12-15 17:03:23,812 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:23,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:23,813 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:03:23,814 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:03:23,816 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:03:23,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:23,821 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:03:23,822 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:23,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:23,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:23,822 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:03:23,822 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:03:23,837 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:03:23,852 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:03:23,852 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:23,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:23,853 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:03:23,854 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:03:23,856 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:03:23,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:23,861 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:03:23,861 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:23,861 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:23,861 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:23,862 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:03:23,862 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:03:23,872 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:03:23,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2021-12-15 17:03:23,889 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:23,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:23,890 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:03:23,894 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:03:23,895 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:03:23,900 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:23,901 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:23,901 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:23,901 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:23,906 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:03:23,906 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:03:23,911 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:03:23,928 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:03:23,928 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:23,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:23,929 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:03:23,929 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:03:23,931 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:03:23,937 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:23,937 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:23,937 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:23,937 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:23,950 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:03:23,950 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:03:23,962 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:03:23,977 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:03:23,978 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:23,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:23,979 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:03:23,980 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:03:23,981 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:03:23,988 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:23,988 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:23,988 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:23,988 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:24,006 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:03:24,006 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:03:24,030 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 17:03:24,057 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2021-12-15 17:03:24,057 INFO L444 ModelExtractionUtils]: 30 out of 40 variables were initially zero. Simplification set additionally 6 variables to zero. [2021-12-15 17:03:24,057 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:24,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:24,071 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:03:24,080 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:03:24,081 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 17:03:24,098 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-15 17:03:24,098 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 17:03:24,098 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:03:24,114 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:03:24,125 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2021-12-15 17:03:24,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:03:24,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:03:24,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-15 17:03:24,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:03:24,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:03:24,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-15 17:03:24,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:03:24,186 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:03:24,186 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:03:24,186 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:03:24,196 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:03:24,197 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:03:24,197 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:03:24,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2021-12-15 17:03:24,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 3 letters. [2021-12-15 17:03:24,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:03:24,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 14 letters. Loop has 3 letters. [2021-12-15 17:03:24,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:03:24,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 6 letters. [2021-12-15 17:03:24,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:03:24,198 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 50 transitions. [2021-12-15 17:03:24,198 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-15 17:03:24,199 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 26 states and 34 transitions. [2021-12-15 17:03:24,199 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-12-15 17:03:24,199 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2021-12-15 17:03:24,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 34 transitions. [2021-12-15 17:03:24,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:03:24,199 INFO L681 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2021-12-15 17:03:24,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 34 transitions. [2021-12-15 17:03:24,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2021-12-15 17:03:24,200 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:03:24,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2021-12-15 17:03:24,200 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2021-12-15 17:03:24,200 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2021-12-15 17:03:24,200 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-15 17:03:24,200 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2021-12-15 17:03:24,200 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-15 17:03:24,200 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:03:24,201 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:03:24,201 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:03:24,201 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 17:03:24,201 INFO L791 eck$LassoCheckResult]: Stem: 616#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 617#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; 622#L558 assume !(main_~array_size~0#1 < 1); 623#L558-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; 628#L562-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; 629#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 630#L562-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; 631#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 633#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 614#L562-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; 615#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 625#L551-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); 626#L552 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 620#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 621#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 632#L550-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 627#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 619#L551-3 [2021-12-15 17:03:24,201 INFO L793 eck$LassoCheckResult]: Loop: 619#L551-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); 624#L552 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); 618#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 619#L551-3 [2021-12-15 17:03:24,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:03:24,201 INFO L85 PathProgramCache]: Analyzing trace with hash 221564791, now seen corresponding path program 1 times [2021-12-15 17:03:24,201 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:03:24,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8456270] [2021-12-15 17:03:24,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:03:24,202 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:03:24,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:03:24,240 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:03:24,240 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:03:24,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8456270] [2021-12-15 17:03:24,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8456270] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:03:24,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724231823] [2021-12-15 17:03:24,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:03:24,240 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:03:24,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:24,267 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:03:24,268 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:03:24,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:03:24,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-15 17:03:24,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:03:24,364 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:03:24,401 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:03:24,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:03:24,440 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:03:24,440 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724231823] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:03:24,440 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:03:24,440 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2021-12-15 17:03:24,440 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976450707] [2021-12-15 17:03:24,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:03:24,440 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:03:24,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:03:24,441 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 2 times [2021-12-15 17:03:24,441 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:03:24,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599191142] [2021-12-15 17:03:24,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:03:24,441 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:03:24,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:24,444 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:03:24,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:24,447 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:03:24,504 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:03:24,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-15 17:03:24,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-12-15 17:03:24,505 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:03:24,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:03:24,556 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2021-12-15 17:03:24,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-15 17:03:24,557 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2021-12-15 17:03:24,557 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-15 17:03:24,557 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 23 states and 28 transitions. [2021-12-15 17:03:24,557 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-12-15 17:03:24,558 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2021-12-15 17:03:24,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2021-12-15 17:03:24,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:03:24,558 INFO L681 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2021-12-15 17:03:24,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2021-12-15 17:03:24,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2021-12-15 17:03:24,559 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:03:24,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2021-12-15 17:03:24,559 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2021-12-15 17:03:24,559 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2021-12-15 17:03:24,559 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-12-15 17:03:24,559 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2021-12-15 17:03:24,559 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-15 17:03:24,559 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:03:24,559 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:03:24,560 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:03:24,560 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 17:03:24,560 INFO L791 eck$LassoCheckResult]: Stem: 784#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 785#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; 790#L558 assume !(main_~array_size~0#1 < 1); 791#L558-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; 796#L562-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; 797#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 798#L562-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; 799#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 801#L562-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#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 802#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 782#L562-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; 783#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 793#L551-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); 794#L552 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 788#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 789#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 800#L550-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 795#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 787#L551-3 [2021-12-15 17:03:24,560 INFO L793 eck$LassoCheckResult]: Loop: 787#L551-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); 792#L552 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); 786#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 787#L551-3 [2021-12-15 17:03:24,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:03:24,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1850126805, now seen corresponding path program 2 times [2021-12-15 17:03:24,560 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:03:24,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127935694] [2021-12-15 17:03:24,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:03:24,560 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:03:24,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:03:24,620 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:03:24,620 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:03:24,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127935694] [2021-12-15 17:03:24,620 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127935694] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:03:24,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868555282] [2021-12-15 17:03:24,620 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 17:03:24,620 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:03:24,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:24,621 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:03:24,622 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:03:24,663 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 17:03:24,664 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 17:03:24,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-15 17:03:24,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:03:24,715 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:03:24,715 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:03:24,738 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:03:24,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868555282] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:03:24,739 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:03:24,739 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 13 [2021-12-15 17:03:24,739 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569667379] [2021-12-15 17:03:24,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:03:24,739 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:03:24,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:03:24,739 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 3 times [2021-12-15 17:03:24,739 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:03:24,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890487211] [2021-12-15 17:03:24,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:03:24,740 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:03:24,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:24,742 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:03:24,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:24,745 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:03:24,807 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:03:24,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-15 17:03:24,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-12-15 17:03:24,808 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:03:24,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:03:24,956 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2021-12-15 17:03:24,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-15 17:03:24,956 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 58 transitions. [2021-12-15 17:03:24,957 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-15 17:03:24,957 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 43 states and 56 transitions. [2021-12-15 17:03:24,957 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2021-12-15 17:03:24,957 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2021-12-15 17:03:24,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 56 transitions. [2021-12-15 17:03:24,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:03:24,958 INFO L681 BuchiCegarLoop]: Abstraction has 43 states and 56 transitions. [2021-12-15 17:03:24,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 56 transitions. [2021-12-15 17:03:24,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 25. [2021-12-15 17:03:24,959 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:03:24,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2021-12-15 17:03:24,959 INFO L704 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2021-12-15 17:03:24,959 INFO L587 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2021-12-15 17:03:24,959 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-12-15 17:03:24,959 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. [2021-12-15 17:03:24,959 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-15 17:03:24,959 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:03:24,959 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:03:24,960 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:03:24,960 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 17:03:24,960 INFO L791 eck$LassoCheckResult]: Stem: 995#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 996#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; 1001#L558 assume !(main_~array_size~0#1 < 1); 1002#L558-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; 1007#L562-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; 1008#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1009#L562-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; 1010#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1013#L562-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#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1014#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 993#L562-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; 994#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 1005#L551-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#L552 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 999#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 1000#L551-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#L552 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 1011#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 1016#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 1012#L550-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 1006#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 998#L551-3 [2021-12-15 17:03:24,960 INFO L793 eck$LassoCheckResult]: Loop: 998#L551-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); 1003#L552 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); 997#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 998#L551-3 [2021-12-15 17:03:24,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:03:24,960 INFO L85 PathProgramCache]: Analyzing trace with hash -135460634, now seen corresponding path program 3 times [2021-12-15 17:03:24,960 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:03:24,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737808288] [2021-12-15 17:03:24,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:03:24,961 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:03:24,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:24,976 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:03:24,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:24,984 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:03:24,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:03:24,985 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 4 times [2021-12-15 17:03:24,985 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:03:24,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212484178] [2021-12-15 17:03:24,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:03:24,985 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:03:24,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:24,987 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:03:24,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:24,989 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:03:24,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:03:24,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1761549573, now seen corresponding path program 1 times [2021-12-15 17:03:24,990 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:03:24,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675945715] [2021-12-15 17:03:24,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:03:24,990 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:03:24,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:03:25,194 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:03:25,194 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:03:25,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675945715] [2021-12-15 17:03:25,194 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675945715] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:03:25,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657655529] [2021-12-15 17:03:25,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:03:25,194 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:03:25,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:25,195 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:03:25,223 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:03:25,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:03:25,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 22 conjunts are in the unsatisfiable core [2021-12-15 17:03:25,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:03:25,393 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 17:03:25,393 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2021-12-15 17:03:25,403 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:03:25,403 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:03:25,478 INFO L354 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2021-12-15 17:03:25,479 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:03:25,532 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:03:25,532 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657655529] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:03:25,532 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:03:25,532 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 7] total 19 [2021-12-15 17:03:25,533 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125711321] [2021-12-15 17:03:25,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:03:25,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:03:25,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-15 17:03:25,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2021-12-15 17:03:25,617 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. cyclomatic complexity: 9 Second operand has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 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:03:25,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:03:25,811 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2021-12-15 17:03:25,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-15 17:03:25,811 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 58 transitions. [2021-12-15 17:03:25,812 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-12-15 17:03:25,813 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 58 transitions. [2021-12-15 17:03:25,813 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2021-12-15 17:03:25,813 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2021-12-15 17:03:25,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 58 transitions. [2021-12-15 17:03:25,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:03:25,813 INFO L681 BuchiCegarLoop]: Abstraction has 45 states and 58 transitions. [2021-12-15 17:03:25,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 58 transitions. [2021-12-15 17:03:25,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2021-12-15 17:03:25,815 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:03:25,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2021-12-15 17:03:25,815 INFO L704 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2021-12-15 17:03:25,815 INFO L587 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2021-12-15 17:03:25,815 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-12-15 17:03:25,815 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 43 transitions. [2021-12-15 17:03:25,816 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-15 17:03:25,816 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:03:25,816 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:03:25,816 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:03:25,816 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 17:03:25,816 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; 1256#L558 assume !(main_~array_size~0#1 < 1); 1257#L558-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; 1264#L562-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; 1265#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1266#L562-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; 1267#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1275#L562-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; 1274#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1273#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1248#L562-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; 1249#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 1260#L551-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); 1279#L552 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 1254#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 1255#L551-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); 1259#L552 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); 1271#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 1278#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 1268#L550-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 1269#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 1253#L551-3 [2021-12-15 17:03:25,816 INFO L793 eck$LassoCheckResult]: Loop: 1253#L551-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); 1258#L552 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); 1252#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 1253#L551-3 [2021-12-15 17:03:25,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:03:25,817 INFO L85 PathProgramCache]: Analyzing trace with hash -137307676, now seen corresponding path program 2 times [2021-12-15 17:03:25,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:03:25,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681739453] [2021-12-15 17:03:25,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:03:25,817 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:03:25,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:25,827 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:03:25,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:25,835 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:03:25,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:03:25,835 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 5 times [2021-12-15 17:03:25,835 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:03:25,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209871699] [2021-12-15 17:03:25,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:03:25,835 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:03:25,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:25,837 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:03:25,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:25,839 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:03:25,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:03:25,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1724071097, now seen corresponding path program 3 times [2021-12-15 17:03:25,840 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:03:25,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128284718] [2021-12-15 17:03:25,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:03:25,840 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:03:25,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:25,850 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:03:25,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:25,860 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:03:26,574 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 17:03:26,575 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 17:03:26,575 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 17:03:26,575 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 17:03:26,575 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 17:03:26,575 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:26,575 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 17:03:26,575 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 17:03:26,575 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-2.i_Iteration10_Lasso [2021-12-15 17:03:26,575 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 17:03:26,575 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 17:03:26,577 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:03:26,579 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:03:26,580 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:03:26,582 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:03:26,583 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:03:26,585 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:03:26,586 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:03:26,588 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:03:26,590 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:03:26,591 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:03:26,592 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:03:26,594 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:03:26,596 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:03:26,598 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:03:26,925 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:03:26,927 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:03:26,929 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:03:27,178 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 17:03:27,179 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 17:03:27,179 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:27,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:27,184 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:03:27,185 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:03:27,191 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:27,191 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:27,191 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:27,192 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:27,193 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:03:27,193 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:03:27,194 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:03:27,195 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:03:27,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2021-12-15 17:03:27,210 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:27,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:27,211 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:03:27,212 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:03:27,213 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:03:27,219 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:27,219 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:03:27,219 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:27,219 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:27,219 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:27,220 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:03:27,220 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:03:27,221 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:03:27,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2021-12-15 17:03:27,236 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:27,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:27,237 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:03:27,238 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:03:27,239 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:03:27,245 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:27,246 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:27,246 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:27,246 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:27,247 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:03:27,247 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:03:27,249 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:03:27,266 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:03:27,266 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:27,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:27,274 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:03:27,275 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:03:27,276 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:03:27,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:27,281 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:03:27,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:27,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:27,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:27,282 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:03:27,282 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:03:27,293 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:03:27,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2021-12-15 17:03:27,308 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:27,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:27,309 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:03:27,310 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:03:27,318 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:03:27,324 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:27,324 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:03:27,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:27,325 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:27,325 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:27,325 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:03:27,325 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:03:27,333 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:03:27,350 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:03:27,350 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:27,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:27,351 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:03:27,352 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:03:27,353 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:03:27,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:27,359 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:03:27,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:27,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:27,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:27,359 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:03:27,359 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:03:27,363 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:03:27,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2021-12-15 17:03:27,380 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:27,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:27,381 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:03:27,382 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:03:27,383 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:03:27,389 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:27,389 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:03:27,389 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:27,389 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:27,389 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:27,389 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:03:27,389 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:03:27,390 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:03:27,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2021-12-15 17:03:27,409 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:27,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:27,410 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:03:27,414 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:03:27,420 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:03:27,420 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:27,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:27,420 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:27,420 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:27,435 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:03:27,436 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:03:27,438 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:03:27,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2021-12-15 17:03:27,478 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:27,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:27,479 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:03:27,479 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:03:27,482 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:03:27,488 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:27,488 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:03:27,488 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:27,488 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:27,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:27,489 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:03:27,489 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:03:27,503 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:03:27,519 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:03:27,519 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:27,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:27,520 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:03:27,521 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:03:27,532 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:03:27,538 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:27,538 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:03:27,538 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:27,538 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:27,538 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:27,538 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:03:27,538 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:03:27,551 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:03:27,566 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:03:27,567 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:27,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:27,568 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:03:27,568 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:03:27,569 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:03:27,575 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:27,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:27,575 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:27,575 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:27,576 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:03:27,576 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:03:27,592 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:03:27,609 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:03:27,610 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:27,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:27,610 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:03:27,611 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:03:27,612 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:03:27,618 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:27,618 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:03:27,618 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:27,618 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:27,618 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:27,619 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:03:27,619 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:03:27,634 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:03:27,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2021-12-15 17:03:27,651 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:27,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:27,651 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:03:27,652 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:03:27,653 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:03:27,659 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:27,659 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:27,659 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:27,659 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:27,660 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:03:27,660 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:03:27,662 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:03:27,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2021-12-15 17:03:27,679 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:27,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:27,681 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:03:27,682 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:03:27,683 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:03:27,688 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:27,689 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:27,689 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:27,689 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:27,690 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:03:27,691 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:03:27,694 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:03:27,708 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:03:27,709 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:27,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:27,709 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:03:27,711 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:03:27,712 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:03:27,718 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:27,718 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:27,718 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:27,718 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:27,729 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:03:27,729 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:03:27,744 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:03:27,759 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2021-12-15 17:03:27,759 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:27,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:27,760 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:03:27,762 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:03:27,797 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:03:27,803 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:27,803 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:27,803 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:27,803 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:27,805 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:03:27,805 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:03:27,813 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:03:27,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2021-12-15 17:03:27,829 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:27,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:27,830 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:03:27,830 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:03:27,832 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:03:27,838 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:27,838 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:27,838 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:27,838 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:27,844 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:03:27,844 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:03:27,860 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 17:03:27,887 INFO L443 ModelExtractionUtils]: Simplification made 22 calls to the SMT solver. [2021-12-15 17:03:27,887 INFO L444 ModelExtractionUtils]: 9 out of 40 variables were initially zero. Simplification set additionally 25 variables to zero. [2021-12-15 17:03:27,887 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:27,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:27,908 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:03:27,909 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:03:27,910 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 17:03:27,917 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2021-12-15 17:03:27,917 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 17:03:27,917 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:03:27,933 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:03:27,970 INFO L297 tatePredicateManager]: 19 out of 22 supporting invariants were superfluous and have been removed [2021-12-15 17:03:27,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:03:28,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:03:28,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-15 17:03:28,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:03:28,319 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:03:28,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:03:28,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-15 17:03:28,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:03:28,384 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:03:28,384 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:03:28,385 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:03:28,598 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:03:28,599 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:03:28,599 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:03:28,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 20 transitions. [2021-12-15 17:03:28,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 20 transitions. Stem has 22 letters. Loop has 3 letters. [2021-12-15 17:03:28,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:03:28,600 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-15 17:03:28,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:03:28,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:03:28,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-15 17:03:28,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:03:28,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:03:28,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-15 17:03:28,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:03:28,975 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:03:28,975 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:03:28,975 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:03:29,170 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:03:29,171 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:03:29,171 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:03:29,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 20 transitions. [2021-12-15 17:03:29,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 20 transitions. Stem has 22 letters. Loop has 3 letters. [2021-12-15 17:03:29,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:03:29,171 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-15 17:03:29,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:03:29,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:03:29,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-15 17:03:29,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:03:29,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:03:29,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-15 17:03:29,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:03:29,557 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:03:29,558 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:03:29,558 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:03:29,830 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:03:29,830 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:03:29,831 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:03:29,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 35 transitions. [2021-12-15 17:03:29,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 35 transitions. Stem has 22 letters. Loop has 3 letters. [2021-12-15 17:03:29,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:03:29,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 35 transitions. Stem has 25 letters. Loop has 3 letters. [2021-12-15 17:03:29,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:03:29,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 35 transitions. Stem has 22 letters. Loop has 6 letters. [2021-12-15 17:03:29,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:03:29,832 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 97 transitions. [2021-12-15 17:03:29,832 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-12-15 17:03:29,832 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 0 states and 0 transitions. [2021-12-15 17:03:29,832 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-12-15 17:03:29,832 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-12-15 17:03:29,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-12-15 17:03:29,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:03:29,833 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-15 17:03:29,833 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-15 17:03:29,833 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-15 17:03:29,833 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-12-15 17:03:29,833 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2021-12-15 17:03:29,833 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-12-15 17:03:29,833 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2021-12-15 17:03:29,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.12 05:03:29 BoogieIcfgContainer [2021-12-15 17:03:29,837 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-12-15 17:03:29,837 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-15 17:03:29,837 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-15 17:03:29,837 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-15 17:03:29,838 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:03:19" (3/4) ... [2021-12-15 17:03:29,839 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-15 17:03:29,839 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-15 17:03:29,840 INFO L158 Benchmark]: Toolchain (without parser) took 11261.14ms. Allocated memory was 94.4MB in the beginning and 195.0MB in the end (delta: 100.7MB). Free memory was 63.7MB in the beginning and 103.6MB in the end (delta: -39.9MB). Peak memory consumption was 60.4MB. Max. memory is 16.1GB. [2021-12-15 17:03:29,840 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 94.4MB. Free memory is still 52.2MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 17:03:29,840 INFO L158 Benchmark]: CACSL2BoogieTranslator took 343.39ms. Allocated memory was 94.4MB in the beginning and 121.6MB in the end (delta: 27.3MB). Free memory was 63.7MB in the beginning and 92.4MB in the end (delta: -28.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-15 17:03:29,840 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.82ms. Allocated memory is still 121.6MB. Free memory was 92.4MB in the beginning and 90.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:03:29,840 INFO L158 Benchmark]: Boogie Preprocessor took 31.75ms. Allocated memory is still 121.6MB. Free memory was 90.3MB in the beginning and 89.0MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:03:29,840 INFO L158 Benchmark]: RCFGBuilder took 180.01ms. Allocated memory is still 121.6MB. Free memory was 89.0MB in the beginning and 78.6MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-15 17:03:29,840 INFO L158 Benchmark]: BuchiAutomizer took 10661.58ms. Allocated memory was 121.6MB in the beginning and 195.0MB in the end (delta: 73.4MB). Free memory was 78.6MB in the beginning and 104.7MB in the end (delta: -26.1MB). Peak memory consumption was 48.5MB. Max. memory is 16.1GB. [2021-12-15 17:03:29,841 INFO L158 Benchmark]: Witness Printer took 2.15ms. Allocated memory is still 195.0MB. Free memory was 104.7MB in the beginning and 103.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:03:29,842 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 94.4MB. Free memory is still 52.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 343.39ms. Allocated memory was 94.4MB in the beginning and 121.6MB in the end (delta: 27.3MB). Free memory was 63.7MB in the beginning and 92.4MB in the end (delta: -28.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.82ms. Allocated memory is still 121.6MB. Free memory was 92.4MB in the beginning and 90.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.75ms. Allocated memory is still 121.6MB. Free memory was 90.3MB in the beginning and 89.0MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 180.01ms. Allocated memory is still 121.6MB. Free memory was 89.0MB in the beginning and 78.6MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 10661.58ms. Allocated memory was 121.6MB in the beginning and 195.0MB in the end (delta: 73.4MB). Free memory was 78.6MB in the beginning and 104.7MB in the end (delta: -26.1MB). Peak memory consumption was 48.5MB. Max. memory is 16.1GB. * Witness Printer took 2.15ms. Allocated memory is still 195.0MB. Free memory was 104.7MB in the beginning and 103.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 -2 * i + unknown-#length-unknown[__builtin_alloca (array_size * sizeof(int))] 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 19 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.6s and 11 iterations. TraceHistogramMax:3. Analysis of lassos took 7.7s. 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, 339 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 337 mSDsluCounter, 391 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 281 mSDsCounter, 123 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 638 IncrementalHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 123 mSolverCounterUnsat, 110 mSDtfsCounter, 638 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU3 SILI1 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital233 mio100 ax109 hnf99 lsp87 ukn69 mio100 lsp59 div100 bol100 ite100 ukn100 eq170 hnf91 smp92 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 36ms 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:03:29,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2021-12-15 17:03:30,080 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:03:30,278 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:03:30,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-12-15 17:03:30,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE