./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/b.15-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml', '-i', '../sv-benchmarks/c/termination-memory-alloca/b.15-alloca.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(F end) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '64bit', '--witnessprinter.graph.data.programhash', '9da06905288f50cb44b9fcf3eb01ce9d3ae2a7ce975483c1902e3cc7a41605c5'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/b.15-alloca.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 9da06905288f50cb44b9fcf3eb01ce9d3ae2a7ce975483c1902e3cc7a41605c5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 23:52:05,428 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 23:52:05,545 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-07 23:52:05,550 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 23:52:05,551 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 23:52:05,571 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 23:52:05,572 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 23:52:05,572 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 23:52:05,572 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 23:52:05,573 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 23:52:05,574 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 23:52:05,574 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 23:52:05,574 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 23:52:05,574 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-07 23:52:05,574 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-07 23:52:05,574 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-07 23:52:05,574 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-07 23:52:05,574 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-07 23:52:05,574 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-07 23:52:05,574 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 23:52:05,574 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-07 23:52:05,574 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 23:52:05,574 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 23:52:05,575 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-07 23:52:05,575 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-07 23:52:05,575 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-07 23:52:05,575 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 23:52:05,575 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 23:52:05,575 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 23:52:05,575 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-07 23:52:05,575 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 23:52:05,575 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 23:52:05,575 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 23:52:05,575 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 23:52:05,575 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 23:52:05,575 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-07 23:52:05,575 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 9da06905288f50cb44b9fcf3eb01ce9d3ae2a7ce975483c1902e3cc7a41605c5 [2024-11-07 23:52:05,852 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 23:52:05,861 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 23:52:05,864 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 23:52:05,865 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 23:52:05,865 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 23:52:05,867 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/b.15-alloca.i [2024-11-07 23:52:07,130 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 23:52:07,417 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 23:52:07,418 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/b.15-alloca.i [2024-11-07 23:52:07,431 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ffd442b9f/30e9629e37594b2e8c29439d5dd1eb16/FLAGd4838c376 [2024-11-07 23:52:07,698 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ffd442b9f/30e9629e37594b2e8c29439d5dd1eb16 [2024-11-07 23:52:07,700 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 23:52:07,701 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 23:52:07,702 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 23:52:07,702 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 23:52:07,705 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 23:52:07,705 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:52:07" (1/1) ... [2024-11-07 23:52:07,706 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@aa0467d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:52:07, skipping insertion in model container [2024-11-07 23:52:07,706 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:52:07" (1/1) ... [2024-11-07 23:52:07,735 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 23:52:07,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 23:52:07,956 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 23:52:07,989 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 23:52:08,016 INFO L204 MainTranslator]: Completed translation [2024-11-07 23:52:08,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:52:08 WrapperNode [2024-11-07 23:52:08,018 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 23:52:08,019 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 23:52:08,019 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 23:52:08,019 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 23:52:08,024 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:52:08" (1/1) ... [2024-11-07 23:52:08,038 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:52:08" (1/1) ... [2024-11-07 23:52:08,056 INFO L138 Inliner]: procedures = 111, calls = 30, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 91 [2024-11-07 23:52:08,057 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 23:52:08,058 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 23:52:08,058 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 23:52:08,058 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 23:52:08,065 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:52:08" (1/1) ... [2024-11-07 23:52:08,065 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:52:08" (1/1) ... [2024-11-07 23:52:08,069 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:52:08" (1/1) ... [2024-11-07 23:52:08,088 INFO L175 MemorySlicer]: Split 15 memory accesses to 4 slices as follows [5, 3, 2, 5]. 33 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0, 0]. The 6 writes are split as follows [2, 1, 1, 2]. [2024-11-07 23:52:08,088 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:52:08" (1/1) ... [2024-11-07 23:52:08,088 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:52:08" (1/1) ... [2024-11-07 23:52:08,097 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:52:08" (1/1) ... [2024-11-07 23:52:08,100 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:52:08" (1/1) ... [2024-11-07 23:52:08,104 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:52:08" (1/1) ... [2024-11-07 23:52:08,105 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:52:08" (1/1) ... [2024-11-07 23:52:08,111 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 23:52:08,112 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 23:52:08,112 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 23:52:08,112 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 23:52:08,113 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:52:08" (1/1) ... [2024-11-07 23:52:08,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:52:08,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:52:08,147 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-07 23:52:08,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-07 23:52:08,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-07 23:52:08,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-07 23:52:08,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-07 23:52:08,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-07 23:52:08,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 23:52:08,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-07 23:52:08,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-07 23:52:08,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-07 23:52:08,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-07 23:52:08,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-07 23:52:08,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 23:52:08,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 23:52:08,289 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 23:52:08,290 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 23:52:08,413 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-07 23:52:08,413 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 23:52:08,424 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 23:52:08,424 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-07 23:52:08,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:52:08 BoogieIcfgContainer [2024-11-07 23:52:08,425 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 23:52:08,426 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-07 23:52:08,426 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-07 23:52:08,429 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-07 23:52:08,430 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-07 23:52:08,430 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 07.11 11:52:07" (1/3) ... [2024-11-07 23:52:08,431 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@20ae6654 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.11 11:52:08, skipping insertion in model container [2024-11-07 23:52:08,431 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-07 23:52:08,431 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:52:08" (2/3) ... [2024-11-07 23:52:08,431 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@20ae6654 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.11 11:52:08, skipping insertion in model container [2024-11-07 23:52:08,431 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-07 23:52:08,431 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:52:08" (3/3) ... [2024-11-07 23:52:08,432 INFO L332 chiAutomizerObserver]: Analyzing ICFG b.15-alloca.i [2024-11-07 23:52:08,478 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-07 23:52:08,480 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-07 23:52:08,480 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-07 23:52:08,480 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-07 23:52:08,480 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-07 23:52:08,480 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-07 23:52:08,480 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-07 23:52:08,480 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-07 23:52:08,484 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 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) [2024-11-07 23:52:08,496 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-07 23:52:08,496 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-07 23:52:08,496 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-07 23:52:08,499 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-07 23:52:08,499 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-07 23:52:08,499 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-07 23:52:08,499 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 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) [2024-11-07 23:52:08,500 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-07 23:52:08,500 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-07 23:52:08,500 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-07 23:52:08,500 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-07 23:52:08,500 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-07 23:52:08,506 INFO L745 eck$LassoCheckResult]: Stem: 6#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~ret19#1;havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1, test_fun_#in~z#1 := main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~short10#1, test_fun_#t~mem11#1, test_fun_#t~mem12#1, test_fun_#t~mem13#1, test_fun_#t~mem14#1, test_fun_#t~mem15#1, test_fun_~x#1, test_fun_~y#1, test_fun_~z#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;test_fun_~z#1 := test_fun_#in~z#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset;call write~int#3(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#0(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(test_fun_~z#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int#2(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 12#L558-4true [2024-11-07 23:52:08,506 INFO L747 eck$LassoCheckResult]: Loop: 12#L558-4true call test_fun_#t~mem6#1 := read~int#3(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem7#1 := read~int#0(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short10#1 := test_fun_#t~mem6#1 == test_fun_#t~mem7#1; 11#L557-1true assume test_fun_#t~short10#1;call test_fun_#t~mem8#1 := read~int#3(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem9#1 := read~int#1(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short10#1 := test_fun_#t~mem8#1 > test_fun_#t~mem9#1; 9#L557-3true assume !!test_fun_#t~short10#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~mem9#1;havoc test_fun_#t~short10#1; 5#L558-3true assume !true; 12#L558-4true [2024-11-07 23:52:08,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:52:08,510 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-07 23:52:08,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:52:08,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798690179] [2024-11-07 23:52:08,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:52:08,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:52:08,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:52:08,642 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 23:52:08,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:52:08,705 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 23:52:08,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:52:08,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1142256, now seen corresponding path program 1 times [2024-11-07 23:52:08,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:52:08,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559575430] [2024-11-07 23:52:08,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:52:08,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:52:08,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:52:08,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 23:52:08,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 23:52:08,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559575430] [2024-11-07 23:52:08,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559575430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 23:52:08,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 23:52:08,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-07 23:52:08,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919355259] [2024-11-07 23:52:08,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 23:52:08,759 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-07 23:52:08,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 23:52:08,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 23:52:08,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 23:52:08,784 INFO L87 Difference]: Start difference. First operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 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 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 23:52:08,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 23:52:08,789 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2024-11-07 23:52:08,790 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 14 transitions. [2024-11-07 23:52:08,793 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-07 23:52:08,798 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 7 states and 9 transitions. [2024-11-07 23:52:08,799 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2024-11-07 23:52:08,799 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2024-11-07 23:52:08,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 9 transitions. [2024-11-07 23:52:08,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-07 23:52:08,800 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7 states and 9 transitions. [2024-11-07 23:52:08,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 9 transitions. [2024-11-07 23:52:08,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2024-11-07 23:52:08,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 23:52:08,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2024-11-07 23:52:08,822 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7 states and 9 transitions. [2024-11-07 23:52:08,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 23:52:08,825 INFO L425 stractBuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2024-11-07 23:52:08,826 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-07 23:52:08,826 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2024-11-07 23:52:08,827 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-07 23:52:08,827 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-07 23:52:08,827 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-07 23:52:08,827 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-07 23:52:08,827 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-07 23:52:08,828 INFO L745 eck$LassoCheckResult]: Stem: 34#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 35#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~ret19#1;havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1, test_fun_#in~z#1 := main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~short10#1, test_fun_#t~mem11#1, test_fun_#t~mem12#1, test_fun_#t~mem13#1, test_fun_#t~mem14#1, test_fun_#t~mem15#1, test_fun_~x#1, test_fun_~y#1, test_fun_~z#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;test_fun_~z#1 := test_fun_#in~z#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset;call write~int#3(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#0(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(test_fun_~z#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int#2(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 36#L558-4 [2024-11-07 23:52:08,828 INFO L747 eck$LassoCheckResult]: Loop: 36#L558-4 call test_fun_#t~mem6#1 := read~int#3(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem7#1 := read~int#0(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short10#1 := test_fun_#t~mem6#1 == test_fun_#t~mem7#1; 38#L557-1 assume test_fun_#t~short10#1;call test_fun_#t~mem8#1 := read~int#3(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem9#1 := read~int#1(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short10#1 := test_fun_#t~mem8#1 > test_fun_#t~mem9#1; 37#L557-3 assume !!test_fun_#t~short10#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~mem9#1;havoc test_fun_#t~short10#1; 32#L558-3 call test_fun_#t~mem11#1 := read~int#0(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem12#1 := read~int#1(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4); 33#L558-1 assume !(test_fun_#t~mem11#1 > test_fun_#t~mem12#1);havoc test_fun_#t~mem11#1;havoc test_fun_#t~mem12#1; 36#L558-4 [2024-11-07 23:52:08,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:52:08,829 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-11-07 23:52:08,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:52:08,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298029353] [2024-11-07 23:52:08,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:52:08,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:52:08,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:52:08,875 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 23:52:08,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:52:08,913 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 23:52:08,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:52:08,913 INFO L85 PathProgramCache]: Analyzing trace with hash 35409745, now seen corresponding path program 1 times [2024-11-07 23:52:08,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:52:08,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404244535] [2024-11-07 23:52:08,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:52:08,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:52:08,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:52:09,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 23:52:09,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 23:52:09,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404244535] [2024-11-07 23:52:09,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404244535] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 23:52:09,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 23:52:09,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 23:52:09,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763605093] [2024-11-07 23:52:09,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 23:52:09,153 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-07 23:52:09,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 23:52:09,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 23:52:09,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 23:52:09,154 INFO L87 Difference]: Start difference. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand has 6 states, 5 states have (on average 1.0) internal successors, (5), 5 states have internal predecessors, (5), 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) [2024-11-07 23:52:09,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 23:52:09,261 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2024-11-07 23:52:09,261 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 12 transitions. [2024-11-07 23:52:09,262 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-07 23:52:09,262 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 12 transitions. [2024-11-07 23:52:09,262 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-07 23:52:09,262 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-07 23:52:09,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 12 transitions. [2024-11-07 23:52:09,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-07 23:52:09,262 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 12 transitions. [2024-11-07 23:52:09,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 12 transitions. [2024-11-07 23:52:09,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-07 23:52:09,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 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) [2024-11-07 23:52:09,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2024-11-07 23:52:09,265 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 11 transitions. [2024-11-07 23:52:09,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 23:52:09,267 INFO L425 stractBuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2024-11-07 23:52:09,268 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-07 23:52:09,268 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. [2024-11-07 23:52:09,268 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-07 23:52:09,268 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-07 23:52:09,268 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-07 23:52:09,269 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-07 23:52:09,269 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2024-11-07 23:52:09,270 INFO L745 eck$LassoCheckResult]: Stem: 66#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 67#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~ret19#1;havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1, test_fun_#in~z#1 := main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~short10#1, test_fun_#t~mem11#1, test_fun_#t~mem12#1, test_fun_#t~mem13#1, test_fun_#t~mem14#1, test_fun_#t~mem15#1, test_fun_~x#1, test_fun_~y#1, test_fun_~z#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;test_fun_~z#1 := test_fun_#in~z#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset;call write~int#3(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#0(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(test_fun_~z#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int#2(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 69#L558-4 [2024-11-07 23:52:09,270 INFO L747 eck$LassoCheckResult]: Loop: 69#L558-4 call test_fun_#t~mem6#1 := read~int#3(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem7#1 := read~int#0(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short10#1 := test_fun_#t~mem6#1 == test_fun_#t~mem7#1; 72#L557-1 assume test_fun_#t~short10#1;call test_fun_#t~mem8#1 := read~int#3(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem9#1 := read~int#1(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short10#1 := test_fun_#t~mem8#1 > test_fun_#t~mem9#1; 70#L557-3 assume !!test_fun_#t~short10#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~mem9#1;havoc test_fun_#t~short10#1; 71#L558-3 call test_fun_#t~mem11#1 := read~int#0(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem12#1 := read~int#1(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4); 68#L558-1 assume !!(test_fun_#t~mem11#1 > test_fun_#t~mem12#1);havoc test_fun_#t~mem11#1;havoc test_fun_#t~mem12#1;call test_fun_#t~mem13#1 := read~int#3(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#3(test_fun_#t~mem13#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem13#1;call test_fun_#t~mem14#1 := read~int#0(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#0(test_fun_#t~mem14#1 - 1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem14#1; 64#L558-3 call test_fun_#t~mem11#1 := read~int#0(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem12#1 := read~int#1(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4); 65#L558-1 assume !(test_fun_#t~mem11#1 > test_fun_#t~mem12#1);havoc test_fun_#t~mem11#1;havoc test_fun_#t~mem12#1; 69#L558-4 [2024-11-07 23:52:09,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:52:09,304 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2024-11-07 23:52:09,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:52:09,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625316860] [2024-11-07 23:52:09,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:52:09,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:52:09,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:52:09,339 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 23:52:09,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:52:09,360 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 23:52:09,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:52:09,362 INFO L85 PathProgramCache]: Analyzing trace with hash -330970762, now seen corresponding path program 1 times [2024-11-07 23:52:09,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:52:09,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994017803] [2024-11-07 23:52:09,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:52:09,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:52:09,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:52:09,379 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 23:52:09,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:52:09,394 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 23:52:09,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:52:09,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1215326068, now seen corresponding path program 1 times [2024-11-07 23:52:09,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:52:09,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832909518] [2024-11-07 23:52:09,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:52:09,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:52:09,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:52:09,439 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 23:52:09,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:52:09,464 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 23:52:10,592 INFO L204 LassoAnalysis]: Preferences: [2024-11-07 23:52:10,593 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-07 23:52:10,593 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-07 23:52:10,593 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-07 23:52:10,593 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-07 23:52:10,594 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:52:10,594 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-07 23:52:10,594 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-07 23:52:10,594 INFO L132 ssoRankerPreferences]: Filename of dumped script: b.15-alloca.i_Iteration3_Lasso [2024-11-07 23:52:10,595 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-07 23:52:10,595 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-07 23:52:10,614 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:52:10,621 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:52:10,623 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:52:10,626 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:52:10,629 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:52:10,632 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:52:11,318 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:52:11,323 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:52:11,325 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:52:11,328 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:52:11,331 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:52:11,333 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:52:11,337 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:52:11,340 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:52:11,342 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:52:11,344 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:52:11,346 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:52:11,805 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-07 23:52:11,809 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-07 23:52:11,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:52:11,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:52:11,814 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-07 23:52:11,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-07 23:52:11,818 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 [2024-11-07 23:52:11,829 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:52:11,830 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-07 23:52:11,830 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:52:11,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:52:11,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:52:11,834 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-07 23:52:11,834 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-07 23:52:11,837 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:52:11,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-11-07 23:52:11,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:52:11,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:52:11,849 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-07 23:52:11,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-07 23:52:11,852 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 [2024-11-07 23:52:11,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:52:11,863 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-07 23:52:11,863 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:52:11,863 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:52:11,863 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:52:11,864 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-07 23:52:11,864 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-07 23:52:11,866 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:52:11,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-11-07 23:52:11,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:52:11,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:52:11,878 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-07 23:52:11,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-07 23:52:11,879 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 [2024-11-07 23:52:11,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:52:11,889 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-07 23:52:11,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:52:11,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:52:11,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:52:11,890 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-07 23:52:11,890 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-07 23:52:11,893 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:52:11,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-11-07 23:52:11,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:52:11,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:52:11,909 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-07 23:52:11,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-07 23:52:11,912 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 [2024-11-07 23:52:11,925 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:52:11,925 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-07 23:52:11,925 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:52:11,925 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:52:11,925 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:52:11,925 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-07 23:52:11,925 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-07 23:52:11,932 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:52:11,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-11-07 23:52:11,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:52:11,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:52:11,948 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-07 23:52:11,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-07 23:52:11,950 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 [2024-11-07 23:52:11,963 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:52:11,963 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:52:11,963 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:52:11,963 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:52:11,966 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-07 23:52:11,966 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-07 23:52:11,969 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:52:11,980 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-07 23:52:11,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:52:11,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:52:11,982 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-07 23:52:11,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-07 23:52:11,984 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 [2024-11-07 23:52:11,994 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:52:11,994 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:52:11,994 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:52:11,994 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:52:12,005 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-07 23:52:12,005 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-07 23:52:12,021 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-07 23:52:12,089 INFO L443 ModelExtractionUtils]: Simplification made 17 calls to the SMT solver. [2024-11-07 23:52:12,091 INFO L444 ModelExtractionUtils]: 4 out of 22 variables were initially zero. Simplification set additionally 15 variables to zero. [2024-11-07 23:52:12,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:52:12,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:52:12,095 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-07 23:52:12,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-07 23:52:12,098 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-07 23:52:12,112 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-07 23:52:12,112 INFO L474 LassoAnalysis]: Proved termination. [2024-11-07 23:52:12,113 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#3 ULTIMATE.start_test_fun_~x_ref~0#1.base) 0)_1, v_rep(select (select #memory_int#1 ULTIMATE.start_test_fun_~z_ref~0#1.base) ULTIMATE.start_test_fun_~z_ref~0#1.offset)_1) = 1*v_rep(select (select #memory_int#3 ULTIMATE.start_test_fun_~x_ref~0#1.base) 0)_1 - 1*v_rep(select (select #memory_int#1 ULTIMATE.start_test_fun_~z_ref~0#1.base) ULTIMATE.start_test_fun_~z_ref~0#1.offset)_1 Supporting invariants [] [2024-11-07 23:52:12,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-07 23:52:12,265 INFO L156 tatePredicateManager]: 37 out of 38 supporting invariants were superfluous and have been removed [2024-11-07 23:52:12,271 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-07 23:52:12,271 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-07 23:52:12,272 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] [2024-11-07 23:52:12,273 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-07 23:52:12,273 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-07 23:52:12,273 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~z_ref~0!base,]]] [2024-11-07 23:52:12,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:52:12,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:52:12,335 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 23:52:12,336 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 23:52:12,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:52:12,367 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-07 23:52:12,368 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 23:52:12,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 28 [2024-11-07 23:52:12,537 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 23:52:12,539 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2024-11-07 23:52:12,540 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 11 transitions. cyclomatic complexity: 3 Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 23:52:12,621 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 11 transitions. cyclomatic complexity: 3. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 20 states and 27 transitions. Complement of second has 8 states. [2024-11-07 23:52:12,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-11-07 23:52:12,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 23:52:12,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2024-11-07 23:52:12,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 2 letters. Loop has 7 letters. [2024-11-07 23:52:12,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-07 23:52:12,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 9 letters. Loop has 7 letters. [2024-11-07 23:52:12,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-07 23:52:12,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 2 letters. Loop has 14 letters. [2024-11-07 23:52:12,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-07 23:52:12,630 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 27 transitions. [2024-11-07 23:52:12,632 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-07 23:52:12,633 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 14 states and 17 transitions. [2024-11-07 23:52:12,633 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2024-11-07 23:52:12,634 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2024-11-07 23:52:12,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 17 transitions. [2024-11-07 23:52:12,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-07 23:52:12,634 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 17 transitions. [2024-11-07 23:52:12,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 17 transitions. [2024-11-07 23:52:12,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2024-11-07 23:52:12,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 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) [2024-11-07 23:52:12,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2024-11-07 23:52:12,635 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 16 transitions. [2024-11-07 23:52:12,635 INFO L425 stractBuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2024-11-07 23:52:12,635 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-07 23:52:12,636 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2024-11-07 23:52:12,636 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-07 23:52:12,636 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-07 23:52:12,636 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-07 23:52:12,636 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-07 23:52:12,636 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-07 23:52:12,636 INFO L745 eck$LassoCheckResult]: Stem: 308#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 309#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~ret19#1;havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1, test_fun_#in~z#1 := main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~short10#1, test_fun_#t~mem11#1, test_fun_#t~mem12#1, test_fun_#t~mem13#1, test_fun_#t~mem14#1, test_fun_#t~mem15#1, test_fun_~x#1, test_fun_~y#1, test_fun_~z#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;test_fun_~z#1 := test_fun_#in~z#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset;call write~int#3(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#0(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(test_fun_~z#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int#2(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 311#L558-4 call test_fun_#t~mem6#1 := read~int#3(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem7#1 := read~int#0(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short10#1 := test_fun_#t~mem6#1 == test_fun_#t~mem7#1; 313#L557-1 assume !test_fun_#t~short10#1; 312#L557-3 assume !!test_fun_#t~short10#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~mem9#1;havoc test_fun_#t~short10#1; 306#L558-3 call test_fun_#t~mem11#1 := read~int#0(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem12#1 := read~int#1(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4); 307#L558-1 assume !!(test_fun_#t~mem11#1 > test_fun_#t~mem12#1);havoc test_fun_#t~mem11#1;havoc test_fun_#t~mem12#1;call test_fun_#t~mem13#1 := read~int#3(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#3(test_fun_#t~mem13#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem13#1;call test_fun_#t~mem14#1 := read~int#0(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#0(test_fun_#t~mem14#1 - 1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem14#1; 310#L558-3 call test_fun_#t~mem11#1 := read~int#0(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem12#1 := read~int#1(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4); 305#L558-1 [2024-11-07 23:52:12,636 INFO L747 eck$LassoCheckResult]: Loop: 305#L558-1 assume !!(test_fun_#t~mem11#1 > test_fun_#t~mem12#1);havoc test_fun_#t~mem11#1;havoc test_fun_#t~mem12#1;call test_fun_#t~mem13#1 := read~int#3(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#3(test_fun_#t~mem13#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem13#1;call test_fun_#t~mem14#1 := read~int#0(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#0(test_fun_#t~mem14#1 - 1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem14#1; 304#L558-3 call test_fun_#t~mem11#1 := read~int#0(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem12#1 := read~int#1(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4); 305#L558-1 [2024-11-07 23:52:12,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:52:12,638 INFO L85 PathProgramCache]: Analyzing trace with hash 179598440, now seen corresponding path program 1 times [2024-11-07 23:52:12,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:52:12,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105766179] [2024-11-07 23:52:12,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:52:12,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:52:12,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:52:12,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 23:52:12,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 23:52:12,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105766179] [2024-11-07 23:52:12,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105766179] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 23:52:12,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 23:52:12,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 23:52:12,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643358977] [2024-11-07 23:52:12,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 23:52:12,708 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-07 23:52:12,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:52:12,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1852, now seen corresponding path program 1 times [2024-11-07 23:52:12,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:52:12,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749508163] [2024-11-07 23:52:12,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:52:12,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:52:12,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-11-07 23:52:12,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:52:12,718 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 23:52:12,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:52:12,724 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 23:52:12,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 23:52:12,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 23:52:12,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 23:52:12,836 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 23:52:12,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 23:52:12,842 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2024-11-07 23:52:12,842 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 16 transitions. [2024-11-07 23:52:12,843 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-07 23:52:12,843 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 13 states and 15 transitions. [2024-11-07 23:52:12,843 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2024-11-07 23:52:12,843 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2024-11-07 23:52:12,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 15 transitions. [2024-11-07 23:52:12,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-07 23:52:12,843 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 15 transitions. [2024-11-07 23:52:12,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 15 transitions. [2024-11-07 23:52:12,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-11-07 23:52:12,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 states have internal predecessors, (15), 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) [2024-11-07 23:52:12,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2024-11-07 23:52:12,844 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 15 transitions. [2024-11-07 23:52:12,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 23:52:12,845 INFO L425 stractBuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2024-11-07 23:52:12,845 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-07 23:52:12,845 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. [2024-11-07 23:52:12,846 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-07 23:52:12,846 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-07 23:52:12,846 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-07 23:52:12,846 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-07 23:52:12,846 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-07 23:52:12,846 INFO L745 eck$LassoCheckResult]: Stem: 341#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 342#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~ret19#1;havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1, test_fun_#in~z#1 := main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~short10#1, test_fun_#t~mem11#1, test_fun_#t~mem12#1, test_fun_#t~mem13#1, test_fun_#t~mem14#1, test_fun_#t~mem15#1, test_fun_~x#1, test_fun_~y#1, test_fun_~z#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;test_fun_~z#1 := test_fun_#in~z#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset;call write~int#3(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#0(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(test_fun_~z#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int#2(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 344#L558-4 call test_fun_#t~mem6#1 := read~int#3(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem7#1 := read~int#0(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short10#1 := test_fun_#t~mem6#1 == test_fun_#t~mem7#1; 347#L557-1 assume test_fun_#t~short10#1;call test_fun_#t~mem8#1 := read~int#3(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem9#1 := read~int#1(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short10#1 := test_fun_#t~mem8#1 > test_fun_#t~mem9#1; 345#L557-3 assume !!test_fun_#t~short10#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~mem9#1;havoc test_fun_#t~short10#1; 346#L558-3 call test_fun_#t~mem11#1 := read~int#0(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem12#1 := read~int#1(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4); 349#L558-1 assume !!(test_fun_#t~mem11#1 > test_fun_#t~mem12#1);havoc test_fun_#t~mem11#1;havoc test_fun_#t~mem12#1;call test_fun_#t~mem13#1 := read~int#3(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#3(test_fun_#t~mem13#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem13#1;call test_fun_#t~mem14#1 := read~int#0(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#0(test_fun_#t~mem14#1 - 1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem14#1; 348#L558-3 call test_fun_#t~mem11#1 := read~int#0(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem12#1 := read~int#1(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4); 338#L558-1 [2024-11-07 23:52:12,846 INFO L747 eck$LassoCheckResult]: Loop: 338#L558-1 assume !!(test_fun_#t~mem11#1 > test_fun_#t~mem12#1);havoc test_fun_#t~mem11#1;havoc test_fun_#t~mem12#1;call test_fun_#t~mem13#1 := read~int#3(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#3(test_fun_#t~mem13#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem13#1;call test_fun_#t~mem14#1 := read~int#0(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#0(test_fun_#t~mem14#1 - 1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem14#1; 337#L558-3 call test_fun_#t~mem11#1 := read~int#0(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem12#1 := read~int#1(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4); 338#L558-1 [2024-11-07 23:52:12,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:52:12,847 INFO L85 PathProgramCache]: Analyzing trace with hash 177751398, now seen corresponding path program 1 times [2024-11-07 23:52:12,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:52:12,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842150010] [2024-11-07 23:52:12,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:52:12,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:52:12,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:52:12,865 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 23:52:12,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:52:12,883 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 23:52:12,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:52:12,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1852, now seen corresponding path program 2 times [2024-11-07 23:52:12,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:52:12,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609261727] [2024-11-07 23:52:12,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:52:12,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:52:12,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:52:12,889 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 23:52:12,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:52:12,892 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 23:52:12,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:52:12,893 INFO L85 PathProgramCache]: Analyzing trace with hash -979597471, now seen corresponding path program 2 times [2024-11-07 23:52:12,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:52:12,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541038838] [2024-11-07 23:52:12,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:52:12,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:52:12,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:52:12,915 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 23:52:12,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:52:12,929 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 23:52:14,173 INFO L204 LassoAnalysis]: Preferences: [2024-11-07 23:52:14,173 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-07 23:52:14,173 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-07 23:52:14,173 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-07 23:52:14,174 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-07 23:52:14,174 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:52:14,174 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-07 23:52:14,174 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-07 23:52:14,174 INFO L132 ssoRankerPreferences]: Filename of dumped script: b.15-alloca.i_Iteration5_Lasso [2024-11-07 23:52:14,174 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-07 23:52:14,174 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-07 23:52:14,177 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:52:14,182 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:52:14,184 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:52:14,762 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:52:14,769 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:52:14,771 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:52:14,775 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:52:14,777 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:52:14,779 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:52:14,781 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:52:14,783 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:52:14,788 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:52:14,790 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:52:14,792 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:52:14,793 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:52:15,158 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-07 23:52:15,158 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-07 23:52:15,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:52:15,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:52:15,160 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-07 23:52:15,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-07 23:52:15,161 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 [2024-11-07 23:52:15,170 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:52:15,170 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-07 23:52:15,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:52:15,171 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:52:15,171 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:52:15,171 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-07 23:52:15,171 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-07 23:52:15,172 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:52:15,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-07 23:52:15,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:52:15,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:52:15,184 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-07 23:52:15,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-07 23:52:15,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 [2024-11-07 23:52:15,195 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:52:15,195 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-07 23:52:15,195 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:52:15,195 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:52:15,195 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:52:15,195 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-07 23:52:15,195 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-07 23:52:15,196 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:52:15,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-07 23:52:15,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:52:15,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:52:15,208 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-07 23:52:15,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-07 23:52:15,209 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 [2024-11-07 23:52:15,219 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:52:15,219 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:52:15,219 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:52:15,219 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:52:15,228 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-07 23:52:15,228 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-07 23:52:15,244 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-07 23:52:15,278 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2024-11-07 23:52:15,278 INFO L444 ModelExtractionUtils]: 8 out of 25 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-11-07 23:52:15,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:52:15,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:52:15,280 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-07 23:52:15,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-07 23:52:15,282 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-07 23:52:15,294 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-11-07 23:52:15,294 INFO L474 LassoAnalysis]: Proved termination. [2024-11-07 23:52:15,294 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~y_ref~0#1.base) ULTIMATE.start_test_fun_~y_ref~0#1.offset)_2, v_rep(select (select #memory_int#1 ULTIMATE.start_test_fun_~z_ref~0#1.base) ULTIMATE.start_test_fun_~z_ref~0#1.offset)_2) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~y_ref~0#1.base) ULTIMATE.start_test_fun_~y_ref~0#1.offset)_2 - 1*v_rep(select (select #memory_int#1 ULTIMATE.start_test_fun_~z_ref~0#1.base) ULTIMATE.start_test_fun_~z_ref~0#1.offset)_2 Supporting invariants [1*ULTIMATE.start_test_fun_#t~mem12#1 - 1*v_rep(select (select #memory_int#1 ULTIMATE.start_test_fun_~z_ref~0#1.base) 0)_2 + 1*v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~y_ref~0#1.base) ULTIMATE.start_test_fun_~y_ref~0#1.offset)_2 - 1*ULTIMATE.start_test_fun_#t~mem11#1 >= 0] [2024-11-07 23:52:15,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-11-07 23:52:15,418 INFO L156 tatePredicateManager]: 36 out of 38 supporting invariants were superfluous and have been removed [2024-11-07 23:52:15,424 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-07 23:52:15,424 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-07 23:52:15,424 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] [2024-11-07 23:52:15,424 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-07 23:52:15,424 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-07 23:52:15,424 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~z_ref~0!base,]]] [2024-11-07 23:52:15,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:52:15,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:52:15,494 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-07 23:52:15,495 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 23:52:15,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-07 23:52:15,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:52:15,542 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-07 23:52:15,542 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 23:52:15,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 28 [2024-11-07 23:52:15,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 23:52:15,573 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2024-11-07 23:52:15,573 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 4 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 23:52:15,618 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 4. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 18 states and 21 transitions. Complement of second has 5 states. [2024-11-07 23:52:15,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 0 non-accepting loop states 2 accepting loop states [2024-11-07 23:52:15,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 23:52:15,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2024-11-07 23:52:15,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 8 letters. Loop has 2 letters. [2024-11-07 23:52:15,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-07 23:52:15,620 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-07 23:52:15,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:52:15,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:52:15,679 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-07 23:52:15,680 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 23:52:15,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-07 23:52:15,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-11-07 23:52:15,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:52:15,733 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-07 23:52:15,734 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 23:52:15,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 28 [2024-11-07 23:52:15,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 23:52:15,761 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2024-11-07 23:52:15,761 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 4 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 23:52:15,796 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 4. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 26 states and 31 transitions. Complement of second has 6 states. [2024-11-07 23:52:15,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-07 23:52:15,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 23:52:15,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2024-11-07 23:52:15,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 8 letters. Loop has 2 letters. [2024-11-07 23:52:15,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-07 23:52:15,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 10 letters. Loop has 2 letters. [2024-11-07 23:52:15,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-07 23:52:15,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 8 letters. Loop has 4 letters. [2024-11-07 23:52:15,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-07 23:52:15,798 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 31 transitions. [2024-11-07 23:52:15,799 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-07 23:52:15,799 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 20 states and 23 transitions. [2024-11-07 23:52:15,799 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2024-11-07 23:52:15,799 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2024-11-07 23:52:15,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2024-11-07 23:52:15,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-07 23:52:15,799 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 23 transitions. [2024-11-07 23:52:15,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2024-11-07 23:52:15,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2024-11-07 23:52:15,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 16 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) [2024-11-07 23:52:15,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2024-11-07 23:52:15,800 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 19 transitions. [2024-11-07 23:52:15,800 INFO L425 stractBuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2024-11-07 23:52:15,800 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-07 23:52:15,800 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2024-11-07 23:52:15,801 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-07 23:52:15,801 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-07 23:52:15,801 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-07 23:52:15,801 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 2, 2, 2, 2, 1, 1, 1] [2024-11-07 23:52:15,801 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-07 23:52:15,801 INFO L745 eck$LassoCheckResult]: Stem: 649#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 650#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~ret19#1;havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1, test_fun_#in~z#1 := main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~short10#1, test_fun_#t~mem11#1, test_fun_#t~mem12#1, test_fun_#t~mem13#1, test_fun_#t~mem14#1, test_fun_#t~mem15#1, test_fun_~x#1, test_fun_~y#1, test_fun_~z#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;test_fun_~z#1 := test_fun_#in~z#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset;call write~int#3(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#0(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(test_fun_~z#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int#2(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 652#L558-4 call test_fun_#t~mem6#1 := read~int#3(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem7#1 := read~int#0(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short10#1 := test_fun_#t~mem6#1 == test_fun_#t~mem7#1; 655#L557-1 assume test_fun_#t~short10#1;call test_fun_#t~mem8#1 := read~int#3(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem9#1 := read~int#1(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short10#1 := test_fun_#t~mem8#1 > test_fun_#t~mem9#1; 653#L557-3 assume !!test_fun_#t~short10#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~mem9#1;havoc test_fun_#t~short10#1; 654#L558-3 call test_fun_#t~mem11#1 := read~int#0(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem12#1 := read~int#1(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4); 651#L558-1 assume !!(test_fun_#t~mem11#1 > test_fun_#t~mem12#1);havoc test_fun_#t~mem11#1;havoc test_fun_#t~mem12#1;call test_fun_#t~mem13#1 := read~int#3(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#3(test_fun_#t~mem13#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem13#1;call test_fun_#t~mem14#1 := read~int#0(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#0(test_fun_#t~mem14#1 - 1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem14#1; 647#L558-3 call test_fun_#t~mem11#1 := read~int#0(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem12#1 := read~int#1(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4); 648#L558-1 assume !(test_fun_#t~mem11#1 > test_fun_#t~mem12#1);havoc test_fun_#t~mem11#1;havoc test_fun_#t~mem12#1; 656#L558-4 call test_fun_#t~mem6#1 := read~int#3(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem7#1 := read~int#0(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short10#1 := test_fun_#t~mem6#1 == test_fun_#t~mem7#1; 657#L557-1 assume test_fun_#t~short10#1;call test_fun_#t~mem8#1 := read~int#3(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem9#1 := read~int#1(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short10#1 := test_fun_#t~mem8#1 > test_fun_#t~mem9#1; 661#L557-3 assume !!test_fun_#t~short10#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~mem9#1;havoc test_fun_#t~short10#1; 660#L558-3 call test_fun_#t~mem11#1 := read~int#0(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem12#1 := read~int#1(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4); 659#L558-1 assume !!(test_fun_#t~mem11#1 > test_fun_#t~mem12#1);havoc test_fun_#t~mem11#1;havoc test_fun_#t~mem12#1;call test_fun_#t~mem13#1 := read~int#3(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#3(test_fun_#t~mem13#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem13#1;call test_fun_#t~mem14#1 := read~int#0(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#0(test_fun_#t~mem14#1 - 1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem14#1; 658#L558-3 call test_fun_#t~mem11#1 := read~int#0(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem12#1 := read~int#1(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4); 646#L558-1 [2024-11-07 23:52:15,801 INFO L747 eck$LassoCheckResult]: Loop: 646#L558-1 assume !!(test_fun_#t~mem11#1 > test_fun_#t~mem12#1);havoc test_fun_#t~mem11#1;havoc test_fun_#t~mem12#1;call test_fun_#t~mem13#1 := read~int#3(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#3(test_fun_#t~mem13#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem13#1;call test_fun_#t~mem14#1 := read~int#0(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#0(test_fun_#t~mem14#1 - 1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem14#1; 645#L558-3 call test_fun_#t~mem11#1 := read~int#0(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem12#1 := read~int#1(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4); 646#L558-1 [2024-11-07 23:52:15,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:52:15,802 INFO L85 PathProgramCache]: Analyzing trace with hash -618569641, now seen corresponding path program 2 times [2024-11-07 23:52:15,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:52:15,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673263517] [2024-11-07 23:52:15,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:52:15,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:52:15,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:52:16,108 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 23:52:16,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 23:52:16,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673263517] [2024-11-07 23:52:16,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673263517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 23:52:16,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 23:52:16,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 23:52:16,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549440014] [2024-11-07 23:52:16,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 23:52:16,109 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-07 23:52:16,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:52:16,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1852, now seen corresponding path program 3 times [2024-11-07 23:52:16,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:52:16,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633032732] [2024-11-07 23:52:16,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:52:16,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:52:16,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:52:16,116 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 23:52:16,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:52:16,119 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 23:52:16,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 23:52:16,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 23:52:16,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 23:52:16,230 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. cyclomatic complexity: 4 Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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) [2024-11-07 23:52:16,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 23:52:16,265 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2024-11-07 23:52:16,265 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 12 transitions. [2024-11-07 23:52:16,266 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-07 23:52:16,266 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 0 states and 0 transitions. [2024-11-07 23:52:16,266 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-07 23:52:16,266 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-07 23:52:16,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-07 23:52:16,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-07 23:52:16,266 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-07 23:52:16,266 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-07 23:52:16,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 23:52:16,267 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-07 23:52:16,267 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-07 23:52:16,267 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-07 23:52:16,267 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-07 23:52:16,267 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-07 23:52:16,275 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 07.11 11:52:16 BoogieIcfgContainer [2024-11-07 23:52:16,275 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-07 23:52:16,276 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 23:52:16,276 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 23:52:16,276 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 23:52:16,277 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:52:08" (3/4) ... [2024-11-07 23:52:16,278 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 23:52:16,279 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 23:52:16,279 INFO L158 Benchmark]: Toolchain (without parser) took 8578.35ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 76.4MB in the beginning and 75.1MB in the end (delta: 1.3MB). Peak memory consumption was 26.6MB. Max. memory is 16.1GB. [2024-11-07 23:52:16,279 INFO L158 Benchmark]: CDTParser took 1.04ms. Allocated memory is still 83.9MB. Free memory is still 47.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 23:52:16,280 INFO L158 Benchmark]: CACSL2BoogieTranslator took 316.38ms. Allocated memory is still 100.7MB. Free memory was 76.3MB in the beginning and 60.2MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 23:52:16,281 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.86ms. Allocated memory is still 100.7MB. Free memory was 60.2MB in the beginning and 58.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 23:52:16,281 INFO L158 Benchmark]: Boogie Preprocessor took 53.12ms. Allocated memory is still 100.7MB. Free memory was 58.8MB in the beginning and 57.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 23:52:16,281 INFO L158 Benchmark]: RCFGBuilder took 313.28ms. Allocated memory is still 100.7MB. Free memory was 57.0MB in the beginning and 44.4MB in the end (delta: 12.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 23:52:16,281 INFO L158 Benchmark]: BuchiAutomizer took 7849.48ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 44.4MB in the beginning and 76.4MB in the end (delta: -32.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 23:52:16,282 INFO L158 Benchmark]: Witness Printer took 2.92ms. Allocated memory is still 125.8MB. Free memory was 76.4MB in the beginning and 75.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 23:52:16,283 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.04ms. Allocated memory is still 83.9MB. Free memory is still 47.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 316.38ms. Allocated memory is still 100.7MB. Free memory was 76.3MB in the beginning and 60.2MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.86ms. Allocated memory is still 100.7MB. Free memory was 60.2MB in the beginning and 58.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 53.12ms. Allocated memory is still 100.7MB. Free memory was 58.8MB in the beginning and 57.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 313.28ms. Allocated memory is still 100.7MB. Free memory was 57.0MB in the beginning and 44.4MB in the end (delta: 12.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 7849.48ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 44.4MB in the beginning and 76.4MB in the end (delta: -32.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.92ms. Allocated memory is still 125.8MB. Free memory was 76.4MB in the beginning and 75.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~z_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~z_ref~0!base,]]] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (4 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function null and consists of 5 locations. One deterministic module has affine ranking function null and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.8s and 7 iterations. TraceHistogramMax:4. Analysis of lassos took 6.7s. Construction of modules took 0.1s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 5 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [1, 1, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/2 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 27 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 27 mSDsluCounter, 67 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 85 IncrementalHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 45 mSDtfsCounter, 85 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital307 mio100 ax105 hnf100 lsp94 ukn70 mio100 lsp23 div100 bol100 ite100 ukn100 eq202 hnf88 smp97 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 23ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-11-07 23:52:16,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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