./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2n_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/sll2n_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 f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 14:41:24,034 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 14:41:24,095 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:41:24,103 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 14:41:24,106 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 14:41:24,129 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 14:41:24,129 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 14:41:24,130 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 14:41:24,130 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 14:41:24,130 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 14:41:24,131 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 14:41:24,131 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 14:41:24,131 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 14:41:24,132 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 14:41:24,132 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 14:41:24,132 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 14:41:24,132 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 14:41:24,132 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 14:41:24,132 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 14:41:24,132 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 14:41:24,132 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 14:41:24,132 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 14:41:24,132 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 14:41:24,133 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 14:41:24,133 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 14:41:24,133 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 14:41:24,133 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 14:41:24,133 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 14:41:24,133 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 14:41:24,133 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 14:41:24,133 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 14:41:24,133 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 14:41:24,133 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 14:41:24,133 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 14:41:24,133 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 14:41:24,133 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 14:41:24,133 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 14:41:24,133 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 14:41:24,133 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 14:41:24,133 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 14:41:24,133 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 14:41:24,133 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 14:41:24,133 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 14:41:24,134 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 -> f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 [2025-02-05 14:41:24,391 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 14:41:24,399 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 14:41:24,402 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 14:41:24,403 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 14:41:24,403 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 14:41:24,405 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_append_equal.i [2025-02-05 14:41:25,634 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/13f25cacb/2f21dc7e0b324ce989caf1107697a2b8/FLAGe0cedd79d [2025-02-05 14:41:26,020 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 14:41:26,028 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_append_equal.i [2025-02-05 14:41:26,045 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/13f25cacb/2f21dc7e0b324ce989caf1107697a2b8/FLAGe0cedd79d [2025-02-05 14:41:26,253 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/13f25cacb/2f21dc7e0b324ce989caf1107697a2b8 [2025-02-05 14:41:26,256 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 14:41:26,258 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 14:41:26,261 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 14:41:26,262 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 14:41:26,267 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 14:41:26,268 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:41:26" (1/1) ... [2025-02-05 14:41:26,271 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79477ef3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:41:26, skipping insertion in model container [2025-02-05 14:41:26,271 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:41:26" (1/1) ... [2025-02-05 14:41:26,310 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 14:41:26,598 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/sll2n_append_equal.i[24197,24210] [2025-02-05 14:41:26,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 14:41:26,609 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 14:41:26,654 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/sll2n_append_equal.i[24197,24210] [2025-02-05 14:41:26,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 14:41:26,683 INFO L204 MainTranslator]: Completed translation [2025-02-05 14:41:26,683 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:41:26 WrapperNode [2025-02-05 14:41:26,684 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 14:41:26,684 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 14:41:26,684 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 14:41:26,685 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 14:41:26,690 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:41:26" (1/1) ... [2025-02-05 14:41:26,701 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:41:26" (1/1) ... [2025-02-05 14:41:26,722 INFO L138 Inliner]: procedures = 127, calls = 33, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 111 [2025-02-05 14:41:26,723 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 14:41:26,723 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 14:41:26,723 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 14:41:26,723 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 14:41:26,729 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:41:26" (1/1) ... [2025-02-05 14:41:26,729 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:41:26" (1/1) ... [2025-02-05 14:41:26,731 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:41:26" (1/1) ... [2025-02-05 14:41:26,745 INFO L175 MemorySlicer]: Split 17 memory accesses to 3 slices as follows [2, 9, 6]. 53 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 5 writes are split as follows [0, 4, 1]. [2025-02-05 14:41:26,746 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:41:26" (1/1) ... [2025-02-05 14:41:26,746 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:41:26" (1/1) ... [2025-02-05 14:41:26,755 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:41:26" (1/1) ... [2025-02-05 14:41:26,756 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:41:26" (1/1) ... [2025-02-05 14:41:26,758 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:41:26" (1/1) ... [2025-02-05 14:41:26,758 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:41:26" (1/1) ... [2025-02-05 14:41:26,760 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 14:41:26,761 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 14:41:26,761 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 14:41:26,761 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 14:41:26,761 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:41:26" (1/1) ... [2025-02-05 14:41:26,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 14:41:26,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:41:26,803 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:41:26,810 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:41:26,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-05 14:41:26,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-05 14:41:26,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-05 14:41:26,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-05 14:41:26,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-05 14:41:26,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-05 14:41:26,834 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-02-05 14:41:26,835 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-02-05 14:41:26,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-05 14:41:26,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 14:41:26,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-05 14:41:26,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-05 14:41:26,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-05 14:41:26,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-05 14:41:26,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-05 14:41:26,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-05 14:41:26,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-05 14:41:26,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-05 14:41:26,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-05 14:41:26,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-05 14:41:26,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-05 14:41:26,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 14:41:26,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 14:41:26,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 14:41:26,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 14:41:26,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 14:41:26,963 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 14:41:26,964 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 14:41:27,120 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L614: 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:41:27,143 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:41:27,158 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2025-02-05 14:41:27,158 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 14:41:27,167 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 14:41:27,168 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 14:41:27,168 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:41:27 BoogieIcfgContainer [2025-02-05 14:41:27,168 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 14:41:27,170 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 14:41:27,170 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 14:41:27,173 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 14:41:27,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 02:41:26" (1/3) ... [2025-02-05 14:41:27,174 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26db246 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:41:27, skipping insertion in model container [2025-02-05 14:41:27,175 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:41:26" (2/3) ... [2025-02-05 14:41:27,175 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26db246 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:41:27, skipping insertion in model container [2025-02-05 14:41:27,175 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:41:27" (3/3) ... [2025-02-05 14:41:27,176 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2n_append_equal.i [2025-02-05 14:41:27,187 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 14:41:27,190 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2n_append_equal.i that has 2 procedures, 29 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-02-05 14:41:27,232 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 14:41:27,241 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;@4ea8d8f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 14:41:27,242 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 14:41:27,245 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 25 states have internal predecessors, (34), 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:41:27,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-05 14:41:27,250 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:41:27,251 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:41:27,251 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:41:27,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:41:27,256 INFO L85 PathProgramCache]: Analyzing trace with hash 695211267, now seen corresponding path program 1 times [2025-02-05 14:41:27,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:41:27,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693771710] [2025-02-05 14:41:27,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:41:27,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:41:27,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-05 14:41:27,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-05 14:41:27,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:41:27,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:41:27,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:41:27,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:41:27,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693771710] [2025-02-05 14:41:27,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693771710] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:41:27,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:41:27,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 14:41:27,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434616884] [2025-02-05 14:41:27,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:41:27,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 14:41:27,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:41:27,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 14:41:27,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 14:41:27,561 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 25 states have internal predecessors, (34), 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) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 14:41:27,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:41:27,586 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2025-02-05 14:41:27,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 14:41:27,590 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-02-05 14:41:27,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:41:27,594 INFO L225 Difference]: With dead ends: 56 [2025-02-05 14:41:27,594 INFO L226 Difference]: Without dead ends: 26 [2025-02-05 14:41:27,597 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:41:27,599 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 1 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 65 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:41:27,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 65 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:41:27,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-02-05 14:41:27,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2025-02-05 14:41:27,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 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:41:27,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2025-02-05 14:41:27,625 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 16 [2025-02-05 14:41:27,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:41:27,626 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2025-02-05 14:41:27,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 14:41:27,626 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2025-02-05 14:41:27,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-05 14:41:27,628 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:41:27,628 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:41:27,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 14:41:27,629 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:41:27,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:41:27,630 INFO L85 PathProgramCache]: Analyzing trace with hash -744395643, now seen corresponding path program 1 times [2025-02-05 14:41:27,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:41:27,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041867425] [2025-02-05 14:41:27,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:41:27,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:41:27,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 14:41:27,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 14:41:27,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:41:27,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:41:27,814 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 14:41:27,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:41:27,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041867425] [2025-02-05 14:41:27,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041867425] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:41:27,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405335585] [2025-02-05 14:41:27,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:41:27,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:41:27,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:41:27,819 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:41:27,820 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:41:27,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 14:41:27,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 14:41:27,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:41:27,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:41:27,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 14:41:27,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:41:27,989 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:41:27,989 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:41:28,028 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 14:41:28,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [405335585] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:41:28,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:41:28,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-02-05 14:41:28,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927950520] [2025-02-05 14:41:28,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:41:28,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 14:41:28,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:41:28,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 14:41:28,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 14:41:28,031 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-05 14:41:28,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:41:28,055 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2025-02-05 14:41:28,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 14:41:28,056 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2025-02-05 14:41:28,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:41:28,056 INFO L225 Difference]: With dead ends: 45 [2025-02-05 14:41:28,056 INFO L226 Difference]: Without dead ends: 27 [2025-02-05 14:41:28,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 14:41:28,057 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 1 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:41:28,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 92 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:41:28,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-02-05 14:41:28,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-02-05 14:41:28,061 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:41:28,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2025-02-05 14:41:28,062 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 24 [2025-02-05 14:41:28,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:41:28,062 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2025-02-05 14:41:28,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-05 14:41:28,063 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2025-02-05 14:41:28,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-05 14:41:28,063 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:41:28,064 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:41:28,071 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:41:28,264 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:41:28,265 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:41:28,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:41:28,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1229726215, now seen corresponding path program 2 times [2025-02-05 14:41:28,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:41:28,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114387105] [2025-02-05 14:41:28,265 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 14:41:28,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:41:28,287 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-02-05 14:41:28,292 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 32 statements. [2025-02-05 14:41:28,292 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-05 14:41:28,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:41:28,656 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 14:41:28,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:41:28,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114387105] [2025-02-05 14:41:28,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114387105] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:41:28,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:41:28,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 14:41:28,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849571273] [2025-02-05 14:41:28,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:41:28,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 14:41:28,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:41:28,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 14:41:28,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-05 14:41:28,659 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 14:41:28,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:41:28,811 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2025-02-05 14:41:28,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 14:41:28,812 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2025-02-05 14:41:28,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:41:28,813 INFO L225 Difference]: With dead ends: 37 [2025-02-05 14:41:28,813 INFO L226 Difference]: Without dead ends: 35 [2025-02-05 14:41:28,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-02-05 14:41:28,814 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 10 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 14:41:28,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 124 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 14:41:28,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-02-05 14:41:28,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2025-02-05 14:41:28,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 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:41:28,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2025-02-05 14:41:28,819 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 32 [2025-02-05 14:41:28,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:41:28,820 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2025-02-05 14:41:28,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 14:41:28,820 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2025-02-05 14:41:28,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-05 14:41:28,821 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:41:28,821 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:41:28,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 14:41:28,821 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:41:28,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:41:28,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1229727021, now seen corresponding path program 1 times [2025-02-05 14:41:28,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:41:28,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53398319] [2025-02-05 14:41:28,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:41:28,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:41:28,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-05 14:41:28,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-05 14:41:28,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:41:28,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:41:29,395 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 14:41:29,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:41:29,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53398319] [2025-02-05 14:41:29,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53398319] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:41:29,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795715963] [2025-02-05 14:41:29,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:41:29,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:41:29,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:41:29,398 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:41:29,400 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:41:29,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-05 14:41:29,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-05 14:41:29,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:41:29,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:41:29,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-05 14:41:29,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:41:29,669 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 15 treesize of output 1 [2025-02-05 14:41:29,678 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:29,682 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 14:41:29,683 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 14:41:29,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795715963] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:41:29,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 14:41:29,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [15] total 20 [2025-02-05 14:41:29,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71916351] [2025-02-05 14:41:29,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:41:29,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 14:41:29,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:41:29,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 14:41:29,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2025-02-05 14:41:29,686 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 14:41:29,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:41:29,767 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2025-02-05 14:41:29,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 14:41:29,768 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2025-02-05 14:41:29,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:41:29,769 INFO L225 Difference]: With dead ends: 38 [2025-02-05 14:41:29,769 INFO L226 Difference]: Without dead ends: 35 [2025-02-05 14:41:29,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2025-02-05 14:41:29,770 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 8 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 14:41:29,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 151 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 14:41:29,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-02-05 14:41:29,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2025-02-05 14:41:29,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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:41:29,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2025-02-05 14:41:29,775 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 32 [2025-02-05 14:41:29,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:41:29,775 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2025-02-05 14:41:29,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 14:41:29,775 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2025-02-05 14:41:29,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-05 14:41:29,776 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:41:29,776 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:41:29,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 14:41:29,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:41:29,985 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:41:29,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:41:29,985 INFO L85 PathProgramCache]: Analyzing trace with hash 650960712, now seen corresponding path program 1 times [2025-02-05 14:41:29,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:41:29,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461970021] [2025-02-05 14:41:29,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:41:29,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:41:30,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-05 14:41:30,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-05 14:41:30,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:41:30,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:41:30,223 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 14:41:30,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:41:30,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461970021] [2025-02-05 14:41:30,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461970021] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:41:30,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663730455] [2025-02-05 14:41:30,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:41:30,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:41:30,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:41:30,226 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:41:30,228 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:41:30,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-05 14:41:30,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-05 14:41:30,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:41:30,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:41:30,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-05 14:41:30,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:41:30,441 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:30,454 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 14:41:30,454 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:41:30,494 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 14:41:30,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [663730455] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:41:30,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:41:30,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 12 [2025-02-05 14:41:30,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963948182] [2025-02-05 14:41:30,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:41:30,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 14:41:30,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:41:30,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 14:41:30,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-02-05 14:41:30,497 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-05 14:41:34,516 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:41:38,530 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:41:42,553 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:41:42,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:41:42,643 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2025-02-05 14:41:42,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 14:41:42,644 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 34 [2025-02-05 14:41:42,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:41:42,644 INFO L225 Difference]: With dead ends: 40 [2025-02-05 14:41:42,644 INFO L226 Difference]: Without dead ends: 32 [2025-02-05 14:41:42,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 64 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:41:42,645 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 15 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2025-02-05 14:41:42,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 182 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 3 Unknown, 0 Unchecked, 12.1s Time] [2025-02-05 14:41:42,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-02-05 14:41:42,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-02-05 14:41:42,648 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:41:42,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2025-02-05 14:41:42,649 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 34 [2025-02-05 14:41:42,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:41:42,649 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2025-02-05 14:41:42,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-05 14:41:42,649 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2025-02-05 14:41:42,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-05 14:41:42,650 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:41:42,650 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:41:42,660 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:42,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:41:42,854 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:41:42,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:41:42,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1885169358, now seen corresponding path program 1 times [2025-02-05 14:41:42,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:41:42,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403287922] [2025-02-05 14:41:42,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:41:42,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:41:42,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-05 14:41:42,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-05 14:41:42,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:41:42,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:41:43,758 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 14:41:43,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:41:43,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403287922] [2025-02-05 14:41:43,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403287922] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:41:43,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173544150] [2025-02-05 14:41:43,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:41:43,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:41:43,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:41:43,762 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:43,764 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:43,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-05 14:41:43,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-05 14:41:43,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:41:43,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:41:43,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 76 conjuncts are in the unsatisfiable core [2025-02-05 14:41:43,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:41:43,957 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:43,970 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:44,030 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 23 treesize of output 11 [2025-02-05 14:41:44,188 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:44,197 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 3 [2025-02-05 14:41:44,295 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0) 0)) (exists ((|v_node_create_~temp~0#1.base_26| Int)) (and (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |v_node_create_~temp~0#1.base_26| (select |c_#memory_int#1| |v_node_create_~temp~0#1.base_26|))) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_26|) 0)))) is different from true [2025-02-05 14:41:44,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:41:44,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 20 treesize of output 15 [2025-02-05 14:41:44,345 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-02-05 14:41:44,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 [2025-02-05 14:41:44,542 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 39 treesize of output 15 [2025-02-05 14:41:44,601 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:44,667 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2025-02-05 14:41:44,667 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:41:44,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173544150] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:41:44,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 14:41:44,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 30 [2025-02-05 14:41:44,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381552758] [2025-02-05 14:41:44,878 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 14:41:44,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-05 14:41:44,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:41:44,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-05 14:41:44,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=878, Unknown=17, NotChecked=60, Total=1056 [2025-02-05 14:41:44,879 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 30 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 26 states have internal predecessors, (46), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-05 14:41:45,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:41:45,436 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2025-02-05 14:41:45,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-05 14:41:45,436 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 26 states have internal predecessors, (46), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 35 [2025-02-05 14:41:45,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:41:45,437 INFO L225 Difference]: With dead ends: 45 [2025-02-05 14:41:45,437 INFO L226 Difference]: Without dead ends: 43 [2025-02-05 14:41:45,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=152, Invalid=1475, Unknown=17, NotChecked=78, Total=1722 [2025-02-05 14:41:45,438 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 29 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 14:41:45,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 169 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 462 Invalid, 0 Unknown, 46 Unchecked, 0.3s Time] [2025-02-05 14:41:45,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-02-05 14:41:45,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 38. [2025-02-05 14:41:45,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 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:41:45,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2025-02-05 14:41:45,443 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 35 [2025-02-05 14:41:45,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:41:45,443 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2025-02-05 14:41:45,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 26 states have internal predecessors, (46), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-05 14:41:45,443 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2025-02-05 14:41:45,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-05 14:41:45,444 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:41:45,444 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:41:45,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 14:41:45,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-02-05 14:41:45,648 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:41:45,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:41:45,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1885170164, now seen corresponding path program 1 times [2025-02-05 14:41:45,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:41:45,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327507219] [2025-02-05 14:41:45,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:41:45,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:41:45,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-05 14:41:45,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-05 14:41:45,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:41:45,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:41:45,742 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 14:41:45,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:41:45,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327507219] [2025-02-05 14:41:45,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327507219] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:41:45,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134357409] [2025-02-05 14:41:45,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:41:45,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:41:45,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:41:45,746 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:45,748 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:45,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-05 14:41:45,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-05 14:41:45,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:41:45,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:41:45,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-05 14:41:45,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:41:45,923 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:45,926 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 14:41:45,926 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:41:45,974 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 14:41:45,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134357409] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:41:45,975 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:41:45,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 10 [2025-02-05 14:41:45,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107581084] [2025-02-05 14:41:45,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:41:45,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 14:41:45,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:41:45,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 14:41:45,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-05 14:41:45,976 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-05 14:41:49,990 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:41:54,002 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:41:58,019 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:41:58,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:41:58,081 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2025-02-05 14:41:58,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 14:41:58,082 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2025-02-05 14:41:58,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:41:58,082 INFO L225 Difference]: With dead ends: 42 [2025-02-05 14:41:58,082 INFO L226 Difference]: Without dead ends: 39 [2025-02-05 14:41:58,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-02-05 14:41:58,083 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 19 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2025-02-05 14:41:58,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 152 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 3 Unknown, 0 Unchecked, 12.1s Time] [2025-02-05 14:41:58,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-02-05 14:41:58,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-02-05 14:41:58,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 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:41:58,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2025-02-05 14:41:58,094 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 35 [2025-02-05 14:41:58,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:41:58,095 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2025-02-05 14:41:58,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-05 14:41:58,095 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2025-02-05 14:41:58,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-05 14:41:58,095 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:41:58,096 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:41:58,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 14:41:58,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:41:58,296 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:41:58,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:41:58,297 INFO L85 PathProgramCache]: Analyzing trace with hash -828371377, now seen corresponding path program 1 times [2025-02-05 14:41:58,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:41:58,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206870316] [2025-02-05 14:41:58,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:41:58,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:41:58,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-05 14:41:58,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-05 14:41:58,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:41:58,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:41:58,887 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 14:41:58,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:41:58,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206870316] [2025-02-05 14:41:58,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206870316] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:41:58,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564952686] [2025-02-05 14:41:58,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:41:58,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:41:58,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:41:58,890 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:58,891 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:58,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-05 14:41:59,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-05 14:41:59,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:41:59,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:41:59,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-02-05 14:41:59,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:41:59,166 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:59,245 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 19 treesize of output 1 [2025-02-05 14:41:59,351 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 18 treesize of output 4 [2025-02-05 14:41:59,355 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 3 [2025-02-05 14:41:59,370 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_47| Int)) (and (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |v_node_create_~temp~0#1.base_47| (select |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_47|))) (= 0 (select |c_old(#valid)| |v_node_create_~temp~0#1.base_47|)))) is different from true [2025-02-05 14:41:59,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:41:59,381 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:59,389 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-02-05 14:41:59,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 [2025-02-05 14:41:59,461 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 36 treesize of output 8 [2025-02-05 14:41:59,485 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 4 not checked. [2025-02-05 14:41:59,485 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:41:59,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564952686] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:41:59,606 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 14:41:59,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 31 [2025-02-05 14:41:59,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620523029] [2025-02-05 14:41:59,606 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 14:41:59,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-02-05 14:41:59,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:41:59,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-02-05 14:41:59,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1027, Unknown=2, NotChecked=64, Total=1190 [2025-02-05 14:41:59,607 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 31 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 26 states have internal predecessors, (47), 6 states have call successors, (6), 2 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:42:00,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:42:00,018 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2025-02-05 14:42:00,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 14:42:00,019 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 26 states have internal predecessors, (47), 6 states have call successors, (6), 2 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 37 [2025-02-05 14:42:00,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:42:00,020 INFO L225 Difference]: With dead ends: 45 [2025-02-05 14:42:00,020 INFO L226 Difference]: Without dead ends: 36 [2025-02-05 14:42:00,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=163, Invalid=1645, Unknown=2, NotChecked=82, Total=1892 [2025-02-05 14:42:00,022 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 16 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 34 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 14:42:00,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 322 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 397 Invalid, 0 Unknown, 34 Unchecked, 0.2s Time] [2025-02-05 14:42:00,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-02-05 14:42:00,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2025-02-05 14:42:00,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 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:42:00,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2025-02-05 14:42:00,029 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 37 [2025-02-05 14:42:00,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:42:00,030 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2025-02-05 14:42:00,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 26 states have internal predecessors, (47), 6 states have call successors, (6), 2 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:42:00,030 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2025-02-05 14:42:00,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-05 14:42:00,032 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:42:00,032 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:42:00,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-05 14:42:00,232 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,SelfDestructingSolverStorable7 [2025-02-05 14:42:00,233 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:42:00,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:42:00,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1203919279, now seen corresponding path program 1 times [2025-02-05 14:42:00,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:42:00,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854753550] [2025-02-05 14:42:00,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:42:00,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:42:00,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-05 14:42:00,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-05 14:42:00,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:42:00,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:42:01,146 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 14:42:01,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:42:01,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854753550] [2025-02-05 14:42:01,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854753550] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:42:01,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905654850] [2025-02-05 14:42:01,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:42:01,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:42:01,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:42:01,148 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:42:01,149 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:42:01,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-05 14:42:01,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-05 14:42:01,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:42:01,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:42:01,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 86 conjuncts are in the unsatisfiable core [2025-02-05 14:42:01,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:42:01,532 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:42:01,563 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:42:01,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-05 14:42:01,633 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 23 treesize of output 11 [2025-02-05 14:42:01,813 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:42:01,817 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 3 [2025-02-05 14:42:01,821 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:42:01,937 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_node_create_~temp~0#1.base_55| Int)) (and (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |v_node_create_~temp~0#1.base_55| (select |c_#memory_int#1| |v_node_create_~temp~0#1.base_55|))) (= 0 (select |c_old(#valid)| |v_node_create_~temp~0#1.base_55|)) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |v_node_create_~temp~0#1.base_55| (select |c_#memory_$Pointer$#1.offset| |v_node_create_~temp~0#1.base_55|))))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0))) is different from true [2025-02-05 14:42:01,978 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-02-05 14:42:01,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 [2025-02-05 14:42:01,984 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:42:01,989 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:42:02,196 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 23 treesize of output 7 [2025-02-05 14:42:02,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:42:02,280 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 31 treesize of output 15 [2025-02-05 14:42:02,337 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:42:02,392 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2025-02-05 14:42:02,392 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:42:02,600 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_854 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~last~0#1.offset_24| Int) (v_subst_1 Int)) (or (not (= v_ArrVal_854 (let ((.cse0 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_24| 4))) (store (select |c_#memory_int#1| v_subst_1) .cse0 (select v_ArrVal_854 .cse0))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| v_subst_1 v_ArrVal_854) (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|))) (< |v_ULTIMATE.start_sll_append_~last~0#1.offset_24| (select (select |c_#memory_$Pointer$#1.offset| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))))) is different from false [2025-02-05 14:42:02,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905654850] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:42:02,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 14:42:02,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 41 [2025-02-05 14:42:02,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144768499] [2025-02-05 14:42:02,726 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 14:42:02,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-02-05 14:42:02,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:42:02,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-02-05 14:42:02,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1655, Unknown=19, NotChecked=166, Total=1980 [2025-02-05 14:42:02,728 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 41 states, 39 states have (on average 1.435897435897436) internal successors, (56), 35 states have internal predecessors, (56), 6 states have call successors, (6), 3 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:42:03,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:42:03,595 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2025-02-05 14:42:03,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-05 14:42:03,599 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 39 states have (on average 1.435897435897436) internal successors, (56), 35 states have internal predecessors, (56), 6 states have call successors, (6), 3 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 37 [2025-02-05 14:42:03,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:42:03,599 INFO L225 Difference]: With dead ends: 48 [2025-02-05 14:42:03,599 INFO L226 Difference]: Without dead ends: 46 [2025-02-05 14:42:03,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=251, Invalid=2930, Unknown=19, NotChecked=222, Total=3422 [2025-02-05 14:42:03,601 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 28 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 14:42:03,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 274 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 561 Invalid, 0 Unknown, 47 Unchecked, 0.4s Time] [2025-02-05 14:42:03,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-02-05 14:42:03,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 41. [2025-02-05 14:42:03,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 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:42:03,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2025-02-05 14:42:03,608 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 37 [2025-02-05 14:42:03,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:42:03,608 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2025-02-05 14:42:03,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 39 states have (on average 1.435897435897436) internal successors, (56), 35 states have internal predecessors, (56), 6 states have call successors, (6), 3 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:42:03,608 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2025-02-05 14:42:03,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-05 14:42:03,608 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:42:03,608 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:42:03,616 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-05 14:42:03,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:42:03,809 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:42:03,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:42:03,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1620298992, now seen corresponding path program 1 times [2025-02-05 14:42:03,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:42:03,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086758426] [2025-02-05 14:42:03,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:42:03,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:42:03,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-05 14:42:03,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-05 14:42:03,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:42:03,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:42:05,471 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:42:05,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:42:05,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086758426] [2025-02-05 14:42:05,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086758426] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:42:05,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196228026] [2025-02-05 14:42:05,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:42:05,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:42:05,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:42:05,474 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:42:05,476 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:42:05,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-05 14:42:05,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-05 14:42:05,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:42:05,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:42:05,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 143 conjuncts are in the unsatisfiable core [2025-02-05 14:42:05,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:42:05,770 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:42:05,782 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:42:05,834 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 23 treesize of output 11 [2025-02-05 14:42:05,981 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-05 14:42:05,982 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:42:05,991 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:42:06,051 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 15 treesize of output 1 [2025-02-05 14:42:06,054 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:42:06,059 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:42:06,271 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:42:06,279 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:42:06,283 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:42:06,290 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:42:06,532 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-02-05 14:42:06,532 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:42:06,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:42:06,551 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:42:06,564 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2025-02-05 14:42:06,564 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:42:06,582 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-02-05 14:42:06,582 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:42:07,030 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2025-02-05 14:42:07,031 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 159 treesize of output 104 [2025-02-05 14:42:07,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:42:07,042 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 59 treesize of output 19 [2025-02-05 14:42:07,048 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 55 treesize of output 15 [2025-02-05 14:42:07,161 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 67 treesize of output 43 [2025-02-05 14:42:07,251 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 40 treesize of output 24 [2025-02-05 14:42:07,255 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 17 treesize of output 7 [2025-02-05 14:42:07,395 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:42:07,395 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:42:07,671 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~last~0#1.offset_29| Int) (v_ArrVal_991 (Array Int Int)) (v_ArrVal_992 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse0)) (.cse4 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_29| 4))) (or (< |v_ULTIMATE.start_sll_append_~last~0#1.offset_29| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse0)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store |c_#memory_int#1| .cse1 v_ArrVal_991) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_992) .cse2) .cse3)) (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 (store (select |c_#memory_$Pointer$#1.offset| .cse1) .cse4 |c_ULTIMATE.start_sll_append_~new_last~0#1.offset|)) .cse2) .cse3)))) (not (= (store (select |c_#memory_int#1| .cse1) .cse4 (select v_ArrVal_991 .cse4)) v_ArrVal_991)))))) is different from false [2025-02-05 14:42:07,697 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~last~0#1.offset_29| Int) (v_ArrVal_991 (Array Int Int)) (v_ArrVal_992 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse1)) (.cse5 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_29| 4))) (or (< |v_ULTIMATE.start_sll_append_~last~0#1.offset_29| (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse1)) (= |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|) 4))) (select (select (store |c_#memory_int#1| .cse2 v_ArrVal_991) (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_992) .cse3) .cse4)) (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 (store (select |c_#memory_$Pointer$#1.offset| .cse2) .cse5 |c_ULTIMATE.start_sll_append_~new_last~0#1.offset|)) .cse3) .cse4)))) (not (= v_ArrVal_991 (store (select |c_#memory_int#1| .cse2) .cse5 (select v_ArrVal_991 .cse5)))))))) is different from false [2025-02-05 14:42:07,715 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~last~0#1.offset_29| Int) (|v_ULTIMATE.start_sll_append_~new_last~0#1.offset_23| Int) (v_ArrVal_991 (Array Int Int)) (v_ArrVal_992 (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse5 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse4) .cse5)) (.cse3 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_29| 4))) (or (= (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|) 4))) (select (select (store |c_#memory_int#1| .cse0 v_ArrVal_991) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_992) .cse1) .cse2)) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 (store (select |c_#memory_$Pointer$#1.offset| .cse0) .cse3 |v_ULTIMATE.start_sll_append_~new_last~0#1.offset_23|)) .cse1) .cse2))) |c_ULTIMATE.start_main_~data~0#1|) (< |v_ULTIMATE.start_sll_append_~last~0#1.offset_29| (select (select |c_#memory_$Pointer$#1.offset| .cse4) .cse5)) (< |v_ULTIMATE.start_sll_append_~new_last~0#1.offset_23| |c_ULTIMATE.start_sll_append_#t~ret7#1.offset|) (not (= v_ArrVal_991 (store (select |c_#memory_int#1| .cse0) .cse3 (select v_ArrVal_991 .cse3)))))))) is different from false [2025-02-05 14:42:07,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196228026] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:42:07,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 14:42:07,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 26] total 50 [2025-02-05 14:42:07,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151377632] [2025-02-05 14:42:07,944 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 14:42:07,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-02-05 14:42:07,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:42:07,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-02-05 14:42:07,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=2915, Unknown=22, NotChecked=330, Total=3422 [2025-02-05 14:42:07,946 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 50 states, 48 states have (on average 1.25) internal successors, (60), 41 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:42:12,710 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:42:13,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:42:13,912 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2025-02-05 14:42:13,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-02-05 14:42:13,912 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 1.25) internal successors, (60), 41 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:42:13,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:42:13,913 INFO L225 Difference]: With dead ends: 52 [2025-02-05 14:42:13,913 INFO L226 Difference]: Without dead ends: 50 [2025-02-05 14:42:13,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 998 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=326, Invalid=5516, Unknown=22, NotChecked=456, Total=6320 [2025-02-05 14:42:13,914 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 34 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 1193 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1193 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-02-05 14:42:13,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 306 Invalid, 1198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1193 Invalid, 1 Unknown, 0 Unchecked, 4.8s Time] [2025-02-05 14:42:13,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-02-05 14:42:13,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2025-02-05 14:42:13,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 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:42:13,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2025-02-05 14:42:13,923 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 39 [2025-02-05 14:42:13,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:42:13,924 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2025-02-05 14:42:13,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 1.25) internal successors, (60), 41 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:42:13,924 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2025-02-05 14:42:13,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-05 14:42:13,924 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:42:13,924 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:42:13,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-05 14:42:14,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:42:14,125 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:42:14,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:42:14,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1620299798, now seen corresponding path program 1 times [2025-02-05 14:42:14,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:42:14,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248739675] [2025-02-05 14:42:14,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:42:14,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:42:14,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-05 14:42:14,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-05 14:42:14,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:42:14,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:42:15,026 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:42:15,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:42:15,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248739675] [2025-02-05 14:42:15,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248739675] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:42:15,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641609935] [2025-02-05 14:42:15,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:42:15,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:42:15,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:42:15,029 INFO L229 MonitoredProcess]: Starting monitored process 10 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:42:15,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-05 14:42:15,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-05 14:42:15,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-05 14:42:15,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:42:15,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:42:15,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-02-05 14:42:15,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:42:15,229 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:42:15,298 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 19 treesize of output 1 [2025-02-05 14:42:15,386 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 18 treesize of output 4 [2025-02-05 14:42:15,389 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 3 [2025-02-05 14:42:15,447 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_71| Int)) (and (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_71|) 0) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |v_node_create_~temp~0#1.base_71| (select |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_71|))))) is different from true [2025-02-05 14:42:15,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:42:15,456 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:42:15,462 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-02-05 14:42:15,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 [2025-02-05 14:42:15,589 INFO L349 Elim1Store]: treesize reduction 59, result has 37.2 percent of original size [2025-02-05 14:42:15,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 47 treesize of output 42 [2025-02-05 14:42:15,598 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 26 treesize of output 18 [2025-02-05 14:42:15,602 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 22 treesize of output 14 [2025-02-05 14:42:15,647 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 20 treesize of output 8 [2025-02-05 14:42:15,650 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 4 not checked. [2025-02-05 14:42:15,650 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:42:15,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641609935] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:42:15,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 14:42:15,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21] total 41 [2025-02-05 14:42:15,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667817148] [2025-02-05 14:42:15,936 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 14:42:15,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-02-05 14:42:15,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:42:15,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-02-05 14:42:15,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1691, Unknown=3, NotChecked=82, Total=1892 [2025-02-05 14:42:15,939 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 41 states, 39 states have (on average 1.5128205128205128) internal successors, (59), 34 states have internal predecessors, (59), 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:42:16,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:42:16,728 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2025-02-05 14:42:16,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-05 14:42:16,729 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 39 states have (on average 1.5128205128205128) internal successors, (59), 34 states have internal predecessors, (59), 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 39 [2025-02-05 14:42:16,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:42:16,729 INFO L225 Difference]: With dead ends: 51 [2025-02-05 14:42:16,729 INFO L226 Difference]: Without dead ends: 48 [2025-02-05 14:42:16,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 622 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=235, Invalid=3426, Unknown=3, NotChecked=118, Total=3782 [2025-02-05 14:42:16,731 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 36 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 14:42:16,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 286 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 672 Invalid, 0 Unknown, 43 Unchecked, 0.3s Time] [2025-02-05 14:42:16,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-02-05 14:42:16,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2025-02-05 14:42:16,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 39 states have internal predecessors, (45), 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:42:16,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2025-02-05 14:42:16,740 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 39 [2025-02-05 14:42:16,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:42:16,740 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2025-02-05 14:42:16,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 39 states have (on average 1.5128205128205128) internal successors, (59), 34 states have internal predecessors, (59), 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:42:16,740 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2025-02-05 14:42:16,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-05 14:42:16,741 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:42:16,741 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:42:16,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-05 14:42:16,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:42:16,942 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:42:16,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:42:16,942 INFO L85 PathProgramCache]: Analyzing trace with hash -642377648, now seen corresponding path program 2 times [2025-02-05 14:42:16,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:42:16,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058349296] [2025-02-05 14:42:16,942 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 14:42:16,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:42:16,953 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-02-05 14:42:16,970 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-02-05 14:42:16,970 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 14:42:16,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:42:18,650 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:42:18,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:42:18,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058349296] [2025-02-05 14:42:18,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058349296] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:42:18,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202552210] [2025-02-05 14:42:18,650 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 14:42:18,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:42:18,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:42:18,652 INFO L229 MonitoredProcess]: Starting monitored process 11 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:42:18,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-05 14:42:18,752 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-02-05 14:42:18,793 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-02-05 14:42:18,793 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 14:42:18,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:42:18,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 116 conjuncts are in the unsatisfiable core [2025-02-05 14:42:18,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:42:18,832 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:42:18,913 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:42:19,033 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:42:19,091 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-05 14:42:19,092 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 18 treesize of output 17 [2025-02-05 14:42:19,096 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 7 treesize of output 3 [2025-02-05 14:42:19,117 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-05 14:42:19,118 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:42:19,187 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 23 treesize of output 11 [2025-02-05 14:42:19,193 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 33 treesize of output 21 [2025-02-05 14:42:19,202 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 15 treesize of output 1 [2025-02-05 14:42:19,434 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 55 treesize of output 31 [2025-02-05 14:42:19,439 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 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-05 14:42:19,445 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:42:19,451 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:42:19,620 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_node_create_~temp~0#1.base_80| Int)) (and (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |v_node_create_~temp~0#1.base_80| (select |c_#memory_$Pointer$#1.offset| |v_node_create_~temp~0#1.base_80|))) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |v_node_create_~temp~0#1.base_80| (select |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_80|))) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |v_node_create_~temp~0#1.base_80| (select |c_#memory_int#1| |v_node_create_~temp~0#1.base_80|))) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_80|) 0))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_8|) 0) 0))) is different from true [2025-02-05 14:42:19,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:42:19,658 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 63 treesize of output 46 [2025-02-05 14:42:19,679 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-02-05 14:42:19,680 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:42:19,685 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:42:19,690 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 34 treesize of output 32 [2025-02-05 14:42:19,905 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 53 treesize of output 29 [2025-02-05 14:42:20,001 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 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-05 14:42:20,101 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 15 [2025-02-05 14:42:20,159 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:42:20,244 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-02-05 14:42:20,244 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:42:20,407 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~last~0#1.base_42| Int) (v_ArrVal_1250 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |v_ULTIMATE.start_sll_append_~last~0#1.base_42| v_ArrVal_1250) (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|))) (not (= (let ((.cse0 (+ 4 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))))) (store (select |c_#memory_int#1| |v_ULTIMATE.start_sll_append_~last~0#1.base_42|) .cse0 (select v_ArrVal_1250 .cse0))) v_ArrVal_1250)))) is different from false [2025-02-05 14:42:20,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202552210] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:42:20,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 14:42:20,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 48 [2025-02-05 14:42:20,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249721507] [2025-02-05 14:42:20,815 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 14:42:20,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-02-05 14:42:20,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:42:20,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-02-05 14:42:20,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=2528, Unknown=51, NotChecked=206, Total=2970 [2025-02-05 14:42:20,816 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 48 states, 46 states have (on average 1.391304347826087) internal successors, (64), 39 states have internal predecessors, (64), 6 states have call successors, (6), 5 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:42:27,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:42:27,131 INFO L93 Difference]: Finished difference Result 76 states and 90 transitions. [2025-02-05 14:42:27,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-02-05 14:42:27,132 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 46 states have (on average 1.391304347826087) internal successors, (64), 39 states have internal predecessors, (64), 6 states have call successors, (6), 5 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 39 [2025-02-05 14:42:27,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:42:27,133 INFO L225 Difference]: With dead ends: 76 [2025-02-05 14:42:27,133 INFO L226 Difference]: Without dead ends: 74 [2025-02-05 14:42:27,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1201 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=360, Invalid=4994, Unknown=56, NotChecked=290, Total=5700 [2025-02-05 14:42:27,134 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 33 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 1072 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 1175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 14:42:27,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 435 Invalid, 1175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1072 Invalid, 0 Unknown, 76 Unchecked, 0.8s Time] [2025-02-05 14:42:27,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-02-05 14:42:27,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 51. [2025-02-05 14:42:27,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 45 states have internal predecessors, (52), 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:42:27,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2025-02-05 14:42:27,147 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 39 [2025-02-05 14:42:27,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:42:27,148 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2025-02-05 14:42:27,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 46 states have (on average 1.391304347826087) internal successors, (64), 39 states have internal predecessors, (64), 6 states have call successors, (6), 5 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:42:27,148 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2025-02-05 14:42:27,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-05 14:42:27,149 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:42:27,149 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:42:27,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-05 14:42:27,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-05 14:42:27,350 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:42:27,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:42:27,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1965722639, now seen corresponding path program 2 times [2025-02-05 14:42:27,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:42:27,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062028671] [2025-02-05 14:42:27,350 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 14:42:27,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:42:27,359 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-02-05 14:42:27,370 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-02-05 14:42:27,371 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 14:42:27,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:42:28,668 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 14:42:28,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:42:28,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062028671] [2025-02-05 14:42:28,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062028671] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:42:28,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82186329] [2025-02-05 14:42:28,669 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 14:42:28,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:42:28,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:42:28,671 INFO L229 MonitoredProcess]: Starting monitored process 12 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:42:28,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-05 14:42:28,770 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-02-05 14:42:28,811 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-02-05 14:42:28,811 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 14:42:28,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:42:28,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 138 conjuncts are in the unsatisfiable core [2025-02-05 14:42:28,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:42:28,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-02-05 14:42:28,995 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:42:29,000 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:42:29,210 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-05 14:42:29,210 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 16 treesize of output 15 [2025-02-05 14:42:29,250 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-05 14:42:29,250 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 16 treesize of output 15 [2025-02-05 14:42:29,281 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-05 14:42:29,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 21 [2025-02-05 14:42:29,350 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 27 treesize of output 26 [2025-02-05 14:42:29,357 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 33 treesize of output 17 [2025-02-05 14:42:29,569 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2025-02-05 14:42:29,569 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 102 treesize of output 31 [2025-02-05 14:42:29,574 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 25 treesize of output 7 [2025-02-05 14:42:29,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 7 [2025-02-05 14:42:29,666 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:42:29,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:42:29,747 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-02-05 14:42:29,747 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 110 treesize of output 87 [2025-02-05 14:42:29,765 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2025-02-05 14:42:29,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2025-02-05 14:42:29,777 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 47 treesize of output 45 [2025-02-05 14:42:30,320 INFO L349 Elim1Store]: treesize reduction 130, result has 20.2 percent of original size [2025-02-05 14:42:30,321 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 4 new quantified variables, introduced 5 case distinctions, treesize of input 135 treesize of output 71 [2025-02-05 14:42:30,341 INFO L349 Elim1Store]: treesize reduction 25, result has 45.7 percent of original size [2025-02-05 14:42:30,341 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 1 case distinctions, treesize of input 22 treesize of output 27 [2025-02-05 14:42:30,379 INFO L349 Elim1Store]: treesize reduction 162, result has 19.4 percent of original size [2025-02-05 14:42:30,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 61 treesize of output 57 [2025-02-05 14:42:30,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 316 treesize of output 252 [2025-02-05 14:42:30,642 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 256 treesize of output 208 [2025-02-05 14:42:31,890 INFO L349 Elim1Store]: treesize reduction 60, result has 85.3 percent of original size [2025-02-05 14:42:31,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 12 new quantified variables, introduced 36 case distinctions, treesize of input 334 treesize of output 511 [2025-02-05 14:42:32,400 INFO L349 Elim1Store]: treesize reduction 60, result has 85.3 percent of original size [2025-02-05 14:42:32,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 158 treesize of output 460