./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/list-simple/dll2c_insert_equal.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/list-simple/dll2c_insert_equal.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 7fc7bbe9c8e24388ea6f64f6e0dd2dbb72e088c84a42ef20dafe6607e6e65c70 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 10:54:39,615 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 10:54:39,671 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-29 10:54:39,676 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 10:54:39,679 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 10:54:39,692 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 10:54:39,693 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 10:54:39,693 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 10:54:39,693 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 10:54:39,693 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 10:54:39,694 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 10:54:39,694 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 10:54:39,695 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 10:54:39,695 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 10:54:39,695 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 10:54:39,695 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 10:54:39,695 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 10:54:39,695 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 10:54:39,695 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 10:54:39,695 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 10:54:39,695 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 10:54:39,695 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 10:54:39,696 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 10:54:39,696 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 10:54:39,696 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 10:54:39,696 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 10:54:39,696 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 10:54:39,696 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 10:54:39,696 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 10:54:39,696 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 10:54:39,696 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 10:54:39,697 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 10:54:39,697 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:54:39,697 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 10:54:39,697 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 10:54:39,697 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 10:54:39,697 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 10:54:39,697 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:54:39,697 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 10:54:39,698 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 10:54:39,698 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 10:54:39,698 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 10:54:39,698 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 10:54:39,698 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 10:54:39,698 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 10:54:39,698 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 10:54:39,698 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 10:54:39,698 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/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 -> 7fc7bbe9c8e24388ea6f64f6e0dd2dbb72e088c84a42ef20dafe6607e6e65c70 [2025-04-29 10:54:39,908 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 10:54:39,914 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 10:54:39,915 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 10:54:39,916 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 10:54:39,916 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 10:54:39,917 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2c_insert_equal.c [2025-04-29 10:54:41,226 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b0de2e98/941e0b0950fe4c2f9732e34f762df35f/FLAG23d90f136 [2025-04-29 10:54:41,424 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 10:54:41,425 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_insert_equal.c [2025-04-29 10:54:41,427 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 10:54:41,427 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 10:54:41,445 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b0de2e98/941e0b0950fe4c2f9732e34f762df35f/FLAG23d90f136 [2025-04-29 10:54:42,277 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b0de2e98/941e0b0950fe4c2f9732e34f762df35f [2025-04-29 10:54:42,283 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 10:54:42,284 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 10:54:42,288 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 10:54:42,290 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 10:54:42,294 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 10:54:42,294 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 10:54:42" (1/1) ... [2025-04-29 10:54:42,296 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@674fedc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:54:42, skipping insertion in model container [2025-04-29 10:54:42,296 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 10:54:42" (1/1) ... [2025-04-29 10:54:42,310 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 10:54:42,539 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_insert_equal.c[2071,2084] [2025-04-29 10:54:42,545 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 10:54:42,553 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 10:54:42,588 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_insert_equal.c[2071,2084] [2025-04-29 10:54:42,588 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 10:54:42,597 INFO L204 MainTranslator]: Completed translation [2025-04-29 10:54:42,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:54:42 WrapperNode [2025-04-29 10:54:42,598 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 10:54:42,599 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 10:54:42,599 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 10:54:42,599 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 10:54:42,603 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:54:42" (1/1) ... [2025-04-29 10:54:42,611 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:54:42" (1/1) ... [2025-04-29 10:54:42,629 INFO L138 Inliner]: procedures = 18, calls = 49, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 142 [2025-04-29 10:54:42,629 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 10:54:42,630 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 10:54:42,630 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 10:54:42,630 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 10:54:42,636 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:54:42" (1/1) ... [2025-04-29 10:54:42,636 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:54:42" (1/1) ... [2025-04-29 10:54:42,638 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:54:42" (1/1) ... [2025-04-29 10:54:42,659 INFO L175 MemorySlicer]: Split 33 memory accesses to 2 slices as follows [11, 22]. 67 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [1, 0]. The 18 writes are split as follows [1, 17]. [2025-04-29 10:54:42,659 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:54:42" (1/1) ... [2025-04-29 10:54:42,659 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:54:42" (1/1) ... [2025-04-29 10:54:42,668 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:54:42" (1/1) ... [2025-04-29 10:54:42,668 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:54:42" (1/1) ... [2025-04-29 10:54:42,670 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:54:42" (1/1) ... [2025-04-29 10:54:42,671 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:54:42" (1/1) ... [2025-04-29 10:54:42,672 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:54:42" (1/1) ... [2025-04-29 10:54:42,675 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 10:54:42,676 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 10:54:42,676 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 10:54:42,676 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 10:54:42,677 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:54:42" (1/1) ... [2025-04-29 10:54:42,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:54:42,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:54:42,703 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-29 10:54:42,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-29 10:54:42,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-29 10:54:42,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-29 10:54:42,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-29 10:54:42,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-29 10:54:42,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-29 10:54:42,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-29 10:54:42,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-29 10:54:42,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 10:54:42,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-29 10:54:42,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 10:54:42,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 10:54:42,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 10:54:42,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-29 10:54:42,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-29 10:54:42,725 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-04-29 10:54:42,725 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-04-29 10:54:42,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 10:54:42,802 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 10:54:42,803 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 10:54:43,014 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2025-04-29 10:54:43,014 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 10:54:43,021 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 10:54:43,021 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-29 10:54:43,021 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:54:43 BoogieIcfgContainer [2025-04-29 10:54:43,021 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 10:54:43,023 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 10:54:43,023 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 10:54:43,026 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 10:54:43,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 10:54:42" (1/3) ... [2025-04-29 10:54:43,027 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@752d86d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 10:54:43, skipping insertion in model container [2025-04-29 10:54:43,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:54:42" (2/3) ... [2025-04-29 10:54:43,027 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@752d86d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 10:54:43, skipping insertion in model container [2025-04-29 10:54:43,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:54:43" (3/3) ... [2025-04-29 10:54:43,028 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2c_insert_equal.c [2025-04-29 10:54:43,037 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 10:54:43,038 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2c_insert_equal.c that has 2 procedures, 35 locations, 51 edges, 1 initial locations, 4 loop locations, and 1 error locations. [2025-04-29 10:54:43,074 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 10:54:43,085 INFO L340 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;@39632d63, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 10:54:43,086 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-29 10:54:43,089 INFO L278 IsEmpty]: Start isEmpty. Operand has 35 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 30 states have internal predecessors, (42), 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-04-29 10:54:43,093 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-29 10:54:43,094 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:54:43,094 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-04-29 10:54:43,094 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:54:43,099 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:54:43,099 INFO L85 PathProgramCache]: Analyzing trace with hash -588406183, now seen corresponding path program 1 times [2025-04-29 10:54:43,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:54:43,105 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864651773] [2025-04-29 10:54:43,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:54:43,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:54:43,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-29 10:54:43,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 10:54:43,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:54:43,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:54:43,425 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 10:54:43,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:54:43,427 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864651773] [2025-04-29 10:54:43,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864651773] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:54:43,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:54:43,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 10:54:43,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481960656] [2025-04-29 10:54:43,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:54:43,433 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 10:54:43,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:54:43,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 10:54:43,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 10:54:43,445 INFO L87 Difference]: Start difference. First operand has 35 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 30 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-04-29 10:54:43,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:54:43,479 INFO L93 Difference]: Finished difference Result 66 states and 91 transitions. [2025-04-29 10:54:43,480 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 10:54:43,481 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2025-04-29 10:54:43,481 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:54:43,485 INFO L225 Difference]: With dead ends: 66 [2025-04-29 10:54:43,485 INFO L226 Difference]: Without dead ends: 33 [2025-04-29 10:54:43,487 INFO L436 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-04-29 10:54:43,491 INFO L437 NwaCegarLoop]: 44 mSDtfsCounter, 4 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:54:43,492 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 80 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:54:43,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-04-29 10:54:43,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2025-04-29 10:54:43,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 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-04-29 10:54:43,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2025-04-29 10:54:43,513 INFO L79 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 24 [2025-04-29 10:54:43,513 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:54:43,514 INFO L485 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2025-04-29 10:54:43,514 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-04-29 10:54:43,514 INFO L278 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2025-04-29 10:54:43,515 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-29 10:54:43,515 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:54:43,515 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:54:43,515 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 10:54:43,515 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:54:43,516 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:54:43,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1104733458, now seen corresponding path program 1 times [2025-04-29 10:54:43,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:54:43,516 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541757095] [2025-04-29 10:54:43,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:54:43,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:54:43,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-29 10:54:43,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 10:54:43,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:54:43,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:54:43,655 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-29 10:54:43,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:54:43,656 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541757095] [2025-04-29 10:54:43,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541757095] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:54:43,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:54:43,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 10:54:43,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119797785] [2025-04-29 10:54:43,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:54:43,657 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 10:54:43,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:54:43,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 10:54:43,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 10:54:43,658 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-04-29 10:54:43,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:54:43,674 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2025-04-29 10:54:43,674 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 10:54:43,675 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 34 [2025-04-29 10:54:43,675 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:54:43,675 INFO L225 Difference]: With dead ends: 38 [2025-04-29 10:54:43,675 INFO L226 Difference]: Without dead ends: 31 [2025-04-29 10:54:43,675 INFO L436 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-04-29 10:54:43,676 INFO L437 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 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-04-29 10:54:43,676 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:54:43,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-04-29 10:54:43,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-04-29 10:54:43,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 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-04-29 10:54:43,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2025-04-29 10:54:43,679 INFO L79 Accepts]: Start accepts. Automaton has 31 states and 40 transitions. Word has length 34 [2025-04-29 10:54:43,680 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:54:43,680 INFO L485 AbstractCegarLoop]: Abstraction has 31 states and 40 transitions. [2025-04-29 10:54:43,680 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-04-29 10:54:43,680 INFO L278 IsEmpty]: Start isEmpty. Operand 31 states and 40 transitions. [2025-04-29 10:54:43,680 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-29 10:54:43,680 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:54:43,680 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:54:43,681 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 10:54:43,681 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:54:43,681 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:54:43,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1758175303, now seen corresponding path program 1 times [2025-04-29 10:54:43,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:54:43,681 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596689859] [2025-04-29 10:54:43,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:54:43,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:54:43,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-29 10:54:43,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-29 10:54:43,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:54:43,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:54:45,985 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:54:45,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:54:45,985 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596689859] [2025-04-29 10:54:45,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596689859] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:54:45,986 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425854865] [2025-04-29 10:54:45,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:54:45,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:54:45,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:54:45,988 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:54:45,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-29 10:54:46,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-29 10:54:46,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-29 10:54:46,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:54:46,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:54:46,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 124 conjuncts are in the unsatisfiable core [2025-04-29 10:54:46,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:54:46,377 INFO L354 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-04-29 10:54:46,582 INFO L354 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-04-29 10:54:46,656 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-29 10:54:46,656 INFO L354 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-04-29 10:54:46,727 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-29 10:54:46,740 INFO L354 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-04-29 10:54:46,810 INFO L325 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-04-29 10:54:46,811 INFO L354 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 57 treesize of output 50 [2025-04-29 10:54:46,820 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-04-29 10:54:46,964 INFO L325 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2025-04-29 10:54:46,965 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 55 [2025-04-29 10:54:46,977 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:54:46,979 INFO L354 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 30 treesize of output 27 [2025-04-29 10:54:46,982 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2025-04-29 10:54:47,170 INFO L325 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2025-04-29 10:54:47,170 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 27 [2025-04-29 10:54:47,180 INFO L354 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-04-29 10:54:47,184 INFO L354 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-04-29 10:54:47,371 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:54:47,379 INFO L325 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-04-29 10:54:47,380 INFO L354 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 76 treesize of output 53 [2025-04-29 10:54:47,393 INFO L325 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-04-29 10:54:47,393 INFO L354 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-04-29 10:54:47,408 INFO L354 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-04-29 10:54:47,627 INFO L325 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2025-04-29 10:54:47,628 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 29 [2025-04-29 10:54:47,746 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 26 [2025-04-29 10:54:47,752 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2025-04-29 10:54:47,813 INFO L354 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-04-29 10:54:47,884 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:54:47,884 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:54:47,974 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_375 (Array Int Int)) (v_ArrVal_377 (Array Int Int)) (v_ArrVal_378 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_375) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_378) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_377) (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (not (= v_ArrVal_375 (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| (select v_ArrVal_375 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|)))))) is different from false [2025-04-29 10:54:47,991 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_375 (Array Int Int)) (v_ArrVal_377 (Array Int Int)) (v_ArrVal_378 (Array Int Int))) (or (not (= v_ArrVal_375 (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| (select v_ArrVal_375 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_375) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_378) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|) v_ArrVal_377) (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))))) is different from false [2025-04-29 10:54:48,002 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_375 (Array Int Int)) (v_ArrVal_377 (Array Int Int)) (v_ArrVal_378 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (or (= (select (select (store (store (store |c_#memory_int#1| .cse0 v_ArrVal_375) |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.base| v_ArrVal_378) (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse1) v_ArrVal_377) (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)) |c_ULTIMATE.start_main_~data~0#1|) (not (= v_ArrVal_375 (store (select |c_#memory_int#1| .cse0) .cse1 (select v_ArrVal_375 .cse1))))))) is different from false [2025-04-29 10:54:48,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [425854865] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:54:48,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 10:54:48,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 46 [2025-04-29 10:54:48,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756528036] [2025-04-29 10:54:48,138 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 10:54:48,139 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-04-29 10:54:48,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:54:48,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-04-29 10:54:48,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=2196, Unknown=3, NotChecked=288, Total=2652 [2025-04-29 10:54:48,141 INFO L87 Difference]: Start difference. First operand 31 states and 40 transitions. Second operand has 46 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 37 states have internal predecessors, (55), 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-04-29 10:54:49,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:54:49,616 INFO L93 Difference]: Finished difference Result 67 states and 88 transitions. [2025-04-29 10:54:49,616 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-29 10:54:49,616 INFO L79 Accepts]: Start accepts. Automaton has has 46 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 37 states have internal predecessors, (55), 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 35 [2025-04-29 10:54:49,617 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:54:49,617 INFO L225 Difference]: With dead ends: 67 [2025-04-29 10:54:49,617 INFO L226 Difference]: Without dead ends: 65 [2025-04-29 10:54:49,619 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1019 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=302, Invalid=3867, Unknown=3, NotChecked=384, Total=4556 [2025-04-29 10:54:49,619 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 41 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 1026 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 1043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-29 10:54:49,621 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 371 Invalid, 1043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1026 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-29 10:54:49,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-04-29 10:54:49,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 50. [2025-04-29 10:54:49,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 42 states have internal predecessors, (55), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-04-29 10:54:49,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 65 transitions. [2025-04-29 10:54:49,633 INFO L79 Accepts]: Start accepts. Automaton has 50 states and 65 transitions. Word has length 35 [2025-04-29 10:54:49,633 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:54:49,633 INFO L485 AbstractCegarLoop]: Abstraction has 50 states and 65 transitions. [2025-04-29 10:54:49,633 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 37 states have internal predecessors, (55), 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-04-29 10:54:49,633 INFO L278 IsEmpty]: Start isEmpty. Operand 50 states and 65 transitions. [2025-04-29 10:54:49,634 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-29 10:54:49,635 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:54:49,635 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:54:49,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-29 10:54:49,836 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:54:49,836 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:54:49,836 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:54:49,836 INFO L85 PathProgramCache]: Analyzing trace with hash -540036018, now seen corresponding path program 2 times [2025-04-29 10:54:49,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:54:49,837 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363597281] [2025-04-29 10:54:49,837 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:54:49,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:54:49,853 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-04-29 10:54:49,864 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-29 10:54:49,865 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:54:49,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:54:49,959 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-29 10:54:49,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:54:49,959 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363597281] [2025-04-29 10:54:49,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363597281] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:54:49,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:54:49,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 10:54:49,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520758386] [2025-04-29 10:54:49,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:54:49,960 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 10:54:49,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:54:49,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 10:54:49,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 10:54:49,961 INFO L87 Difference]: Start difference. First operand 50 states and 65 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-29 10:54:49,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:54:49,988 INFO L93 Difference]: Finished difference Result 63 states and 81 transitions. [2025-04-29 10:54:49,988 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 10:54:49,988 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2025-04-29 10:54:49,989 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:54:49,989 INFO L225 Difference]: With dead ends: 63 [2025-04-29 10:54:49,989 INFO L226 Difference]: Without dead ends: 52 [2025-04-29 10:54:49,990 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-29 10:54:49,990 INFO L437 NwaCegarLoop]: 32 mSDtfsCounter, 17 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:54:49,990 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 100 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:54:49,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-04-29 10:54:49,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2025-04-29 10:54:49,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 42 states have internal predecessors, (53), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-04-29 10:54:49,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 63 transitions. [2025-04-29 10:54:49,996 INFO L79 Accepts]: Start accepts. Automaton has 50 states and 63 transitions. Word has length 36 [2025-04-29 10:54:49,996 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:54:49,996 INFO L485 AbstractCegarLoop]: Abstraction has 50 states and 63 transitions. [2025-04-29 10:54:49,996 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-29 10:54:49,996 INFO L278 IsEmpty]: Start isEmpty. Operand 50 states and 63 transitions. [2025-04-29 10:54:49,997 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-29 10:54:49,997 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:54:49,997 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:54:49,997 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 10:54:49,997 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:54:49,997 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:54:49,998 INFO L85 PathProgramCache]: Analyzing trace with hash 805520724, now seen corresponding path program 1 times [2025-04-29 10:54:49,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:54:49,998 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826132189] [2025-04-29 10:54:49,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:54:49,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:54:50,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-29 10:54:50,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-29 10:54:50,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:54:50,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:54:50,086 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-29 10:54:50,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:54:50,086 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826132189] [2025-04-29 10:54:50,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826132189] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:54:50,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:54:50,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 10:54:50,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207724149] [2025-04-29 10:54:50,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:54:50,087 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 10:54:50,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:54:50,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 10:54:50,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 10:54:50,087 INFO L87 Difference]: Start difference. First operand 50 states and 63 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-29 10:54:50,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:54:50,102 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2025-04-29 10:54:50,102 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 10:54:50,102 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2025-04-29 10:54:50,103 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:54:50,103 INFO L225 Difference]: With dead ends: 61 [2025-04-29 10:54:50,103 INFO L226 Difference]: Without dead ends: 51 [2025-04-29 10:54:50,103 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 10:54:50,104 INFO L437 NwaCegarLoop]: 34 mSDtfsCounter, 17 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:54:50,104 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 73 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:54:50,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-04-29 10:54:50,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2025-04-29 10:54:50,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 41 states have internal predecessors, (50), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-04-29 10:54:50,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2025-04-29 10:54:50,109 INFO L79 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 36 [2025-04-29 10:54:50,109 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:54:50,109 INFO L485 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2025-04-29 10:54:50,110 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-29 10:54:50,110 INFO L278 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2025-04-29 10:54:50,110 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-29 10:54:50,110 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:54:50,110 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:54:50,110 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 10:54:50,111 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:54:50,111 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:54:50,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1684280272, now seen corresponding path program 1 times [2025-04-29 10:54:50,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:54:50,111 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219944021] [2025-04-29 10:54:50,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:54:50,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:54:50,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-29 10:54:50,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-29 10:54:50,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:54:50,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:54:50,661 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 10:54:50,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:54:50,661 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219944021] [2025-04-29 10:54:50,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219944021] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:54:50,661 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045935255] [2025-04-29 10:54:50,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:54:50,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:54:50,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:54:50,664 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:54:50,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-29 10:54:50,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-29 10:54:50,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-29 10:54:50,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:54:50,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:54:50,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 78 conjuncts are in the unsatisfiable core [2025-04-29 10:54:50,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:54:50,799 INFO L354 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-04-29 10:54:50,898 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-29 10:54:50,898 INFO L354 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-04-29 10:54:50,924 INFO L354 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-04-29 10:54:50,953 INFO L354 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-04-29 10:54:51,023 INFO L325 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2025-04-29 10:54:51,024 INFO L354 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 2 case distinctions, treesize of input 67 treesize of output 36 [2025-04-29 10:54:51,124 INFO L325 Elim1Store]: treesize reduction 42, result has 2.3 percent of original size [2025-04-29 10:54:51,124 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 27 [2025-04-29 10:54:51,127 INFO L354 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-04-29 10:54:51,203 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:54:51,209 INFO L325 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-04-29 10:54:51,209 INFO L354 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 98 treesize of output 75 [2025-04-29 10:54:51,233 INFO L325 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2025-04-29 10:54:51,233 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2025-04-29 10:54:51,439 INFO L325 Elim1Store]: treesize reduction 156, result has 37.6 percent of original size [2025-04-29 10:54:51,439 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 176 treesize of output 179 [2025-04-29 10:54:51,531 INFO L325 Elim1Store]: treesize reduction 370, result has 26.1 percent of original size [2025-04-29 10:54:51,531 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 13 case distinctions, treesize of input 191 treesize of output 310 [2025-04-29 10:54:51,567 INFO L354 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 11 treesize of output 9 [2025-04-29 10:54:51,597 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 10:54:51,597 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2025-04-29 10:54:52,940 INFO L325 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2025-04-29 10:54:52,941 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 28 treesize of output 17 [2025-04-29 10:54:52,969 INFO L325 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-04-29 10:54:52,970 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 treesize of output 21 [2025-04-29 10:54:52,990 INFO L325 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-04-29 10:54:52,991 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 treesize of output 21 [2025-04-29 10:54:53,076 INFO L325 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-04-29 10:54:53,076 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 treesize of output 21 [2025-04-29 10:54:53,096 INFO L325 Elim1Store]: treesize reduction 50, result has 33.3 percent of original size [2025-04-29 10:54:53,096 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 41 [2025-04-29 10:54:53,118 INFO L325 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-04-29 10:54:53,118 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 treesize of output 21 [2025-04-29 10:54:53,270 INFO L325 Elim1Store]: treesize reduction 56, result has 43.4 percent of original size [2025-04-29 10:54:53,271 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 37 treesize of output 49 [2025-04-29 10:54:53,364 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2025-04-29 10:54:53,374 INFO L325 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2025-04-29 10:54:53,374 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 17 [2025-04-29 10:54:53,395 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 10:54:53,430 INFO L325 Elim1Store]: treesize reduction 68, result has 55.0 percent of original size [2025-04-29 10:54:53,430 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 102 treesize of output 139 [2025-04-29 10:54:53,500 WARN L195 Elim1Store]: Array PQE input equivalent to false [2025-04-29 10:54:53,515 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2025-04-29 10:54:53,551 WARN L195 Elim1Store]: Array PQE input equivalent to false [2025-04-29 10:54:53,695 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2025-04-29 10:54:53,709 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2025-04-29 10:54:53,727 INFO L325 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2025-04-29 10:54:53,727 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 28 treesize of output 32 [2025-04-29 10:54:53,741 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2025-04-29 10:54:53,777 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 10:54:53,791 INFO L325 Elim1Store]: treesize reduction 66, result has 33.3 percent of original size [2025-04-29 10:54:53,791 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 43 treesize of output 45 [2025-04-29 10:54:53,809 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 10:54:53,823 INFO L325 Elim1Store]: treesize reduction 64, result has 35.4 percent of original size [2025-04-29 10:54:53,824 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 43 treesize of output 47 [2025-04-29 10:54:53,835 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 10:54:53,872 INFO L325 Elim1Store]: treesize reduction 90, result has 43.0 percent of original size [2025-04-29 10:54:53,873 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 83 [2025-04-29 10:54:53,906 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 10:54:53,927 INFO L325 Elim1Store]: treesize reduction 56, result has 43.4 percent of original size [2025-04-29 10:54:53,927 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 37 treesize of output 49 [2025-04-29 10:54:53,946 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 10:54:53,964 INFO L325 Elim1Store]: treesize reduction 56, result has 43.4 percent of original size [2025-04-29 10:54:53,964 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 37 treesize of output 49 [2025-04-29 10:54:54,067 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 10:54:54,088 INFO L325 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2025-04-29 10:54:54,089 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 17 [2025-04-29 10:54:54,102 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 10:54:54,103 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2025-04-29 10:54:54,108 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 10:54:54,108 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2025-04-29 10:54:54,127 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 10:54:54,127 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2025-04-29 10:54:54,137 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 10:54:54,137 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2025-04-29 10:54:54,425 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 10:54:54,507 INFO L325 Elim1Store]: treesize reduction 248, result has 40.0 percent of original size [2025-04-29 10:54:54,508 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 18 case distinctions, treesize of input 306 treesize of output 406 [2025-04-29 10:54:56,979 INFO L354 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 13 treesize of output 9 [2025-04-29 10:54:57,000 INFO L354 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 13 treesize of output 9 [2025-04-29 10:54:57,019 INFO L325 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-04-29 10:54:57,020 INFO L354 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 25 treesize of output 19 [2025-04-29 10:54:57,222 INFO L354 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 13 treesize of output 9 [2025-04-29 10:54:57,319 INFO L354 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 13 treesize of output 9 [2025-04-29 10:54:57,337 INFO L325 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-04-29 10:54:57,337 INFO L354 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 25 treesize of output 19 [2025-04-29 10:54:57,340 INFO L354 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 13 treesize of output 9 [2025-04-29 10:54:57,406 INFO L354 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 13 treesize of output 9 [2025-04-29 10:54:57,426 INFO L325 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-04-29 10:54:57,426 INFO L354 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 25 treesize of output 19 [2025-04-29 10:54:57,471 INFO L354 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 13 treesize of output 9 [2025-04-29 10:54:57,486 INFO L325 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-04-29 10:54:57,486 INFO L354 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 25 treesize of output 19 [2025-04-29 10:54:57,489 INFO L354 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 13 treesize of output 9 [2025-04-29 10:54:57,541 INFO L325 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-04-29 10:54:57,541 INFO L354 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 25 treesize of output 19 [2025-04-29 10:54:57,605 INFO L354 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 13 treesize of output 9 [2025-04-29 10:54:57,616 INFO L325 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-04-29 10:54:57,616 INFO L354 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 25 treesize of output 19 [2025-04-29 10:54:57,652 INFO L325 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-04-29 10:54:57,652 INFO L354 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 25 treesize of output 19 [2025-04-29 10:54:57,661 INFO L354 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 13 treesize of output 9 [2025-04-29 10:54:57,675 INFO L325 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-04-29 10:54:57,675 INFO L354 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 25 treesize of output 19 [2025-04-29 10:54:57,713 INFO L354 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 13 treesize of output 9 [2025-04-29 10:54:57,755 INFO L354 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 13 treesize of output 9 [2025-04-29 10:55:02,722 INFO L354 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 13 treesize of output 9 [2025-04-29 10:55:02,766 WARN L195 Elim1Store]: Array PQE input equivalent to false [2025-04-29 10:55:02,769 INFO L325 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-04-29 10:55:02,769 INFO L354 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 25 treesize of output 19 [2025-04-29 10:55:02,854 INFO L354 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 13 treesize of output 9 [2025-04-29 10:55:02,865 WARN L195 Elim1Store]: Array PQE input equivalent to false [2025-04-29 10:55:02,869 INFO L325 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-04-29 10:55:02,869 INFO L354 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 25 treesize of output 19 [2025-04-29 10:55:03,047 INFO L354 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 13 treesize of output 9 [2025-04-29 10:55:03,156 INFO L354 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 13 treesize of output 9 [2025-04-29 10:55:03,168 INFO L325 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-04-29 10:55:03,169 INFO L354 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 25 treesize of output 19 [2025-04-29 10:55:03,187 INFO L354 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 13 treesize of output 9 [2025-04-29 10:55:03,197 INFO L325 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-04-29 10:55:03,197 INFO L354 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 25 treesize of output 19 [2025-04-29 10:55:03,207 INFO L325 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-04-29 10:55:03,207 INFO L354 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 25 treesize of output 19 [2025-04-29 10:55:03,212 INFO L354 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 13 treesize of output 9 [2025-04-29 10:55:03,222 INFO L325 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-04-29 10:55:03,222 INFO L354 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 25 treesize of output 19 [2025-04-29 10:55:03,250 INFO L354 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 13 treesize of output 9 [2025-04-29 10:55:03,310 INFO L354 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 13 treesize of output 9 [2025-04-29 10:55:03,321 WARN L195 Elim1Store]: Array PQE input equivalent to false [2025-04-29 10:55:03,325 INFO L325 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-04-29 10:55:03,325 INFO L354 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 25 treesize of output 19 [2025-04-29 10:55:03,439 WARN L195 Elim1Store]: Array PQE input equivalent to false [2025-04-29 10:55:03,443 INFO L325 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-04-29 10:55:03,443 INFO L354 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 25 treesize of output 19 [2025-04-29 10:55:06,349 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 10:55:06,416 INFO L325 Elim1Store]: treesize reduction 248, result has 40.0 percent of original size [2025-04-29 10:55:06,416 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 18 case distinctions, treesize of input 253 treesize of output 357 [2025-04-29 10:55:11,345 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 10:55:11,377 INFO L325 Elim1Store]: treesize reduction 92, result has 47.4 percent of original size [2025-04-29 10:55:11,377 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 106 treesize of output 144 Killed by 15