./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/dll2c_prepend_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/dll2c_prepend_unequal.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 583b66b9d59d34de12ff7e58a8eb24a95055476e3f5044dc2a7c6b2bb83f4c67 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 02:47:26,283 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 02:47:26,326 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 02:47:26,330 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 02:47:26,330 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 02:47:26,348 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 02:47:26,349 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 02:47:26,349 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 02:47:26,350 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 02:47:26,350 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 02:47:26,350 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 02:47:26,350 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 02:47:26,350 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 02:47:26,350 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 02:47:26,350 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 02:47:26,350 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 02:47:26,350 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 02:47:26,350 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 02:47:26,350 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 02:47:26,351 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 02:47:26,351 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 02:47:26,351 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 02:47:26,351 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 02:47:26,351 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 02:47:26,351 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 02:47:26,351 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 02:47:26,351 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 02:47:26,351 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 02:47:26,351 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 02:47:26,351 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:47:26,352 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:47:26,352 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:47:26,352 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:47:26,352 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 02:47:26,352 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:47:26,352 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:47:26,352 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:47:26,352 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:47:26,352 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 02:47:26,352 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 02:47:26,352 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 02:47:26,352 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 02:47:26,352 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 02:47:26,353 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 02:47:26,353 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 02:47:26,353 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 02:47:26,353 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 02:47:26,353 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 02:47:26,353 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 583b66b9d59d34de12ff7e58a8eb24a95055476e3f5044dc2a7c6b2bb83f4c67 [2025-01-09 02:47:26,615 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 02:47:26,622 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 02:47:26,625 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 02:47:26,626 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 02:47:26,626 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 02:47:26,628 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_prepend_unequal.i [2025-01-09 02:47:27,717 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/037351cac/baf1a46e4bde4df391ab2e958c714085/FLAGcbebf603d [2025-01-09 02:47:27,977 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 02:47:27,977 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_prepend_unequal.i [2025-01-09 02:47:27,990 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/037351cac/baf1a46e4bde4df391ab2e958c714085/FLAGcbebf603d [2025-01-09 02:47:28,005 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/037351cac/baf1a46e4bde4df391ab2e958c714085 [2025-01-09 02:47:28,007 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 02:47:28,009 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 02:47:28,010 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 02:47:28,010 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 02:47:28,013 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 02:47:28,013 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:47:28" (1/1) ... [2025-01-09 02:47:28,014 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d31ac5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:28, skipping insertion in model container [2025-01-09 02:47:28,014 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:47:28" (1/1) ... [2025-01-09 02:47:28,041 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 02:47:28,274 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_prepend_unequal.i[24729,24742] [2025-01-09 02:47:28,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:47:28,289 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 02:47:28,321 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_prepend_unequal.i[24729,24742] [2025-01-09 02:47:28,322 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:47:28,343 INFO L204 MainTranslator]: Completed translation [2025-01-09 02:47:28,343 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:28 WrapperNode [2025-01-09 02:47:28,343 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 02:47:28,344 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 02:47:28,344 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 02:47:28,344 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 02:47:28,349 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:28" (1/1) ... [2025-01-09 02:47:28,356 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:28" (1/1) ... [2025-01-09 02:47:28,373 INFO L138 Inliner]: procedures = 127, calls = 49, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 139 [2025-01-09 02:47:28,373 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 02:47:28,373 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 02:47:28,374 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 02:47:28,374 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 02:47:28,380 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:28" (1/1) ... [2025-01-09 02:47:28,380 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:28" (1/1) ... [2025-01-09 02:47:28,382 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:28" (1/1) ... [2025-01-09 02:47:28,396 INFO L175 MemorySlicer]: Split 31 memory accesses to 3 slices as follows [2, 20, 9]. 65 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 15 writes are split as follows [0, 13, 2]. [2025-01-09 02:47:28,396 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:28" (1/1) ... [2025-01-09 02:47:28,396 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:28" (1/1) ... [2025-01-09 02:47:28,409 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:28" (1/1) ... [2025-01-09 02:47:28,410 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:28" (1/1) ... [2025-01-09 02:47:28,412 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:28" (1/1) ... [2025-01-09 02:47:28,414 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:28" (1/1) ... [2025-01-09 02:47:28,415 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:28" (1/1) ... [2025-01-09 02:47:28,417 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 02:47:28,418 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 02:47:28,418 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 02:47:28,418 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 02:47:28,419 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:28" (1/1) ... [2025-01-09 02:47:28,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:47:28,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:47:28,446 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 02:47:28,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 02:47:28,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 02:47:28,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 02:47:28,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 02:47:28,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 02:47:28,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 02:47:28,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 02:47:28,465 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-01-09 02:47:28,465 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-01-09 02:47:28,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 02:47:28,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 02:47:28,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 02:47:28,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 02:47:28,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 02:47:28,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 02:47:28,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 02:47:28,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 02:47:28,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 02:47:28,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 02:47:28,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 02:47:28,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 02:47:28,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 02:47:28,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 02:47:28,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 02:47:28,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 02:47:28,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 02:47:28,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 02:47:28,586 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 02:47:28,588 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 02:47:28,808 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2025-01-09 02:47:28,809 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 02:47:28,817 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 02:47:28,817 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 02:47:28,817 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:47:28 BoogieIcfgContainer [2025-01-09 02:47:28,817 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 02:47:28,820 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 02:47:28,820 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 02:47:28,824 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 02:47:28,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:47:28" (1/3) ... [2025-01-09 02:47:28,825 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40b5fb8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:47:28, skipping insertion in model container [2025-01-09 02:47:28,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:28" (2/3) ... [2025-01-09 02:47:28,826 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40b5fb8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:47:28, skipping insertion in model container [2025-01-09 02:47:28,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:47:28" (3/3) ... [2025-01-09 02:47:28,827 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2c_prepend_unequal.i [2025-01-09 02:47:28,837 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 02:47:28,839 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2c_prepend_unequal.i that has 2 procedures, 33 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-01-09 02:47:28,872 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 02:47:28,880 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6512e601, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 02:47:28,880 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 02:47:28,883 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 28 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 02:47:28,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-09 02:47:28,887 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:47:28,887 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:47:28,888 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:47:28,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:47:28,891 INFO L85 PathProgramCache]: Analyzing trace with hash -142768512, now seen corresponding path program 1 times [2025-01-09 02:47:28,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:47:28,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87534598] [2025-01-09 02:47:28,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:47:28,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:47:28,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 02:47:29,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 02:47:29,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:47:29,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:47:29,222 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 02:47:29,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:47:29,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87534598] [2025-01-09 02:47:29,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87534598] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:47:29,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:47:29,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 02:47:29,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809010775] [2025-01-09 02:47:29,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:47:29,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 02:47:29,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:47:29,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 02:47:29,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:47:29,243 INFO L87 Difference]: Start difference. First operand has 33 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 28 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-01-09 02:47:29,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:47:29,268 INFO L93 Difference]: Finished difference Result 62 states and 85 transitions. [2025-01-09 02:47:29,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 02:47:29,270 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 22 [2025-01-09 02:47:29,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:47:29,275 INFO L225 Difference]: With dead ends: 62 [2025-01-09 02:47:29,275 INFO L226 Difference]: Without dead ends: 31 [2025-01-09 02:47:29,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:47:29,278 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 4 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 77 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-01-09 02:47:29,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 77 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:47:29,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-01-09 02:47:29,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2025-01-09 02:47:29,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 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-01-09 02:47:29,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2025-01-09 02:47:29,301 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 22 [2025-01-09 02:47:29,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:47:29,301 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2025-01-09 02:47:29,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-01-09 02:47:29,301 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2025-01-09 02:47:29,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-09 02:47:29,302 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:47:29,302 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] [2025-01-09 02:47:29,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 02:47:29,302 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:47:29,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:47:29,303 INFO L85 PathProgramCache]: Analyzing trace with hash 146891668, now seen corresponding path program 1 times [2025-01-09 02:47:29,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:47:29,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144723098] [2025-01-09 02:47:29,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:47:29,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:47:29,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 02:47:29,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 02:47:29,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:47:29,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:47:29,706 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 02:47:29,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:47:29,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144723098] [2025-01-09 02:47:29,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144723098] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:47:29,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666796419] [2025-01-09 02:47:29,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:47:29,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:47:29,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:47:29,709 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:47:29,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 02:47:29,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 02:47:29,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 02:47:29,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:47:29,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:47:29,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 02:47:29,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:47:30,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-01-09 02:47:30,028 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 02:47:30,028 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:47:30,088 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 02:47:30,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666796419] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:47:30,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:47:30,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 13 [2025-01-09 02:47:30,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120806117] [2025-01-09 02:47:30,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:47:30,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 02:47:30,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:47:30,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 02:47:30,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-01-09 02:47:30,091 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-09 02:47:34,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 02:47:38,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 02:47:42,167 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 02:47:46,198 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 02:47:50,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 02:47:54,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 02:47:58,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 02:47:58,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:47:58,558 INFO L93 Difference]: Finished difference Result 57 states and 71 transitions. [2025-01-09 02:47:58,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 02:47:58,558 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 32 [2025-01-09 02:47:58,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:47:58,559 INFO L225 Difference]: With dead ends: 57 [2025-01-09 02:47:58,559 INFO L226 Difference]: Without dead ends: 35 [2025-01-09 02:47:58,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2025-01-09 02:47:58,560 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 4 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 1 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.4s IncrementalHoareTripleChecker+Time [2025-01-09 02:47:58,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 293 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 156 Invalid, 7 Unknown, 0 Unchecked, 28.4s Time] [2025-01-09 02:47:58,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-01-09 02:47:58,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-01-09 02:47:58,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 02:47:58,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2025-01-09 02:47:58,566 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 32 [2025-01-09 02:47:58,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:47:58,567 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2025-01-09 02:47:58,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-09 02:47:58,567 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2025-01-09 02:47:58,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-09 02:47:58,567 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:47:58,567 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] [2025-01-09 02:47:58,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 02:47:58,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:47:58,768 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:47:58,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:47:58,768 INFO L85 PathProgramCache]: Analyzing trace with hash 146951250, now seen corresponding path program 1 times [2025-01-09 02:47:58,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:47:58,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141278135] [2025-01-09 02:47:58,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:47:58,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:47:58,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 02:47:58,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 02:47:58,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:47:58,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:48:00,829 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:48:00,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:48:00,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141278135] [2025-01-09 02:48:00,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141278135] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:48:00,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171761447] [2025-01-09 02:48:00,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:48:00,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:48:00,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:48:00,832 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:48:00,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 02:48:00,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 02:48:00,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 02:48:00,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:48:00,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:48:00,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-01-09 02:48:00,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:48:00,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 02:48:01,065 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-01-09 02:48:01,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-01-09 02:48:01,168 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2025-01-09 02:48:01,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 17 [2025-01-09 02:48:01,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2025-01-09 02:48:01,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 23 [2025-01-09 02:48:01,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2025-01-09 02:48:01,337 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:48:01,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 45 [2025-01-09 02:48:01,349 INFO L349 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2025-01-09 02:48:01,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 35 [2025-01-09 02:48:01,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-01-09 02:48:01,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:48:01,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 66 [2025-01-09 02:48:01,485 INFO L349 Elim1Store]: treesize reduction 31, result has 49.2 percent of original size [2025-01-09 02:48:01,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 100 [2025-01-09 02:48:01,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:48:01,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:48:01,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 60 [2025-01-09 02:48:01,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 41 [2025-01-09 02:48:01,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 25 [2025-01-09 02:48:01,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-01-09 02:48:01,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 21 [2025-01-09 02:48:01,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:48:01,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:48:01,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 60 [2025-01-09 02:48:01,692 INFO L378 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 0 case distinctions, treesize of input 63 treesize of output 21 [2025-01-09 02:48:01,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2025-01-09 02:48:01,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2025-01-09 02:48:01,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-01-09 02:48:01,734 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:48:01,735 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:48:01,763 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_470 (Array Int Int)) (v_ArrVal_472 (Array Int Int)) (v_ArrVal_467 (Array Int Int)) (v_ArrVal_466 (Array Int Int))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse4 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) (+ (select .cse4 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) 4)))) (or (not (= v_ArrVal_470 (let ((.cse2 (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4))) (store (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_472) .cse0 v_ArrVal_467) .cse1 v_ArrVal_466) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse2 (select v_ArrVal_470 .cse2))))) (not (= v_ArrVal_472 (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_472 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)))) (= (select (select (store (store (store |c_#memory_int#1| .cse0 v_ArrVal_467) .cse1 v_ArrVal_466) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_470) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse4 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_main_~uneq~0#1|)))))) is different from false [2025-01-09 02:48:01,787 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_470 (Array Int Int)) (v_ArrVal_472 (Array Int Int)) (v_ArrVal_467 (Array Int Int)) (v_ArrVal_466 (Array Int Int))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse4 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) (+ (select .cse4 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) 4)))) (or (not (= v_ArrVal_470 (let ((.cse2 (+ |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.offset| 4))) (store (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| v_ArrVal_472) .cse0 v_ArrVal_467) .cse1 v_ArrVal_466) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) .cse2 (select v_ArrVal_470 .cse2))))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int#1| .cse0 v_ArrVal_467) .cse1 v_ArrVal_466) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| v_ArrVal_470) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse4 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (not (= v_ArrVal_472 (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.offset| (select v_ArrVal_472 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.offset|))))))))) is different from false [2025-01-09 02:48:01,850 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:48:01,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1296 treesize of output 1286 [2025-01-09 02:48:01,884 INFO L349 Elim1Store]: treesize reduction 42, result has 55.3 percent of original size [2025-01-09 02:48:01,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 692 treesize of output 693 [2025-01-09 02:48:01,918 INFO L349 Elim1Store]: treesize reduction 42, result has 55.3 percent of original size [2025-01-09 02:48:01,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 391 treesize of output 417 [2025-01-09 02:48:01,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2025-01-09 02:48:02,027 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:48:02,028 INFO L378 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 1 case distinctions, treesize of input 23 treesize of output 8 [2025-01-09 02:48:02,144 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:48:02,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 89 [2025-01-09 02:48:02,207 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:48:02,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 89 [2025-01-09 02:48:02,397 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:48:02,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 13 [2025-01-09 02:48:02,414 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:48:02,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 13 [2025-01-09 02:48:02,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-01-09 02:48:02,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-01-09 02:48:02,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-01-09 02:48:02,475 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:48:02,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 79 [2025-01-09 02:48:02,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2025-01-09 02:48:02,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2025-01-09 02:48:02,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171761447] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:48:02,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 02:48:02,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 34 [2025-01-09 02:48:02,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465394978] [2025-01-09 02:48:02,805 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 02:48:02,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-01-09 02:48:02,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:48:02,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-01-09 02:48:02,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1098, Unknown=2, NotChecked=134, Total=1332 [2025-01-09 02:48:02,806 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 34 states, 32 states have (on average 1.40625) internal successors, (45), 27 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-09 02:48:04,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:48:04,144 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2025-01-09 02:48:04,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 02:48:04,144 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 1.40625) internal successors, (45), 27 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 32 [2025-01-09 02:48:04,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:48:04,145 INFO L225 Difference]: With dead ends: 37 [2025-01-09 02:48:04,145 INFO L226 Difference]: Without dead ends: 35 [2025-01-09 02:48:04,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=160, Invalid=1738, Unknown=2, NotChecked=170, Total=2070 [2025-01-09 02:48:04,146 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 9 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:48:04,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 276 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 02:48:04,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-01-09 02:48:04,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-01-09 02:48:04,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 02:48:04,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2025-01-09 02:48:04,150 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 32 [2025-01-09 02:48:04,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:48:04,151 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2025-01-09 02:48:04,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 1.40625) internal successors, (45), 27 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-09 02:48:04,151 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2025-01-09 02:48:04,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-09 02:48:04,151 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:48:04,151 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-01-09 02:48:04,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 02:48:04,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:48:04,352 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:48:04,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:48:04,352 INFO L85 PathProgramCache]: Analyzing trace with hash -513741235, now seen corresponding path program 1 times [2025-01-09 02:48:04,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:48:04,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610106869] [2025-01-09 02:48:04,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:48:04,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:48:04,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 02:48:04,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 02:48:04,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:48:04,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:48:06,201 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:48:06,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:48:06,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610106869] [2025-01-09 02:48:06,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610106869] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:48:06,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333179234] [2025-01-09 02:48:06,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:48:06,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:48:06,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:48:06,203 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:48:06,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 02:48:06,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 02:48:06,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 02:48:06,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:48:06,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:48:06,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 119 conjuncts are in the unsatisfiable core [2025-01-09 02:48:06,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:48:06,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 02:48:06,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 02:48:06,551 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 8) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1)) is different from false [2025-01-09 02:48:06,553 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 8) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1)) is different from true [2025-01-09 02:48:06,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-01-09 02:48:06,578 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 8) 1)) is different from false [2025-01-09 02:48:06,579 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 8) 1)) is different from true [2025-01-09 02:48:06,596 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 02:48:06,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-01-09 02:48:06,616 WARN L851 $PredicateComparison]: unable to prove that (and (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 8) 1)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)))) is different from false [2025-01-09 02:48:06,618 WARN L873 $PredicateComparison]: unable to prove that (and (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 8) 1)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)))) is different from true [2025-01-09 02:48:06,645 WARN L851 $PredicateComparison]: unable to prove that (and (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8) 1)) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) is different from false [2025-01-09 02:48:06,646 WARN L873 $PredicateComparison]: unable to prove that (and (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8) 1)) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) is different from true [2025-01-09 02:48:06,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2025-01-09 02:48:06,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 02:48:06,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:48:06,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 27 [2025-01-09 02:48:06,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2025-01-09 02:48:06,709 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse0 (select .cse2 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 8) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))))) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_DerPreprocessor_4) .cse0 v_DerPreprocessor_5) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 4 .cse0) .cse2)) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_#res#1.base|))))) is different from false [2025-01-09 02:48:06,713 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse0 (select .cse2 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 8) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))))) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_DerPreprocessor_4) .cse0 v_DerPreprocessor_5) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 4 .cse0) .cse2)) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_#res#1.base|))))) is different from true [2025-01-09 02:48:06,741 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse0 (select .cse2 4))) (and (not (= .cse0 .cse1)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_int#1| .cse1) 8) 1) (= (select |c_#valid| .cse1) 1) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse1 v_DerPreprocessor_4) .cse0 v_DerPreprocessor_5) .cse1) 4 .cse0) .cse2)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |c_#valid| .cse3)))) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 0))))))) is different from false [2025-01-09 02:48:06,743 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse0 (select .cse2 4))) (and (not (= .cse0 .cse1)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_int#1| .cse1) 8) 1) (= (select |c_#valid| .cse1) 1) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse1 v_DerPreprocessor_4) .cse0 v_DerPreprocessor_5) .cse1) 4 .cse0) .cse2)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |c_#valid| .cse3)))) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 0))))))) is different from true [2025-01-09 02:48:06,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 56 [2025-01-09 02:48:06,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-01-09 02:48:06,781 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4| Int) (v_DerPreprocessor_6 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (select |v_#valid_BEFORE_CALL_6| v_DerPreprocessor_6) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))))))) is different from false [2025-01-09 02:48:06,782 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4| Int) (v_DerPreprocessor_6 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (select |v_#valid_BEFORE_CALL_6| v_DerPreprocessor_6) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))))))) is different from true [2025-01-09 02:48:06,806 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4| Int) (v_DerPreprocessor_6 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (select |v_#valid_BEFORE_CALL_6| v_DerPreprocessor_6) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))))))) is different from false [2025-01-09 02:48:06,807 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4| Int) (v_DerPreprocessor_6 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (select |v_#valid_BEFORE_CALL_6| v_DerPreprocessor_6) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))))))) is different from true [2025-01-09 02:48:06,838 WARN L851 $PredicateComparison]: unable to prove that (and (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_node_create_#res#1.base| (select |c_#memory_int#1| |c_node_create_#res#1.base|))) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4| Int) (v_DerPreprocessor_6 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (select |v_#valid_BEFORE_CALL_6| v_DerPreprocessor_6) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))))))) is different from false [2025-01-09 02:48:06,839 WARN L873 $PredicateComparison]: unable to prove that (and (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_node_create_#res#1.base| (select |c_#memory_int#1| |c_node_create_#res#1.base|))) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4| Int) (v_DerPreprocessor_6 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (select |v_#valid_BEFORE_CALL_6| v_DerPreprocessor_6) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))))))) is different from true [2025-01-09 02:48:06,876 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-01-09 02:48:06,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2025-01-09 02:48:06,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:48:06,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 65 [2025-01-09 02:48:06,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2025-01-09 02:48:06,926 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (not (= .cse0 .cse1)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse1) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_old(#valid)_AFTER_CALL_9| .cse2))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_#valid_BEFORE_CALL_9| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= (select (select |c_#memory_int#1| .cse1) 8) 1) (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse1)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4| Int) (v_DerPreprocessor_6 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (select |v_#valid_BEFORE_CALL_6| v_DerPreprocessor_6) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse3) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse3) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4)))))))))) is different from false [2025-01-09 02:48:06,928 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (not (= .cse0 .cse1)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse1) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_old(#valid)_AFTER_CALL_9| .cse2))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_#valid_BEFORE_CALL_9| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= (select (select |c_#memory_int#1| .cse1) 8) 1) (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse1)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4| Int) (v_DerPreprocessor_6 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (select |v_#valid_BEFORE_CALL_6| v_DerPreprocessor_6) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse3) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse3) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4)))))))))) is different from true [2025-01-09 02:48:06,982 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (and (or (= (select (select |c_#memory_int#1| .cse0) 8) 1) (= |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| .cse0)) (not (= .cse1 .cse0)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse0) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_old(#valid)_AFTER_CALL_9| .cse2))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 1))) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4| Int) (v_DerPreprocessor_6 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (select |v_#valid_BEFORE_CALL_6| v_DerPreprocessor_6) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse3) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse3) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4)))))))))) is different from false [2025-01-09 02:48:06,984 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (and (or (= (select (select |c_#memory_int#1| .cse0) 8) 1) (= |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| .cse0)) (not (= .cse1 .cse0)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse0) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_old(#valid)_AFTER_CALL_9| .cse2))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 1))) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4| Int) (v_DerPreprocessor_6 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (select |v_#valid_BEFORE_CALL_6| v_DerPreprocessor_6) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse3) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse3) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4)))))))))) is different from true [2025-01-09 02:48:07,026 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-01-09 02:48:07,044 INFO L349 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2025-01-09 02:48:07,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 312 treesize of output 271 [2025-01-09 02:48:07,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 120 [2025-01-09 02:48:07,151 INFO L349 Elim1Store]: treesize reduction 20, result has 58.3 percent of original size [2025-01-09 02:48:07,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 406 treesize of output 306 [2025-01-09 02:48:07,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:48:07,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 95 [2025-01-09 02:48:07,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:48:07,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:48:07,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 31 [2025-01-09 02:48:07,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2025-01-09 02:48:07,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-01-09 02:48:07,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 17 [2025-01-09 02:48:07,276 INFO L349 Elim1Store]: treesize reduction 33, result has 31.3 percent of original size [2025-01-09 02:48:07,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 22 [2025-01-09 02:48:07,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2025-01-09 02:48:08,735 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-01-09 02:48:08,745 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-01-09 02:48:12,760 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse1) 0) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse0)) (.cse10 (+ .cse1 4))) (let ((.cse11 (select .cse5 .cse10))) (let ((.cse14 (exists ((v_ArrVal_721 (Array Int Int)) (v_DerPreprocessor_10 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_DerPreprocessor_8 Int) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (let ((.cse23 (select v_DerPreprocessor_11 .cse1))) (let ((.cse24 (select (select (store (store (store |c_#memory_$Pointer$#1.base| .cse23 v_DerPreprocessor_9) v_DerPreprocessor_8 v_DerPreprocessor_10) .cse0 v_DerPreprocessor_11) .cse23) 4))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse23) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse24) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 0) (= (store (select (store (store (store (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_8 v_DerPreprocessor_10) .cse0 v_DerPreprocessor_11) .cse23 v_ArrVal_723) .cse24 v_ArrVal_721) .cse0) .cse10 .cse11) .cse5) (= (let ((.cse25 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse25 (select |v_old(#valid)_AFTER_CALL_9| .cse25))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse23) 1) (= v_DerPreprocessor_8 .cse24) (= (select (select |c_#memory_int#1| .cse23) 8) 1))))))) (or (and (exists ((v_ArrVal_721 (Array Int Int)) (v_DerPreprocessor_10 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_DerPreprocessor_8 Int) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_6 Int) (v_DerPreprocessor_11 (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (let ((.cse2 (select v_DerPreprocessor_11 0))) (let ((.cse3 (select (select (store (store (store |c_#memory_$Pointer$#1.base| .cse2 v_DerPreprocessor_9) v_DerPreprocessor_8 v_DerPreprocessor_10) .cse0 v_DerPreprocessor_11) .cse2) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse2) 1) (= v_DerPreprocessor_8 .cse3) (= (select |v_#valid_BEFORE_CALL_9| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_6| v_DerPreprocessor_6) 1) (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse4 (select |v_old(#valid)_AFTER_CALL_9| .cse4))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 0) (= (store (select (store (store (store (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_8 v_DerPreprocessor_10) .cse0 v_DerPreprocessor_11) .cse2 v_ArrVal_723) .cse3 v_ArrVal_721) .cse0) 4 (select .cse5 4)) .cse5) (= (select (select |c_#memory_int#1| .cse2) 8) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse6 (select |v_#valid_BEFORE_CALL_7| .cse6)))) (= (select |v_#valid_BEFORE_CALL_9| .cse3) 1))))) (= .cse1 0)) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_DerPreprocessor_6 Int)) (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse7) 0) (exists ((|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (exists ((v_ArrVal_721 (Array Int Int)) (v_DerPreprocessor_10 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (v_DerPreprocessor_8 Int) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse8 (select v_DerPreprocessor_11 .cse1))) (let ((.cse9 (select (select (store (store (store |c_#memory_$Pointer$#1.base| .cse8 v_DerPreprocessor_9) v_DerPreprocessor_8 v_DerPreprocessor_10) .cse0 v_DerPreprocessor_11) .cse8) 4))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse9) 1) (= (store (select (store (store (store (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_8 v_DerPreprocessor_10) .cse0 v_DerPreprocessor_11) .cse8 v_ArrVal_723) .cse9 v_ArrVal_721) .cse0) .cse10 .cse11) .cse5) (= .cse7 .cse8) (= (select |v_old(#valid)_AFTER_CALL_9| .cse8) 1) (= v_DerPreprocessor_8 .cse9) (= (select (select |c_#memory_int#1| .cse8) 8) 1))))) (= (let ((.cse12 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse12 (select |v_old(#valid)_AFTER_CALL_9| .cse12))) |v_old(#valid)_AFTER_CALL_9|))))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse7) 1)))) (= |v_#valid_BEFORE_CALL_7| (let ((.cse13 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse13 (select |v_#valid_BEFORE_CALL_7| .cse13)))))) (= (select |v_#valid_BEFORE_CALL_6| v_DerPreprocessor_6) 1))) (and .cse14 (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4| Int) (v_DerPreprocessor_6 Int)) (let ((.cse15 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (select |v_#valid_BEFORE_CALL_6| v_DerPreprocessor_6) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse15) 0) (not (= |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse15) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse16 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse16 (select |v_#valid_BEFORE_CALL_7| .cse16)))))))) (exists ((v_ArrVal_721 (Array Int Int)) (v_DerPreprocessor_10 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_DerPreprocessor_8 Int) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_6 Int) (v_DerPreprocessor_11 (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (let ((.cse17 (select v_DerPreprocessor_11 .cse1))) (let ((.cse18 (select (select (store (store (store |c_#memory_$Pointer$#1.base| .cse17 v_DerPreprocessor_9) v_DerPreprocessor_8 v_DerPreprocessor_10) .cse0 v_DerPreprocessor_11) .cse17) 4))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse17) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse18) 1) (= (select |v_#valid_BEFORE_CALL_7| .cse17) 1) (= (select |v_#valid_BEFORE_CALL_6| v_DerPreprocessor_6) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 0) (= (store (select (store (store (store (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_8 v_DerPreprocessor_10) .cse0 v_DerPreprocessor_11) .cse17 v_ArrVal_723) .cse18 v_ArrVal_721) .cse0) .cse10 .cse11) .cse5) (= (let ((.cse19 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse19 (select |v_old(#valid)_AFTER_CALL_9| .cse19))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse17) 1) (= v_DerPreprocessor_8 .cse18) (= (select |v_#valid_BEFORE_CALL_6| .cse17) 0) (= (select (select |c_#memory_int#1| .cse17) 8) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse20 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse20 (select |v_#valid_BEFORE_CALL_7| .cse20)))))))) (and .cse14 (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4| Int) (v_DerPreprocessor_6 Int)) (let ((.cse21 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (select |v_#valid_BEFORE_CALL_6| v_DerPreprocessor_6) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse21) 0) (not (= |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4|)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse21) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse22 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse22 (select |v_#valid_BEFORE_CALL_7| .cse22)))))))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1))) is different from false [2025-01-09 02:48:12,768 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse1) 0) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse0)) (.cse10 (+ .cse1 4))) (let ((.cse11 (select .cse5 .cse10))) (let ((.cse14 (exists ((v_ArrVal_721 (Array Int Int)) (v_DerPreprocessor_10 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_DerPreprocessor_8 Int) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (let ((.cse23 (select v_DerPreprocessor_11 .cse1))) (let ((.cse24 (select (select (store (store (store |c_#memory_$Pointer$#1.base| .cse23 v_DerPreprocessor_9) v_DerPreprocessor_8 v_DerPreprocessor_10) .cse0 v_DerPreprocessor_11) .cse23) 4))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse23) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse24) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 0) (= (store (select (store (store (store (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_8 v_DerPreprocessor_10) .cse0 v_DerPreprocessor_11) .cse23 v_ArrVal_723) .cse24 v_ArrVal_721) .cse0) .cse10 .cse11) .cse5) (= (let ((.cse25 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse25 (select |v_old(#valid)_AFTER_CALL_9| .cse25))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse23) 1) (= v_DerPreprocessor_8 .cse24) (= (select (select |c_#memory_int#1| .cse23) 8) 1))))))) (or (and (exists ((v_ArrVal_721 (Array Int Int)) (v_DerPreprocessor_10 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_DerPreprocessor_8 Int) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_6 Int) (v_DerPreprocessor_11 (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (let ((.cse2 (select v_DerPreprocessor_11 0))) (let ((.cse3 (select (select (store (store (store |c_#memory_$Pointer$#1.base| .cse2 v_DerPreprocessor_9) v_DerPreprocessor_8 v_DerPreprocessor_10) .cse0 v_DerPreprocessor_11) .cse2) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse2) 1) (= v_DerPreprocessor_8 .cse3) (= (select |v_#valid_BEFORE_CALL_9| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_6| v_DerPreprocessor_6) 1) (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse4 (select |v_old(#valid)_AFTER_CALL_9| .cse4))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 0) (= (store (select (store (store (store (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_8 v_DerPreprocessor_10) .cse0 v_DerPreprocessor_11) .cse2 v_ArrVal_723) .cse3 v_ArrVal_721) .cse0) 4 (select .cse5 4)) .cse5) (= (select (select |c_#memory_int#1| .cse2) 8) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse6 (select |v_#valid_BEFORE_CALL_7| .cse6)))) (= (select |v_#valid_BEFORE_CALL_9| .cse3) 1))))) (= .cse1 0)) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_DerPreprocessor_6 Int)) (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse7) 0) (exists ((|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (exists ((v_ArrVal_721 (Array Int Int)) (v_DerPreprocessor_10 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (v_DerPreprocessor_8 Int) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse8 (select v_DerPreprocessor_11 .cse1))) (let ((.cse9 (select (select (store (store (store |c_#memory_$Pointer$#1.base| .cse8 v_DerPreprocessor_9) v_DerPreprocessor_8 v_DerPreprocessor_10) .cse0 v_DerPreprocessor_11) .cse8) 4))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse9) 1) (= (store (select (store (store (store (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_8 v_DerPreprocessor_10) .cse0 v_DerPreprocessor_11) .cse8 v_ArrVal_723) .cse9 v_ArrVal_721) .cse0) .cse10 .cse11) .cse5) (= .cse7 .cse8) (= (select |v_old(#valid)_AFTER_CALL_9| .cse8) 1) (= v_DerPreprocessor_8 .cse9) (= (select (select |c_#memory_int#1| .cse8) 8) 1))))) (= (let ((.cse12 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse12 (select |v_old(#valid)_AFTER_CALL_9| .cse12))) |v_old(#valid)_AFTER_CALL_9|))))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse7) 1)))) (= |v_#valid_BEFORE_CALL_7| (let ((.cse13 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse13 (select |v_#valid_BEFORE_CALL_7| .cse13)))))) (= (select |v_#valid_BEFORE_CALL_6| v_DerPreprocessor_6) 1))) (and .cse14 (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4| Int) (v_DerPreprocessor_6 Int)) (let ((.cse15 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (select |v_#valid_BEFORE_CALL_6| v_DerPreprocessor_6) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse15) 0) (not (= |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse15) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse16 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse16 (select |v_#valid_BEFORE_CALL_7| .cse16)))))))) (exists ((v_ArrVal_721 (Array Int Int)) (v_DerPreprocessor_10 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_DerPreprocessor_8 Int) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_6 Int) (v_DerPreprocessor_11 (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (let ((.cse17 (select v_DerPreprocessor_11 .cse1))) (let ((.cse18 (select (select (store (store (store |c_#memory_$Pointer$#1.base| .cse17 v_DerPreprocessor_9) v_DerPreprocessor_8 v_DerPreprocessor_10) .cse0 v_DerPreprocessor_11) .cse17) 4))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse17) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse18) 1) (= (select |v_#valid_BEFORE_CALL_7| .cse17) 1) (= (select |v_#valid_BEFORE_CALL_6| v_DerPreprocessor_6) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 0) (= (store (select (store (store (store (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_8 v_DerPreprocessor_10) .cse0 v_DerPreprocessor_11) .cse17 v_ArrVal_723) .cse18 v_ArrVal_721) .cse0) .cse10 .cse11) .cse5) (= (let ((.cse19 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_9|))) (store |v_#valid_BEFORE_CALL_9| .cse19 (select |v_old(#valid)_AFTER_CALL_9| .cse19))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse17) 1) (= v_DerPreprocessor_8 .cse18) (= (select |v_#valid_BEFORE_CALL_6| .cse17) 0) (= (select (select |c_#memory_int#1| .cse17) 8) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse20 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse20 (select |v_#valid_BEFORE_CALL_7| .cse20)))))))) (and .cse14 (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4| Int) (v_DerPreprocessor_6 Int)) (let ((.cse21 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4|))) (and (= (select |v_#valid_BEFORE_CALL_6| v_DerPreprocessor_6) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse21) 0) (not (= |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4|)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4|) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse21) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse22 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse22 (select |v_#valid_BEFORE_CALL_7| .cse22)))))))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1))) is different from true [2025-01-09 02:48:13,094 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:48:13,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1256 treesize of output 1132 [2025-01-09 02:48:13,409 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:48:13,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1064 treesize of output 908