./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 277634da297b7f9e262585608ed7ad62cca7d59b0122d4e61ee1b4b78256acae --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 13:41:27,245 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 13:41:27,300 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-06 13:41:27,304 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 13:41:27,305 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 13:41:27,319 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 13:41:27,319 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 13:41:27,319 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 13:41:27,320 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 13:41:27,320 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 13:41:27,320 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 13:41:27,320 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 13:41:27,320 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 13:41:27,320 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 13:41:27,320 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 13:41:27,321 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 13:41:27,321 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 13:41:27,322 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 13:41:27,322 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 13:41:27,322 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 13:41:27,322 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 13:41:27,322 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 13:41:27,322 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 13:41:27,322 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 13:41:27,322 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 13:41:27,322 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 13:41:27,322 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 13:41:27,322 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 13:41:27,322 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 13:41:27,322 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 13:41:27,322 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 13:41:27,322 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 13:41:27,322 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 13:41:27,322 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 13:41:27,322 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:41:27,323 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 13:41:27,323 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 13:41:27,323 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 13:41:27,323 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 13:41:27,323 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 13:41:27,323 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 13:41:27,323 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 13:41:27,323 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 13:41:27,323 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 13:41:27,323 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 13:41:27,323 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 ! overflow) ) 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 -> 277634da297b7f9e262585608ed7ad62cca7d59b0122d4e61ee1b4b78256acae [2025-02-06 13:41:27,551 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 13:41:27,560 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 13:41:27,562 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 13:41:27,563 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 13:41:27,563 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 13:41:27,564 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i [2025-02-06 13:41:28,732 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3ed843017/00495a1e89af464daa2affafda708429/FLAGa79a73ab6 [2025-02-06 13:41:29,070 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 13:41:29,070 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i [2025-02-06 13:41:29,079 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3ed843017/00495a1e89af464daa2affafda708429/FLAGa79a73ab6 [2025-02-06 13:41:29,324 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3ed843017/00495a1e89af464daa2affafda708429 [2025-02-06 13:41:29,326 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 13:41:29,327 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 13:41:29,328 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 13:41:29,328 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 13:41:29,331 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 13:41:29,331 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:41:29" (1/1) ... [2025-02-06 13:41:29,332 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51ea392a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:41:29, skipping insertion in model container [2025-02-06 13:41:29,332 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:41:29" (1/1) ... [2025-02-06 13:41:29,353 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 13:41:29,576 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:41:29,586 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 13:41:29,624 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:41:29,641 INFO L204 MainTranslator]: Completed translation [2025-02-06 13:41:29,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:41:29 WrapperNode [2025-02-06 13:41:29,643 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 13:41:29,643 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 13:41:29,644 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 13:41:29,644 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 13:41:29,648 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:41:29" (1/1) ... [2025-02-06 13:41:29,658 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:41:29" (1/1) ... [2025-02-06 13:41:29,676 INFO L138 Inliner]: procedures = 127, calls = 33, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 113 [2025-02-06 13:41:29,678 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 13:41:29,679 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 13:41:29,679 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 13:41:29,679 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 13:41:29,684 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:41:29" (1/1) ... [2025-02-06 13:41:29,685 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:41:29" (1/1) ... [2025-02-06 13:41:29,687 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:41:29" (1/1) ... [2025-02-06 13:41:29,700 INFO L175 MemorySlicer]: Split 16 memory accesses to 3 slices as follows [2, 5, 9]. 56 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 5 writes are split as follows [0, 1, 4]. [2025-02-06 13:41:29,700 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:41:29" (1/1) ... [2025-02-06 13:41:29,700 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:41:29" (1/1) ... [2025-02-06 13:41:29,705 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:41:29" (1/1) ... [2025-02-06 13:41:29,706 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:41:29" (1/1) ... [2025-02-06 13:41:29,707 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:41:29" (1/1) ... [2025-02-06 13:41:29,708 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:41:29" (1/1) ... [2025-02-06 13:41:29,709 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 13:41:29,710 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 13:41:29,710 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 13:41:29,710 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 13:41:29,710 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:41:29" (1/1) ... [2025-02-06 13:41:29,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:41:29,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:41:29,737 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 13:41:29,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 13:41:29,758 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 13:41:29,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 13:41:29,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 13:41:29,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 13:41:29,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 13:41:29,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 13:41:29,759 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-02-06 13:41:29,759 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-02-06 13:41:29,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 13:41:29,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 13:41:29,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 13:41:29,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 13:41:29,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 13:41:29,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 13:41:29,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 13:41:29,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 13:41:29,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 13:41:29,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 13:41:29,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-06 13:41:29,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-06 13:41:29,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-06 13:41:29,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 13:41:29,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 13:41:29,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 13:41:29,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 13:41:29,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 13:41:29,857 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 13:41:29,858 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 13:41:30,034 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L607: call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; [2025-02-06 13:41:30,054 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint myexit_returnLabel#1: havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2025-02-06 13:41:30,075 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2025-02-06 13:41:30,076 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 13:41:30,083 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 13:41:30,085 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 13:41:30,086 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:41:30 BoogieIcfgContainer [2025-02-06 13:41:30,086 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 13:41:30,088 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 13:41:30,089 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 13:41:30,092 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 13:41:30,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:41:29" (1/3) ... [2025-02-06 13:41:30,094 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a02511f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:41:30, skipping insertion in model container [2025-02-06 13:41:30,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:41:29" (2/3) ... [2025-02-06 13:41:30,094 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a02511f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:41:30, skipping insertion in model container [2025-02-06 13:41:30,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:41:30" (3/3) ... [2025-02-06 13:41:30,096 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2n_prepend_unequal.i [2025-02-06 13:41:30,110 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 13:41:30,112 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2n_prepend_unequal.i that has 2 procedures, 39 locations, 1 initial locations, 3 loop locations, and 6 error locations. [2025-02-06 13:41:30,158 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 13:41:30,168 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;@137f462, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 13:41:30,168 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-06 13:41:30,173 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 35 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 13:41:30,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-06 13:41:30,178 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:41:30,179 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:41:30,179 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:41:30,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:41:30,183 INFO L85 PathProgramCache]: Analyzing trace with hash -40661397, now seen corresponding path program 1 times [2025-02-06 13:41:30,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:41:30,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927368478] [2025-02-06 13:41:30,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:41:30,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:41:30,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 13:41:30,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 13:41:30,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:41:30,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:41:30,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:41:30,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:41:30,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927368478] [2025-02-06 13:41:30,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927368478] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:41:30,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:41:30,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:41:30,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349689723] [2025-02-06 13:41:30,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:41:30,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:41:30,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:41:30,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:41:30,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:41:30,486 INFO L87 Difference]: Start difference. First operand has 39 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 35 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 13:41:30,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:41:30,529 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2025-02-06 13:41:30,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:41:30,531 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2025-02-06 13:41:30,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:41:30,535 INFO L225 Difference]: With dead ends: 75 [2025-02-06 13:41:30,535 INFO L226 Difference]: Without dead ends: 34 [2025-02-06 13:41:30,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:41:30,539 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 1 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:41:30,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 113 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:41:30,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-02-06 13:41:30,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-02-06 13:41:30,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 29 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 13:41:30,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2025-02-06 13:41:30,566 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 11 [2025-02-06 13:41:30,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:41:30,567 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2025-02-06 13:41:30,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 13:41:30,567 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2025-02-06 13:41:30,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-06 13:41:30,568 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:41:30,568 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-02-06 13:41:30,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 13:41:30,569 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:41:30,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:41:30,570 INFO L85 PathProgramCache]: Analyzing trace with hash 383842667, now seen corresponding path program 1 times [2025-02-06 13:41:30,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:41:30,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251472263] [2025-02-06 13:41:30,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:41:30,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:41:30,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 13:41:30,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 13:41:30,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:41:30,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:41:30,691 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 13:41:30,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:41:30,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251472263] [2025-02-06 13:41:30,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251472263] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:41:30,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:41:30,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:41:30,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977673499] [2025-02-06 13:41:30,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:41:30,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:41:30,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:41:30,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:41:30,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:41:30,693 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 13:41:30,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:41:30,720 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2025-02-06 13:41:30,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:41:30,721 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 21 [2025-02-06 13:41:30,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:41:30,722 INFO L225 Difference]: With dead ends: 34 [2025-02-06 13:41:30,722 INFO L226 Difference]: Without dead ends: 33 [2025-02-06 13:41:30,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:41:30,722 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 1 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:41:30,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 69 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:41:30,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-02-06 13:41:30,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-02-06 13:41:30,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 24 states have (on average 1.25) internal successors, (30), 28 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 13:41:30,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2025-02-06 13:41:30,729 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 21 [2025-02-06 13:41:30,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:41:30,730 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2025-02-06 13:41:30,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 13:41:30,730 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2025-02-06 13:41:30,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-06 13:41:30,731 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:41:30,731 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2025-02-06 13:41:30,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 13:41:30,731 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:41:30,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:41:30,735 INFO L85 PathProgramCache]: Analyzing trace with hash -985779199, now seen corresponding path program 1 times [2025-02-06 13:41:30,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:41:30,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853825224] [2025-02-06 13:41:30,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:41:30,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:41:30,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 13:41:30,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 13:41:30,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:41:30,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:41:30,894 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 13:41:30,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:41:30,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853825224] [2025-02-06 13:41:30,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853825224] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:41:30,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702207559] [2025-02-06 13:41:30,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:41:30,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:41:30,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:41:30,897 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:41:30,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 13:41:30,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 13:41:31,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 13:41:31,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:41:31,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:41:31,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 13:41:31,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:41:31,091 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 13:41:31,091 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:41:31,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1702207559] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:41:31,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 13:41:31,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-02-06 13:41:31,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553099684] [2025-02-06 13:41:31,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:41:31,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 13:41:31,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:41:31,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 13:41:31,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 13:41:31,093 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 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-02-06 13:41:31,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:41:31,127 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2025-02-06 13:41:31,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:41:31,129 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 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-02-06 13:41:31,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:41:31,130 INFO L225 Difference]: With dead ends: 33 [2025-02-06 13:41:31,130 INFO L226 Difference]: Without dead ends: 32 [2025-02-06 13:41:31,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 13:41:31,130 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:41:31,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:41:31,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-02-06 13:41:31,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2025-02-06 13:41:31,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 24 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 13:41:31,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2025-02-06 13:41:31,136 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 22 [2025-02-06 13:41:31,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:41:31,136 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2025-02-06 13:41:31,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 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-02-06 13:41:31,136 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2025-02-06 13:41:31,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-06 13:41:31,136 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:41:31,136 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:41:31,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 13:41:31,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:41:31,337 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:41:31,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:41:31,338 INFO L85 PathProgramCache]: Analyzing trace with hash -795792257, now seen corresponding path program 1 times [2025-02-06 13:41:31,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:41:31,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436823219] [2025-02-06 13:41:31,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:41:31,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:41:31,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 13:41:31,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 13:41:31,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:41:31,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:41:31,464 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 13:41:31,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:41:31,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436823219] [2025-02-06 13:41:31,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436823219] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:41:31,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252691350] [2025-02-06 13:41:31,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:41:31,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:41:31,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:41:31,466 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:41:31,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 13:41:31,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 13:41:31,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 13:41:31,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:41:31,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:41:31,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 13:41:31,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:41:31,584 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 13:41:31,585 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:41:31,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252691350] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:41:31,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 13:41:31,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-02-06 13:41:31,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410719312] [2025-02-06 13:41:31,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:41:31,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:41:31,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:41:31,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:41:31,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 13:41:31,586 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 13:41:31,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:41:31,591 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2025-02-06 13:41:31,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:41:31,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2025-02-06 13:41:31,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:41:31,592 INFO L225 Difference]: With dead ends: 28 [2025-02-06 13:41:31,592 INFO L226 Difference]: Without dead ends: 27 [2025-02-06 13:41:31,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 13:41:31,592 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 7 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:41:31,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 33 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:41:31,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-02-06 13:41:31,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-02-06 13:41:31,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 13:41:31,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2025-02-06 13:41:31,595 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 25 [2025-02-06 13:41:31,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:41:31,596 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2025-02-06 13:41:31,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 13:41:31,596 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2025-02-06 13:41:31,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-06 13:41:31,596 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:41:31,596 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:41:31,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 13:41:31,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:41:31,799 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:41:31,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:41:31,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1100243150, now seen corresponding path program 1 times [2025-02-06 13:41:31,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:41:31,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883791906] [2025-02-06 13:41:31,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:41:31,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:41:31,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 13:41:31,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 13:41:31,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:41:31,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:41:31,906 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 13:41:31,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:41:31,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883791906] [2025-02-06 13:41:31,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883791906] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:41:31,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337354348] [2025-02-06 13:41:31,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:41:31,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:41:31,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:41:31,910 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:41:31,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 13:41:31,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 13:41:32,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 13:41:32,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:41:32,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:41:32,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 13:41:32,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:41:32,055 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:41:32,055 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:41:32,114 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 13:41:32,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [337354348] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:41:32,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:41:32,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-02-06 13:41:32,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666708869] [2025-02-06 13:41:32,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:41:32,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 13:41:32,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:41:32,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 13:41:32,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 13:41:32,115 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 13:41:32,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:41:32,150 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2025-02-06 13:41:32,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:41:32,151 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2025-02-06 13:41:32,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:41:32,151 INFO L225 Difference]: With dead ends: 51 [2025-02-06 13:41:32,151 INFO L226 Difference]: Without dead ends: 32 [2025-02-06 13:41:32,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 13:41:32,152 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:41:32,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 108 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:41:32,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-02-06 13:41:32,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-02-06 13:41:32,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.16) internal successors, (29), 27 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 13:41:32,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2025-02-06 13:41:32,159 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 26 [2025-02-06 13:41:32,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:41:32,161 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2025-02-06 13:41:32,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 13:41:32,161 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2025-02-06 13:41:32,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-06 13:41:32,161 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:41:32,161 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:41:32,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 13:41:32,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:41:32,362 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:41:32,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:41:32,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1134324274, now seen corresponding path program 2 times [2025-02-06 13:41:32,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:41:32,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202335515] [2025-02-06 13:41:32,363 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:41:32,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:41:32,380 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-02-06 13:41:32,382 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 36 statements. [2025-02-06 13:41:32,382 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 13:41:32,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:41:32,418 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 13:41:32,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:41:32,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202335515] [2025-02-06 13:41:32,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202335515] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:41:32,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:41:32,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:41:32,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823632440] [2025-02-06 13:41:32,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:41:32,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:41:32,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:41:32,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:41:32,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:41:32,420 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 13:41:32,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:41:32,439 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2025-02-06 13:41:32,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:41:32,440 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2025-02-06 13:41:32,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:41:32,441 INFO L225 Difference]: With dead ends: 41 [2025-02-06 13:41:32,441 INFO L226 Difference]: Without dead ends: 39 [2025-02-06 13:41:32,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:41:32,442 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 4 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:41:32,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 70 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:41:32,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-02-06 13:41:32,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2025-02-06 13:41:32,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 31 states have internal predecessors, (34), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 13:41:32,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2025-02-06 13:41:32,449 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 36 [2025-02-06 13:41:32,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:41:32,450 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2025-02-06 13:41:32,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 13:41:32,450 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2025-02-06 13:41:32,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-06 13:41:32,450 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:41:32,451 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:41:32,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 13:41:32,451 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:41:32,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:41:32,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1134323629, now seen corresponding path program 1 times [2025-02-06 13:41:32,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:41:32,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36025420] [2025-02-06 13:41:32,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:41:32,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:41:32,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-06 13:41:32,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-06 13:41:32,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:41:32,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:41:32,502 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 13:41:32,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:41:32,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36025420] [2025-02-06 13:41:32,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36025420] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:41:32,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:41:32,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:41:32,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921528778] [2025-02-06 13:41:32,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:41:32,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:41:32,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:41:32,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:41:32,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:41:32,504 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 13:41:32,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:41:32,508 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2025-02-06 13:41:32,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:41:32,508 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2025-02-06 13:41:32,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:41:32,509 INFO L225 Difference]: With dead ends: 36 [2025-02-06 13:41:32,509 INFO L226 Difference]: Without dead ends: 33 [2025-02-06 13:41:32,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:41:32,509 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:41:32,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 33 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:41:32,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-02-06 13:41:32,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-02-06 13:41:32,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 13:41:32,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2025-02-06 13:41:32,513 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 36 [2025-02-06 13:41:32,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:41:32,517 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2025-02-06 13:41:32,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 13:41:32,517 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2025-02-06 13:41:32,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-06 13:41:32,517 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:41:32,517 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:41:32,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 13:41:32,517 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:41:32,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:41:32,518 INFO L85 PathProgramCache]: Analyzing trace with hash 300117777, now seen corresponding path program 1 times [2025-02-06 13:41:32,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:41:32,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549638552] [2025-02-06 13:41:32,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:41:32,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:41:32,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-06 13:41:32,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 13:41:32,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:41:32,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:41:32,618 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 13:41:32,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:41:32,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549638552] [2025-02-06 13:41:32,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549638552] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:41:32,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886382533] [2025-02-06 13:41:32,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:41:32,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:41:32,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:41:32,621 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:41:32,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 13:41:32,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-06 13:41:32,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 13:41:32,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:41:32,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:41:32,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 13:41:32,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:41:32,769 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 13:41:32,769 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:41:32,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [886382533] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:41:32,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 13:41:32,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-02-06 13:41:32,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110458523] [2025-02-06 13:41:32,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:41:32,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 13:41:32,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:41:32,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 13:41:32,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 13:41:32,771 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 13:41:32,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:41:32,794 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2025-02-06 13:41:32,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:41:32,794 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 40 [2025-02-06 13:41:32,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:41:32,795 INFO L225 Difference]: With dead ends: 33 [2025-02-06 13:41:32,795 INFO L226 Difference]: Without dead ends: 32 [2025-02-06 13:41:32,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 13:41:32,795 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 1 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:41:32,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 59 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:41:32,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-02-06 13:41:32,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-02-06 13:41:32,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 13:41:32,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2025-02-06 13:41:32,802 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 40 [2025-02-06 13:41:32,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:41:32,803 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2025-02-06 13:41:32,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 13:41:32,803 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2025-02-06 13:41:32,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-06 13:41:32,804 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:41:32,804 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:41:32,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 13:41:33,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-02-06 13:41:33,005 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:41:33,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:41:33,005 INFO L85 PathProgramCache]: Analyzing trace with hash 713716485, now seen corresponding path program 1 times [2025-02-06 13:41:33,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:41:33,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478414639] [2025-02-06 13:41:33,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:41:33,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:41:33,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-06 13:41:33,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-06 13:41:33,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:41:33,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:41:33,108 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 13:41:33,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:41:33,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478414639] [2025-02-06 13:41:33,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478414639] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:41:33,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326989597] [2025-02-06 13:41:33,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:41:33,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:41:33,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:41:33,111 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:41:33,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 13:41:33,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-06 13:41:33,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-06 13:41:33,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:41:33,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:41:33,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 13:41:33,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:41:33,265 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 13:41:33,265 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:41:33,309 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 13:41:33,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326989597] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:41:33,309 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:41:33,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-02-06 13:41:33,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128325923] [2025-02-06 13:41:33,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:41:33,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 13:41:33,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:41:33,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 13:41:33,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-06 13:41:33,311 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 12 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 13:41:33,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:41:33,340 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2025-02-06 13:41:33,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 13:41:33,341 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 12 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 41 [2025-02-06 13:41:33,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:41:33,341 INFO L225 Difference]: With dead ends: 45 [2025-02-06 13:41:33,342 INFO L226 Difference]: Without dead ends: 44 [2025-02-06 13:41:33,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-06 13:41:33,342 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:41:33,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 173 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:41:33,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-02-06 13:41:33,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-02-06 13:41:33,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 39 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 13:41:33,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2025-02-06 13:41:33,366 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 41 [2025-02-06 13:41:33,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:41:33,366 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2025-02-06 13:41:33,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 12 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 13:41:33,367 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2025-02-06 13:41:33,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-06 13:41:33,367 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:41:33,367 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:41:33,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 13:41:33,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:41:33,568 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:41:33,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:41:33,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1313842852, now seen corresponding path program 2 times [2025-02-06 13:41:33,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:41:33,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570181838] [2025-02-06 13:41:33,568 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:41:33,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:41:33,583 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 53 statements into 2 equivalence classes. [2025-02-06 13:41:33,595 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-02-06 13:41:33,595 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:41:33,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:41:33,811 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 13:41:33,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:41:33,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570181838] [2025-02-06 13:41:33,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570181838] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:41:33,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68905253] [2025-02-06 13:41:33,812 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:41:33,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:41:33,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:41:33,813 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:41:33,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 13:41:33,914 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 53 statements into 2 equivalence classes. [2025-02-06 13:41:33,967 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-02-06 13:41:33,967 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:41:33,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:41:33,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 13:41:33,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:41:34,023 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 13:41:34,023 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:41:34,171 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 13:41:34,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68905253] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:41:34,171 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:41:34,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2025-02-06 13:41:34,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720744607] [2025-02-06 13:41:34,171 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:41:34,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-06 13:41:34,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:41:34,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-06 13:41:34,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-02-06 13:41:34,173 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand has 24 states, 23 states have (on average 2.652173913043478) internal successors, (61), 24 states have internal predecessors, (61), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 13:41:34,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:41:34,232 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2025-02-06 13:41:34,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-06 13:41:34,232 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.652173913043478) internal successors, (61), 24 states have internal predecessors, (61), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 53 [2025-02-06 13:41:34,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:41:34,233 INFO L225 Difference]: With dead ends: 69 [2025-02-06 13:41:34,233 INFO L226 Difference]: Without dead ends: 68 [2025-02-06 13:41:34,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-02-06 13:41:34,233 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:41:34,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 162 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:41:34,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-02-06 13:41:34,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-02-06 13:41:34,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 63 states have (on average 1.0317460317460319) internal successors, (65), 63 states have internal predecessors, (65), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 13:41:34,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2025-02-06 13:41:34,243 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 53 [2025-02-06 13:41:34,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:41:34,243 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2025-02-06 13:41:34,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.652173913043478) internal successors, (61), 24 states have internal predecessors, (61), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 13:41:34,244 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2025-02-06 13:41:34,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-06 13:41:34,246 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:41:34,246 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 10, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:41:34,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 13:41:34,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-06 13:41:34,447 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:41:34,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:41:34,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1769113226, now seen corresponding path program 3 times [2025-02-06 13:41:34,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:41:34,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038753135] [2025-02-06 13:41:34,447 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 13:41:34,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:41:34,468 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 77 statements into 11 equivalence classes. [2025-02-06 13:41:34,550 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 73 of 77 statements. [2025-02-06 13:41:34,550 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-02-06 13:41:34,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:41:37,162 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 84 proven. 21 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2025-02-06 13:41:37,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:41:37,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038753135] [2025-02-06 13:41:37,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038753135] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:41:37,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749604378] [2025-02-06 13:41:37,163 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 13:41:37,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:41:37,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:41:37,165 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:41:37,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 13:41:37,267 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 77 statements into 11 equivalence classes. [2025-02-06 13:41:37,987 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 73 of 77 statements. [2025-02-06 13:41:37,987 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-02-06 13:41:37,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:41:37,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 145 conjuncts are in the unsatisfiable core [2025-02-06 13:41:38,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:41:38,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 13:41:38,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 13:41:38,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 13:41:38,293 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-06 13:41:38,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-02-06 13:41:38,316 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-06 13:41:38,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-02-06 13:41:38,341 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-06 13:41:38,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-06 13:41:38,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-02-06 13:41:38,428 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 22 [2025-02-06 13:41:38,649 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-02-06 13:41:38,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 27 [2025-02-06 13:41:38,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 13:41:38,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-02-06 13:41:38,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 13:41:38,911 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-02-06 13:41:38,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 51 [2025-02-06 13:41:38,941 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2025-02-06 13:41:38,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 53 [2025-02-06 13:41:38,973 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-02-06 13:41:38,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2025-02-06 13:41:39,095 INFO L349 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2025-02-06 13:41:39,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 63 [2025-02-06 13:41:39,103 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 46 treesize of output 44 [2025-02-06 13:41:39,115 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 116 treesize of output 69 [2025-02-06 13:41:39,145 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2025-02-06 13:41:39,145 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 26 treesize of output 21 [2025-02-06 13:41:39,254 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 116 treesize of output 80 [2025-02-06 13:41:39,667 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2025-02-06 13:41:39,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 43 [2025-02-06 13:41:39,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2025-02-06 13:41:39,861 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 85 proven. 21 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2025-02-06 13:41:39,861 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:41:40,172 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 13:41:40,173 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 91 treesize of output 94 [2025-02-06 13:41:40,472 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 13:41:40,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 652 treesize of output 592 [2025-02-06 13:41:40,479 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 13:41:40,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 582 treesize of output 522 [2025-02-06 13:41:41,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1749604378] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:41:41,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 13:41:41,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 43 [2025-02-06 13:41:41,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672686035] [2025-02-06 13:41:41,556 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 13:41:41,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-02-06 13:41:41,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:41:41,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-02-06 13:41:41,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=2407, Unknown=0, NotChecked=0, Total=2550 [2025-02-06 13:41:41,558 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand has 43 states, 41 states have (on average 1.7073170731707317) internal successors, (70), 35 states have internal predecessors, (70), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 13:41:42,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:41:42,960 INFO L93 Difference]: Finished difference Result 130 states and 136 transitions. [2025-02-06 13:41:42,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-06 13:41:42,961 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 41 states have (on average 1.7073170731707317) internal successors, (70), 35 states have internal predecessors, (70), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 77 [2025-02-06 13:41:42,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:41:42,961 INFO L225 Difference]: With dead ends: 130 [2025-02-06 13:41:42,961 INFO L226 Difference]: Without dead ends: 75 [2025-02-06 13:41:42,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=219, Invalid=3563, Unknown=0, NotChecked=0, Total=3782 [2025-02-06 13:41:42,963 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 13 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 13:41:42,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 444 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 13:41:42,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-02-06 13:41:42,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2025-02-06 13:41:42,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 13:41:42,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2025-02-06 13:41:42,972 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 77 [2025-02-06 13:41:42,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:41:42,972 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2025-02-06 13:41:42,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 41 states have (on average 1.7073170731707317) internal successors, (70), 35 states have internal predecessors, (70), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 13:41:42,972 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2025-02-06 13:41:42,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-06 13:41:42,975 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:41:42,975 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 10, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:41:42,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-06 13:41:43,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:41:43,176 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:41:43,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:41:43,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1513697674, now seen corresponding path program 4 times [2025-02-06 13:41:43,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:41:43,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854954721] [2025-02-06 13:41:43,176 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 13:41:43,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:41:43,199 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 87 statements into 2 equivalence classes. [2025-02-06 13:41:43,266 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 58 of 87 statements. [2025-02-06 13:41:43,267 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 13:41:43,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:41:45,517 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 111 proven. 49 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-02-06 13:41:45,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:41:45,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854954721] [2025-02-06 13:41:45,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854954721] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:41:45,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140520752] [2025-02-06 13:41:45,518 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 13:41:45,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:41:45,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:41:45,519 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:41:45,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 13:41:45,618 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 87 statements into 2 equivalence classes. [2025-02-06 13:41:45,679 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 58 of 87 statements. [2025-02-06 13:41:45,679 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 13:41:45,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:41:45,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 160 conjuncts are in the unsatisfiable core [2025-02-06 13:41:45,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:41:45,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 13:41:45,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 13:41:45,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 13:41:45,930 WARN L851 $PredicateComparison]: unable to prove that (and (or (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_6| |c_#memory_$Pointer$#2.offset|))) (and (= (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_6| .cse0 (select |c_#memory_$Pointer$#2.offset| .cse0)) |c_#memory_$Pointer$#2.offset|) (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= .cse0 |c_ULTIMATE.start_sll_create_#t~ret4#1.base|)))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_#t~ret4#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)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1))) (or (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_6| |c_#memory_$Pointer$#2.base|))) (and (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_6| .cse2 (select |c_#memory_$Pointer$#2.base| .cse2)) |c_#memory_$Pointer$#2.base|) (= .cse2 |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0))))) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 1)) is different from false [2025-02-06 13:41:45,944 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_6| |c_#memory_$Pointer$#2.offset|))) (and (= (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_6| .cse0 (select |c_#memory_$Pointer$#2.offset| .cse0)) |c_#memory_$Pointer$#2.offset|) (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= .cse0 |c_ULTIMATE.start_sll_create_#t~ret4#1.base|)))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_#t~ret4#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)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1))) (or (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_6| |c_#memory_$Pointer$#2.base|))) (and (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_6| .cse2 (select |c_#memory_$Pointer$#2.base| .cse2)) |c_#memory_$Pointer$#2.base|) (= .cse2 |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0))))) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 1)) is different from true [2025-02-06 13:41:45,973 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2025-02-06 13:41:45,973 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 23 treesize of output 22 [2025-02-06 13:41:45,990 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2025-02-06 13:41:45,991 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 27 treesize of output 23 [2025-02-06 13:41:46,001 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (or (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0)) (exists ((|v_#memory_$Pointer$#2.offset_57| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$#2.offset_57| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$#2.offset_57| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4 0)) |c_#memory_$Pointer$#2.offset|) (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_6| |v_#memory_$Pointer$#2.offset_57|))) (and (= .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= |v_#memory_$Pointer$#2.offset_57| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_6| .cse1 (select |v_#memory_$Pointer$#2.offset_57| .cse1))) (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_6| .cse0) 4) 0))))))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (or (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0)) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1))) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from false [2025-02-06 13:41:46,004 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (or (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0)) (exists ((|v_#memory_$Pointer$#2.offset_57| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$#2.offset_57| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$#2.offset_57| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4 0)) |c_#memory_$Pointer$#2.offset|) (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_6| |v_#memory_$Pointer$#2.offset_57|))) (and (= .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= |v_#memory_$Pointer$#2.offset_57| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_6| .cse1 (select |v_#memory_$Pointer$#2.offset_57| .cse1))) (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_6| .cse0) 4) 0))))))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (or (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0)) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1))) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from true [2025-02-06 13:41:46,026 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (or (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0)) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_~head~0#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)))) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1))) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from false [2025-02-06 13:41:46,030 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (or (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0)) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_~head~0#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)))) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1))) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from true [2025-02-06 13:41:46,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 13:41:46,191 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2025-02-06 13:41:46,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 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 43 [2025-02-06 13:41:46,229 INFO L349 Elim1Store]: treesize reduction 32, result has 54.9 percent of original size [2025-02-06 13:41:46,230 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 3 case distinctions, treesize of input 27 treesize of output 49 [2025-02-06 13:41:46,266 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_21| |c_ULTIMATE.start_sll_create_#t~ret4#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_21| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_21| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_21|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_old(#valid)_AFTER_CALL_21| .cse1))) |v_old(#valid)_AFTER_CALL_21|))) (let ((.cse2 (or (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)))) (or (and (= .cse0 |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) .cse2) (and .cse2 (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0)))) (or (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from false [2025-02-06 13:41:46,268 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_21| |c_ULTIMATE.start_sll_create_#t~ret4#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_21| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_21| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_21|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_old(#valid)_AFTER_CALL_21| .cse1))) |v_old(#valid)_AFTER_CALL_21|))) (let ((.cse2 (or (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)))) (or (and (= .cse0 |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) .cse2) (and .cse2 (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0)))) (or (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from true [2025-02-06 13:41:46,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 13:41:46,296 INFO L349 Elim1Store]: treesize reduction 45, result has 13.5 percent of original size [2025-02-06 13:41:46,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 151 treesize of output 101 [2025-02-06 13:41:46,327 INFO L349 Elim1Store]: treesize reduction 64, result has 57.6 percent of original size [2025-02-06 13:41:46,327 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 3 case distinctions, treesize of input 93 treesize of output 141 [2025-02-06 13:41:46,397 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse3))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_21| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_21| |c_ULTIMATE.start_sll_create_~head~0#1.base| 1)) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_21|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_old(#valid)_AFTER_CALL_21| .cse2))) |v_old(#valid)_AFTER_CALL_21|))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse3) 0) (or (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 4) 0) (= .cse0 .cse1)) (let ((.cse4 (or (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0)))) (or (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) .cse4) (and .cse4 (= |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse1)))))))) is different from false [2025-02-06 13:41:46,399 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse3))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_21| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_21| |c_ULTIMATE.start_sll_create_~head~0#1.base| 1)) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_21|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_old(#valid)_AFTER_CALL_21| .cse2))) |v_old(#valid)_AFTER_CALL_21|))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse3) 0) (or (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 4) 0) (= .cse0 .cse1)) (let ((.cse4 (or (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0)))) (or (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) .cse4) (and .cse4 (= |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse1)))))))) is different from true [2025-02-06 13:41:46,503 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_21| |c_ULTIMATE.start_sll_create_#res#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_21| |c_ULTIMATE.start_sll_create_#res#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 1) (= 0 (select |v_#valid_BEFORE_CALL_6| .cse0)) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_21|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_old(#valid)_AFTER_CALL_21| .cse2))) |v_old(#valid)_AFTER_CALL_21|))) (let ((.cse3 (or (= |c_ULTIMATE.start_sll_create_#res#1.base| .cse0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0)))) (or (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) .cse3) (and .cse3 (= .cse1 |c_ULTIMATE.start_sll_create_#res#1.base|)))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse4) 0) (or (= .cse1 .cse0) (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 4) 0)))))) is different from false [2025-02-06 13:41:46,505 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_21| |c_ULTIMATE.start_sll_create_#res#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_21| |c_ULTIMATE.start_sll_create_#res#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 1) (= 0 (select |v_#valid_BEFORE_CALL_6| .cse0)) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_21|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_old(#valid)_AFTER_CALL_21| .cse2))) |v_old(#valid)_AFTER_CALL_21|))) (let ((.cse3 (or (= |c_ULTIMATE.start_sll_create_#res#1.base| .cse0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0)))) (or (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) .cse3) (and .cse3 (= .cse1 |c_ULTIMATE.start_sll_create_#res#1.base|)))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse4) 0) (or (= .cse1 .cse0) (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 4) 0)))))) is different from true [2025-02-06 13:41:46,559 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse3) .cse4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_21| .cse0)) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_21|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_old(#valid)_AFTER_CALL_21| .cse1))) |v_old(#valid)_AFTER_CALL_21|) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_21| .cse3 1)) (= (select |v_old(#valid)_AFTER_CALL_21| .cse3) 0))) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) .cse4) 0) (or (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 4) 0) (= .cse2 .cse0)) (let ((.cse5 (or (= .cse3 .cse0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0)))) (or (and .cse5 (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0)) (and .cse5 (= .cse2 .cse3)))))))) is different from false [2025-02-06 13:41:46,561 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse3) .cse4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_21| .cse0)) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_21|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_old(#valid)_AFTER_CALL_21| .cse1))) |v_old(#valid)_AFTER_CALL_21|) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_21| .cse3 1)) (= (select |v_old(#valid)_AFTER_CALL_21| .cse3) 0))) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) .cse4) 0) (or (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 4) 0) (= .cse2 .cse0)) (let ((.cse5 (or (= .cse3 .cse0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0)))) (or (and .cse5 (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0)) (and .cse5 (= .cse2 .cse3)))))))) is different from true [2025-02-06 13:41:46,598 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2025-02-06 13:41:46,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 262 treesize of output 76 [2025-02-06 13:41:46,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 13:41:46,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 13:41:46,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 13:41:46,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 39 [2025-02-06 13:41:46,636 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2| Int) (v_arrayElimIndex_8 Int) (v_arrayElimIndex_9 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimIndex_9) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_8) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_9) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_21|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_old(#valid)_AFTER_CALL_21| .cse0))) |v_old(#valid)_AFTER_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_21| (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2|)) 0))) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2025-02-06 13:41:46,637 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2| Int) (v_arrayElimIndex_8 Int) (v_arrayElimIndex_9 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimIndex_9) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_8) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_9) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_21|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_old(#valid)_AFTER_CALL_21| .cse0))) |v_old(#valid)_AFTER_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_21| (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2|)) 0))) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2025-02-06 13:41:46,658 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2| Int) (v_arrayElimIndex_8 Int) (v_arrayElimIndex_9 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimIndex_9) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_8) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_9) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_21|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_old(#valid)_AFTER_CALL_21| .cse0))) |v_old(#valid)_AFTER_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_21| (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2|)) 0))) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2025-02-06 13:41:46,659 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2| Int) (v_arrayElimIndex_8 Int) (v_arrayElimIndex_9 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimIndex_9) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_8) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_9) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_21|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_old(#valid)_AFTER_CALL_21| .cse0))) |v_old(#valid)_AFTER_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_21| (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2|)) 0))) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2025-02-06 13:41:46,696 WARN L851 $PredicateComparison]: unable to prove that (and (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2| Int) (v_arrayElimIndex_8 Int) (v_arrayElimIndex_9 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimIndex_9) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_8) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_9) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_21|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_old(#valid)_AFTER_CALL_21| .cse0))) |v_old(#valid)_AFTER_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_21| (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2|)) 0)))) is different from false [2025-02-06 13:41:46,698 WARN L873 $PredicateComparison]: unable to prove that (and (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2| Int) (v_arrayElimIndex_8 Int) (v_arrayElimIndex_9 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimIndex_9) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_8) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_9) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_21|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_old(#valid)_AFTER_CALL_21| .cse0))) |v_old(#valid)_AFTER_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_21| (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2|)) 0)))) is different from true [2025-02-06 13:41:46,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 13:41:46,761 INFO L349 Elim1Store]: treesize reduction 64, result has 14.7 percent of original size [2025-02-06 13:41:46,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 270 treesize of output 171 [2025-02-06 13:41:46,825 INFO L349 Elim1Store]: treesize reduction 108, result has 64.5 percent of original size [2025-02-06 13:41:46,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 165 treesize of output 294 [2025-02-06 13:41:46,839 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-02-06 13:41:46,917 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-02-06 13:41:46,917 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 55 treesize of output 45 [2025-02-06 13:41:46,997 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 13:41:46,997 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 39 treesize of output 41 [2025-02-06 13:41:47,029 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-02-06 13:41:47,151 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse17 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) .cse17))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (and (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2| Int) (v_arrayElimIndex_8 Int) (v_arrayElimIndex_9 Int)) (and (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimIndex_8) 1) (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimIndex_9) 0) (= (select |v_old(#valid)_AFTER_CALL_23| (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2|)) 0) (= (select |v_old(#valid)_AFTER_CALL_23| v_arrayElimIndex_9) 1) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_11| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_11| .cse0 (select |v_old(#valid)_AFTER_CALL_23| .cse0))) |v_old(#valid)_AFTER_CALL_23|))) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select (store |v_old(#valid)_AFTER_CALL_21| .cse1 1) |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_21| .cse2)) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_21|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_old(#valid)_AFTER_CALL_21| .cse3))) |v_old(#valid)_AFTER_CALL_21|) (= (select |v_#valid_BEFORE_CALL_6| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_21| .cse1) 0))) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= (select (select |c_#memory_$Pointer$#2.base| .cse4) 4) 0) (= .cse4 .cse2)) (let ((.cse15 (select |c_#memory_$Pointer$#2.offset| .cse4))) (let ((.cse12 (select |c_#memory_$Pointer$#2.offset| .cse1)) (.cse14 (select |c_#memory_$Pointer$#2.offset| .cse2)) (.cse7 (= (select .cse15 4) 0)) (.cse16 (= .cse4 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|))) (let ((.cse8 (= .cse1 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (.cse10 (or .cse7 .cse16)) (.cse13 (= (select .cse14 .cse17) 0)) (.cse9 (= (select .cse12 .cse17) 0)) (.cse11 (= .cse1 .cse2)) (.cse6 (= .cse4 .cse1)) (.cse5 (= (select .cse14 4) 0))) (or (and (or (and .cse5 .cse6) (and .cse5 .cse7)) (or .cse8 .cse9)) (and (or (and .cse6 .cse9) (and .cse10 (not .cse11) .cse9 (not .cse6)) (and (or .cse8 (and (= (select .cse12 4) 0) .cse9)) .cse10)) (= .cse2 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (and .cse10 .cse13 .cse11) (and (or (and .cse13 (= .cse12 .cse14)) .cse9) (or (and .cse11 .cse6) .cse5) (or (= .cse15 .cse14) .cse16)))))))))) is different from false [2025-02-06 13:41:47,154 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse17 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) .cse17))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (and (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2| Int) (v_arrayElimIndex_8 Int) (v_arrayElimIndex_9 Int)) (and (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimIndex_8) 1) (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimIndex_9) 0) (= (select |v_old(#valid)_AFTER_CALL_23| (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2|)) 0) (= (select |v_old(#valid)_AFTER_CALL_23| v_arrayElimIndex_9) 1) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_11| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_11| .cse0 (select |v_old(#valid)_AFTER_CALL_23| .cse0))) |v_old(#valid)_AFTER_CALL_23|))) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select (store |v_old(#valid)_AFTER_CALL_21| .cse1 1) |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_21| .cse2)) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_21|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_old(#valid)_AFTER_CALL_21| .cse3))) |v_old(#valid)_AFTER_CALL_21|) (= (select |v_#valid_BEFORE_CALL_6| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_21| .cse1) 0))) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= (select (select |c_#memory_$Pointer$#2.base| .cse4) 4) 0) (= .cse4 .cse2)) (let ((.cse15 (select |c_#memory_$Pointer$#2.offset| .cse4))) (let ((.cse12 (select |c_#memory_$Pointer$#2.offset| .cse1)) (.cse14 (select |c_#memory_$Pointer$#2.offset| .cse2)) (.cse7 (= (select .cse15 4) 0)) (.cse16 (= .cse4 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|))) (let ((.cse8 (= .cse1 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (.cse10 (or .cse7 .cse16)) (.cse13 (= (select .cse14 .cse17) 0)) (.cse9 (= (select .cse12 .cse17) 0)) (.cse11 (= .cse1 .cse2)) (.cse6 (= .cse4 .cse1)) (.cse5 (= (select .cse14 4) 0))) (or (and (or (and .cse5 .cse6) (and .cse5 .cse7)) (or .cse8 .cse9)) (and (or (and .cse6 .cse9) (and .cse10 (not .cse11) .cse9 (not .cse6)) (and (or .cse8 (and (= (select .cse12 4) 0) .cse9)) .cse10)) (= .cse2 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (and .cse10 .cse13 .cse11) (and (or (and .cse13 (= .cse12 .cse14)) .cse9) (or (and .cse11 .cse6) .cse5) (or (= .cse15 .cse14) .cse16)))))))))) is different from true [2025-02-06 13:41:47,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 13:41:47,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 13:41:47,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 13:41:47,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 13:41:47,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 13:41:47,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 13:41:47,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 738 treesize of output 528 [2025-02-06 13:41:47,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 13:41:47,293 INFO L349 Elim1Store]: treesize reduction 136, result has 9.9 percent of original size [2025-02-06 13:41:47,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 860 treesize of output 401 [2025-02-06 13:41:47,331 INFO L349 Elim1Store]: treesize reduction 20, result has 58.3 percent of original size [2025-02-06 13:41:47,332 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 901 treesize of output 713 [2025-02-06 13:41:47,436 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 1328 treesize of output 1161 [2025-02-06 13:41:47,444 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 32 treesize of output 1 [2025-02-06 13:41:47,643 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse14 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse19 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse14) .cse19)) (.cse10 (+ 4 (select (select |c_#memory_$Pointer$#2.offset| .cse14) .cse19)))) (let ((.cse13 (select (select |c_#memory_$Pointer$#2.base| .cse1) .cse10))) (let ((.cse17 (select (select |c_#memory_$Pointer$#2.base| .cse13) 4))) (and (or (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimIndex_8 Int)) (and (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimIndex_8) 1) (exists ((v_arrayElimIndex_9 Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2| Int)) (and (not (= |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= (select |v_old(#valid)_AFTER_CALL_23| (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2|)) 0))) (= (select |v_old(#valid)_AFTER_CALL_23| v_arrayElimIndex_9) 1) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_11| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_11| .cse0 (select |v_old(#valid)_AFTER_CALL_23| .cse0))) |v_old(#valid)_AFTER_CALL_23|))) (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimIndex_9) 0))))) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimIndex_8 Int)) (and (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimIndex_8) 1) (exists ((v_arrayElimIndex_9 Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_23| v_arrayElimIndex_9) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_11| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_11| .cse2 (select |v_old(#valid)_AFTER_CALL_23| .cse2))) |v_old(#valid)_AFTER_CALL_23|))) (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimIndex_9) 0))))) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimIndex_8 Int)) (and (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimIndex_8) 1) (exists ((v_arrayElimIndex_9 Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_23| (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2|)) 0) (not (= |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2| |c_ULTIMATE.start_main_~#s~0#1.base|)))) (= (select |v_old(#valid)_AFTER_CALL_23| v_arrayElimIndex_9) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_11| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_11| .cse3 (select |v_old(#valid)_AFTER_CALL_23| .cse3))) |v_old(#valid)_AFTER_CALL_23|))) (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimIndex_9) 0)))))) (let ((.cse16 (select |c_#memory_$Pointer$#2.offset| .cse17))) (let ((.cse9 (select |c_#memory_$Pointer$#2.offset| .cse13)) (.cse15 (= .cse17 .cse14)) (.cse8 (= (select .cse16 4) 0))) (let ((.cse5 (= .cse14 .cse1)) (.cse12 (or .cse15 .cse8)) (.cse4 (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) .cse10) 0)) (.cse11 (= .cse13 .cse1)) (.cse6 (= .cse17 .cse1)) (.cse7 (= (select .cse9 4) 0))) (or (and (or .cse4 .cse5) (or (and .cse6 .cse7) (and .cse7 .cse8))) (and (= (select .cse9 .cse10) 0) .cse11 .cse12) (and (= .cse13 .cse14) (or (and .cse6 .cse4) (and .cse4 .cse12) (and .cse5 .cse12))) (and .cse4 (or (and .cse11 .cse6) .cse7) (or .cse15 (= .cse9 .cse16))))))) (or (= .cse13 .cse17) (= (select (select |c_#memory_$Pointer$#2.base| .cse17) 4) 0)) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse17) 1) (= (select (store |v_old(#valid)_AFTER_CALL_21| .cse1 1) .cse14) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse13) 1) (= (let ((.cse18 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_21|))) (store |v_#valid_BEFORE_CALL_6| .cse18 (select |v_old(#valid)_AFTER_CALL_21| .cse18))) |v_old(#valid)_AFTER_CALL_21|) (= 0 (select |v_old(#valid)_AFTER_CALL_21| .cse1)) (= (select |v_#valid_BEFORE_CALL_6| .cse13) 0)))))))) is different from false [2025-02-06 13:41:47,647 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse14 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse19 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse14) .cse19)) (.cse10 (+ 4 (select (select |c_#memory_$Pointer$#2.offset| .cse14) .cse19)))) (let ((.cse13 (select (select |c_#memory_$Pointer$#2.base| .cse1) .cse10))) (let ((.cse17 (select (select |c_#memory_$Pointer$#2.base| .cse13) 4))) (and (or (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimIndex_8 Int)) (and (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimIndex_8) 1) (exists ((v_arrayElimIndex_9 Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2| Int)) (and (not (= |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= (select |v_old(#valid)_AFTER_CALL_23| (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2|)) 0))) (= (select |v_old(#valid)_AFTER_CALL_23| v_arrayElimIndex_9) 1) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_11| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_11| .cse0 (select |v_old(#valid)_AFTER_CALL_23| .cse0))) |v_old(#valid)_AFTER_CALL_23|))) (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimIndex_9) 0))))) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimIndex_8 Int)) (and (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimIndex_8) 1) (exists ((v_arrayElimIndex_9 Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_23| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_23| v_arrayElimIndex_9) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_11| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_11| .cse2 (select |v_old(#valid)_AFTER_CALL_23| .cse2))) |v_old(#valid)_AFTER_CALL_23|))) (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimIndex_9) 0))))) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimIndex_8 Int)) (and (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimIndex_8) 1) (exists ((v_arrayElimIndex_9 Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_23| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_23| (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_2|)) 0) (not (= |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_2| |c_ULTIMATE.start_main_~#s~0#1.base|)))) (= (select |v_old(#valid)_AFTER_CALL_23| v_arrayElimIndex_9) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_11| |v_old(#valid)_AFTER_CALL_23|))) (store |v_#valid_BEFORE_CALL_11| .cse3 (select |v_old(#valid)_AFTER_CALL_23| .cse3))) |v_old(#valid)_AFTER_CALL_23|))) (= (select |v_#valid_BEFORE_CALL_11| v_arrayElimIndex_9) 0)))))) (let ((.cse16 (select |c_#memory_$Pointer$#2.offset| .cse17))) (let ((.cse9 (select |c_#memory_$Pointer$#2.offset| .cse13)) (.cse15 (= .cse17 .cse14)) (.cse8 (= (select .cse16 4) 0))) (let ((.cse5 (= .cse14 .cse1)) (.cse12 (or .cse15 .cse8)) (.cse4 (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) .cse10) 0)) (.cse11 (= .cse13 .cse1)) (.cse6 (= .cse17 .cse1)) (.cse7 (= (select .cse9 4) 0))) (or (and (or .cse4 .cse5) (or (and .cse6 .cse7) (and .cse7 .cse8))) (and (= (select .cse9 .cse10) 0) .cse11 .cse12) (and (= .cse13 .cse14) (or (and .cse6 .cse4) (and .cse4 .cse12) (and .cse5 .cse12))) (and .cse4 (or (and .cse11 .cse6) .cse7) (or .cse15 (= .cse9 .cse16))))))) (or (= .cse13 .cse17) (= (select (select |c_#memory_$Pointer$#2.base| .cse17) 4) 0)) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse17) 1) (= (select (store |v_old(#valid)_AFTER_CALL_21| .cse1 1) .cse14) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse13) 1) (= (let ((.cse18 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_21|))) (store |v_#valid_BEFORE_CALL_6| .cse18 (select |v_old(#valid)_AFTER_CALL_21| .cse18))) |v_old(#valid)_AFTER_CALL_21|) (= 0 (select |v_old(#valid)_AFTER_CALL_21| .cse1)) (= (select |v_#valid_BEFORE_CALL_6| .cse13) 0)))))))) is different from true [2025-02-06 13:41:47,724 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 13:41:47,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1561 treesize of output 1269 [2025-02-06 13:41:47,735 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 1237 treesize of output 949 [2025-02-06 13:41:47,908 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse15 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse15)) (.cse5 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse15) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) .cse5))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_21| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse1) 1) (= (select (store |v_old(#valid)_AFTER_CALL_21| .cse0 1) |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_21|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_old(#valid)_AFTER_CALL_21| .cse2))) |v_old(#valid)_AFTER_CALL_21|) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse3) 1))) (or (= (select (select |c_#memory_$Pointer$#2.base| .cse3) 4) 0) (= .cse3 .cse1)) (let ((.cse12 (select |c_#memory_$Pointer$#2.offset| .cse3))) (let ((.cse4 (select |c_#memory_$Pointer$#2.offset| .cse1)) (.cse13 (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse3)) (.cse14 (= (select .cse12 4) 0))) (let ((.cse6 (or .cse13 .cse14)) (.cse7 (= .cse0 .cse1)) (.cse10 (= .cse0 .cse3)) (.cse11 (= (select .cse4 4) 0)) (.cse8 (= .cse0 |c_ULTIMATE.start_main_~ptr~0#1.base|)) (.cse9 (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) .cse5) 0))) (or (and (= (select .cse4 .cse5) 0) .cse6 .cse7) (and (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1) (or (and .cse8 .cse6) (and .cse9 .cse6) (and .cse10 .cse9))) (and (or (and .cse10 .cse7) .cse11) .cse9 (or (= .cse12 .cse4) .cse13)) (and (or (and .cse10 .cse11) (and .cse11 .cse14)) (or .cse8 .cse9))))))))))) is different from false [2025-02-06 13:41:47,909 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse15 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse15)) (.cse5 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse15) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) .cse5))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_21| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse1) 1) (= (select (store |v_old(#valid)_AFTER_CALL_21| .cse0 1) |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_21|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_old(#valid)_AFTER_CALL_21| .cse2))) |v_old(#valid)_AFTER_CALL_21|) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse3) 1))) (or (= (select (select |c_#memory_$Pointer$#2.base| .cse3) 4) 0) (= .cse3 .cse1)) (let ((.cse12 (select |c_#memory_$Pointer$#2.offset| .cse3))) (let ((.cse4 (select |c_#memory_$Pointer$#2.offset| .cse1)) (.cse13 (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse3)) (.cse14 (= (select .cse12 4) 0))) (let ((.cse6 (or .cse13 .cse14)) (.cse7 (= .cse0 .cse1)) (.cse10 (= .cse0 .cse3)) (.cse11 (= (select .cse4 4) 0)) (.cse8 (= .cse0 |c_ULTIMATE.start_main_~ptr~0#1.base|)) (.cse9 (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) .cse5) 0))) (or (and (= (select .cse4 .cse5) 0) .cse6 .cse7) (and (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1) (or (and .cse8 .cse6) (and .cse9 .cse6) (and .cse10 .cse9))) (and (or (and .cse10 .cse7) .cse11) .cse9 (or (= .cse12 .cse4) .cse13)) (and (or (and .cse10 .cse11) (and .cse11 .cse14)) (or .cse8 .cse9))))))))))) is different from true [2025-02-06 13:41:48,160 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_39| Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_39| Int)) (let ((.cse6 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_39| 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse6))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse6)) (.cse3 (+ .cse5 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) .cse3))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4)) (.cse4 (select |c_#memory_$Pointer$#2.offset| .cse1))) (and (= 1 (select |v_#valid_BEFORE_CALL_6| .cse0)) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse2) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) .cse3) 0) (= .cse2 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= (select (store |v_old(#valid)_AFTER_CALL_21| .cse2 1) |v_ULTIMATE.start_main_~ptr~0#1.base_39|) 0) (= .cse4 (select |c_#memory_$Pointer$#2.offset| .cse0)) (= (select |v_old(#valid)_AFTER_CALL_21| .cse1) 1) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0) (= (select .cse4 4) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse5)))))))) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_21|))) (store |v_#valid_BEFORE_CALL_6| .cse7 (select |v_old(#valid)_AFTER_CALL_21| .cse7))) |v_old(#valid)_AFTER_CALL_21|))) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_21|))) (store |v_#valid_BEFORE_CALL_6| .cse8 (select |v_old(#valid)_AFTER_CALL_21| .cse8))) |v_old(#valid)_AFTER_CALL_21|) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_39| Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_39| Int)) (let ((.cse14 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_39| 4))) (let ((.cse13 (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse14))) (let ((.cse11 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse14)) (.cse12 (+ .cse13 4))) (let ((.cse10 (select (select |c_#memory_$Pointer$#2.base| .cse11) .cse12))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| .cse10) 4))) (and (= 1 (select |v_#valid_BEFORE_CALL_6| .cse9)) (= (select |v_#valid_BEFORE_CALL_6| .cse10) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse11) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse11) .cse12) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse9) 4) 0) (= .cse11 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= (select (store |v_old(#valid)_AFTER_CALL_21| .cse11 1) |v_ULTIMATE.start_main_~ptr~0#1.base_39|) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse10) 1) (= (select (select |c_#memory_$Pointer$#2.base| .cse9) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse10) 4) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse13))))))))))) is different from false [2025-02-06 13:41:48,166 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_39| Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_39| Int)) (let ((.cse6 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_39| 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse6))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse6)) (.cse3 (+ .cse5 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) .cse3))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4)) (.cse4 (select |c_#memory_$Pointer$#2.offset| .cse1))) (and (= 1 (select |v_#valid_BEFORE_CALL_6| .cse0)) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse2) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) .cse3) 0) (= .cse2 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= (select (store |v_old(#valid)_AFTER_CALL_21| .cse2 1) |v_ULTIMATE.start_main_~ptr~0#1.base_39|) 0) (= .cse4 (select |c_#memory_$Pointer$#2.offset| .cse0)) (= (select |v_old(#valid)_AFTER_CALL_21| .cse1) 1) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0) (= (select .cse4 4) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse5)))))))) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_21|))) (store |v_#valid_BEFORE_CALL_6| .cse7 (select |v_old(#valid)_AFTER_CALL_21| .cse7))) |v_old(#valid)_AFTER_CALL_21|))) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_21|))) (store |v_#valid_BEFORE_CALL_6| .cse8 (select |v_old(#valid)_AFTER_CALL_21| .cse8))) |v_old(#valid)_AFTER_CALL_21|) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_39| Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_39| Int)) (let ((.cse14 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_39| 4))) (let ((.cse13 (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse14))) (let ((.cse11 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse14)) (.cse12 (+ .cse13 4))) (let ((.cse10 (select (select |c_#memory_$Pointer$#2.base| .cse11) .cse12))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| .cse10) 4))) (and (= 1 (select |v_#valid_BEFORE_CALL_6| .cse9)) (= (select |v_#valid_BEFORE_CALL_6| .cse10) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse11) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse11) .cse12) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse9) 4) 0) (= .cse11 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= (select (store |v_old(#valid)_AFTER_CALL_21| .cse11 1) |v_ULTIMATE.start_main_~ptr~0#1.base_39|) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse10) 1) (= (select (select |c_#memory_$Pointer$#2.base| .cse9) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse10) 4) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse13))))))))))) is different from true [2025-02-06 13:41:48,256 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0))) (or (and (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_39| Int) (|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_39| Int)) (let ((.cse6 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_39| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse6)) (.cse3 (+ (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse6) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) .cse3))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4)) (.cse5 (select |c_#memory_$Pointer$#2.offset| .cse1))) (and (= 1 (select |v_#valid_BEFORE_CALL_6| .cse0)) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse2) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) .cse3) 0) (= |c_ULTIMATE.start_main_~temp~2#1.base| .cse1) (= (select (store |v_old(#valid)_AFTER_CALL_21| .cse2 1) |v_ULTIMATE.start_main_~ptr~0#1.base_39|) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_21|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |v_old(#valid)_AFTER_CALL_21| .cse4))) |v_old(#valid)_AFTER_CALL_21|) (= .cse5 (select |c_#memory_$Pointer$#2.offset| .cse0)) (= (select |v_old(#valid)_AFTER_CALL_21| .cse1) 1) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0) (= (select .cse5 4) 0))))))) .cse7) (and (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_39| Int) (|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_39| Int)) (let ((.cse13 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_39| 4))) (let ((.cse10 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse13)) (.cse11 (+ (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse13) 4))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| .cse10) .cse11))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| .cse9) 4))) (and (= 1 (select |v_#valid_BEFORE_CALL_6| .cse8)) (= (select |v_#valid_BEFORE_CALL_6| .cse9) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse10) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse10) .cse11) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse8) 4) 0) (= |c_ULTIMATE.start_main_~temp~2#1.base| .cse9) (= (select (store |v_old(#valid)_AFTER_CALL_21| .cse10 1) |v_ULTIMATE.start_main_~ptr~0#1.base_39|) 0) (= (let ((.cse12 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_21|))) (store |v_#valid_BEFORE_CALL_6| .cse12 (select |v_old(#valid)_AFTER_CALL_21| .cse12))) |v_old(#valid)_AFTER_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_21| .cse9) 1) (= (select (select |c_#memory_$Pointer$#2.base| .cse8) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse9) 4) 0))))))) .cse7))) is different from false [2025-02-06 13:41:48,258 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse7 (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0))) (or (and (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_39| Int) (|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_39| Int)) (let ((.cse6 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_39| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse6)) (.cse3 (+ (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse6) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) .cse3))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4)) (.cse5 (select |c_#memory_$Pointer$#2.offset| .cse1))) (and (= 1 (select |v_#valid_BEFORE_CALL_6| .cse0)) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse2) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) .cse3) 0) (= |c_ULTIMATE.start_main_~temp~2#1.base| .cse1) (= (select (store |v_old(#valid)_AFTER_CALL_21| .cse2 1) |v_ULTIMATE.start_main_~ptr~0#1.base_39|) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_21|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |v_old(#valid)_AFTER_CALL_21| .cse4))) |v_old(#valid)_AFTER_CALL_21|) (= .cse5 (select |c_#memory_$Pointer$#2.offset| .cse0)) (= (select |v_old(#valid)_AFTER_CALL_21| .cse1) 1) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0) (= (select .cse5 4) 0))))))) .cse7) (and (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_39| Int) (|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_39| Int)) (let ((.cse13 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_39| 4))) (let ((.cse10 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse13)) (.cse11 (+ (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse13) 4))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| .cse10) .cse11))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| .cse9) 4))) (and (= 1 (select |v_#valid_BEFORE_CALL_6| .cse8)) (= (select |v_#valid_BEFORE_CALL_6| .cse9) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse10) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse10) .cse11) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse8) 4) 0) (= |c_ULTIMATE.start_main_~temp~2#1.base| .cse9) (= (select (store |v_old(#valid)_AFTER_CALL_21| .cse10 1) |v_ULTIMATE.start_main_~ptr~0#1.base_39|) 0) (= (let ((.cse12 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_21|))) (store |v_#valid_BEFORE_CALL_6| .cse12 (select |v_old(#valid)_AFTER_CALL_21| .cse12))) |v_old(#valid)_AFTER_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_21| .cse9) 1) (= (select (select |c_#memory_$Pointer$#2.base| .cse8) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse9) 4) 0))))))) .cse7))) is different from true [2025-02-06 13:41:48,330 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0))) (or (and .cse0 (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_39| Int) (|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_39| Int)) (let ((.cse7 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_39| 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse7)) (.cse4 (+ (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse7) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) .cse4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4)) (.cse6 (select |c_#memory_$Pointer$#2.offset| .cse2))) (and (= 1 (select |v_#valid_BEFORE_CALL_6| .cse1)) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse3) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) .cse4) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2) (= (select (store |v_old(#valid)_AFTER_CALL_21| .cse3 1) |v_ULTIMATE.start_main_~ptr~0#1.base_39|) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_21|))) (store |v_#valid_BEFORE_CALL_6| .cse5 (select |v_old(#valid)_AFTER_CALL_21| .cse5))) |v_old(#valid)_AFTER_CALL_21|) (= .cse6 (select |c_#memory_$Pointer$#2.offset| .cse1)) (= (select |v_old(#valid)_AFTER_CALL_21| .cse2) 1) (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 4) 0) (= (select .cse6 4) 0)))))))) (and .cse0 (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_39| Int) (|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_39| Int)) (let ((.cse13 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_39| 4))) (let ((.cse10 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse13)) (.cse11 (+ (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse13) 4))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| .cse10) .cse11))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| .cse9) 4))) (and (= 1 (select |v_#valid_BEFORE_CALL_6| .cse8)) (= (select |v_#valid_BEFORE_CALL_6| .cse9) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse10) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse10) .cse11) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse8) 4) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse9) (= (select (store |v_old(#valid)_AFTER_CALL_21| .cse10 1) |v_ULTIMATE.start_main_~ptr~0#1.base_39|) 0) (= (let ((.cse12 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_21|))) (store |v_#valid_BEFORE_CALL_6| .cse12 (select |v_old(#valid)_AFTER_CALL_21| .cse12))) |v_old(#valid)_AFTER_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_21| .cse9) 1) (= (select (select |c_#memory_$Pointer$#2.base| .cse8) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse9) 4) 0)))))))))) is different from false [2025-02-06 13:41:48,332 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0))) (or (and .cse0 (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_39| Int) (|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_39| Int)) (let ((.cse7 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_39| 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse7)) (.cse4 (+ (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse7) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) .cse4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4)) (.cse6 (select |c_#memory_$Pointer$#2.offset| .cse2))) (and (= 1 (select |v_#valid_BEFORE_CALL_6| .cse1)) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse3) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) .cse4) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2) (= (select (store |v_old(#valid)_AFTER_CALL_21| .cse3 1) |v_ULTIMATE.start_main_~ptr~0#1.base_39|) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_21|))) (store |v_#valid_BEFORE_CALL_6| .cse5 (select |v_old(#valid)_AFTER_CALL_21| .cse5))) |v_old(#valid)_AFTER_CALL_21|) (= .cse6 (select |c_#memory_$Pointer$#2.offset| .cse1)) (= (select |v_old(#valid)_AFTER_CALL_21| .cse2) 1) (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 4) 0) (= (select .cse6 4) 0)))))))) (and .cse0 (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_39| Int) (|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_39| Int)) (let ((.cse13 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_39| 4))) (let ((.cse10 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse13)) (.cse11 (+ (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse13) 4))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| .cse10) .cse11))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| .cse9) 4))) (and (= 1 (select |v_#valid_BEFORE_CALL_6| .cse8)) (= (select |v_#valid_BEFORE_CALL_6| .cse9) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse10) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse10) .cse11) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse8) 4) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse9) (= (select (store |v_old(#valid)_AFTER_CALL_21| .cse10 1) |v_ULTIMATE.start_main_~ptr~0#1.base_39|) 0) (= (let ((.cse12 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_21|))) (store |v_#valid_BEFORE_CALL_6| .cse12 (select |v_old(#valid)_AFTER_CALL_21| .cse12))) |v_old(#valid)_AFTER_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_21| .cse9) 1) (= (select (select |c_#memory_$Pointer$#2.base| .cse8) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse9) 4) 0)))))))))) is different from true [2025-02-06 13:41:48,621 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0))) (or (and (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_39| Int) (|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_39| Int)) (let ((.cse5 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_39| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse5)) (.cse3 (+ (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse5) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) .cse3))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (= 1 (select |v_#valid_BEFORE_CALL_6| .cse0)) (= |c_ULTIMATE.start_main_~temp~2#1.base| .cse0) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse2) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) .cse3) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select (store |v_old(#valid)_AFTER_CALL_21| .cse2 1) |v_ULTIMATE.start_main_~ptr~0#1.base_39|) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_21|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |v_old(#valid)_AFTER_CALL_21| .cse4))) |v_old(#valid)_AFTER_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_21| .cse1) 1) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0))))))) .cse6) (and (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_39| Int) (|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_39| Int)) (let ((.cse13 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_39| 4))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse13)) (.cse10 (+ (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse13) 4))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| .cse9) .cse10))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| .cse8) 4)) (.cse12 (select |c_#memory_$Pointer$#2.offset| .cse8))) (and (= 1 (select |v_#valid_BEFORE_CALL_6| .cse7)) (= |c_ULTIMATE.start_main_~temp~2#1.base| .cse7) (= (select |v_#valid_BEFORE_CALL_6| .cse8) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse9) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse9) .cse10) 0) (= (select (store |v_old(#valid)_AFTER_CALL_21| .cse9 1) |v_ULTIMATE.start_main_~ptr~0#1.base_39|) 0) (= (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_21|))) (store |v_#valid_BEFORE_CALL_6| .cse11 (select |v_old(#valid)_AFTER_CALL_21| .cse11))) |v_old(#valid)_AFTER_CALL_21|) (= .cse12 (select |c_#memory_$Pointer$#2.offset| .cse7)) (= (select |v_old(#valid)_AFTER_CALL_21| .cse8) 1) (= (select (select |c_#memory_$Pointer$#2.base| .cse7) 4) 0) (= (select .cse12 4) 0))))))) .cse6))) is different from false [2025-02-06 13:41:48,623 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse6 (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0))) (or (and (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_39| Int) (|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_39| Int)) (let ((.cse5 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_39| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse5)) (.cse3 (+ (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse5) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) .cse3))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (= 1 (select |v_#valid_BEFORE_CALL_6| .cse0)) (= |c_ULTIMATE.start_main_~temp~2#1.base| .cse0) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse2) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) .cse3) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select (store |v_old(#valid)_AFTER_CALL_21| .cse2 1) |v_ULTIMATE.start_main_~ptr~0#1.base_39|) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_21|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |v_old(#valid)_AFTER_CALL_21| .cse4))) |v_old(#valid)_AFTER_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_21| .cse1) 1) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0))))))) .cse6) (and (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_39| Int) (|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_39| Int)) (let ((.cse13 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_39| 4))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse13)) (.cse10 (+ (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse13) 4))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| .cse9) .cse10))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| .cse8) 4)) (.cse12 (select |c_#memory_$Pointer$#2.offset| .cse8))) (and (= 1 (select |v_#valid_BEFORE_CALL_6| .cse7)) (= |c_ULTIMATE.start_main_~temp~2#1.base| .cse7) (= (select |v_#valid_BEFORE_CALL_6| .cse8) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse9) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse9) .cse10) 0) (= (select (store |v_old(#valid)_AFTER_CALL_21| .cse9 1) |v_ULTIMATE.start_main_~ptr~0#1.base_39|) 0) (= (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_21|))) (store |v_#valid_BEFORE_CALL_6| .cse11 (select |v_old(#valid)_AFTER_CALL_21| .cse11))) |v_old(#valid)_AFTER_CALL_21|) (= .cse12 (select |c_#memory_$Pointer$#2.offset| .cse7)) (= (select |v_old(#valid)_AFTER_CALL_21| .cse8) 1) (= (select (select |c_#memory_$Pointer$#2.base| .cse7) 4) 0) (= (select .cse12 4) 0))))))) .cse6))) is different from true [2025-02-06 13:41:48,698 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0))) (or (and .cse0 (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_39| Int) (|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_39| Int)) (let ((.cse7 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_39| 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse7)) (.cse4 (+ (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse7) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) .cse4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4)) (.cse6 (select |c_#memory_$Pointer$#2.offset| .cse2))) (and (= 1 (select |v_#valid_BEFORE_CALL_6| .cse1)) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse3) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) .cse4) 0) (= (select (store |v_old(#valid)_AFTER_CALL_21| .cse3 1) |v_ULTIMATE.start_main_~ptr~0#1.base_39|) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_21|))) (store |v_#valid_BEFORE_CALL_6| .cse5 (select |v_old(#valid)_AFTER_CALL_21| .cse5))) |v_old(#valid)_AFTER_CALL_21|) (= .cse6 (select |c_#memory_$Pointer$#2.offset| .cse1)) (= (select |v_old(#valid)_AFTER_CALL_21| .cse2) 1) (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 4) 0) (= (select .cse6 4) 0)))))))) (and .cse0 (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_39| Int) (|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_39| Int)) (let ((.cse13 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_39| 4))) (let ((.cse10 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse13)) (.cse11 (+ (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse13) 4))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| .cse10) .cse11))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| .cse9) 4))) (and (= 1 (select |v_#valid_BEFORE_CALL_6| .cse8)) (= (select |v_#valid_BEFORE_CALL_6| .cse9) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse10) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse8) (= (select (select |c_#memory_$Pointer$#2.offset| .cse10) .cse11) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse8) 4) 0) (= (select (store |v_old(#valid)_AFTER_CALL_21| .cse10 1) |v_ULTIMATE.start_main_~ptr~0#1.base_39|) 0) (= (let ((.cse12 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_21|))) (store |v_#valid_BEFORE_CALL_6| .cse12 (select |v_old(#valid)_AFTER_CALL_21| .cse12))) |v_old(#valid)_AFTER_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_21| .cse9) 1) (= (select (select |c_#memory_$Pointer$#2.base| .cse8) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse9) 4) 0)))))))))) is different from false [2025-02-06 13:41:48,700 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0))) (or (and .cse0 (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_39| Int) (|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_39| Int)) (let ((.cse7 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_39| 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse7)) (.cse4 (+ (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse7) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) .cse4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4)) (.cse6 (select |c_#memory_$Pointer$#2.offset| .cse2))) (and (= 1 (select |v_#valid_BEFORE_CALL_6| .cse1)) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse3) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) .cse4) 0) (= (select (store |v_old(#valid)_AFTER_CALL_21| .cse3 1) |v_ULTIMATE.start_main_~ptr~0#1.base_39|) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_21|))) (store |v_#valid_BEFORE_CALL_6| .cse5 (select |v_old(#valid)_AFTER_CALL_21| .cse5))) |v_old(#valid)_AFTER_CALL_21|) (= .cse6 (select |c_#memory_$Pointer$#2.offset| .cse1)) (= (select |v_old(#valid)_AFTER_CALL_21| .cse2) 1) (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 4) 0) (= (select .cse6 4) 0)))))))) (and .cse0 (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_39| Int) (|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_39| Int)) (let ((.cse13 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_39| 4))) (let ((.cse10 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse13)) (.cse11 (+ (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_39|) .cse13) 4))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| .cse10) .cse11))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| .cse9) 4))) (and (= 1 (select |v_#valid_BEFORE_CALL_6| .cse8)) (= (select |v_#valid_BEFORE_CALL_6| .cse9) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse10) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse8) (= (select (select |c_#memory_$Pointer$#2.offset| .cse10) .cse11) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse8) 4) 0) (= (select (store |v_old(#valid)_AFTER_CALL_21| .cse10 1) |v_ULTIMATE.start_main_~ptr~0#1.base_39|) 0) (= (let ((.cse12 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_21|))) (store |v_#valid_BEFORE_CALL_6| .cse12 (select |v_old(#valid)_AFTER_CALL_21| .cse12))) |v_old(#valid)_AFTER_CALL_21|) (= (select |v_old(#valid)_AFTER_CALL_21| .cse9) 1) (= (select (select |c_#memory_$Pointer$#2.base| .cse8) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse9) 4) 0)))))))))) is different from true [2025-02-06 13:41:49,254 INFO L349 Elim1Store]: treesize reduction 84, result has 82.8 percent of original size [2025-02-06 13:41:49,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 15 new quantified variables, introduced 36 case distinctions, treesize of input 513 treesize of output 585 [2025-02-06 13:41:49,531 INFO L349 Elim1Store]: treesize reduction 56, result has 80.6 percent of original size [2025-02-06 13:41:49,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 407 treesize of output 591