./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2c_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/sll2c_append_equal.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b335af75f55d322161e6a270bf4669ab290ae0e9da4bc480724c7d5e3b79fdab --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 14:40:31,452 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 14:40:31,489 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 14:40:31,492 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 14:40:31,492 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 14:40:31,507 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 14:40:31,507 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 14:40:31,508 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 14:40:31,508 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 14:40:31,508 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 14:40:31,508 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 14:40:31,508 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 14:40:31,508 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 14:40:31,508 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 14:40:31,509 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 14:40:31,509 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 14:40:31,509 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 14:40:31,509 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 14:40:31,509 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 14:40:31,509 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 14:40:31,509 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 14:40:31,509 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 14:40:31,509 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 14:40:31,509 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 14:40:31,509 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 14:40:31,510 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 14:40:31,510 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 14:40:31,510 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 14:40:31,510 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 14:40:31,510 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 14:40:31,510 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 14:40:31,510 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 14:40:31,510 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 14:40:31,510 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 14:40:31,510 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 14:40:31,510 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 14:40:31,510 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 14:40:31,510 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 14:40:31,510 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 14:40:31,510 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 14:40:31,510 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 14:40:31,510 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 14:40:31,510 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 14:40:31,511 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b335af75f55d322161e6a270bf4669ab290ae0e9da4bc480724c7d5e3b79fdab [2025-02-05 14:40:31,699 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 14:40:31,704 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 14:40:31,706 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 14:40:31,707 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 14:40:31,707 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 14:40:31,708 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_append_equal.i [2025-02-05 14:40:32,833 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6465d8c3d/2d70f863875241bf8f3c93af36185989/FLAG117b38c69 [2025-02-05 14:40:33,192 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 14:40:33,192 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_equal.i [2025-02-05 14:40:33,220 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6465d8c3d/2d70f863875241bf8f3c93af36185989/FLAG117b38c69 [2025-02-05 14:40:33,428 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6465d8c3d/2d70f863875241bf8f3c93af36185989 [2025-02-05 14:40:33,430 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 14:40:33,433 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 14:40:33,434 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 14:40:33,434 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 14:40:33,439 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 14:40:33,440 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:40:33" (1/1) ... [2025-02-05 14:40:33,441 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77bb3c60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:40:33, skipping insertion in model container [2025-02-05 14:40:33,441 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:40:33" (1/1) ... [2025-02-05 14:40:33,466 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 14:40:33,662 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_equal.i[24433,24446] [2025-02-05 14:40:33,664 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 14:40:33,670 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 14:40:33,698 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_equal.i[24433,24446] [2025-02-05 14:40:33,699 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 14:40:33,723 INFO L204 MainTranslator]: Completed translation [2025-02-05 14:40:33,723 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:40:33 WrapperNode [2025-02-05 14:40:33,724 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 14:40:33,724 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 14:40:33,725 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 14:40:33,725 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 14:40:33,729 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:40:33" (1/1) ... [2025-02-05 14:40:33,738 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:40:33" (1/1) ... [2025-02-05 14:40:33,764 INFO L138 Inliner]: procedures = 127, calls = 42, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 131 [2025-02-05 14:40:33,764 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 14:40:33,765 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 14:40:33,765 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 14:40:33,765 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 14:40:33,775 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:40:33" (1/1) ... [2025-02-05 14:40:33,779 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:40:33" (1/1) ... [2025-02-05 14:40:33,781 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:40:33" (1/1) ... [2025-02-05 14:40:33,803 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [2, 13, 9]. 54 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 8 writes are split as follows [0, 7, 1]. [2025-02-05 14:40:33,804 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:40:33" (1/1) ... [2025-02-05 14:40:33,804 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:40:33" (1/1) ... [2025-02-05 14:40:33,813 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:40:33" (1/1) ... [2025-02-05 14:40:33,817 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:40:33" (1/1) ... [2025-02-05 14:40:33,818 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:40:33" (1/1) ... [2025-02-05 14:40:33,818 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:40:33" (1/1) ... [2025-02-05 14:40:33,824 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 14:40:33,825 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 14:40:33,825 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 14:40:33,825 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 14:40:33,826 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:40:33" (1/1) ... [2025-02-05 14:40:33,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 14:40:33,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:40:33,864 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 14:40:33,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 14:40:33,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-05 14:40:33,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-05 14:40:33,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-05 14:40:33,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-05 14:40:33,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-05 14:40:33,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-05 14:40:33,888 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-02-05 14:40:33,888 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-02-05 14:40:33,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-05 14:40:33,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 14:40:33,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-05 14:40:33,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-05 14:40:33,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-05 14:40:33,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-05 14:40:33,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-05 14:40:33,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-05 14:40:33,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-05 14:40:33,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-05 14:40:33,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-05 14:40:33,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-05 14:40:33,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-05 14:40:33,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 14:40:33,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 14:40:33,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 14:40:33,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 14:40:33,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 14:40:34,002 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 14:40:34,003 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 14:40:34,137 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L623: call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; [2025-02-05 14:40:34,148 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint myexit_returnLabel#1: havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2025-02-05 14:40:34,170 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2025-02-05 14:40:34,170 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 14:40:34,182 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 14:40:34,182 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 14:40:34,185 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:40:34 BoogieIcfgContainer [2025-02-05 14:40:34,185 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 14:40:34,187 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 14:40:34,187 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 14:40:34,190 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 14:40:34,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 02:40:33" (1/3) ... [2025-02-05 14:40:34,190 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fbac69e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:40:34, skipping insertion in model container [2025-02-05 14:40:34,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:40:33" (2/3) ... [2025-02-05 14:40:34,191 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fbac69e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:40:34, skipping insertion in model container [2025-02-05 14:40:34,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:40:34" (3/3) ... [2025-02-05 14:40:34,192 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2c_append_equal.i [2025-02-05 14:40:34,201 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 14:40:34,202 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2c_append_equal.i that has 2 procedures, 33 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-02-05 14:40:34,260 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 14:40:34,271 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@77eb9353, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 14:40:34,271 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 14:40:34,274 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 28 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 14:40:34,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-05 14:40:34,279 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:40:34,280 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:40:34,280 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:40:34,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:40:34,284 INFO L85 PathProgramCache]: Analyzing trace with hash 433364782, now seen corresponding path program 1 times [2025-02-05 14:40:34,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:40:34,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321786432] [2025-02-05 14:40:34,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:40:34,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:40:34,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-05 14:40:34,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-05 14:40:34,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:40:34,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:40:34,562 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 14:40:34,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:40:34,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321786432] [2025-02-05 14:40:34,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321786432] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:40:34,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:40:34,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 14:40:34,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443174104] [2025-02-05 14:40:34,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:40:34,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 14:40:34,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:40:34,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 14:40:34,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 14:40:34,579 INFO L87 Difference]: Start difference. First operand has 33 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 28 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 14:40:34,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:40:34,597 INFO L93 Difference]: Finished difference Result 62 states and 85 transitions. [2025-02-05 14:40:34,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 14:40:34,599 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2025-02-05 14:40:34,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:40:34,602 INFO L225 Difference]: With dead ends: 62 [2025-02-05 14:40:34,602 INFO L226 Difference]: Without dead ends: 29 [2025-02-05 14:40:34,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 14:40:34,606 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 1 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:40:34,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 75 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:40:34,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-02-05 14:40:34,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2025-02-05 14:40:34,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 14:40:34,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2025-02-05 14:40:34,626 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 23 [2025-02-05 14:40:34,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:40:34,626 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2025-02-05 14:40:34,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 14:40:34,626 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2025-02-05 14:40:34,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-05 14:40:34,627 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:40:34,627 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:40:34,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 14:40:34,628 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:40:34,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:40:34,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1612058384, now seen corresponding path program 1 times [2025-02-05 14:40:34,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:40:34,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814177830] [2025-02-05 14:40:34,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:40:34,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:40:34,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-05 14:40:34,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-05 14:40:34,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:40:34,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:40:34,979 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-05 14:40:34,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:40:34,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814177830] [2025-02-05 14:40:34,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814177830] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:40:34,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149378096] [2025-02-05 14:40:34,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:40:34,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:40:34,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:40:34,986 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:40:34,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 14:40:35,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-05 14:40:35,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-05 14:40:35,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:40:35,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:40:35,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-05 14:40:35,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:40:35,222 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 16 treesize of output 8 [2025-02-05 14:40:35,233 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 14:40:35,234 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:40:35,286 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-05 14:40:35,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149378096] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:40:35,287 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:40:35,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 12 [2025-02-05 14:40:35,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516308374] [2025-02-05 14:40:35,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:40:35,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 14:40:35,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:40:35,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 14:40:35,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-02-05 14:40:35,288 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-05 14:40:39,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-05 14:40:43,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-05 14:40:47,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-05 14:40:51,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-05 14:40:51,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:40:51,545 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2025-02-05 14:40:51,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 14:40:51,546 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 31 [2025-02-05 14:40:51,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:40:51,547 INFO L225 Difference]: With dead ends: 41 [2025-02-05 14:40:51,547 INFO L226 Difference]: Without dead ends: 34 [2025-02-05 14:40:51,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2025-02-05 14:40:51,548 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 25 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.2s IncrementalHoareTripleChecker+Time [2025-02-05 14:40:51,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 200 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 4 Unknown, 0 Unchecked, 16.2s Time] [2025-02-05 14:40:51,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-02-05 14:40:51,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2025-02-05 14:40:51,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 14:40:51,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2025-02-05 14:40:51,556 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 31 [2025-02-05 14:40:51,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:40:51,556 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2025-02-05 14:40:51,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-05 14:40:51,556 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2025-02-05 14:40:51,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-05 14:40:51,557 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:40:51,557 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:40:51,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 14:40:51,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:40:51,761 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:40:51,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:40:51,762 INFO L85 PathProgramCache]: Analyzing trace with hash 380675137, now seen corresponding path program 1 times [2025-02-05 14:40:51,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:40:51,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264985505] [2025-02-05 14:40:51,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:40:51,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:40:51,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-05 14:40:51,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-05 14:40:51,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:40:51,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:40:52,725 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:40:52,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:40:52,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264985505] [2025-02-05 14:40:52,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264985505] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:40:52,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937570924] [2025-02-05 14:40:52,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:40:52,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:40:52,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:40:52,729 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:40:52,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 14:40:52,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-05 14:40:52,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-05 14:40:52,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:40:52,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:40:52,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 92 conjuncts are in the unsatisfiable core [2025-02-05 14:40:52,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:40:53,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-02-05 14:40:53,134 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 13 treesize of output 9 [2025-02-05 14:40:53,198 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-05 14:40:53,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-05 14:40:53,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-02-05 14:40:53,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-02-05 14:40:53,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 3 [2025-02-05 14:40:53,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-05 14:40:53,570 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2025-02-05 14:40:53,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2025-02-05 14:40:53,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2025-02-05 14:40:53,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:40:53,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2025-02-05 14:40:53,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2025-02-05 14:40:53,828 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 25 treesize of output 17 [2025-02-05 14:40:53,831 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 21 treesize of output 13 [2025-02-05 14:40:53,897 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:40:53,897 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:40:54,171 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_302 Int) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_13| Int) (v_ArrVal_301 (Array Int Int))) (or (< (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_13|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (store |c_#memory_int#1| .cse0 (store (select |c_#memory_int#1| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_13| v_ArrVal_302))) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_301) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2025-02-05 14:40:54,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937570924] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:40:54,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 14:40:54,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 23] total 37 [2025-02-05 14:40:54,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434701745] [2025-02-05 14:40:54,269 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 14:40:54,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-02-05 14:40:54,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:40:54,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-02-05 14:40:54,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1671, Unknown=25, NotChecked=82, Total=1892 [2025-02-05 14:40:54,273 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 37 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 29 states have internal predecessors, (50), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-05 14:40:55,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:40:55,090 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2025-02-05 14:40:55,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-05 14:40:55,090 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 29 states have internal predecessors, (50), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 34 [2025-02-05 14:40:55,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:40:55,092 INFO L225 Difference]: With dead ends: 44 [2025-02-05 14:40:55,092 INFO L226 Difference]: Without dead ends: 36 [2025-02-05 14:40:55,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=234, Invalid=2825, Unknown=25, NotChecked=108, Total=3192 [2025-02-05 14:40:55,094 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 35 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 14:40:55,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 285 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 14:40:55,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-02-05 14:40:55,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2025-02-05 14:40:55,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 14:40:55,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2025-02-05 14:40:55,098 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 34 [2025-02-05 14:40:55,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:40:55,099 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2025-02-05 14:40:55,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 29 states have internal predecessors, (50), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-05 14:40:55,099 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2025-02-05 14:40:55,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-05 14:40:55,099 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:40:55,099 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:40:55,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 14:40:55,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:40:55,300 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:40:55,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:40:55,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1506011678, now seen corresponding path program 1 times [2025-02-05 14:40:55,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:40:55,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964588489] [2025-02-05 14:40:55,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:40:55,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:40:55,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-05 14:40:55,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-05 14:40:55,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:40:55,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:40:56,522 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:40:56,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:40:56,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964588489] [2025-02-05 14:40:56,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964588489] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:40:56,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594497041] [2025-02-05 14:40:56,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:40:56,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:40:56,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:40:56,524 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:40:56,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 14:40:56,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-05 14:40:56,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-05 14:40:56,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:40:56,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:40:56,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 117 conjuncts are in the unsatisfiable core [2025-02-05 14:40:56,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:40:56,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-02-05 14:40:56,978 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 [2025-02-05 14:40:57,027 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-05 14:40:57,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-05 14:40:57,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2025-02-05 14:40:57,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-05 14:40:57,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-05 14:40:57,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-05 14:40:57,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-02-05 14:40:57,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-02-05 14:40:57,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-05 14:40:57,506 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-02-05 14:40:57,506 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 1 case distinctions, treesize of input 20 treesize of output 23 [2025-02-05 14:40:57,529 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-02-05 14:40:57,529 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 1 case distinctions, treesize of input 20 treesize of output 23 [2025-02-05 14:40:57,560 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2025-02-05 14:40:57,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2025-02-05 14:40:57,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-02-05 14:40:57,916 INFO L349 Elim1Store]: treesize reduction 20, result has 60.0 percent of original size [2025-02-05 14:40:57,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 47 [2025-02-05 14:40:57,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 1 [2025-02-05 14:40:57,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2025-02-05 14:40:57,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2025-02-05 14:40:58,008 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 19 treesize of output 11 [2025-02-05 14:40:58,076 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:40:58,076 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:40:58,157 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_append_~last~1#1.base| Int) (v_ArrVal_445 (Array Int Int)) (v_ArrVal_444 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_445) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_444) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= v_ArrVal_445 (store (select |c_#memory_int#1| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select v_ArrVal_445 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)))))) is different from false [2025-02-05 14:40:58,174 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_17| Int) (v_ArrVal_445 (Array Int Int)) (v_ArrVal_444 (Array Int Int))) (or (not (= (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (store (select |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_17|) .cse0 (select v_ArrVal_445 .cse0))) v_ArrVal_445)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_17| v_ArrVal_445) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_444) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2025-02-05 14:40:58,189 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_17| Int) (v_ArrVal_445 (Array Int Int)) (v_ArrVal_444 (Array Int Int))) (or (not (= v_ArrVal_445 (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (store (select |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_17|) .cse0 (select v_ArrVal_445 .cse0))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_17| v_ArrVal_445) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_444) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2025-02-05 14:40:58,197 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_17| Int) (v_ArrVal_445 (Array Int Int)) (v_ArrVal_444 (Array Int Int))) (or (not (= v_ArrVal_445 (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (store (select |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_17|) .cse0 (select v_ArrVal_445 .cse0))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_17| v_ArrVal_445) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_444) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2025-02-05 14:40:58,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594497041] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:40:58,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 14:40:58,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 45 [2025-02-05 14:40:58,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103371305] [2025-02-05 14:40:58,318 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 14:40:58,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-02-05 14:40:58,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:40:58,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-02-05 14:40:58,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=2111, Unknown=4, NotChecked=380, Total=2652 [2025-02-05 14:40:58,320 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 45 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 36 states have internal predecessors, (58), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-05 14:40:59,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:40:59,840 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2025-02-05 14:40:59,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-05 14:40:59,841 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 36 states have internal predecessors, (58), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 36 [2025-02-05 14:40:59,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:40:59,842 INFO L225 Difference]: With dead ends: 50 [2025-02-05 14:40:59,842 INFO L226 Difference]: Without dead ends: 48 [2025-02-05 14:40:59,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 858 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=313, Invalid=3859, Unknown=4, NotChecked=516, Total=4692 [2025-02-05 14:40:59,843 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 70 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 14:40:59,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 313 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 14:40:59,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-02-05 14:40:59,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 40. [2025-02-05 14:40:59,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 14:40:59,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2025-02-05 14:40:59,853 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 36 [2025-02-05 14:40:59,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:40:59,854 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2025-02-05 14:40:59,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 36 states have internal predecessors, (58), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-05 14:40:59,854 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2025-02-05 14:40:59,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-05 14:40:59,854 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:40:59,855 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:40:59,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 14:41:00,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:41:00,057 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:41:00,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:41:00,058 INFO L85 PathProgramCache]: Analyzing trace with hash 126828676, now seen corresponding path program 1 times [2025-02-05 14:41:00,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:41:00,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125919774] [2025-02-05 14:41:00,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:41:00,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:41:00,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-05 14:41:00,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-05 14:41:00,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:41:00,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:41:01,102 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:41:01,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:41:01,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125919774] [2025-02-05 14:41:01,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125919774] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:41:01,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880717709] [2025-02-05 14:41:01,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:41:01,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:41:01,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:41:01,107 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:41:01,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 14:41:01,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-05 14:41:01,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-05 14:41:01,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:41:01,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:41:01,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-02-05 14:41:01,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:41:01,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-02-05 14:41:01,400 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-05 14:41:01,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-05 14:41:01,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2025-02-05 14:41:01,481 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-05 14:41:01,482 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-02-05 14:41:01,579 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 38 treesize of output 14 [2025-02-05 14:41:01,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-05 14:41:01,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:41:01,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 35 [2025-02-05 14:41:01,712 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2025-02-05 14:41:01,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2025-02-05 14:41:01,821 INFO L349 Elim1Store]: treesize reduction 33, result has 48.4 percent of original size [2025-02-05 14:41:01,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 59 [2025-02-05 14:41:01,838 INFO L349 Elim1Store]: treesize reduction 56, result has 25.3 percent of original size [2025-02-05 14:41:01,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 74 [2025-02-05 14:41:01,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 16 [2025-02-05 14:41:01,866 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 28 treesize of output 20 [2025-02-05 14:41:01,907 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 35 treesize of output 19 [2025-02-05 14:41:01,909 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 16 treesize of output 8 [2025-02-05 14:41:01,910 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 14:41:01,910 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:41:02,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880717709] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:41:02,149 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 14:41:02,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21] total 40 [2025-02-05 14:41:02,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559068497] [2025-02-05 14:41:02,150 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 14:41:02,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-02-05 14:41:02,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:41:02,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-02-05 14:41:02,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1669, Unknown=19, NotChecked=0, Total=1806 [2025-02-05 14:41:02,152 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 40 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 31 states have internal predecessors, (58), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-05 14:41:03,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:41:03,136 INFO L93 Difference]: Finished difference Result 82 states and 96 transitions. [2025-02-05 14:41:03,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-05 14:41:03,138 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 31 states have internal predecessors, (58), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 38 [2025-02-05 14:41:03,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:41:03,138 INFO L225 Difference]: With dead ends: 82 [2025-02-05 14:41:03,139 INFO L226 Difference]: Without dead ends: 79 [2025-02-05 14:41:03,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=236, Invalid=3051, Unknown=19, NotChecked=0, Total=3306 [2025-02-05 14:41:03,140 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 71 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 14:41:03,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 324 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 14:41:03,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-02-05 14:41:03,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 62. [2025-02-05 14:41:03,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 54 states have (on average 1.1666666666666667) internal successors, (63), 54 states have internal predecessors, (63), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-05 14:41:03,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 73 transitions. [2025-02-05 14:41:03,160 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 73 transitions. Word has length 38 [2025-02-05 14:41:03,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:41:03,161 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 73 transitions. [2025-02-05 14:41:03,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 31 states have internal predecessors, (58), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-05 14:41:03,161 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2025-02-05 14:41:03,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-05 14:41:03,161 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:41:03,161 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:41:03,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-05 14:41:03,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:41:03,362 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:41:03,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:41:03,363 INFO L85 PathProgramCache]: Analyzing trace with hash -2135841981, now seen corresponding path program 2 times [2025-02-05 14:41:03,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:41:03,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140981447] [2025-02-05 14:41:03,363 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 14:41:03,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:41:03,382 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-02-05 14:41:03,399 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-02-05 14:41:03,399 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 14:41:03,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:41:04,312 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:41:04,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:41:04,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140981447] [2025-02-05 14:41:04,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140981447] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:41:04,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12291119] [2025-02-05 14:41:04,313 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 14:41:04,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:41:04,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:41:04,315 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:41:04,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 14:41:04,393 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-02-05 14:41:04,639 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-02-05 14:41:04,639 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 14:41:04,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:41:04,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 151 conjuncts are in the unsatisfiable core [2025-02-05 14:41:04,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:41:04,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-02-05 14:41:04,796 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 [2025-02-05 14:41:04,845 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-05 14:41:04,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-05 14:41:04,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2025-02-05 14:41:04,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-05 14:41:04,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2025-02-05 14:41:04,994 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-05 14:41:04,995 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 60 [2025-02-05 14:41:05,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2025-02-05 14:41:05,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-02-05 14:41:05,125 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 45 treesize of output 21 [2025-02-05 14:41:05,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-02-05 14:41:05,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-05 14:41:05,139 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 11 treesize of output 3 [2025-02-05 14:41:05,313 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-02-05 14:41:05,314 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 1 case distinctions, treesize of input 20 treesize of output 23 [2025-02-05 14:41:05,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:41:05,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 36 [2025-02-05 14:41:05,342 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-02-05 14:41:05,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2025-02-05 14:41:05,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 40 [2025-02-05 14:41:05,687 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:41:05,688 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:41:05,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 23 [2025-02-05 14:41:05,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:41:05,934 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:41:05,935 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:41:05,961 INFO L349 Elim1Store]: treesize reduction 33, result has 49.2 percent of original size [2025-02-05 14:41:05,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 50 [2025-02-05 14:41:06,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2025-02-05 14:41:06,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-02-05 14:41:06,186 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 19 treesize of output 11 [2025-02-05 14:41:06,262 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:41:06,262 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:41:07,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12291119] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:41:07,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 14:41:07,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 27] total 42 [2025-02-05 14:41:07,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230716010] [2025-02-05 14:41:07,133 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 14:41:07,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-02-05 14:41:07,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:41:07,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-02-05 14:41:07,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=2571, Unknown=9, NotChecked=0, Total=2756 [2025-02-05 14:41:07,136 INFO L87 Difference]: Start difference. First operand 62 states and 73 transitions. Second operand has 42 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 34 states have internal predecessors, (58), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-05 14:41:10,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:41:10,651 INFO L93 Difference]: Finished difference Result 82 states and 95 transitions. [2025-02-05 14:41:10,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-05 14:41:10,652 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 34 states have internal predecessors, (58), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 38 [2025-02-05 14:41:10,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:41:10,653 INFO L225 Difference]: With dead ends: 82 [2025-02-05 14:41:10,653 INFO L226 Difference]: Without dead ends: 69 [2025-02-05 14:41:10,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 915 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=362, Invalid=4458, Unknown=10, NotChecked=0, Total=4830 [2025-02-05 14:41:10,654 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 37 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 14:41:10,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 305 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 14:41:10,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-02-05 14:41:10,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 61. [2025-02-05 14:41:10,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 52 states have internal predecessors, (58), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-05 14:41:10,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2025-02-05 14:41:10,669 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 38 [2025-02-05 14:41:10,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:41:10,670 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2025-02-05 14:41:10,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 34 states have internal predecessors, (58), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-05 14:41:10,670 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2025-02-05 14:41:10,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-05 14:41:10,671 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:41:10,671 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:41:10,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-05 14:41:10,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:41:10,875 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:41:10,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:41:10,875 INFO L85 PathProgramCache]: Analyzing trace with hash -363298021, now seen corresponding path program 1 times [2025-02-05 14:41:10,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:41:10,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790861972] [2025-02-05 14:41:10,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:41:10,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:41:10,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-05 14:41:10,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-05 14:41:10,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:41:10,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:41:12,940 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:41:12,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:41:12,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790861972] [2025-02-05 14:41:12,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790861972] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:41:12,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828557958] [2025-02-05 14:41:12,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:41:12,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:41:12,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:41:12,943 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:41:12,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 14:41:13,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-05 14:41:13,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-05 14:41:13,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:41:13,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:41:13,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 141 conjuncts are in the unsatisfiable core [2025-02-05 14:41:13,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:41:13,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-02-05 14:41:13,358 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 [2025-02-05 14:41:13,582 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-05 14:41:13,582 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 1 case distinctions, treesize of input 16 treesize of output 15 [2025-02-05 14:41:13,631 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-05 14:41:13,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-05 14:41:13,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-05 14:41:13,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2025-02-05 14:41:13,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2025-02-05 14:41:13,784 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-02-05 14:41:13,784 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 57 [2025-02-05 14:41:13,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2025-02-05 14:41:13,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-02-05 14:41:13,976 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-02-05 14:41:13,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 31 [2025-02-05 14:41:13,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-02-05 14:41:13,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-05 14:41:13,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-05 14:41:14,219 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-02-05 14:41:14,220 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 1 case distinctions, treesize of input 20 treesize of output 23 [2025-02-05 14:41:14,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:41:14,258 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-02-05 14:41:14,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 55 [2025-02-05 14:41:14,271 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2025-02-05 14:41:14,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 31 [2025-02-05 14:41:14,295 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-02-05 14:41:14,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2025-02-05 14:41:14,730 INFO L349 Elim1Store]: treesize reduction 68, result has 11.7 percent of original size [2025-02-05 14:41:14,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 188 treesize of output 103 [2025-02-05 14:41:14,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 7 [2025-02-05 14:41:14,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 34 [2025-02-05 14:41:14,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 15 [2025-02-05 14:41:14,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:41:14,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 19 [2025-02-05 14:41:15,080 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 54 treesize of output 34 [2025-02-05 14:41:15,083 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 27 treesize of output 15 [2025-02-05 14:41:15,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-05 14:41:15,186 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:41:15,187 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:41:15,334 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_887 (Array Int Int)) (v_ArrVal_886 (Array Int Int)) (v_ArrVal_881 (Array Int Int)) (v_ArrVal_883 (Array Int Int)) (v_ArrVal_882 (Array Int Int)) (v_ArrVal_885 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_886) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_887) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_883) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_885) .cse0) .cse1)) (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_882) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_881) .cse0) .cse1) 4)))) (not (= v_ArrVal_886 (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select v_ArrVal_886 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)))))) is different from false [2025-02-05 14:41:15,390 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_887 (Array Int Int)) (v_ArrVal_886 (Array Int Int)) (v_ArrVal_881 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_33| Int) (v_ArrVal_883 (Array Int Int)) (v_ArrVal_882 (Array Int Int)) (v_ArrVal_885 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (or (< (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_33|) (not (= v_ArrVal_886 (store (select |c_#memory_int#1| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_33| (select v_ArrVal_886 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_33|)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_int#1| .cse0 v_ArrVal_886) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_887) (select (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_883) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_885) .cse1) .cse2)) (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_882) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_881) .cse1) .cse2) 4))))))) is different from false [2025-02-05 14:41:15,421 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_887 (Array Int Int)) (v_ArrVal_886 (Array Int Int)) (v_ArrVal_881 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_33| Int) (v_ArrVal_883 (Array Int Int)) (v_ArrVal_882 (Array Int Int)) (v_ArrVal_885 (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse3) .cse4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_int#1| .cse0 v_ArrVal_886) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_887) (select (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_883) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_885) .cse1) .cse2)) (+ 4 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_882) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_881) .cse1) .cse2))))) (not (= (store (select |c_#memory_int#1| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_33| (select v_ArrVal_886 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_33|)) v_ArrVal_886)) (< (select (select |c_#memory_$Pointer$#1.offset| .cse3) .cse4) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_33|))))) is different from false [2025-02-05 14:41:15,438 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_887 (Array Int Int)) (v_ArrVal_886 (Array Int Int)) (v_ArrVal_881 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_33| Int) (v_ArrVal_883 (Array Int Int)) (v_ArrVal_882 (Array Int Int)) (v_ArrVal_885 (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse3) .cse4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_int#1| .cse0 v_ArrVal_886) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_887) (select (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_883) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_885) .cse1) .cse2)) (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_882) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_881) .cse1) .cse2) 4)))) (not (= (store (select |c_#memory_int#1| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_33| (select v_ArrVal_886 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_33|)) v_ArrVal_886)) (< (select (select |c_#memory_$Pointer$#1.offset| .cse3) .cse4) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_33|))))) is different from false [2025-02-05 14:41:15,509 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_887 (Array Int Int)) (v_ArrVal_897 (Array Int Int)) (v_ArrVal_886 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| Int) (v_ArrVal_881 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_33| Int) (v_ArrVal_883 (Array Int Int)) (v_ArrVal_882 (Array Int Int)) (v_ArrVal_885 (Array Int Int)) (v_ArrVal_896 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_897) .cse0) .cse1))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30|) 0)) (< (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_895) .cse0) .cse1) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_33|) (not (= v_ArrVal_886 (store (select (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_896) .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_33| (select v_ArrVal_886 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_33|)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_int#1| .cse2 v_ArrVal_886) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_887) (select (select (store (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_883) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_885) .cse3) .cse4)) (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_882) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_30| v_ArrVal_881) .cse3) .cse4) 4)))))))) is different from false [2025-02-05 14:41:15,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828557958] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:41:15,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 14:41:15,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 25] total 48 [2025-02-05 14:41:15,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235126515] [2025-02-05 14:41:15,511 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 14:41:15,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-02-05 14:41:15,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:41:15,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-02-05 14:41:15,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=2408, Unknown=5, NotChecked=510, Total=3080 [2025-02-05 14:41:15,512 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand has 48 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 39 states have internal predecessors, (60), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-05 14:41:17,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:41:17,350 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2025-02-05 14:41:17,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-05 14:41:17,350 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 39 states have internal predecessors, (60), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 39 [2025-02-05 14:41:17,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:41:17,351 INFO L225 Difference]: With dead ends: 73 [2025-02-05 14:41:17,351 INFO L226 Difference]: Without dead ends: 71 [2025-02-05 14:41:17,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 691 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=292, Invalid=4145, Unknown=5, NotChecked=670, Total=5112 [2025-02-05 14:41:17,353 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 46 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 1124 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 1140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 14:41:17,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 342 Invalid, 1140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1124 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 14:41:17,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-02-05 14:41:17,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 61. [2025-02-05 14:41:17,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 52 states have internal predecessors, (58), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-05 14:41:17,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2025-02-05 14:41:17,370 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 39 [2025-02-05 14:41:17,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:41:17,371 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2025-02-05 14:41:17,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 39 states have internal predecessors, (60), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-05 14:41:17,371 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2025-02-05 14:41:17,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-05 14:41:17,372 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:41:17,372 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:41:17,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-05 14:41:17,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-02-05 14:41:17,573 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:41:17,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:41:17,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1236974723, now seen corresponding path program 1 times [2025-02-05 14:41:17,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:41:17,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961193581] [2025-02-05 14:41:17,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:41:17,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:41:17,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-05 14:41:17,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-05 14:41:17,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:41:17,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:41:18,917 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 14:41:18,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:41:18,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961193581] [2025-02-05 14:41:18,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961193581] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:41:18,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025021208] [2025-02-05 14:41:18,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:41:18,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:41:18,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:41:18,919 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:41:18,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 14:41:19,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-05 14:41:19,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-05 14:41:19,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:41:19,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:41:19,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 145 conjuncts are in the unsatisfiable core [2025-02-05 14:41:19,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:41:19,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-02-05 14:41:19,325 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-05 14:41:19,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-05 14:41:19,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2025-02-05 14:41:19,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2025-02-05 14:41:19,455 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-05 14:41:19,455 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-02-05 14:41:19,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-02-05 14:41:19,551 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 30 treesize of output 14 [2025-02-05 14:41:19,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-02-05 14:41:19,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-05 14:41:19,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:41:19,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 32 [2025-02-05 14:41:19,739 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-02-05 14:41:19,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2025-02-05 14:41:19,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-02-05 14:41:20,440 INFO L349 Elim1Store]: treesize reduction 60, result has 27.7 percent of original size [2025-02-05 14:41:20,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 122 treesize of output 82 [2025-02-05 14:41:20,461 INFO L349 Elim1Store]: treesize reduction 80, result has 15.8 percent of original size [2025-02-05 14:41:20,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 183 treesize of output 100 [2025-02-05 14:41:20,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:41:20,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 65 [2025-02-05 14:41:20,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:41:20,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 33 [2025-02-05 14:41:20,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:41:20,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 7 [2025-02-05 14:41:20,625 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-05 14:41:20,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2025-02-05 14:41:20,682 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 75 treesize of output 47 [2025-02-05 14:41:20,687 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-05 14:41:20,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 19 [2025-02-05 14:41:20,718 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:41:20,718 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:41:21,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025021208] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:41:21,768 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 14:41:21,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 28] total 45 [2025-02-05 14:41:21,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860293090] [2025-02-05 14:41:21,769 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 14:41:21,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-02-05 14:41:21,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:41:21,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-02-05 14:41:21,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=2577, Unknown=4, NotChecked=0, Total=2756 [2025-02-05 14:41:21,770 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand has 45 states, 42 states have (on average 1.5) internal successors, (63), 38 states have internal predecessors, (63), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-05 14:41:23,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:41:23,695 INFO L93 Difference]: Finished difference Result 86 states and 98 transitions. [2025-02-05 14:41:23,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-02-05 14:41:23,696 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 42 states have (on average 1.5) internal successors, (63), 38 states have internal predecessors, (63), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 41 [2025-02-05 14:41:23,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:41:23,697 INFO L225 Difference]: With dead ends: 86 [2025-02-05 14:41:23,697 INFO L226 Difference]: Without dead ends: 83 [2025-02-05 14:41:23,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1390 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=440, Invalid=6036, Unknown=4, NotChecked=0, Total=6480 [2025-02-05 14:41:23,699 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 82 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 909 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 14:41:23,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 355 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 909 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 14:41:23,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-02-05 14:41:23,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 67. [2025-02-05 14:41:23,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 58 states have (on average 1.1379310344827587) internal successors, (66), 58 states have internal predecessors, (66), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-05 14:41:23,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 76 transitions. [2025-02-05 14:41:23,712 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 76 transitions. Word has length 41 [2025-02-05 14:41:23,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:41:23,712 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 76 transitions. [2025-02-05 14:41:23,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 42 states have (on average 1.5) internal successors, (63), 38 states have internal predecessors, (63), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-05 14:41:23,713 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 76 transitions. [2025-02-05 14:41:23,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-05 14:41:23,713 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:41:23,713 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:41:23,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-05 14:41:23,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:41:23,918 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:41:23,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:41:23,918 INFO L85 PathProgramCache]: Analyzing trace with hash 308469570, now seen corresponding path program 2 times [2025-02-05 14:41:23,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:41:23,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877837233] [2025-02-05 14:41:23,919 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 14:41:23,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:41:23,935 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-02-05 14:41:23,979 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-02-05 14:41:23,979 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 14:41:23,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:41:25,987 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:41:25,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:41:25,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877837233] [2025-02-05 14:41:25,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877837233] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:41:25,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056447786] [2025-02-05 14:41:25,987 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 14:41:25,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:41:25,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:41:25,989 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:41:25,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-05 14:41:26,088 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-02-05 14:41:26,134 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-02-05 14:41:26,134 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 14:41:26,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:41:26,137 WARN L254 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 189 conjuncts are in the unsatisfiable core [2025-02-05 14:41:26,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:41:26,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-02-05 14:41:26,217 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 [2025-02-05 14:41:26,470 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-05 14:41:26,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-05 14:41:26,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-05 14:41:26,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2025-02-05 14:41:26,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-05 14:41:26,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2025-02-05 14:41:26,688 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-02-05 14:41:26,688 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 60 [2025-02-05 14:41:26,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2025-02-05 14:41:26,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2025-02-05 14:41:26,884 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-02-05 14:41:26,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 38 [2025-02-05 14:41:26,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-05 14:41:26,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-02-05 14:41:26,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-05 14:41:27,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 9 treesize of output 12 [2025-02-05 14:41:27,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:41:27,173 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-02-05 14:41:27,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 87 treesize of output 64 [2025-02-05 14:41:27,194 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2025-02-05 14:41:27,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 53 [2025-02-05 14:41:27,221 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-02-05 14:41:27,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2025-02-05 14:41:27,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2025-02-05 14:41:28,318 INFO L349 Elim1Store]: treesize reduction 481, result has 23.3 percent of original size [2025-02-05 14:41:28,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 11 case distinctions, treesize of input 824 treesize of output 514 [2025-02-05 14:41:28,485 INFO L349 Elim1Store]: treesize reduction 393, result has 26.7 percent of original size [2025-02-05 14:41:28,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 515 treesize of output 399 [2025-02-05 14:41:28,536 INFO L349 Elim1Store]: treesize reduction 79, result has 31.3 percent of original size [2025-02-05 14:41:28,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 91 treesize of output 131 [2025-02-05 14:41:28,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2025-02-05 14:41:28,586 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:41:28,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 treesize of output 1 [2025-02-05 14:41:28,638 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:41:28,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 19 [2025-02-05 14:41:28,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2025-02-05 14:41:32,531 INFO L349 Elim1Store]: treesize reduction 284, result has 13.7 percent of original size [2025-02-05 14:41:32,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 315 treesize of output 173 [2025-02-05 14:41:32,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 37 treesize of output 40 [2025-02-05 14:41:32,559 INFO L349 Elim1Store]: treesize reduction 161, result has 8.5 percent of original size [2025-02-05 14:41:32,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 104 treesize of output 81 [2025-02-05 14:41:32,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 24