./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/java_Sequence-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/java_Sequence-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', 'd628f3524885345eb9e2318f2d0dbb026e233c3bcc51319b2ad8fc1a71d35580'] 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/java_Sequence-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 d628f3524885345eb9e2318f2d0dbb026e233c3bcc51319b2ad8fc1a71d35580 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 23:52:52,667 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 23:52:52,767 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:52,771 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 23:52:52,771 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 23:52:52,797 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 23:52:52,797 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 23:52:52,798 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 23:52:52,798 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 23:52:52,799 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 23:52:52,800 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 23:52:52,800 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 23:52:52,800 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 23:52:52,800 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-07 23:52:52,800 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-07 23:52:52,801 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-07 23:52:52,801 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-07 23:52:52,801 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-07 23:52:52,801 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-07 23:52:52,802 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 23:52:52,802 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-07 23:52:52,802 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 23:52:52,802 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 23:52:52,802 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-07 23:52:52,802 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-07 23:52:52,803 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-07 23:52:52,803 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 23:52:52,803 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 23:52:52,803 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 23:52:52,803 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-07 23:52:52,803 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 23:52:52,803 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 23:52:52,803 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 23:52:52,803 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 23:52:52,804 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 23:52:52,804 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-07 23:52:52,804 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 -> d628f3524885345eb9e2318f2d0dbb026e233c3bcc51319b2ad8fc1a71d35580 [2024-11-07 23:52:53,081 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 23:52:53,090 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 23:52:53,093 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 23:52:53,094 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 23:52:53,094 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 23:52:53,096 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/java_Sequence-alloca.i [2024-11-07 23:52:54,431 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 23:52:54,650 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 23:52:54,651 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/java_Sequence-alloca.i [2024-11-07 23:52:54,663 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/177f29b2a/f58792a70b0a40b1ab169541604a4225/FLAGb33b9eb82 [2024-11-07 23:52:54,682 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/177f29b2a/f58792a70b0a40b1ab169541604a4225 [2024-11-07 23:52:54,684 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 23:52:54,685 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 23:52:54,688 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 23:52:54,688 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 23:52:54,693 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 23:52:54,694 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:52:54" (1/1) ... [2024-11-07 23:52:54,696 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23078608 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:52:54, skipping insertion in model container [2024-11-07 23:52:54,696 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:52:54" (1/1) ... [2024-11-07 23:52:54,724 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 23:52:54,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 23:52:54,908 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 23:52:54,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 23:52:54,968 INFO L204 MainTranslator]: Completed translation [2024-11-07 23:52:54,969 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:52:54 WrapperNode [2024-11-07 23:52:54,969 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 23:52:54,970 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 23:52:54,970 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 23:52:54,970 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 23:52:54,975 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:54" (1/1) ... [2024-11-07 23:52:54,986 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:54" (1/1) ... [2024-11-07 23:52:55,001 INFO L138 Inliner]: procedures = 109, calls = 25, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 56 [2024-11-07 23:52:55,002 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 23:52:55,002 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 23:52:55,002 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 23:52:55,002 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 23:52:55,010 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:54" (1/1) ... [2024-11-07 23:52:55,011 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:54" (1/1) ... [2024-11-07 23:52:55,015 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:54" (1/1) ... [2024-11-07 23:52:55,027 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [4, 6, 4]. 43 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0]. The 7 writes are split as follows [2, 3, 2]. [2024-11-07 23:52:55,028 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:54" (1/1) ... [2024-11-07 23:52:55,028 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:54" (1/1) ... [2024-11-07 23:52:55,035 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:54" (1/1) ... [2024-11-07 23:52:55,038 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:54" (1/1) ... [2024-11-07 23:52:55,039 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:54" (1/1) ... [2024-11-07 23:52:55,044 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:54" (1/1) ... [2024-11-07 23:52:55,045 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 23:52:55,048 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 23:52:55,048 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 23:52:55,048 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 23:52:55,049 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:52:54" (1/1) ... [2024-11-07 23:52:55,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:52:55,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:52:55,083 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:55,087 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:55,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-07 23:52:55,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-07 23:52:55,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-07 23:52:55,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 23:52:55,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-07 23:52:55,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-07 23:52:55,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-07 23:52:55,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-07 23:52:55,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 23:52:55,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 23:52:55,212 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 23:52:55,214 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 23:52:55,341 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-11-07 23:52:55,341 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 23:52:55,349 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 23:52:55,349 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-07 23:52:55,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:52:55 BoogieIcfgContainer [2024-11-07 23:52:55,349 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 23:52:55,350 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-07 23:52:55,350 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-07 23:52:55,354 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-07 23:52:55,354 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-07 23:52:55,354 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 07.11 11:52:54" (1/3) ... [2024-11-07 23:52:55,355 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@633b9d71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.11 11:52:55, skipping insertion in model container [2024-11-07 23:52:55,355 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-07 23:52:55,355 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:52:54" (2/3) ... [2024-11-07 23:52:55,355 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@633b9d71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.11 11:52:55, skipping insertion in model container [2024-11-07 23:52:55,355 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-07 23:52:55,355 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:52:55" (3/3) ... [2024-11-07 23:52:55,356 INFO L332 chiAutomizerObserver]: Analyzing ICFG java_Sequence-alloca.i [2024-11-07 23:52:55,399 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-07 23:52:55,400 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-07 23:52:55,400 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-07 23:52:55,400 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-07 23:52:55,400 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-07 23:52:55,401 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-07 23:52:55,401 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-07 23:52:55,401 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-07 23:52:55,405 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 23:52:55,416 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-11-07 23:52:55,416 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-07 23:52:55,416 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-07 23:52:55,420 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-07 23:52:55,420 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-07 23:52:55,420 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-07 23:52:55,420 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 23:52:55,421 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-11-07 23:52:55,421 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-07 23:52:55,421 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-07 23:52:55,421 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-07 23:52:55,421 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-07 23:52:55,427 INFO L745 eck$LassoCheckResult]: Stem: 12#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6#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~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~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_~i~0#1.base, main_~i~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_~j~0#1.base, main_~j~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_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int#1(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#2(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 4#L552-4true [2024-11-07 23:52:55,427 INFO L747 eck$LassoCheckResult]: Loop: 4#L552-4true call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 9#L552-1true assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 3#L552-3true call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 4#L552-4true [2024-11-07 23:52:55,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:52:55,432 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-07 23:52:55,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:52:55,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984290680] [2024-11-07 23:52:55,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:52:55,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:52:55,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:52:55,567 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 23:52:55,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:52:55,615 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 23:52:55,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:52:55,617 INFO L85 PathProgramCache]: Analyzing trace with hash 35911, now seen corresponding path program 1 times [2024-11-07 23:52:55,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:52:55,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490394829] [2024-11-07 23:52:55,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:52:55,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:52:55,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:52:55,638 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 23:52:55,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:52:55,650 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 23:52:55,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:52:55,653 INFO L85 PathProgramCache]: Analyzing trace with hash 28694853, now seen corresponding path program 1 times [2024-11-07 23:52:55,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:52:55,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886659696] [2024-11-07 23:52:55,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:52:55,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:52:55,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:52:55,727 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 23:52:55,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:52:55,756 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 23:52:56,361 INFO L204 LassoAnalysis]: Preferences: [2024-11-07 23:52:56,362 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-07 23:52:56,362 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-07 23:52:56,362 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-07 23:52:56,362 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-07 23:52:56,362 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:52:56,362 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-07 23:52:56,363 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-07 23:52:56,363 INFO L132 ssoRankerPreferences]: Filename of dumped script: java_Sequence-alloca.i_Iteration1_Lasso [2024-11-07 23:52:56,363 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-07 23:52:56,363 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-07 23:52:56,377 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:52:56,384 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:52:56,387 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:52:56,391 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:52:56,393 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:52:56,398 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:52:56,402 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:52:56,405 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:52:56,408 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:52:56,412 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:52:56,759 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:52:56,762 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:52:56,767 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:52:56,770 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:52:57,079 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-07 23:52:57,082 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-07 23:52:57,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:52:57,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:52:57,087 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-07 23:52:57,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-07 23:52:57,090 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-07 23:52:57,106 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:52:57,106 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-07 23:52:57,107 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:52:57,107 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:52:57,107 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:52:57,111 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-07 23:52:57,112 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-07 23:52:57,114 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:52:57,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-11-07 23:52:57,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:52:57,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:52:57,131 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-07 23:52:57,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-07 23:52:57,133 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-07 23:52:57,147 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:52:57,147 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-07 23:52:57,147 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:52:57,147 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:52:57,147 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:52:57,148 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-07 23:52:57,148 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-07 23:52:57,150 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:52:57,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-11-07 23:52:57,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:52:57,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:52:57,167 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-07 23:52:57,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-07 23:52:57,170 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-07 23:52:57,182 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:52:57,183 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-07 23:52:57,183 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:52:57,183 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:52:57,183 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:52:57,186 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-07 23:52:57,186 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-07 23:52:57,188 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:52:57,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-11-07 23:52:57,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:52:57,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:52:57,205 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-07 23:52:57,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-07 23:52:57,208 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-07 23:52:57,220 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:52:57,220 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-07 23:52:57,221 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:52:57,221 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:52:57,221 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:52:57,221 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-07 23:52:57,221 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-07 23:52:57,223 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:52:57,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-07 23:52:57,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:52:57,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:52:57,240 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-07 23:52:57,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-07 23:52:57,242 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-07 23:52:57,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:52:57,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:52:57,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:52:57,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:52:57,258 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-07 23:52:57,258 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-07 23:52:57,261 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:52:57,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-11-07 23:52:57,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:52:57,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:52:57,279 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-07 23:52:57,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-07 23:52:57,281 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-07 23:52:57,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:52:57,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:52:57,294 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:52:57,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:52:57,297 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-07 23:52:57,297 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-07 23:52:57,301 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:52:57,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-07 23:52:57,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:52:57,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:52:57,318 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-07 23:52:57,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-07 23:52:57,320 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-07 23:52:57,333 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:52:57,334 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:52:57,334 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:52:57,334 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:52:57,338 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-07 23:52:57,339 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-07 23:52:57,345 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:52:57,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-11-07 23:52:57,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:52:57,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:52:57,363 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-07 23:52:57,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-07 23:52:57,365 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-07 23:52:57,378 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:52:57,378 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-07 23:52:57,378 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:52:57,378 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:52:57,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:52:57,379 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-07 23:52:57,379 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-07 23:52:57,382 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:52:57,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-07 23:52:57,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:52:57,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:52:57,398 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-07 23:52:57,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-07 23:52:57,400 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-07 23:52:57,410 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:52:57,410 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-07 23:52:57,410 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:52:57,410 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:52:57,410 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:52:57,411 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-07 23:52:57,411 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-07 23:52:57,414 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:52:57,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-07 23:52:57,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:52:57,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:52:57,427 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-07 23:52:57,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-07 23:52:57,429 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-07 23:52:57,438 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:52:57,439 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:52:57,439 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:52:57,439 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:52:57,443 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-07 23:52:57,443 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-07 23:52:57,456 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:52:57,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-11-07 23:52:57,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:52:57,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:52:57,472 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-07 23:52:57,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-07 23:52:57,474 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-07 23:52:57,484 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:52:57,484 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:52:57,484 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:52:57,484 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:52:57,488 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-07 23:52:57,488 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-07 23:52:57,493 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:52:57,506 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:52:57,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:52:57,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:52:57,508 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:52:57,509 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:52:57,509 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-07 23:52:57,519 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:52:57,519 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:52:57,519 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:52:57,519 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:52:57,522 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-07 23:52:57,522 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-07 23:52:57,528 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-07 23:52:57,539 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2024-11-07 23:52:57,542 INFO L444 ModelExtractionUtils]: 1 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2024-11-07 23:52:57,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:52:57,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:52:57,548 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:52:57,549 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:52:57,550 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-07 23:52:57,565 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-07 23:52:57,565 INFO L474 LassoAnalysis]: Proved termination. [2024-11-07 23:52:57,566 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#2 ULTIMATE.start_main_~i~0#1.base) ULTIMATE.start_main_~i~0#1.offset)_1) = -2*v_rep(select (select #memory_int#2 ULTIMATE.start_main_~i~0#1.base) ULTIMATE.start_main_~i~0#1.offset)_1 + 199 Supporting invariants [] [2024-11-07 23:52:57,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-11-07 23:52:57,621 INFO L156 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2024-11-07 23:52:57,627 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-11-07 23:52:57,628 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-11-07 23:52:57,628 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~i~0!base,]]] [2024-11-07 23:52:57,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:52:57,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:52:57,677 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 23:52:57,677 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 23:52:57,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:52:57,695 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 23:52:57,696 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 23:52:57,755 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:57,781 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-11-07 23:52:57,783 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 23:52:57,843 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 30 states and 37 transitions. Complement of second has 10 states. [2024-11-07 23:52:57,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-11-07 23:52:57,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 23:52:57,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2024-11-07 23:52:57,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 2 letters. Loop has 3 letters. [2024-11-07 23:52:57,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-07 23:52:57,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 5 letters. Loop has 3 letters. [2024-11-07 23:52:57,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-07 23:52:57,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 2 letters. Loop has 6 letters. [2024-11-07 23:52:57,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-07 23:52:57,860 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 37 transitions. [2024-11-07 23:52:57,861 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-07 23:52:57,865 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 11 states and 13 transitions. [2024-11-07 23:52:57,866 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2024-11-07 23:52:57,866 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-11-07 23:52:57,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2024-11-07 23:52:57,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-07 23:52:57,867 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 13 transitions. [2024-11-07 23:52:57,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2024-11-07 23:52:57,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2024-11-07 23:52:57,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 23:52:57,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2024-11-07 23:52:57,886 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11 states and 13 transitions. [2024-11-07 23:52:57,886 INFO L425 stractBuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2024-11-07 23:52:57,886 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-07 23:52:57,886 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. [2024-11-07 23:52:57,887 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-07 23:52:57,887 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-07 23:52:57,887 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-07 23:52:57,887 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-07 23:52:57,887 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-07 23:52:57,887 INFO L745 eck$LassoCheckResult]: Stem: 157#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 158#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~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~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_~i~0#1.base, main_~i~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_~j~0#1.base, main_~j~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_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int#1(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#2(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 151#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 153#L552-1 assume !(main_#t~mem5#1 < 100);havoc main_#t~mem5#1; 154#L552-5 call write~int#0(5, main_~j~0#1.base, main_~j~0#1.offset, 4); 155#L553-4 [2024-11-07 23:52:57,887 INFO L747 eck$LassoCheckResult]: Loop: 155#L553-4 call main_#t~mem9#1 := read~int#0(main_~j~0#1.base, main_~j~0#1.offset, 4); 159#L553-1 assume !!(main_#t~mem9#1 < 21);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem10#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 156#L553-3 call main_#t~mem11#1 := read~int#0(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#0(3 + main_#t~mem11#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem11#1; 155#L553-4 [2024-11-07 23:52:57,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:52:57,888 INFO L85 PathProgramCache]: Analyzing trace with hash 28694795, now seen corresponding path program 1 times [2024-11-07 23:52:57,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:52:57,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024001474] [2024-11-07 23:52:57,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:52:57,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:52:57,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:52:58,043 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:58,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 23:52:58,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024001474] [2024-11-07 23:52:58,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024001474] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 23:52:58,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 23:52:58,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 23:52:58,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026771086] [2024-11-07 23:52:58,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 23:52:58,050 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-07 23:52:58,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:52:58,050 INFO L85 PathProgramCache]: Analyzing trace with hash 50806, now seen corresponding path program 1 times [2024-11-07 23:52:58,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:52:58,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870382267] [2024-11-07 23:52:58,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:52:58,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:52:58,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:52:58,067 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 23:52:58,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:52:58,075 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 23:52:58,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 23:52:58,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 23:52:58,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 23:52:58,160 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. cyclomatic complexity: 4 Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 23:52:58,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 23:52:58,181 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2024-11-07 23:52:58,182 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 15 transitions. [2024-11-07 23:52:58,182 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-07 23:52:58,182 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 13 states and 14 transitions. [2024-11-07 23:52:58,183 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-11-07 23:52:58,183 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-11-07 23:52:58,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2024-11-07 23:52:58,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-07 23:52:58,183 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 14 transitions. [2024-11-07 23:52:58,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2024-11-07 23:52:58,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2024-11-07 23:52:58,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 10 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:52:58,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2024-11-07 23:52:58,184 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11 states and 12 transitions. [2024-11-07 23:52:58,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 23:52:58,186 INFO L425 stractBuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2024-11-07 23:52:58,186 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-07 23:52:58,186 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2024-11-07 23:52:58,186 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-07 23:52:58,187 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-07 23:52:58,187 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-07 23:52:58,188 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-07 23:52:58,188 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-07 23:52:58,188 INFO L745 eck$LassoCheckResult]: Stem: 191#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 192#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~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~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_~i~0#1.base, main_~i~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_~j~0#1.base, main_~j~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_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int#1(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#2(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 185#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 186#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 183#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 184#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 187#L552-1 assume !(main_#t~mem5#1 < 100);havoc main_#t~mem5#1; 188#L552-5 call write~int#0(5, main_~j~0#1.base, main_~j~0#1.offset, 4); 189#L553-4 [2024-11-07 23:52:58,189 INFO L747 eck$LassoCheckResult]: Loop: 189#L553-4 call main_#t~mem9#1 := read~int#0(main_~j~0#1.base, main_~j~0#1.offset, 4); 193#L553-1 assume !!(main_#t~mem9#1 < 21);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem10#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 190#L553-3 call main_#t~mem11#1 := read~int#0(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#0(3 + main_#t~mem11#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem11#1; 189#L553-4 [2024-11-07 23:52:58,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:52:58,189 INFO L85 PathProgramCache]: Analyzing trace with hash 149879881, now seen corresponding path program 1 times [2024-11-07 23:52:58,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:52:58,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058108063] [2024-11-07 23:52:58,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:52:58,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:52:58,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:52:58,439 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 23:52:58,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 23:52:58,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058108063] [2024-11-07 23:52:58,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058108063] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 23:52:58,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634768861] [2024-11-07 23:52:58,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:52:58,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 23:52:58,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:52:58,442 INFO L229 MonitoredProcess]: Starting monitored process 15 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:58,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-07 23:52:58,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:52:58,505 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 23:52:58,506 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 23:52:58,526 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:52:58,543 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 23 treesize of output 3 [2024-11-07 23:52:58,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2024-11-07 23:52:58,555 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 23:52:58,555 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 23:52:58,619 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:52:58,619 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 23:52:58,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634768861] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 23:52:58,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 23:52:58,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2024-11-07 23:52:58,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457388343] [2024-11-07 23:52:58,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 23:52:58,621 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-07 23:52:58,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:52:58,621 INFO L85 PathProgramCache]: Analyzing trace with hash 50806, now seen corresponding path program 2 times [2024-11-07 23:52:58,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:52:58,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520650434] [2024-11-07 23:52:58,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:52:58,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:52:58,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:52:58,627 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 23:52:58,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:52:58,630 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 23:52:58,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 23:52:58,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 23:52:58,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-11-07 23:52:58,704 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. cyclomatic complexity: 3 Second operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 23:52:58,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 23:52:58,762 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2024-11-07 23:52:58,762 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 26 transitions. [2024-11-07 23:52:58,762 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-07 23:52:58,763 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 22 states and 23 transitions. [2024-11-07 23:52:58,763 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-11-07 23:52:58,763 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-11-07 23:52:58,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 23 transitions. [2024-11-07 23:52:58,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-07 23:52:58,763 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 23 transitions. [2024-11-07 23:52:58,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 23 transitions. [2024-11-07 23:52:58,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2024-11-07 23:52:58,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.05) internal successors, (21), 19 states have internal predecessors, (21), 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:58,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2024-11-07 23:52:58,766 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 21 transitions. [2024-11-07 23:52:58,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 23:52:58,767 INFO L425 stractBuchiCegarLoop]: Abstraction has 20 states and 21 transitions. [2024-11-07 23:52:58,768 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-07 23:52:58,768 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 21 transitions. [2024-11-07 23:52:58,769 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-07 23:52:58,769 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-07 23:52:58,769 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-07 23:52:58,770 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 1, 1, 1, 1] [2024-11-07 23:52:58,770 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-07 23:52:58,770 INFO L745 eck$LassoCheckResult]: Stem: 288#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 289#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~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~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_~i~0#1.base, main_~i~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_~j~0#1.base, main_~j~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_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int#1(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#2(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 282#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 283#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 280#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 281#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 284#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 299#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 298#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 297#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 296#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 295#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 293#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 294#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 292#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 291#L552-1 assume !(main_#t~mem5#1 < 100);havoc main_#t~mem5#1; 285#L552-5 call write~int#0(5, main_~j~0#1.base, main_~j~0#1.offset, 4); 286#L553-4 [2024-11-07 23:52:58,770 INFO L747 eck$LassoCheckResult]: Loop: 286#L553-4 call main_#t~mem9#1 := read~int#0(main_~j~0#1.base, main_~j~0#1.offset, 4); 290#L553-1 assume !!(main_#t~mem9#1 < 21);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem10#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 287#L553-3 call main_#t~mem11#1 := read~int#0(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#0(3 + main_#t~mem11#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem11#1; 286#L553-4 [2024-11-07 23:52:58,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:52:58,771 INFO L85 PathProgramCache]: Analyzing trace with hash 446171019, now seen corresponding path program 2 times [2024-11-07 23:52:58,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:52:58,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317672758] [2024-11-07 23:52:58,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:52:58,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:52:58,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:52:59,270 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 23:52:59,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 23:52:59,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317672758] [2024-11-07 23:52:59,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317672758] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 23:52:59,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401396943] [2024-11-07 23:52:59,271 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 23:52:59,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 23:52:59,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:52:59,274 INFO L229 MonitoredProcess]: Starting monitored process 16 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:59,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-07 23:52:59,365 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 23:52:59,365 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 23:52:59,366 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-07 23:52:59,369 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 23:52:59,373 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:52:59,394 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 23 treesize of output 3 [2024-11-07 23:52:59,405 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 36 treesize of output 13 [2024-11-07 23:52:59,421 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 36 treesize of output 13 [2024-11-07 23:52:59,437 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 36 treesize of output 13 [2024-11-07 23:52:59,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2024-11-07 23:52:59,448 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 23:52:59,449 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 23:52:59,565 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 23:52:59,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401396943] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 23:52:59,566 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 23:52:59,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 19 [2024-11-07 23:52:59,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44230137] [2024-11-07 23:52:59,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 23:52:59,566 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-07 23:52:59,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:52:59,566 INFO L85 PathProgramCache]: Analyzing trace with hash 50806, now seen corresponding path program 3 times [2024-11-07 23:52:59,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:52:59,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931019214] [2024-11-07 23:52:59,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:52:59,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:52:59,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:52:59,574 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 23:52:59,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:52:59,577 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 23:52:59,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 23:52:59,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-07 23:52:59,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=202, Unknown=0, NotChecked=0, Total=342 [2024-11-07 23:52:59,651 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. cyclomatic complexity: 3 Second operand has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 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:59,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 23:52:59,780 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2024-11-07 23:52:59,780 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 47 transitions. [2024-11-07 23:52:59,782 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-07 23:52:59,784 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 40 states and 41 transitions. [2024-11-07 23:52:59,784 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-11-07 23:52:59,784 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-11-07 23:52:59,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 41 transitions. [2024-11-07 23:52:59,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-07 23:52:59,785 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 41 transitions. [2024-11-07 23:52:59,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 41 transitions. [2024-11-07 23:52:59,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2024-11-07 23:52:59,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 37 states have internal predecessors, (39), 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:59,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2024-11-07 23:52:59,787 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 39 transitions. [2024-11-07 23:52:59,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-07 23:52:59,788 INFO L425 stractBuchiCegarLoop]: Abstraction has 38 states and 39 transitions. [2024-11-07 23:52:59,788 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-07 23:52:59,788 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 39 transitions. [2024-11-07 23:52:59,789 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-07 23:52:59,789 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-07 23:52:59,789 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-07 23:52:59,790 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 10, 10, 1, 1, 1, 1] [2024-11-07 23:52:59,790 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-07 23:52:59,791 INFO L745 eck$LassoCheckResult]: Stem: 484#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 485#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~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~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_~i~0#1.base, main_~i~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_~j~0#1.base, main_~j~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_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int#1(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#2(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 478#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 479#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 476#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 477#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 480#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 513#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 512#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 511#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 510#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 509#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 508#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 507#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 506#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 505#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 504#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 503#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 502#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 501#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 500#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 499#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 498#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 497#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 496#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 495#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 494#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 493#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 492#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 491#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 489#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 490#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 488#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 487#L552-1 assume !(main_#t~mem5#1 < 100);havoc main_#t~mem5#1; 481#L552-5 call write~int#0(5, main_~j~0#1.base, main_~j~0#1.offset, 4); 482#L553-4 [2024-11-07 23:52:59,791 INFO L747 eck$LassoCheckResult]: Loop: 482#L553-4 call main_#t~mem9#1 := read~int#0(main_~j~0#1.base, main_~j~0#1.offset, 4); 486#L553-1 assume !!(main_#t~mem9#1 < 21);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem10#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 483#L553-3 call main_#t~mem11#1 := read~int#0(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#0(3 + main_#t~mem11#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem11#1; 482#L553-4 [2024-11-07 23:52:59,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:52:59,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1419508405, now seen corresponding path program 3 times [2024-11-07 23:52:59,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:52:59,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569392880] [2024-11-07 23:52:59,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:52:59,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:52:59,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:53:01,219 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 23:53:01,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 23:53:01,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569392880] [2024-11-07 23:53:01,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569392880] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 23:53:01,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782530940] [2024-11-07 23:53:01,219 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-07 23:53:01,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 23:53:01,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:53:01,221 INFO L229 MonitoredProcess]: Starting monitored process 17 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:01,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-07 23:53:01,504 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-07 23:53:01,504 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 23:53:01,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-07 23:53:01,510 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 23:53:01,517 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:53:01,530 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 23 treesize of output 3 [2024-11-07 23:53:01,539 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 36 treesize of output 13 [2024-11-07 23:53:01,554 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 36 treesize of output 13 [2024-11-07 23:53:01,563 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 36 treesize of output 13 [2024-11-07 23:53:01,573 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 36 treesize of output 13 [2024-11-07 23:53:01,585 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 36 treesize of output 13 [2024-11-07 23:53:01,595 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 36 treesize of output 13 [2024-11-07 23:53:01,608 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 36 treesize of output 13 [2024-11-07 23:53:01,620 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 36 treesize of output 13 [2024-11-07 23:53:01,631 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 36 treesize of output 13 [2024-11-07 23:53:01,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2024-11-07 23:53:01,640 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 23:53:01,640 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 23:53:01,945 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 23:53:01,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782530940] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 23:53:01,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 23:53:01,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 14, 14] total 37 [2024-11-07 23:53:01,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082982186] [2024-11-07 23:53:01,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 23:53:01,946 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-07 23:53:01,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:53:01,946 INFO L85 PathProgramCache]: Analyzing trace with hash 50806, now seen corresponding path program 4 times [2024-11-07 23:53:01,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:53:01,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906736244] [2024-11-07 23:53:01,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:53:01,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:53:01,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:53:01,953 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 23:53:01,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:53:01,957 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 23:53:02,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 23:53:02,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-07 23:53:02,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=566, Invalid=766, Unknown=0, NotChecked=0, Total=1332 [2024-11-07 23:53:02,039 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. cyclomatic complexity: 3 Second operand has 37 states, 37 states have (on average 2.4054054054054053) internal successors, (89), 37 states have internal predecessors, (89), 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:02,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 23:53:02,366 INFO L93 Difference]: Finished difference Result 88 states and 89 transitions. [2024-11-07 23:53:02,366 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88 states and 89 transitions. [2024-11-07 23:53:02,368 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-07 23:53:02,368 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88 states to 76 states and 77 transitions. [2024-11-07 23:53:02,368 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-11-07 23:53:02,368 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-11-07 23:53:02,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 77 transitions. [2024-11-07 23:53:02,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-07 23:53:02,369 INFO L218 hiAutomatonCegarLoop]: Abstraction has 76 states and 77 transitions. [2024-11-07 23:53:02,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 77 transitions. [2024-11-07 23:53:02,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2024-11-07 23:53:02,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 74 states have (on average 1.0135135135135136) internal successors, (75), 73 states have internal predecessors, (75), 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:02,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2024-11-07 23:53:02,372 INFO L240 hiAutomatonCegarLoop]: Abstraction has 74 states and 75 transitions. [2024-11-07 23:53:02,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-11-07 23:53:02,373 INFO L425 stractBuchiCegarLoop]: Abstraction has 74 states and 75 transitions. [2024-11-07 23:53:02,373 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-07 23:53:02,373 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 75 transitions. [2024-11-07 23:53:02,374 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-07 23:53:02,374 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-07 23:53:02,374 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-07 23:53:02,376 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [23, 22, 22, 1, 1, 1, 1] [2024-11-07 23:53:02,376 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-07 23:53:02,376 INFO L745 eck$LassoCheckResult]: Stem: 878#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 879#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~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~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_~i~0#1.base, main_~i~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_~j~0#1.base, main_~j~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_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int#1(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#2(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 872#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 873#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 870#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 871#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 874#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 943#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 942#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 941#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 940#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 939#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 938#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 937#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 936#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 935#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 934#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 933#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 932#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 931#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 930#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 929#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 928#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 927#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 926#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 925#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 924#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 923#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 922#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 921#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 920#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 919#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 918#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 917#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 916#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 915#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 914#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 913#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 912#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 911#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 910#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 909#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 908#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 907#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 906#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 905#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 904#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 903#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 902#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 901#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 900#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 899#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 898#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 897#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 896#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 895#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 894#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 893#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 892#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 891#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 890#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 889#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 888#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 887#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 886#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 885#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 883#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 884#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 882#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 881#L552-1 assume !(main_#t~mem5#1 < 100);havoc main_#t~mem5#1; 875#L552-5 call write~int#0(5, main_~j~0#1.base, main_~j~0#1.offset, 4); 876#L553-4 [2024-11-07 23:53:02,376 INFO L747 eck$LassoCheckResult]: Loop: 876#L553-4 call main_#t~mem9#1 := read~int#0(main_~j~0#1.base, main_~j~0#1.offset, 4); 880#L553-1 assume !!(main_#t~mem9#1 < 21);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem10#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 877#L553-3 call main_#t~mem11#1 := read~int#0(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#0(3 + main_#t~mem11#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem11#1; 876#L553-4 [2024-11-07 23:53:02,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:53:02,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1124348107, now seen corresponding path program 4 times [2024-11-07 23:53:02,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:53:02,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752999183] [2024-11-07 23:53:02,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:53:02,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:53:02,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:53:06,006 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 23:53:06,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 23:53:06,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752999183] [2024-11-07 23:53:06,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752999183] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 23:53:06,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471854642] [2024-11-07 23:53:06,006 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-07 23:53:06,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 23:53:06,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:53:06,009 INFO L229 MonitoredProcess]: Starting monitored process 18 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:06,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-07 23:53:06,462 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-07 23:53:06,462 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 23:53:06,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 630 conjuncts, 70 conjuncts are in the unsatisfiable core [2024-11-07 23:53:06,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 23:53:06,482 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:53:06,495 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 23 treesize of output 3 [2024-11-07 23:53:06,505 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 36 treesize of output 13 [2024-11-07 23:53:06,517 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 36 treesize of output 13 [2024-11-07 23:53:06,533 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 36 treesize of output 13 [2024-11-07 23:53:06,549 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 36 treesize of output 13 [2024-11-07 23:53:06,561 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 36 treesize of output 13 [2024-11-07 23:53:06,572 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 36 treesize of output 13 [2024-11-07 23:53:06,585 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 36 treesize of output 13 [2024-11-07 23:53:06,594 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 36 treesize of output 13 [2024-11-07 23:53:06,604 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 36 treesize of output 13 [2024-11-07 23:53:06,616 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 36 treesize of output 13 [2024-11-07 23:53:06,630 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 36 treesize of output 13 [2024-11-07 23:53:06,641 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 36 treesize of output 13 [2024-11-07 23:53:06,647 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 36 treesize of output 13 [2024-11-07 23:53:06,659 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 36 treesize of output 13 [2024-11-07 23:53:06,667 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 36 treesize of output 13 [2024-11-07 23:53:06,675 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 36 treesize of output 13 [2024-11-07 23:53:06,683 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 36 treesize of output 13 [2024-11-07 23:53:06,692 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 36 treesize of output 13 [2024-11-07 23:53:06,700 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 36 treesize of output 13 [2024-11-07 23:53:06,707 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 36 treesize of output 13 [2024-11-07 23:53:06,714 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 36 treesize of output 13 [2024-11-07 23:53:06,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2024-11-07 23:53:06,721 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 23:53:06,721 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 23:53:07,511 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 23:53:07,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471854642] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 23:53:07,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 23:53:07,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 26, 26] total 73 [2024-11-07 23:53:07,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597147144] [2024-11-07 23:53:07,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 23:53:07,512 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-07 23:53:07,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:53:07,513 INFO L85 PathProgramCache]: Analyzing trace with hash 50806, now seen corresponding path program 5 times [2024-11-07 23:53:07,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:53:07,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019188130] [2024-11-07 23:53:07,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:53:07,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:53:07,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:53:07,519 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 23:53:07,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:53:07,523 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 23:53:07,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 23:53:07,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2024-11-07 23:53:07,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2282, Invalid=2974, Unknown=0, NotChecked=0, Total=5256 [2024-11-07 23:53:07,585 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. cyclomatic complexity: 3 Second operand has 73 states, 73 states have (on average 2.5342465753424657) internal successors, (185), 73 states have internal predecessors, (185), 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:08,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 23:53:08,647 INFO L93 Difference]: Finished difference Result 172 states and 173 transitions. [2024-11-07 23:53:08,647 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 172 states and 173 transitions. [2024-11-07 23:53:08,654 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-07 23:53:08,655 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 172 states to 148 states and 149 transitions. [2024-11-07 23:53:08,659 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-11-07 23:53:08,659 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-11-07 23:53:08,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 148 states and 149 transitions. [2024-11-07 23:53:08,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-07 23:53:08,659 INFO L218 hiAutomatonCegarLoop]: Abstraction has 148 states and 149 transitions. [2024-11-07 23:53:08,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states and 149 transitions. [2024-11-07 23:53:08,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 146. [2024-11-07 23:53:08,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 146 states have (on average 1.0068493150684932) internal successors, (147), 145 states have internal predecessors, (147), 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:08,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 147 transitions. [2024-11-07 23:53:08,672 INFO L240 hiAutomatonCegarLoop]: Abstraction has 146 states and 147 transitions. [2024-11-07 23:53:08,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2024-11-07 23:53:08,672 INFO L425 stractBuchiCegarLoop]: Abstraction has 146 states and 147 transitions. [2024-11-07 23:53:08,673 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-07 23:53:08,673 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 146 states and 147 transitions. [2024-11-07 23:53:08,674 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-07 23:53:08,677 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-07 23:53:08,677 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-07 23:53:08,680 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [47, 46, 46, 1, 1, 1, 1] [2024-11-07 23:53:08,682 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-07 23:53:08,683 INFO L745 eck$LassoCheckResult]: Stem: 1668#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1669#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~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~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_~i~0#1.base, main_~i~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_~j~0#1.base, main_~j~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_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int#1(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#2(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 1662#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1663#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1660#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1661#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1664#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1805#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1804#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1803#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1802#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1801#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1800#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1799#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1798#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1797#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1796#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1795#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1794#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1793#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1792#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1791#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1790#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1789#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1788#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1787#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1786#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1785#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1784#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1783#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1782#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1781#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1780#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1779#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1778#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1777#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1776#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1775#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1774#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1773#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1772#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1771#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1770#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1769#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1768#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1767#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1766#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1765#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1764#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1763#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1762#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1761#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1760#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1759#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1758#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1757#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1756#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1755#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1754#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1753#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1752#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1751#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1750#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1749#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1748#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1747#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1746#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1745#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1744#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1743#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1742#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1741#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1740#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1739#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1738#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1737#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1736#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1735#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1734#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1733#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1732#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1731#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1730#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1729#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1728#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1727#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1726#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1725#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1724#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1723#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1722#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1721#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1720#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1719#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1718#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1717#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1716#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1715#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1714#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1713#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1712#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1711#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1710#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1709#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1708#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1707#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1706#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1705#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1704#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1703#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1702#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1701#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1700#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1699#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1698#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1697#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1696#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1695#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1694#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1693#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1692#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1691#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1690#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1689#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1688#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1687#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1686#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1685#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1684#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1683#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1682#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1681#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1680#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1679#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1678#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1677#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1676#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1675#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1673#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1674#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1672#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1671#L552-1 assume !(main_#t~mem5#1 < 100);havoc main_#t~mem5#1; 1665#L552-5 call write~int#0(5, main_~j~0#1.base, main_~j~0#1.offset, 4); 1666#L553-4 [2024-11-07 23:53:08,683 INFO L747 eck$LassoCheckResult]: Loop: 1666#L553-4 call main_#t~mem9#1 := read~int#0(main_~j~0#1.base, main_~j~0#1.offset, 4); 1670#L553-1 assume !!(main_#t~mem9#1 < 21);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int#1(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(1 + main_#t~mem10#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1667#L553-3 call main_#t~mem11#1 := read~int#0(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#0(3 + main_#t~mem11#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem11#1; 1666#L553-4 [2024-11-07 23:53:08,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:53:08,684 INFO L85 PathProgramCache]: Analyzing trace with hash 209012683, now seen corresponding path program 5 times [2024-11-07 23:53:08,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:53:08,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230485429] [2024-11-07 23:53:08,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:53:08,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:53:08,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:53:17,707 INFO L134 CoverageAnalysis]: Checked inductivity of 3197 backedges. 0 proven. 3197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 23:53:17,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 23:53:17,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230485429] [2024-11-07 23:53:17,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230485429] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 23:53:17,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063022761] [2024-11-07 23:53:17,708 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-07 23:53:17,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 23:53:17,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:53:17,712 INFO L229 MonitoredProcess]: Starting monitored process 19 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:17,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process