./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/fermat-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/fermat-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', 'e779827438904e8a0bb49f414cbe4d14072e556fff2389d3772808230457c73c'] 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/fermat-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 e779827438904e8a0bb49f414cbe4d14072e556fff2389d3772808230457c73c --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 23:52:40,754 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 23:52:40,878 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:40,883 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 23:52:40,884 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 23:52:40,910 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 23:52:40,912 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 23:52:40,912 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 23:52:40,912 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 23:52:40,913 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 23:52:40,913 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 23:52:40,914 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 23:52:40,914 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 23:52:40,914 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-07 23:52:40,914 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-07 23:52:40,915 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-07 23:52:40,915 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-07 23:52:40,915 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-07 23:52:40,915 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-07 23:52:40,915 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 23:52:40,915 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-07 23:52:40,916 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 23:52:40,916 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 23:52:40,916 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-07 23:52:40,916 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-07 23:52:40,916 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-07 23:52:40,916 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 23:52:40,916 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 23:52:40,916 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 23:52:40,916 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-07 23:52:40,916 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 23:52:40,916 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 23:52:40,916 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 23:52:40,916 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 23:52:40,916 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 23:52:40,917 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-07 23:52:40,917 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 -> e779827438904e8a0bb49f414cbe4d14072e556fff2389d3772808230457c73c [2024-11-07 23:52:41,277 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 23:52:41,283 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 23:52:41,285 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 23:52:41,286 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 23:52:41,286 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 23:52:41,288 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/fermat-alloca.i [2024-11-07 23:52:42,523 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 23:52:42,836 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 23:52:42,837 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/fermat-alloca.i [2024-11-07 23:52:42,851 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b65df44ea/fd243483cf85479c8e2ca8f603237680/FLAG914524840 [2024-11-07 23:52:43,096 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b65df44ea/fd243483cf85479c8e2ca8f603237680 [2024-11-07 23:52:43,099 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 23:52:43,100 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 23:52:43,102 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 23:52:43,103 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 23:52:43,107 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 23:52:43,108 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:52:43" (1/1) ... [2024-11-07 23:52:43,108 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42813e5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:52:43, skipping insertion in model container [2024-11-07 23:52:43,109 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:52:43" (1/1) ... [2024-11-07 23:52:43,143 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 23:52:43,366 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 23:52:43,377 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 23:52:43,418 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 23:52:43,445 INFO L204 MainTranslator]: Completed translation [2024-11-07 23:52:43,446 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:52:43 WrapperNode [2024-11-07 23:52:43,446 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 23:52:43,447 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 23:52:43,447 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 23:52:43,447 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 23:52:43,453 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:43" (1/1) ... [2024-11-07 23:52:43,464 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:43" (1/1) ... [2024-11-07 23:52:43,487 INFO L138 Inliner]: procedures = 109, calls = 45, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 115 [2024-11-07 23:52:43,487 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 23:52:43,488 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 23:52:43,488 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 23:52:43,488 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 23:52:43,494 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:43" (1/1) ... [2024-11-07 23:52:43,495 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:43" (1/1) ... [2024-11-07 23:52:43,498 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:43" (1/1) ... [2024-11-07 23:52:43,518 INFO L175 MemorySlicer]: Split 27 memory accesses to 4 slices as follows [8, 8, 4, 7]. 30 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0, 0]. The 9 writes are split as follows [3, 3, 1, 2]. [2024-11-07 23:52:43,518 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:43" (1/1) ... [2024-11-07 23:52:43,519 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:43" (1/1) ... [2024-11-07 23:52:43,523 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:43" (1/1) ... [2024-11-07 23:52:43,530 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:43" (1/1) ... [2024-11-07 23:52:43,531 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:43" (1/1) ... [2024-11-07 23:52:43,532 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:43" (1/1) ... [2024-11-07 23:52:43,537 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 23:52:43,538 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 23:52:43,538 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 23:52:43,538 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 23:52:43,539 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:52:43" (1/1) ... [2024-11-07 23:52:43,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:52:43,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:52:43,572 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:43,575 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:43,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-07 23:52:43,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-07 23:52:43,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-07 23:52:43,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-07 23:52:43,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 23:52:43,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-07 23:52:43,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-07 23:52:43,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-07 23:52:43,596 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-07 23:52:43,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-07 23:52:43,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 23:52:43,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 23:52:43,688 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 23:52:43,689 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 23:52:43,824 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-11-07 23:52:43,824 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 23:52:43,832 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 23:52:43,832 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 23:52:43,833 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:52:43 BoogieIcfgContainer [2024-11-07 23:52:43,833 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 23:52:43,834 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-07 23:52:43,834 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-07 23:52:43,837 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-07 23:52:43,837 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-07 23:52:43,837 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 07.11 11:52:43" (1/3) ... [2024-11-07 23:52:43,838 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7cb86a5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.11 11:52:43, skipping insertion in model container [2024-11-07 23:52:43,838 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-07 23:52:43,838 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:52:43" (2/3) ... [2024-11-07 23:52:43,838 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7cb86a5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.11 11:52:43, skipping insertion in model container [2024-11-07 23:52:43,839 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-07 23:52:43,839 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:52:43" (3/3) ... [2024-11-07 23:52:43,840 INFO L332 chiAutomizerObserver]: Analyzing ICFG fermat-alloca.i [2024-11-07 23:52:43,883 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-07 23:52:43,883 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-07 23:52:43,883 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-07 23:52:43,884 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-07 23:52:43,884 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-07 23:52:43,884 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-07 23:52:43,884 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-07 23:52:43,884 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-07 23:52:43,888 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 23:52:43,900 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-07 23:52:43,901 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-07 23:52:43,901 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-07 23:52:43,904 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-07 23:52:43,904 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-07 23:52:43,904 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-07 23:52:43,904 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 23:52:43,905 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-07 23:52:43,905 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-07 23:52:43,905 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-07 23:52:43,905 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-07 23:52:43,905 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-07 23:52:43,910 INFO L745 eck$LassoCheckResult]: Stem: 12#$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~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post24#1, main_#t~mem25#1, main_#t~mem26#1, main_~MAX~0#1.base, main_~MAX~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~MAX~0#1.base, main_~MAX~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call write~int#2(1000, main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);call write~int#1(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call write~int#0(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call write~int#3(1, main_~c~0#1.base, main_~c~0#1.offset, 4); 6#L556-2true [2024-11-07 23:52:43,911 INFO L747 eck$LassoCheckResult]: Loop: 6#L556-2true assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 13#L557true assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#2(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 5#L561true assume main_#t~mem17#1 > main_#t~mem18#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;call write~int#1(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem19#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int#0(1 + main_#t~post20#1, main_~b~0#1.base, main_~b~0#1.offset, 4);havoc main_#t~mem19#1;havoc main_#t~post20#1; 7#L561-2true call main_#t~mem21#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#2(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4#L565true assume main_#t~mem21#1 > main_#t~mem22#1;havoc main_#t~mem21#1;havoc main_#t~mem22#1;call write~int#0(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem23#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post24#1 := main_#t~mem23#1;call write~int#3(1 + main_#t~post24#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem23#1;havoc main_#t~post24#1; 10#L565-2true call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#2(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 3#L569true assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 6#L556-2true [2024-11-07 23:52:43,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:52:43,915 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-07 23:52:43,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:52:43,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077383332] [2024-11-07 23:52:43,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:52:43,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:52:44,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:52:44,051 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 23:52:44,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:52:44,112 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 23:52:44,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:52:44,115 INFO L85 PathProgramCache]: Analyzing trace with hash -903226603, now seen corresponding path program 1 times [2024-11-07 23:52:44,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:52:44,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104480328] [2024-11-07 23:52:44,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:52:44,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:52:44,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 23:52:44,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1084173288] [2024-11-07 23:52:44,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:52:44,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 23:52:44,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:52:44,153 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 23:52:44,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 23:52:44,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:52:44,260 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 23:52:44,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:52:44,289 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 23:52:44,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:52:44,290 INFO L85 PathProgramCache]: Analyzing trace with hash 643070227, now seen corresponding path program 1 times [2024-11-07 23:52:44,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:52:44,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105259976] [2024-11-07 23:52:44,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:52:44,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:52:44,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:52:44,822 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:44,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 23:52:44,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105259976] [2024-11-07 23:52:44,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105259976] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 23:52:44,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 23:52:44,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 23:52:44,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159537341] [2024-11-07 23:52:44,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 23:52:57,695 WARN L286 SmtUtils]: Spent 12.86s on a formula simplification that was a NOOP. DAG size: 118 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-11-07 23:53:09,995 WARN L286 SmtUtils]: Spent 12.04s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-07 23:53:22,401 WARN L286 SmtUtils]: Spent 12.28s on a formula simplification that was a NOOP. DAG size: 74 (called from [L 299] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-11-07 23:53:22,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 23:53:22,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 23:53:22,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 23:53:22,427 INFO L87 Difference]: Start difference. First operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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:53:22,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 23:53:22,470 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2024-11-07 23:53:22,471 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 21 transitions. [2024-11-07 23:53:22,472 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-07 23:53:22,475 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 12 states and 14 transitions. [2024-11-07 23:53:22,476 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-11-07 23:53:22,476 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-07 23:53:22,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 14 transitions. [2024-11-07 23:53:22,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-07 23:53:22,476 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 14 transitions. [2024-11-07 23:53:22,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 14 transitions. [2024-11-07 23:53:22,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-11-07 23:53:22,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 11 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:53:22,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2024-11-07 23:53:22,490 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 14 transitions. [2024-11-07 23:53:22,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 23:53:22,496 INFO L425 stractBuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2024-11-07 23:53:22,496 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-07 23:53:22,496 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 14 transitions. [2024-11-07 23:53:22,496 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-07 23:53:22,496 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-07 23:53:22,496 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-07 23:53:22,497 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-07 23:53:22,497 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-07 23:53:22,497 INFO L745 eck$LassoCheckResult]: Stem: 50#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 51#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post24#1, main_#t~mem25#1, main_#t~mem26#1, main_~MAX~0#1.base, main_~MAX~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~MAX~0#1.base, main_~MAX~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call write~int#2(1000, main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);call write~int#1(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call write~int#0(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call write~int#3(1, main_~c~0#1.base, main_~c~0#1.offset, 4); 48#L556-2 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 49#L557 assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#2(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 46#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 47#L561-2 [2024-11-07 23:53:22,498 INFO L747 eck$LassoCheckResult]: Loop: 47#L561-2 call main_#t~mem21#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#2(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 44#L565 assume main_#t~mem21#1 > main_#t~mem22#1;havoc main_#t~mem21#1;havoc main_#t~mem22#1;call write~int#0(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem23#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post24#1 := main_#t~mem23#1;call write~int#3(1 + main_#t~post24#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem23#1;havoc main_#t~post24#1; 45#L565-2 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#2(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 42#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 43#L556-2 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 53#L557 assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#2(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 52#L561 assume main_#t~mem17#1 > main_#t~mem18#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;call write~int#1(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem19#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int#0(1 + main_#t~post20#1, main_~b~0#1.base, main_~b~0#1.offset, 4);havoc main_#t~mem19#1;havoc main_#t~post20#1; 47#L561-2 [2024-11-07 23:53:22,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:53:22,499 INFO L85 PathProgramCache]: Analyzing trace with hash 28699821, now seen corresponding path program 1 times [2024-11-07 23:53:22,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:53:22,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625183469] [2024-11-07 23:53:22,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:53:22,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:53:22,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 23:53:22,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [383439610] [2024-11-07 23:53:22,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:53:22,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 23:53:22,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:53:22,545 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 23:53:22,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 23:53:22,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:53:22,643 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 23:53:22,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:53:22,675 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 23:53:22,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:53:22,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1453675845, now seen corresponding path program 2 times [2024-11-07 23:53:22,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:53:22,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458592419] [2024-11-07 23:53:22,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:53:22,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:53:22,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 23:53:22,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1337218357] [2024-11-07 23:53:22,698 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 23:53:22,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 23:53:22,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:53:22,702 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 23:53:22,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-07 23:53:22,784 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-07 23:53:22,785 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-07 23:53:22,785 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 23:53:22,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:53:22,820 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 23:53:22,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:53:22,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1341656857, now seen corresponding path program 1 times [2024-11-07 23:53:22,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:53:22,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433616376] [2024-11-07 23:53:22,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:53:22,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:53:22,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:53:23,125 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 23:53:23,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 23:53:23,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433616376] [2024-11-07 23:53:23,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433616376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 23:53:23,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 23:53:23,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 23:53:23,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676548274] [2024-11-07 23:53:23,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 23:53:24,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 23:53:24,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 23:53:24,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-07 23:53:24,569 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. cyclomatic complexity: 3 Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 23:53:24,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 23:53:24,689 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2024-11-07 23:53:24,689 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 22 transitions. [2024-11-07 23:53:24,690 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2024-11-07 23:53:24,690 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 22 transitions. [2024-11-07 23:53:24,690 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-11-07 23:53:24,690 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-11-07 23:53:24,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 22 transitions. [2024-11-07 23:53:24,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-07 23:53:24,691 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-11-07 23:53:24,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 22 transitions. [2024-11-07 23:53:24,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-07 23:53:24,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 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:53:24,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2024-11-07 23:53:24,693 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-11-07 23:53:24,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 23:53:24,694 INFO L425 stractBuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-11-07 23:53:24,694 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-07 23:53:24,694 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 22 transitions. [2024-11-07 23:53:24,694 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2024-11-07 23:53:24,695 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-07 23:53:24,695 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-07 23:53:24,695 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-07 23:53:24,695 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-07 23:53:24,695 INFO L745 eck$LassoCheckResult]: Stem: 93#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 94#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post24#1, main_#t~mem25#1, main_#t~mem26#1, main_~MAX~0#1.base, main_~MAX~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~MAX~0#1.base, main_~MAX~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call write~int#2(1000, main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);call write~int#1(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call write~int#0(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call write~int#3(1, main_~c~0#1.base, main_~c~0#1.offset, 4); 97#L556-2 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 101#L557 assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#2(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 90#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 91#L561-2 [2024-11-07 23:53:24,695 INFO L747 eck$LassoCheckResult]: Loop: 91#L561-2 call main_#t~mem21#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#2(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 88#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 89#L565-2 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#2(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 104#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 103#L556-2 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 102#L557 assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#2(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 98#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 91#L561-2 [2024-11-07 23:53:24,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:53:24,696 INFO L85 PathProgramCache]: Analyzing trace with hash 28699821, now seen corresponding path program 2 times [2024-11-07 23:53:24,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:53:24,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832922280] [2024-11-07 23:53:24,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:53:24,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:53:24,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 23:53:24,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [533788762] [2024-11-07 23:53:24,718 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 23:53:24,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 23:53:24,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:53:24,721 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 23:53:24,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-07 23:53:24,808 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-07 23:53:24,808 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-07 23:53:24,808 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 23:53:24,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:53:24,831 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 23:53:24,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:53:24,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1510934149, now seen corresponding path program 1 times [2024-11-07 23:53:24,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:53:24,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276059438] [2024-11-07 23:53:24,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:53:24,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:53:24,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 23:53:24,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [409471229] [2024-11-07 23:53:24,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:53:24,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 23:53:24,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:53:24,848 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 23:53:24,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-07 23:53:24,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:53:24,923 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 23:53:24,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:53:24,939 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 23:53:24,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:53:24,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1398915161, now seen corresponding path program 1 times [2024-11-07 23:53:24,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:53:24,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403151266] [2024-11-07 23:53:24,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:53:24,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:53:24,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 23:53:24,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1670928776] [2024-11-07 23:53:24,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:53:24,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 23:53:24,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:53:24,964 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 23:53:24,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-07 23:53:25,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:53:25,057 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 23:53:25,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:53:25,103 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 23:53:37,535 WARN L286 SmtUtils]: Spent 12.43s on a formula simplification that was a NOOP. DAG size: 96 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-11-07 23:53:49,693 WARN L286 SmtUtils]: Spent 12.04s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-07 23:54:02,106 WARN L286 SmtUtils]: Spent 12.27s on a formula simplification that was a NOOP. DAG size: 66 (called from [L 299] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-11-07 23:54:03,471 INFO L204 LassoAnalysis]: Preferences: [2024-11-07 23:54:03,472 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-07 23:54:03,472 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-07 23:54:03,472 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-07 23:54:03,472 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-07 23:54:03,472 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:54:03,472 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-07 23:54:03,472 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-07 23:54:03,472 INFO L132 ssoRankerPreferences]: Filename of dumped script: fermat-alloca.i_Iteration3_Lasso [2024-11-07 23:54:03,473 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-07 23:54:03,473 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-07 23:54:03,497 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:54:03,504 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:54:03,506 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:54:03,508 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:54:03,510 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:54:03,512 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:54:03,514 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:54:03,516 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:54:03,520 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:54:03,522 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:54:03,525 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:54:03,532 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:54:03,535 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:54:03,538 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:54:04,556 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:54:04,561 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:54:04,564 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:54:04,568 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:54:04,574 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:54:04,576 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:54:04,578 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:54:04,582 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:54:04,584 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:54:04,586 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:54:04,591 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:54:04,594 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:54:05,447 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-07 23:54:05,450 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-07 23:54:05,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:54:05,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:54:05,453 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:54:05,454 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:54:05,457 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:54:05,468 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:54:05,468 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-07 23:54:05,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:54:05,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:54:05,469 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:54:05,472 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-07 23:54:05,472 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-07 23:54:05,474 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:54:05,486 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:54:05,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:54:05,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:54:05,488 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:54:05,489 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:54:05,489 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:54:05,500 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:54:05,500 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-07 23:54:05,500 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:54:05,500 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:54:05,500 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:54:05,501 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-07 23:54:05,501 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-07 23:54:05,502 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:54:05,513 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:54:05,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:54:05,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:54:05,515 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:54:05,516 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:54:05,516 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:54:05,526 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:54:05,527 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-07 23:54:05,527 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:54:05,527 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:54:05,527 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:54:05,527 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-07 23:54:05,527 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-07 23:54:05,529 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:54:05,539 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:54:05,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:54:05,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:54:05,541 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:54:05,541 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:54:05,542 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:54:05,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:54:05,553 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-07 23:54:05,554 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:54:05,554 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:54:05,554 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:54:05,554 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-07 23:54:05,554 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-07 23:54:05,558 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:54:05,573 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:54:05,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:54:05,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:54:05,576 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:54:05,577 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:54:05,578 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:54:05,591 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:54:05,591 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-07 23:54:05,591 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:54:05,591 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:54:05,591 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:54:05,592 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-07 23:54:05,592 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-07 23:54:05,593 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:54:05,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-11-07 23:54:05,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:54:05,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:54:05,610 INFO L229 MonitoredProcess]: Starting monitored process 13 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:54:05,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-07 23:54:05,613 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:54:05,625 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:54:05,625 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-07 23:54:05,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:54:05,626 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:54:05,626 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:54:05,626 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-07 23:54:05,626 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-07 23:54:05,628 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:54:05,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-11-07 23:54:05,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:54:05,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:54:05,644 INFO L229 MonitoredProcess]: Starting monitored process 14 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:54:05,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-07 23:54:05,646 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:54:05,659 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:54:05,659 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-07 23:54:05,659 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:54:05,659 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:54:05,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:54:05,661 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-07 23:54:05,661 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-07 23:54:05,663 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:54:05,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-11-07 23:54:05,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:54:05,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:54:05,680 INFO L229 MonitoredProcess]: Starting monitored process 15 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:54:05,682 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:54:05,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-07 23:54:05,695 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:54:05,695 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-07 23:54:05,695 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:54:05,695 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:54:05,695 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:54:05,699 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-07 23:54:05,700 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-07 23:54:05,703 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:54:05,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-11-07 23:54:05,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:54:05,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:54:05,720 INFO L229 MonitoredProcess]: Starting monitored process 16 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:54:05,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-07 23:54:05,723 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:54:05,742 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:54:05,742 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-07 23:54:05,742 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:54:05,742 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:54:05,742 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:54:05,743 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-07 23:54:05,743 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-07 23:54:05,745 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:54:05,759 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-11-07 23:54:05,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:54:05,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:54:05,762 INFO L229 MonitoredProcess]: Starting monitored process 17 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:54:05,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-07 23:54:05,766 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:54:05,778 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:54:05,778 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-07 23:54:05,778 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:54:05,778 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:54:05,778 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:54:05,779 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-07 23:54:05,779 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-07 23:54:05,783 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:54:05,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-11-07 23:54:05,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:54:05,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:54:05,799 INFO L229 MonitoredProcess]: Starting monitored process 18 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:54:05,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-07 23:54:05,802 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:54:05,814 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:54:05,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:54:05,815 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:54:05,815 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:54:05,817 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-07 23:54:05,817 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-07 23:54:05,820 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:54:05,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-11-07 23:54:05,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:54:05,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:54:05,837 INFO L229 MonitoredProcess]: Starting monitored process 19 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:54:05,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-07 23:54:05,839 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:54:05,851 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:54:05,852 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-07 23:54:05,852 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:54:05,852 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:54:05,852 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:54:05,852 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-07 23:54:05,852 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-07 23:54:05,856 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:54:05,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-11-07 23:54:05,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:54:05,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:54:05,873 INFO L229 MonitoredProcess]: Starting monitored process 20 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:54:05,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-07 23:54:05,875 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:54:05,887 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:54:05,887 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-07 23:54:05,887 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:54:05,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:54:05,888 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:54:05,888 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-07 23:54:05,888 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-07 23:54:05,889 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:54:05,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-11-07 23:54:05,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:54:05,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:54:05,906 INFO L229 MonitoredProcess]: Starting monitored process 21 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:54:05,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-07 23:54:05,908 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:54:05,920 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:54:05,922 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:54:05,922 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-07 23:54:05,922 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:54:05,954 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2024-11-07 23:54:05,955 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-11-07 23:54:05,999 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-07 23:54:06,176 INFO L443 ModelExtractionUtils]: Simplification made 27 calls to the SMT solver. [2024-11-07 23:54:06,178 INFO L444 ModelExtractionUtils]: 4 out of 46 variables were initially zero. Simplification set additionally 39 variables to zero. [2024-11-07 23:54:06,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:54:06,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:54:06,182 INFO L229 MonitoredProcess]: Starting monitored process 22 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:54:06,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-07 23:54:06,184 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-07 23:54:06,201 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2024-11-07 23:54:06,202 INFO L474 LassoAnalysis]: Proved termination. [2024-11-07 23:54:06,202 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#2 ULTIMATE.start_main_~MAX~0#1.base) 0)_1, v_rep(select (select #memory_int#1 ULTIMATE.start_main_~a~0#1.base) ULTIMATE.start_main_~a~0#1.offset)_1) = 1*v_rep(select (select #memory_int#2 ULTIMATE.start_main_~MAX~0#1.base) 0)_1 - 1*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~a~0#1.base) ULTIMATE.start_main_~a~0#1.offset)_1 Supporting invariants [] [2024-11-07 23:54:06,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-11-07 23:54:06,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-11-07 23:54:06,454 INFO L156 tatePredicateManager]: 39 out of 40 supporting invariants were superfluous and have been removed [2024-11-07 23:54:06,462 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-11-07 23:54:06,463 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-11-07 23:54:06,463 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~MAX~0!base,]]] [2024-11-07 23:54:06,464 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-07 23:54:06,464 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-07 23:54:06,464 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a~0!base,]]] [2024-11-07 23:54:06,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:54:06,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:54:06,550 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 23:54:06,551 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 23:54:06,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:54:06,605 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-07 23:54:06,606 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 23:54:06,722 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 31 treesize of output 19 [2024-11-07 23:54:06,768 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:54:06,770 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:54:06,771 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 5 Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 23:54:06,895 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 5. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 26 states and 30 transitions. Complement of second has 8 states. [2024-11-07 23:54:06,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-07 23:54:06,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 23:54:06,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2024-11-07 23:54:06,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 5 letters. Loop has 7 letters. [2024-11-07 23:54:06,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-07 23:54:06,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 12 letters. Loop has 7 letters. [2024-11-07 23:54:06,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-07 23:54:06,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 5 letters. Loop has 14 letters. [2024-11-07 23:54:06,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-07 23:54:06,902 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 30 transitions. [2024-11-07 23:54:06,903 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-07 23:54:06,903 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 30 transitions. [2024-11-07 23:54:06,903 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2024-11-07 23:54:06,903 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-11-07 23:54:06,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 30 transitions. [2024-11-07 23:54:06,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-07 23:54:06,903 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 30 transitions. [2024-11-07 23:54:06,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 30 transitions. [2024-11-07 23:54:06,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-07 23:54:06,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 states have internal predecessors, (30), 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:54:06,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2024-11-07 23:54:06,905 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 30 transitions. [2024-11-07 23:54:06,905 INFO L425 stractBuchiCegarLoop]: Abstraction has 26 states and 30 transitions. [2024-11-07 23:54:06,906 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-07 23:54:06,906 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 30 transitions. [2024-11-07 23:54:06,906 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-07 23:54:06,906 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-07 23:54:06,906 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-07 23:54:06,907 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 23:54:06,907 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-07 23:54:06,907 INFO L745 eck$LassoCheckResult]: Stem: 371#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 372#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post24#1, main_#t~mem25#1, main_#t~mem26#1, main_~MAX~0#1.base, main_~MAX~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~MAX~0#1.base, main_~MAX~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call write~int#2(1000, main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);call write~int#1(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call write~int#0(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call write~int#3(1, main_~c~0#1.base, main_~c~0#1.offset, 4); 374#L556-2 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 378#L557 assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#2(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 376#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 375#L561-2 call main_#t~mem21#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#2(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 361#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 362#L565-2 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#2(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 357#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 358#L556-2 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 369#L557 assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#2(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 365#L561 assume main_#t~mem17#1 > main_#t~mem18#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;call write~int#1(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem19#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int#0(1 + main_#t~post20#1, main_~b~0#1.base, main_~b~0#1.offset, 4);havoc main_#t~mem19#1;havoc main_#t~post20#1; 366#L561-2 [2024-11-07 23:54:06,907 INFO L747 eck$LassoCheckResult]: Loop: 366#L561-2 call main_#t~mem21#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#2(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 373#L565 assume main_#t~mem21#1 > main_#t~mem22#1;havoc main_#t~mem21#1;havoc main_#t~mem22#1;call write~int#0(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem23#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post24#1 := main_#t~mem23#1;call write~int#3(1 + main_#t~post24#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem23#1;havoc main_#t~post24#1; 382#L565-2 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#2(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 381#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 380#L556-2 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 379#L557 assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#2(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 377#L561 assume main_#t~mem17#1 > main_#t~mem18#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;call write~int#1(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem19#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int#0(1 + main_#t~post20#1, main_~b~0#1.base, main_~b~0#1.offset, 4);havoc main_#t~mem19#1;havoc main_#t~post20#1; 366#L561-2 [2024-11-07 23:54:06,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:54:06,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1398915159, now seen corresponding path program 1 times [2024-11-07 23:54:06,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:54:06,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497607076] [2024-11-07 23:54:06,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:54:06,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:54:06,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:54:07,231 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 23:54:07,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 23:54:07,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497607076] [2024-11-07 23:54:07,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497607076] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 23:54:07,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589171618] [2024-11-07 23:54:07,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:54:07,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 23:54:07,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:54:07,235 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 23:54:07,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-11-07 23:54:07,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:54:07,331 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-07 23:54:07,334 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 23:54:07,344 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 11 treesize of output 7 [2024-11-07 23:54:07,352 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 11 treesize of output 7 [2024-11-07 23:54:07,375 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 19 treesize of output 11 [2024-11-07 23:54:07,474 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 23:54:07,475 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 23:54:07,578 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 23:54:07,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589171618] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 23:54:07,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 23:54:07,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 10 [2024-11-07 23:54:07,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360483539] [2024-11-07 23:54:07,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 23:54:07,579 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-07 23:54:07,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:54:07,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1453675845, now seen corresponding path program 3 times [2024-11-07 23:54:07,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:54:07,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902491190] [2024-11-07 23:54:07,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:54:07,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:54:07,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 23:54:07,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [350670987] [2024-11-07 23:54:07,591 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-07 23:54:07,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 23:54:07,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:54:07,593 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 23:54:07,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-11-07 23:54:07,670 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-07 23:54:07,670 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-07 23:54:07,670 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 23:54:07,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:54:07,695 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 23:54:08,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 23:54:08,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 23:54:08,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-07 23:54:08,723 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. cyclomatic complexity: 6 Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 23:54:08,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 23:54:08,926 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2024-11-07 23:54:08,926 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 67 transitions. [2024-11-07 23:54:08,928 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-07 23:54:08,928 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 46 states and 49 transitions. [2024-11-07 23:54:08,928 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-11-07 23:54:08,929 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-11-07 23:54:08,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 49 transitions. [2024-11-07 23:54:08,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-07 23:54:08,929 INFO L218 hiAutomatonCegarLoop]: Abstraction has 46 states and 49 transitions. [2024-11-07 23:54:08,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 49 transitions. [2024-11-07 23:54:08,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 40. [2024-11-07 23:54:08,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 23:54:08,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2024-11-07 23:54:08,931 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 43 transitions. [2024-11-07 23:54:08,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 23:54:08,932 INFO L425 stractBuchiCegarLoop]: Abstraction has 40 states and 43 transitions. [2024-11-07 23:54:08,932 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-07 23:54:08,932 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 43 transitions. [2024-11-07 23:54:08,933 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-07 23:54:08,933 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-07 23:54:08,933 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-07 23:54:08,934 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 4, 4, 1, 1, 1] [2024-11-07 23:54:08,934 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-07 23:54:08,934 INFO L745 eck$LassoCheckResult]: Stem: 550#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 551#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post24#1, main_#t~mem25#1, main_#t~mem26#1, main_~MAX~0#1.base, main_~MAX~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~MAX~0#1.base, main_~MAX~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call write~int#2(1000, main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);call write~int#1(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call write~int#0(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call write~int#3(1, main_~c~0#1.base, main_~c~0#1.offset, 4); 554#L556-2 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 558#L557 assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#2(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 541#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 542#L561-2 call main_#t~mem21#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#2(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 552#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 566#L565-2 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#2(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 565#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 564#L556-2 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 549#L557 assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#2(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 543#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 544#L561-2 call main_#t~mem21#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#2(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 567#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 572#L565-2 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#2(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 571#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 570#L556-2 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 569#L557 assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#2(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 568#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 553#L561-2 call main_#t~mem21#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#2(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 539#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 540#L565-2 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#2(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 535#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 536#L556-2 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 547#L557 assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#2(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 563#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 562#L561-2 call main_#t~mem21#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#2(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 561#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 560#L565-2 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#2(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 533#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 534#L556-2 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 546#L557 assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#2(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 548#L561 assume main_#t~mem17#1 > main_#t~mem18#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;call write~int#1(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem19#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int#0(1 + main_#t~post20#1, main_~b~0#1.base, main_~b~0#1.offset, 4);havoc main_#t~mem19#1;havoc main_#t~post20#1; 555#L561-2 [2024-11-07 23:54:08,935 INFO L747 eck$LassoCheckResult]: Loop: 555#L561-2 call main_#t~mem21#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#2(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 537#L565 assume main_#t~mem21#1 > main_#t~mem22#1;havoc main_#t~mem21#1;havoc main_#t~mem22#1;call write~int#0(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem23#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post24#1 := main_#t~mem23#1;call write~int#3(1 + main_#t~post24#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem23#1;havoc main_#t~post24#1; 538#L565-2 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#2(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 545#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 559#L556-2 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 557#L557 assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#2(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 556#L561 assume main_#t~mem17#1 > main_#t~mem18#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;call write~int#1(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem19#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int#0(1 + main_#t~post20#1, main_~b~0#1.base, main_~b~0#1.offset, 4);havoc main_#t~mem19#1;havoc main_#t~post20#1; 555#L561-2 [2024-11-07 23:54:08,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:54:08,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1830413909, now seen corresponding path program 2 times [2024-11-07 23:54:08,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:54:08,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229582065] [2024-11-07 23:54:08,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:54:08,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:54:08,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:54:09,834 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 23:54:09,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 23:54:09,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229582065] [2024-11-07 23:54:09,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229582065] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 23:54:09,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031016167] [2024-11-07 23:54:09,834 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 23:54:09,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 23:54:09,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:54:09,838 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 23:54:09,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-11-07 23:54:09,974 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 23:54:09,974 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 23:54:09,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-07 23:54:09,978 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 23:54:09,985 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 11 treesize of output 7 [2024-11-07 23:54:09,993 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 11 treesize of output 7 [2024-11-07 23:54:10,012 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 19 treesize of output 11 [2024-11-07 23:54:10,086 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 19 treesize of output 11 [2024-11-07 23:54:10,172 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 19 treesize of output 11 [2024-11-07 23:54:10,259 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 19 treesize of output 11 [2024-11-07 23:54:10,385 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 23:54:10,385 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 23:54:10,672 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 23:54:10,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031016167] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 23:54:10,672 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 23:54:10,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 22 [2024-11-07 23:54:10,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708214428] [2024-11-07 23:54:10,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 23:54:10,673 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-07 23:54:10,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:54:10,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1453675845, now seen corresponding path program 4 times [2024-11-07 23:54:10,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:54:10,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026856951] [2024-11-07 23:54:10,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:54:10,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:54:10,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 23:54:10,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1503542202] [2024-11-07 23:54:10,690 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-07 23:54:10,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 23:54:10,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:54:10,694 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 23:54:10,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-11-07 23:54:10,784 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-07 23:54:10,784 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-07 23:54:10,784 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 23:54:10,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:54:10,801 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 23:54:11,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 23:54:11,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-07 23:54:11,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=349, Unknown=0, NotChecked=0, Total=506 [2024-11-07 23:54:11,761 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. cyclomatic complexity: 5 Second operand has 23 states, 22 states have (on average 4.318181818181818) internal successors, (95), 23 states have internal predecessors, (95), 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:54:12,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 23:54:12,392 INFO L93 Difference]: Finished difference Result 124 states and 127 transitions. [2024-11-07 23:54:12,392 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 127 transitions. [2024-11-07 23:54:12,394 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-07 23:54:12,395 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 88 states and 91 transitions. [2024-11-07 23:54:12,395 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-11-07 23:54:12,395 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-11-07 23:54:12,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 88 states and 91 transitions. [2024-11-07 23:54:12,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-07 23:54:12,395 INFO L218 hiAutomatonCegarLoop]: Abstraction has 88 states and 91 transitions. [2024-11-07 23:54:12,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states and 91 transitions. [2024-11-07 23:54:12,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 82. [2024-11-07 23:54:12,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 82 states have (on average 1.0365853658536586) internal successors, (85), 81 states have internal predecessors, (85), 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:54:12,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2024-11-07 23:54:12,403 INFO L240 hiAutomatonCegarLoop]: Abstraction has 82 states and 85 transitions. [2024-11-07 23:54:12,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-07 23:54:12,405 INFO L425 stractBuchiCegarLoop]: Abstraction has 82 states and 85 transitions. [2024-11-07 23:54:12,405 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-07 23:54:12,405 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 85 transitions. [2024-11-07 23:54:12,406 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-07 23:54:12,406 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-07 23:54:12,406 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-07 23:54:12,408 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 11, 10, 10, 10, 10, 10, 1, 1, 1] [2024-11-07 23:54:12,408 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-07 23:54:12,412 INFO L745 eck$LassoCheckResult]: Stem: 950#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 951#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post24#1, main_#t~mem25#1, main_#t~mem26#1, main_~MAX~0#1.base, main_~MAX~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~MAX~0#1.base, main_~MAX~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call write~int#2(1000, main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);call write~int#1(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call write~int#0(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call write~int#3(1, main_~c~0#1.base, main_~c~0#1.offset, 4); 953#L556-2 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 957#L557 assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#2(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 941#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 942#L561-2 call main_#t~mem21#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#2(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 952#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 1014#L565-2 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#2(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1013#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 1012#L556-2 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 1011#L557 assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#2(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 943#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 944#L561-2 call main_#t~mem21#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#2(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 939#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 940#L565-2 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#2(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 935#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 936#L556-2 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 947#L557 assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#2(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 949#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 1010#L561-2 call main_#t~mem21#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#2(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1009#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 1008#L565-2 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#2(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1007#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 1006#L556-2 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 1005#L557 assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#2(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1004#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 1003#L561-2 call main_#t~mem21#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#2(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1002#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 1001#L565-2 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#2(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 1000#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 999#L556-2 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 998#L557 assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#2(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 997#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 996#L561-2 call main_#t~mem21#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#2(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 995#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 994#L565-2 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#2(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 993#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 992#L556-2 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 991#L557 assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#2(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 990#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 989#L561-2 call main_#t~mem21#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#2(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 988#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 987#L565-2 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#2(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 986#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 985#L556-2 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 984#L557 assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#2(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 983#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 982#L561-2 call main_#t~mem21#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#2(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 981#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 980#L565-2 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#2(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 979#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 978#L556-2 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 977#L557 assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#2(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 976#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 975#L561-2 call main_#t~mem21#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#2(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 974#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 973#L565-2 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#2(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 972#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 971#L556-2 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 970#L557 assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#2(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 969#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 968#L561-2 call main_#t~mem21#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#2(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 962#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 967#L565-2 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#2(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 966#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 965#L556-2 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 964#L557 assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#2(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 963#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 961#L561-2 call main_#t~mem21#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#2(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 960#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 959#L565-2 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#2(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 933#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 934#L556-2 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 946#L557 assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#2(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 948#L561 assume main_#t~mem17#1 > main_#t~mem18#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;call write~int#1(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem19#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int#0(1 + main_#t~post20#1, main_~b~0#1.base, main_~b~0#1.offset, 4);havoc main_#t~mem19#1;havoc main_#t~post20#1; 954#L561-2 [2024-11-07 23:54:12,412 INFO L747 eck$LassoCheckResult]: Loop: 954#L561-2 call main_#t~mem21#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int#2(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 937#L565 assume main_#t~mem21#1 > main_#t~mem22#1;havoc main_#t~mem21#1;havoc main_#t~mem22#1;call write~int#0(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem23#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post24#1 := main_#t~mem23#1;call write~int#3(1 + main_#t~post24#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem23#1;havoc main_#t~post24#1; 938#L565-2 call main_#t~mem25#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int#2(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 945#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 958#L556-2 assume !false;call main_#t~mem6#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int#3(main_~c~0#1.base, main_~c~0#1.offset, 4); 956#L557 assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int#1(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int#1(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int#2(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 955#L561 assume main_#t~mem17#1 > main_#t~mem18#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;call write~int#1(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem19#1 := read~int#0(main_~b~0#1.base, main_~b~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int#0(1 + main_#t~post20#1, main_~b~0#1.base, main_~b~0#1.offset, 4);havoc main_#t~mem19#1;havoc main_#t~post20#1; 954#L561-2 [2024-11-07 23:54:12,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:54:12,413 INFO L85 PathProgramCache]: Analyzing trace with hash 589434155, now seen corresponding path program 3 times [2024-11-07 23:54:12,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:54:12,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179120158] [2024-11-07 23:54:12,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:54:12,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:54:12,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:54:14,809 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 23:54:14,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 23:54:14,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179120158] [2024-11-07 23:54:14,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179120158] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 23:54:14,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309082215] [2024-11-07 23:54:14,810 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-07 23:54:14,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 23:54:14,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:54:14,813 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 23:54:14,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-11-07 23:54:15,684 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-07 23:54:15,684 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 23:54:15,688 INFO L255 TraceCheckSpWp]: Trace formula consists of 899 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-07 23:54:15,694 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 23:54:15,700 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 11 treesize of output 7 [2024-11-07 23:54:15,706 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 11 treesize of output 7 [2024-11-07 23:54:15,726 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 19 treesize of output 11 [2024-11-07 23:54:15,799 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 19 treesize of output 11 [2024-11-07 23:54:15,887 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 19 treesize of output 11 [2024-11-07 23:54:15,968 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 19 treesize of output 11 [2024-11-07 23:54:16,047 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 19 treesize of output 11 [2024-11-07 23:54:16,104 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 19 treesize of output 11 [2024-11-07 23:54:16,168 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 19 treesize of output 11 [2024-11-07 23:54:16,249 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 19 treesize of output 11 [2024-11-07 23:54:16,323 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 19 treesize of output 11 [2024-11-07 23:54:16,403 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 19 treesize of output 11 [2024-11-07 23:54:16,510 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 23:54:16,510 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 23:54:17,283 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 23:54:17,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309082215] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 23:54:17,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 23:54:17,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 13, 13] total 46 [2024-11-07 23:54:17,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891152408] [2024-11-07 23:54:17,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 23:54:17,284 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-07 23:54:17,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:54:17,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1453675845, now seen corresponding path program 5 times [2024-11-07 23:54:17,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:54:17,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132445926] [2024-11-07 23:54:17,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:54:17,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:54:17,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 23:54:17,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [717103024] [2024-11-07 23:54:17,296 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-07 23:54:17,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 23:54:17,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:54:17,299 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 23:54:17,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2024-11-07 23:54:17,388 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-07 23:54:17,388 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-07 23:54:17,388 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 23:54:17,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:54:17,415 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 23:54:18,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 23:54:18,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-07 23:54:18,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=1459, Unknown=0, NotChecked=0, Total=2162 [2024-11-07 23:54:18,425 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. cyclomatic complexity: 5 Second operand has 47 states, 46 states have (on average 4.804347826086956) internal successors, (221), 47 states have internal predecessors, (221), 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)