./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/dll2n_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/dll2n_insert_equal.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 93d1510274ba16ddd1276e8e93ff0a644bf6fb4a262c4c9dde32fe8591d5ce8c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 02:48:05,211 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 02:48:05,272 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 02:48:05,276 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 02:48:05,278 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 02:48:05,303 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 02:48:05,305 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 02:48:05,305 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 02:48:05,305 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 02:48:05,305 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 02:48:05,306 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 02:48:05,306 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 02:48:05,306 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 02:48:05,306 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 02:48:05,307 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 02:48:05,307 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 02:48:05,307 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 02:48:05,307 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 02:48:05,307 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 02:48:05,307 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 02:48:05,308 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 02:48:05,308 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 02:48:05,308 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 02:48:05,308 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 02:48:05,308 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 02:48:05,308 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 02:48:05,308 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 02:48:05,308 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 02:48:05,308 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 02:48:05,308 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:48:05,309 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:48:05,309 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:48:05,309 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:48:05,309 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 02:48:05,309 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:48:05,309 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:48:05,309 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:48:05,309 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:48:05,309 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 02:48:05,309 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 02:48:05,309 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 02:48:05,310 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 02:48:05,310 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 02:48:05,310 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 02:48:05,310 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 02:48:05,310 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 02:48:05,310 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 02:48:05,310 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 02:48:05,310 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 93d1510274ba16ddd1276e8e93ff0a644bf6fb4a262c4c9dde32fe8591d5ce8c [2025-01-09 02:48:05,583 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 02:48:05,591 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 02:48:05,594 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 02:48:05,594 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 02:48:05,595 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 02:48:05,596 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_insert_equal.i [2025-01-09 02:48:07,017 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ec973a787/ab8bc579f4b34437b3e85d63f78ff0bc/FLAGf5526e111 [2025-01-09 02:48:07,305 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 02:48:07,305 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_insert_equal.i [2025-01-09 02:48:07,326 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ec973a787/ab8bc579f4b34437b3e85d63f78ff0bc/FLAGf5526e111 [2025-01-09 02:48:07,586 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ec973a787/ab8bc579f4b34437b3e85d63f78ff0bc [2025-01-09 02:48:07,587 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 02:48:07,593 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 02:48:07,594 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 02:48:07,594 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 02:48:07,597 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 02:48:07,598 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:48:07" (1/1) ... [2025-01-09 02:48:07,598 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fd1a89b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:07, skipping insertion in model container [2025-01-09 02:48:07,599 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:48:07" (1/1) ... [2025-01-09 02:48:07,618 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 02:48:07,796 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_insert_equal.i[24706,24719] [2025-01-09 02:48:07,798 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:48:07,808 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 02:48:07,855 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_insert_equal.i[24706,24719] [2025-01-09 02:48:07,859 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:48:07,889 INFO L204 MainTranslator]: Completed translation [2025-01-09 02:48:07,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:07 WrapperNode [2025-01-09 02:48:07,894 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 02:48:07,895 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 02:48:07,895 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 02:48:07,895 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 02:48:07,903 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:07" (1/1) ... [2025-01-09 02:48:07,921 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:07" (1/1) ... [2025-01-09 02:48:07,941 INFO L138 Inliner]: procedures = 127, calls = 44, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 126 [2025-01-09 02:48:07,941 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 02:48:07,942 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 02:48:07,942 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 02:48:07,942 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 02:48:07,952 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:07" (1/1) ... [2025-01-09 02:48:07,957 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:07" (1/1) ... [2025-01-09 02:48:07,959 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:07" (1/1) ... [2025-01-09 02:48:07,982 INFO L175 MemorySlicer]: Split 27 memory accesses to 3 slices as follows [2, 17, 8]. 63 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 14 writes are split as follows [0, 13, 1]. [2025-01-09 02:48:07,982 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:07" (1/1) ... [2025-01-09 02:48:07,982 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:07" (1/1) ... [2025-01-09 02:48:07,988 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:07" (1/1) ... [2025-01-09 02:48:07,989 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:07" (1/1) ... [2025-01-09 02:48:07,995 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:07" (1/1) ... [2025-01-09 02:48:07,996 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:07" (1/1) ... [2025-01-09 02:48:07,997 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:07" (1/1) ... [2025-01-09 02:48:08,002 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 02:48:08,003 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 02:48:08,003 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 02:48:08,004 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 02:48:08,004 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:07" (1/1) ... [2025-01-09 02:48:08,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:48:08,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:48:08,044 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 02:48:08,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 02:48:08,068 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2025-01-09 02:48:08,068 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2025-01-09 02:48:08,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 02:48:08,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 02:48:08,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 02:48:08,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 02:48:08,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 02:48:08,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 02:48:08,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 02:48:08,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 02:48:08,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 02:48:08,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 02:48:08,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 02:48:08,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 02:48:08,069 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 02:48:08,069 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 02:48:08,069 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 02:48:08,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 02:48:08,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 02:48:08,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 02:48:08,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 02:48:08,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 02:48:08,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 02:48:08,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 02:48:08,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 02:48:08,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 02:48:08,174 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 02:48:08,176 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 02:48:08,195 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2025-01-09 02:48:08,388 INFO L? ?]: Removed 56 outVars from TransFormulas that were not future-live. [2025-01-09 02:48:08,388 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 02:48:08,396 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 02:48:08,396 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 02:48:08,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:48:08 BoogieIcfgContainer [2025-01-09 02:48:08,397 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 02:48:08,398 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 02:48:08,398 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 02:48:08,401 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 02:48:08,401 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:48:07" (1/3) ... [2025-01-09 02:48:08,402 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eb32a3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:48:08, skipping insertion in model container [2025-01-09 02:48:08,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:07" (2/3) ... [2025-01-09 02:48:08,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eb32a3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:48:08, skipping insertion in model container [2025-01-09 02:48:08,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:48:08" (3/3) ... [2025-01-09 02:48:08,403 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2n_insert_equal.i [2025-01-09 02:48:08,416 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 02:48:08,417 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2n_insert_equal.i that has 2 procedures, 32 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-01-09 02:48:08,450 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 02:48:08,457 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;@221bc70d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 02:48:08,457 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 02:48:08,459 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 29 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:48:08,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-09 02:48:08,463 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:48:08,463 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:48:08,463 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:48:08,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:48:08,466 INFO L85 PathProgramCache]: Analyzing trace with hash 44296455, now seen corresponding path program 1 times [2025-01-09 02:48:08,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:48:08,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530404453] [2025-01-09 02:48:08,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:48:08,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:48:08,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 02:48:08,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 02:48:08,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:48:08,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:48:08,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:48:08,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:48:08,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530404453] [2025-01-09 02:48:08,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530404453] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:48:08,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:48:08,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 02:48:08,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202552807] [2025-01-09 02:48:08,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:48:08,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 02:48:08,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:48:08,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 02:48:08,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:48:08,789 INFO L87 Difference]: Start difference. First operand has 31 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 29 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:48:08,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:48:08,809 INFO L93 Difference]: Finished difference Result 60 states and 82 transitions. [2025-01-09 02:48:08,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 02:48:08,810 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-01-09 02:48:08,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:48:08,814 INFO L225 Difference]: With dead ends: 60 [2025-01-09 02:48:08,814 INFO L226 Difference]: Without dead ends: 27 [2025-01-09 02:48:08,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:48:08,817 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 6 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:48:08,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 75 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:48:08,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-01-09 02:48:08,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2025-01-09 02:48:08,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:48:08,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2025-01-09 02:48:08,836 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 14 [2025-01-09 02:48:08,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:48:08,836 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2025-01-09 02:48:08,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:48:08,837 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2025-01-09 02:48:08,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-09 02:48:08,837 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:48:08,837 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:48:08,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 02:48:08,837 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:48:08,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:48:08,838 INFO L85 PathProgramCache]: Analyzing trace with hash -982223726, now seen corresponding path program 1 times [2025-01-09 02:48:08,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:48:08,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285860539] [2025-01-09 02:48:08,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:48:08,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:48:08,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 02:48:08,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 02:48:08,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:48:08,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:48:08,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:48:08,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:48:08,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285860539] [2025-01-09 02:48:08,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285860539] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:48:08,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:48:08,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 02:48:08,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643495158] [2025-01-09 02:48:08,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:48:08,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 02:48:08,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:48:08,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 02:48:08,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:48:08,970 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:48:08,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:48:08,992 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2025-01-09 02:48:08,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 02:48:08,993 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-01-09 02:48:08,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:48:08,993 INFO L225 Difference]: With dead ends: 46 [2025-01-09 02:48:08,993 INFO L226 Difference]: Without dead ends: 26 [2025-01-09 02:48:08,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:48:08,994 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:48:08,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:48:08,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-01-09 02:48:08,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-01-09 02:48:08,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:48:08,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2025-01-09 02:48:08,998 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 19 [2025-01-09 02:48:08,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:48:08,998 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2025-01-09 02:48:08,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:48:08,999 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2025-01-09 02:48:08,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-09 02:48:08,999 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:48:08,999 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:48:08,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 02:48:08,999 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:48:09,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:48:09,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1993340976, now seen corresponding path program 1 times [2025-01-09 02:48:09,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:48:09,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652363215] [2025-01-09 02:48:09,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:48:09,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:48:09,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 02:48:09,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 02:48:09,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:48:09,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:48:09,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:48:09,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:48:09,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652363215] [2025-01-09 02:48:09,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652363215] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:48:09,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779022299] [2025-01-09 02:48:09,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:48:09,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:48:09,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:48:09,160 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:48:09,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 02:48:09,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 02:48:09,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 02:48:09,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:48:09,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:48:09,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 02:48:09,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:48:09,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:48:09,337 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:48:09,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:48:09,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1779022299] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:48:09,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:48:09,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-01-09 02:48:09,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528765460] [2025-01-09 02:48:09,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:48:09,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 02:48:09,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:48:09,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 02:48:09,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 02:48:09,362 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:48:09,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:48:09,378 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2025-01-09 02:48:09,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 02:48:09,378 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-01-09 02:48:09,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:48:09,380 INFO L225 Difference]: With dead ends: 43 [2025-01-09 02:48:09,380 INFO L226 Difference]: Without dead ends: 28 [2025-01-09 02:48:09,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 02:48:09,381 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 5 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:48:09,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 71 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:48:09,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-01-09 02:48:09,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-01-09 02:48:09,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:48:09,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2025-01-09 02:48:09,386 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 19 [2025-01-09 02:48:09,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:48:09,386 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2025-01-09 02:48:09,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:48:09,386 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2025-01-09 02:48:09,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 02:48:09,387 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:48:09,387 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:48:09,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 02:48:09,587 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-01-09 02:48:09,588 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:48:09,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:48:09,588 INFO L85 PathProgramCache]: Analyzing trace with hash -20370583, now seen corresponding path program 1 times [2025-01-09 02:48:09,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:48:09,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395787862] [2025-01-09 02:48:09,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:48:09,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:48:09,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 02:48:09,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 02:48:09,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:48:09,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:48:09,668 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 02:48:09,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:48:09,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395787862] [2025-01-09 02:48:09,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395787862] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:48:09,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:48:09,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 02:48:09,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056948621] [2025-01-09 02:48:09,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:48:09,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 02:48:09,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:48:09,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 02:48:09,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:48:09,669 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:48:09,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:48:09,683 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2025-01-09 02:48:09,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 02:48:09,684 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-01-09 02:48:09,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:48:09,685 INFO L225 Difference]: With dead ends: 37 [2025-01-09 02:48:09,685 INFO L226 Difference]: Without dead ends: 30 [2025-01-09 02:48:09,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:48:09,685 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:48:09,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:48:09,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-01-09 02:48:09,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-01-09 02:48:09,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:48:09,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2025-01-09 02:48:09,690 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 24 [2025-01-09 02:48:09,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:48:09,690 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2025-01-09 02:48:09,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:48:09,690 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2025-01-09 02:48:09,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-09 02:48:09,691 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:48:09,691 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-01-09 02:48:09,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 02:48:09,691 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:48:09,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:48:09,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1711375515, now seen corresponding path program 1 times [2025-01-09 02:48:09,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:48:09,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734287274] [2025-01-09 02:48:09,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:48:09,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:48:09,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 02:48:09,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 02:48:09,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:48:09,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:48:11,176 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:48:11,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:48:11,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734287274] [2025-01-09 02:48:11,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734287274] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:48:11,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182178460] [2025-01-09 02:48:11,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:48:11,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:48:11,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:48:11,180 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:48:11,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 02:48:11,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 02:48:11,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 02:48:11,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:48:11,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:48:11,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 92 conjuncts are in the unsatisfiable core [2025-01-09 02:48:11,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:48:11,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 02:48:11,715 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-09 02:48:11,716 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-01-09 02:48:11,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2025-01-09 02:48:11,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2025-01-09 02:48:11,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-01-09 02:48:11,892 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 02:48:11,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 50 [2025-01-09 02:48:11,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-01-09 02:48:12,100 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-01-09 02:48:12,101 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-01-09 02:48:12,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-01-09 02:48:12,199 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 48 treesize of output 31 [2025-01-09 02:48:12,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 19 [2025-01-09 02:48:12,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2025-01-09 02:48:12,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-01-09 02:48:12,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-01-09 02:48:12,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-01-09 02:48:12,520 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:48:12,521 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:48:16,302 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_477 Int) (v_ArrVal_470 (Array Int Int)) (v_ArrVal_471 (Array Int Int)) (v_ArrVal_475 (Array Int Int)) (v_ArrVal_478 (Array Int Int))) (= (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|) 4))) (store (store (store |c_#memory_int#1| .cse0 (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_471) .cse0) .cse1 v_ArrVal_477)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_475) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_470) .cse0) .cse1) v_ArrVal_478)) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2025-01-09 02:48:16,324 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 72 treesize of output 52 [2025-01-09 02:48:16,329 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 56 treesize of output 40 [2025-01-09 02:48:17,777 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 290 treesize of output 288 [2025-01-09 02:48:17,787 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:48:17,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 173 treesize of output 133 [2025-01-09 02:48:17,798 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:48:17,799 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 1 case distinctions, treesize of input 605 treesize of output 545 [2025-01-09 02:48:17,821 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 54 treesize of output 52 [2025-01-09 02:48:17,846 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 52 treesize of output 44 [2025-01-09 02:48:17,850 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 111 treesize of output 107 [2025-01-09 02:48:17,855 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 64 treesize of output 48 [2025-01-09 02:48:17,860 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 48 treesize of output 46 [2025-01-09 02:48:18,119 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:48:18,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1182178460] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:48:18,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:48:18,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 46 [2025-01-09 02:48:18,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136179452] [2025-01-09 02:48:18,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:48:18,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-01-09 02:48:18,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:48:18,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-01-09 02:48:18,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1761, Unknown=53, NotChecked=86, Total=2070 [2025-01-09 02:48:18,125 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 46 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 46 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:48:19,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:48:19,177 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2025-01-09 02:48:19,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 02:48:19,178 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 46 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-01-09 02:48:19,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:48:19,179 INFO L225 Difference]: With dead ends: 50 [2025-01-09 02:48:19,179 INFO L226 Difference]: Without dead ends: 48 [2025-01-09 02:48:19,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 732 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=272, Invalid=2435, Unknown=53, NotChecked=102, Total=2862 [2025-01-09 02:48:19,181 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 26 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 993 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 1055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 56 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 02:48:19,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 241 Invalid, 1055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 993 Invalid, 0 Unknown, 56 Unchecked, 0.8s Time] [2025-01-09 02:48:19,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-01-09 02:48:19,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 36. [2025-01-09 02:48:19,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 35 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:48:19,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2025-01-09 02:48:19,190 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 25 [2025-01-09 02:48:19,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:48:19,190 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2025-01-09 02:48:19,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 46 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:48:19,191 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2025-01-09 02:48:19,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-09 02:48:19,191 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:48:19,191 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-01-09 02:48:19,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 02:48:19,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:48:19,391 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:48:19,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:48:19,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1711382459, now seen corresponding path program 1 times [2025-01-09 02:48:19,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:48:19,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36095240] [2025-01-09 02:48:19,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:48:19,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:48:19,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 02:48:19,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 02:48:19,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:48:19,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:48:19,501 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 02:48:19,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:48:19,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36095240] [2025-01-09 02:48:19,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36095240] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:48:19,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:48:19,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 02:48:19,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27115841] [2025-01-09 02:48:19,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:48:19,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 02:48:19,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:48:19,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 02:48:19,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 02:48:19,503 INFO L87 Difference]: Start difference. First operand 36 states and 48 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:48:19,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:48:19,593 INFO L93 Difference]: Finished difference Result 71 states and 97 transitions. [2025-01-09 02:48:19,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 02:48:19,594 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-01-09 02:48:19,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:48:19,594 INFO L225 Difference]: With dead ends: 71 [2025-01-09 02:48:19,594 INFO L226 Difference]: Without dead ends: 43 [2025-01-09 02:48:19,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 02:48:19,595 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 16 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:48:19,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 108 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 02:48:19,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-01-09 02:48:19,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 38. [2025-01-09 02:48:19,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:48:19,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2025-01-09 02:48:19,597 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 48 transitions. Word has length 25 [2025-01-09 02:48:19,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:48:19,599 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 48 transitions. [2025-01-09 02:48:19,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:48:19,599 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2025-01-09 02:48:19,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-09 02:48:19,602 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:48:19,602 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-01-09 02:48:19,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 02:48:19,602 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:48:19,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:48:19,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1894329595, now seen corresponding path program 1 times [2025-01-09 02:48:19,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:48:19,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627741839] [2025-01-09 02:48:19,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:48:19,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:48:19,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 02:48:19,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 02:48:19,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:48:19,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:48:19,671 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 02:48:19,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:48:19,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627741839] [2025-01-09 02:48:19,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627741839] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:48:19,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:48:19,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 02:48:19,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457774598] [2025-01-09 02:48:19,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:48:19,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 02:48:19,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:48:19,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 02:48:19,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 02:48:19,672 INFO L87 Difference]: Start difference. First operand 38 states and 48 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:48:19,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:48:19,688 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2025-01-09 02:48:19,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 02:48:19,689 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-01-09 02:48:19,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:48:19,690 INFO L225 Difference]: With dead ends: 48 [2025-01-09 02:48:19,690 INFO L226 Difference]: Without dead ends: 39 [2025-01-09 02:48:19,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 02:48:19,690 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 20 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:48:19,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 49 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:48:19,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-01-09 02:48:19,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2025-01-09 02:48:19,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:48:19,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2025-01-09 02:48:19,695 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 25 [2025-01-09 02:48:19,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:48:19,695 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2025-01-09 02:48:19,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:48:19,696 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2025-01-09 02:48:19,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 02:48:19,696 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:48:19,696 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:48:19,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 02:48:19,697 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:48:19,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:48:19,697 INFO L85 PathProgramCache]: Analyzing trace with hash -439070295, now seen corresponding path program 2 times [2025-01-09 02:48:19,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:48:19,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893836642] [2025-01-09 02:48:19,697 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 02:48:19,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:48:19,712 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-01-09 02:48:19,722 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 02:48:19,722 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 02:48:19,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:48:19,793 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 02:48:19,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:48:19,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893836642] [2025-01-09 02:48:19,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893836642] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:48:19,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:48:19,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 02:48:19,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455986134] [2025-01-09 02:48:19,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:48:19,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 02:48:19,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:48:19,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 02:48:19,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 02:48:19,795 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:48:19,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:48:19,818 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2025-01-09 02:48:19,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 02:48:19,819 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-01-09 02:48:19,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:48:19,819 INFO L225 Difference]: With dead ends: 47 [2025-01-09 02:48:19,819 INFO L226 Difference]: Without dead ends: 34 [2025-01-09 02:48:19,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 02:48:19,819 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 19 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:48:19,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 51 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:48:19,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-01-09 02:48:19,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2025-01-09 02:48:19,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:48:19,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2025-01-09 02:48:19,822 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 26 [2025-01-09 02:48:19,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:48:19,822 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2025-01-09 02:48:19,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:48:19,822 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2025-01-09 02:48:19,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 02:48:19,822 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:48:19,822 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-01-09 02:48:19,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 02:48:19,822 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:48:19,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:48:19,822 INFO L85 PathProgramCache]: Analyzing trace with hash 250191891, now seen corresponding path program 1 times [2025-01-09 02:48:19,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:48:19,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163730436] [2025-01-09 02:48:19,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:48:19,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:48:19,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 02:48:19,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 02:48:19,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:48:19,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:48:19,907 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 02:48:19,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:48:19,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163730436] [2025-01-09 02:48:19,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163730436] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:48:19,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896740728] [2025-01-09 02:48:19,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:48:19,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:48:19,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:48:19,909 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:48:19,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 02:48:20,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 02:48:20,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 02:48:20,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:48:20,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:48:20,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 02:48:20,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:48:20,058 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 02:48:20,058 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:48:20,107 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 02:48:20,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896740728] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:48:20,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:48:20,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-01-09 02:48:20,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030583563] [2025-01-09 02:48:20,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:48:20,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 02:48:20,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:48:20,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 02:48:20,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 02:48:20,111 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:48:20,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:48:20,170 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2025-01-09 02:48:20,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 02:48:20,171 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-01-09 02:48:20,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:48:20,171 INFO L225 Difference]: With dead ends: 39 [2025-01-09 02:48:20,171 INFO L226 Difference]: Without dead ends: 32 [2025-01-09 02:48:20,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-01-09 02:48:20,172 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 2 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:48:20,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 99 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:48:20,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-01-09 02:48:20,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-01-09 02:48:20,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:48:20,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2025-01-09 02:48:20,175 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 26 [2025-01-09 02:48:20,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:48:20,175 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2025-01-09 02:48:20,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:48:20,175 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2025-01-09 02:48:20,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 02:48:20,177 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:48:20,177 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-01-09 02:48:20,183 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-01-09 02:48:20,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:48:20,378 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:48:20,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:48:20,379 INFO L85 PathProgramCache]: Analyzing trace with hash 307450193, now seen corresponding path program 1 times [2025-01-09 02:48:20,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:48:20,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598156368] [2025-01-09 02:48:20,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:48:20,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:48:20,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 02:48:20,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 02:48:20,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:48:20,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:48:20,525 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 02:48:20,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:48:20,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598156368] [2025-01-09 02:48:20,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598156368] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:48:20,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929161340] [2025-01-09 02:48:20,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:48:20,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:48:20,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:48:20,527 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-01-09 02:48:20,530 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-01-09 02:48:20,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 02:48:20,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 02:48:20,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:48:20,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:48:20,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 02:48:20,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:48:20,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-01-09 02:48:20,682 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 02:48:20,682 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:48:20,702 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 02:48:20,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [929161340] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:48:20,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:48:20,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 11 [2025-01-09 02:48:20,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558289530] [2025-01-09 02:48:20,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:48:20,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 02:48:20,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:48:20,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 02:48:20,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 02:48:20,703 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:48:20,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:48:20,793 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2025-01-09 02:48:20,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 02:48:20,794 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-01-09 02:48:20,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:48:20,794 INFO L225 Difference]: With dead ends: 37 [2025-01-09 02:48:20,794 INFO L226 Difference]: Without dead ends: 29 [2025-01-09 02:48:20,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-01-09 02:48:20,794 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 16 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:48:20,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 96 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 02:48:20,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-01-09 02:48:20,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-01-09 02:48:20,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:48:20,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2025-01-09 02:48:20,797 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 26 [2025-01-09 02:48:20,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:48:20,797 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2025-01-09 02:48:20,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:48:20,797 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2025-01-09 02:48:20,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-09 02:48:20,797 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:48:20,797 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:48:20,806 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-01-09 02:48:21,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,SelfDestructingSolverStorable9 [2025-01-09 02:48:21,004 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:48:21,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:48:21,005 INFO L85 PathProgramCache]: Analyzing trace with hash -340563658, now seen corresponding path program 1 times [2025-01-09 02:48:21,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:48:21,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32717342] [2025-01-09 02:48:21,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:48:21,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:48:21,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 02:48:21,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 02:48:21,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:48:21,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:48:22,270 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:48:22,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:48:22,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32717342] [2025-01-09 02:48:22,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32717342] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:48:22,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587872676] [2025-01-09 02:48:22,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:48:22,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:48:22,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:48:22,273 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-01-09 02:48:22,274 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-01-09 02:48:22,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 02:48:22,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 02:48:22,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:48:22,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:48:22,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 107 conjuncts are in the unsatisfiable core [2025-01-09 02:48:22,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:48:22,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 02:48:22,825 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-09 02:48:22,825 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-01-09 02:48:22,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2025-01-09 02:48:22,942 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 02:48:22,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-01-09 02:48:23,096 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-01-09 02:48:23,097 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-01-09 02:48:23,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 02:48:23,188 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 37 treesize of output 26 [2025-01-09 02:48:23,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:48:23,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 27 [2025-01-09 02:48:23,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 35 [2025-01-09 02:48:23,436 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2025-01-09 02:48:23,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 160 treesize of output 105 [2025-01-09 02:48:23,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2025-01-09 02:48:23,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2025-01-09 02:48:23,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 37 [2025-01-09 02:48:23,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 19 [2025-01-09 02:48:23,529 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 52 treesize of output 35 [2025-01-09 02:48:23,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2025-01-09 02:48:23,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-01-09 02:48:23,593 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 50 treesize of output 30 [2025-01-09 02:48:23,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-01-09 02:48:23,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-01-09 02:48:23,742 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:48:23,743 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:48:23,860 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1187 (Array Int Int)) (v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1186) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1185) .cse0) .cse1)) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1187) .cse0) .cse1))))) is different from false [2025-01-09 02:48:23,871 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:48:23,872 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 77 [2025-01-09 02:48:23,883 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:48:23,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 580 treesize of output 565 [2025-01-09 02:48:23,894 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 127 treesize of output 119 [2025-01-09 02:48:23,907 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 134 treesize of output 118 [2025-01-09 02:48:24,358 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse17 (= |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| .cse12))) (let ((.cse23 (not .cse17)) (.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) (+ |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset| 4) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) (.cse13 (+ .cse0 4)) (.cse8 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 8)) (.cse9 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 4))) (let ((.cse3 (or .cse23 (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_arrayElimCell_49 Int) (v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int)) (v_ArrVal_1184 (Array Int Int))) (let ((.cse33 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1184))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store .cse33 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1186) (select (select (store (store .cse11 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1181) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1185) .cse12) .cse13)) v_arrayElimCell_49)) (not (= (store (store (select .cse33 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse8 (select v_ArrVal_1177 .cse8)) .cse9 (select v_ArrVal_1177 .cse9)) v_ArrVal_1177))))))) (.cse1 (or (forall ((v_ArrVal_1181 (Array Int Int)) (v_arrayElimCell_50 Int) (v_arrayElimCell_47 Int) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int)) (v_ArrVal_1184 (Array Int Int))) (let ((.cse32 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1184))) (let ((.cse31 (select (store (store .cse32 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1186) (select (select (store (store .cse11 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1181) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1185) .cse12) .cse13)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse31 v_arrayElimCell_47)) (not (= (store (store (select .cse32 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse8 (select v_ArrVal_1177 .cse8)) .cse9 (select v_ArrVal_1177 .cse9)) v_ArrVal_1177)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse31 v_arrayElimCell_50)))))) .cse17)) (.cse6 (forall ((v_arrayElimCell_47 Int) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1184 (Array Int Int))) (let ((.cse29 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1184))) (or (not (= (store (store (select .cse29 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse8 (select v_ArrVal_1177 .cse8)) .cse9 (select v_ArrVal_1177 .cse9)) v_ArrVal_1177)) (forall ((v_ArrVal_1181 (Array Int Int)) (v_arrayElimCell_50 Int) (v_arrayElimCell_49 Int) (v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (let ((.cse30 (select (store (store .cse29 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1186) (select (select (store (store .cse11 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1181) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1185) .cse12) .cse13)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse30 v_arrayElimCell_49)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse30 v_arrayElimCell_47)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse30 v_arrayElimCell_50))))))))) (.cse2 (forall ((v_arrayElimCell_47 Int) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1184 (Array Int Int))) (let ((.cse28 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1184))) (or (forall ((v_ArrVal_1181 (Array Int Int)) (v_arrayElimCell_49 Int) (v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (let ((.cse27 (select (store (store .cse28 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1186) (select (select (store (store .cse11 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1181) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1185) .cse12) .cse13)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse27 v_arrayElimCell_49)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse27 v_arrayElimCell_47))))) (not (= (store (store (select .cse28 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse8 (select v_ArrVal_1177 .cse8)) .cse9 (select v_ArrVal_1177 .cse9)) v_ArrVal_1177)))))) (.cse4 (or (forall ((v_ArrVal_1181 (Array Int Int)) (v_arrayElimCell_47 Int) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int)) (v_ArrVal_1184 (Array Int Int))) (let ((.cse26 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1184))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store .cse26 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1186) (select (select (store (store .cse11 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1181) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1185) .cse12) .cse13)) v_arrayElimCell_47)) (not (= (store (store (select .cse26 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse8 (select v_ArrVal_1177 .cse8)) .cse9 (select v_ArrVal_1177 .cse9)) v_ArrVal_1177))))) .cse17)) (.cse5 (= |c_ULTIMATE.start_dll_insert_~last~0#1.base| .cse12))) (and (or (= .cse0 |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset|) (and .cse1 (or (and .cse2 .cse3 .cse4) .cse5) .cse6)) (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1184 (Array Int Int))) (let ((.cse7 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1184))) (or (not (= (store (store (select .cse7 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse8 (select v_ArrVal_1177 .cse8)) .cse9 (select v_ArrVal_1177 .cse9)) v_ArrVal_1177)) (forall ((v_ArrVal_1181 (Array Int Int)) (v_arrayElimCell_50 Int) (v_arrayElimCell_49 Int) (v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (let ((.cse10 (select (store (store .cse7 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1186) (select (select (store (store .cse11 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1181) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1185) .cse12) .cse13)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse10 v_arrayElimCell_49)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse10 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse10 v_arrayElimCell_50)))))))) (or (not .cse5) (forall ((v_ArrVal_1181 (Array Int Int)) (v_arrayElimCell_50 Int) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int)) (v_ArrVal_1184 (Array Int Int))) (let ((.cse14 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1184))) (or (not (= (store (store (select .cse14 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse8 (select v_ArrVal_1177 .cse8)) .cse9 (select v_ArrVal_1177 .cse9)) v_ArrVal_1177)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store .cse14 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1186) (select (select (store (store .cse11 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1181) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1185) .cse12) .cse13)) v_arrayElimCell_50)))))) (or (forall ((v_ArrVal_1181 (Array Int Int)) (v_arrayElimCell_50 Int) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int)) (v_ArrVal_1184 (Array Int Int))) (let ((.cse16 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1184))) (let ((.cse15 (select (store (store .cse16 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1186) (select (select (store (store .cse11 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1181) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1185) .cse12) .cse13)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse15 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) (not (= (store (store (select .cse16 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse8 (select v_ArrVal_1177 .cse8)) .cse9 (select v_ArrVal_1177 .cse9)) v_ArrVal_1177)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse15 v_arrayElimCell_50)))))) .cse17) (or (and (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1184 (Array Int Int))) (let ((.cse19 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1184))) (or (forall ((v_ArrVal_1181 (Array Int Int)) (v_arrayElimCell_49 Int) (v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (let ((.cse18 (select (store (store .cse19 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1186) (select (select (store (store .cse11 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1181) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1185) .cse12) .cse13)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse18 v_arrayElimCell_49)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|))))) (not (= (store (store (select .cse19 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse8 (select v_ArrVal_1177 .cse8)) .cse9 (select v_ArrVal_1177 .cse9)) v_ArrVal_1177))))) (or (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int)) (v_ArrVal_1184 (Array Int Int))) (let ((.cse20 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1184))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store .cse20 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1186) (select (select (store (store .cse11 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1181) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1185) .cse12) .cse13)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) (not (= (store (store (select .cse20 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse8 (select v_ArrVal_1177 .cse8)) .cse9 (select v_ArrVal_1177 .cse9)) v_ArrVal_1177))))) .cse17) .cse3) .cse5) (or (forall ((v_ArrVal_1181 (Array Int Int)) (v_arrayElimCell_50 Int) (v_ArrVal_1177 (Array Int Int)) (v_arrayElimCell_49 Int) (v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int)) (v_ArrVal_1184 (Array Int Int))) (let ((.cse22 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1184))) (let ((.cse21 (select (store (store .cse22 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1186) (select (select (store (store .cse11 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1181) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1185) .cse12) .cse13)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse21 v_arrayElimCell_49)) (not (= (store (store (select .cse22 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse8 (select v_ArrVal_1177 .cse8)) .cse9 (select v_ArrVal_1177 .cse9)) v_ArrVal_1177)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse21 v_arrayElimCell_50)))))) .cse23) (or (= |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| .cse12) (let ((.cse24 (select |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) (and (or .cse23 (forall ((v_ArrVal_1181 (Array Int Int)) (v_arrayElimCell_50 Int) (v_ArrVal_1177 (Array Int Int)) (v_arrayElimCell_49 Int) (v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int)) (v_ArrVal_1184 (Array Int Int))) (let ((.cse25 (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1184) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1186) (select (select (store (store .cse11 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1181) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1185) .cse12) .cse13)))) (or (not (= (store (store .cse24 .cse8 (select v_ArrVal_1177 .cse8)) .cse9 (select v_ArrVal_1177 .cse9)) v_ArrVal_1177)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse25 v_arrayElimCell_49)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse25 v_arrayElimCell_50)))))) .cse1 .cse6 (or (and .cse2 (or (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_arrayElimCell_49 Int) (v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int)) (v_ArrVal_1184 (Array Int Int))) (or (not (= (store (store .cse24 .cse8 (select v_ArrVal_1177 .cse8)) .cse9 (select v_ArrVal_1177 .cse9)) v_ArrVal_1177)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1184) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1186) (select (select (store (store .cse11 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1181) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1185) .cse12) .cse13)) v_arrayElimCell_49)))) .cse23) .cse4) .cse5))))))))) is different from false [2025-01-09 02:48:25,124 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse13 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse35 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base|)) (.cse36 (+ |c_ULTIMATE.start_dll_insert_~last~0#1.offset| 4)) (.cse15 (= |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| .cse13))) (let ((.cse21 (not .cse15)) (.cse8 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 8)) (.cse9 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 4)) (.cse12 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store .cse35 .cse36 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) (.cse11 (select .cse35 .cse36)) (.cse14 (+ .cse6 4))) (let ((.cse0 (or .cse21 (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_arrayElimCell_49 Int) (v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int)) (v_ArrVal_1184 (Array Int Int))) (let ((.cse34 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1184))) (or (not (= (store (store (select .cse34 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse8 (select v_ArrVal_1177 .cse8)) .cse9 (select v_ArrVal_1177 .cse9)) v_ArrVal_1177)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store .cse34 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1177) .cse11 v_ArrVal_1186) (select (select (store (store .cse12 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1181) .cse11 v_ArrVal_1185) .cse13) .cse14)) v_arrayElimCell_49))))))) (.cse4 (or .cse15 (forall ((v_ArrVal_1181 (Array Int Int)) (v_arrayElimCell_50 Int) (v_arrayElimCell_47 Int) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int)) (v_ArrVal_1184 (Array Int Int))) (let ((.cse32 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1184))) (let ((.cse33 (select (store (store .cse32 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1177) .cse11 v_ArrVal_1186) (select (select (store (store .cse12 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1181) .cse11 v_ArrVal_1185) .cse13) .cse14)))) (or (not (= (store (store (select .cse32 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse8 (select v_ArrVal_1177 .cse8)) .cse9 (select v_ArrVal_1177 .cse9)) v_ArrVal_1177)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse33 v_arrayElimCell_47)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse33 v_arrayElimCell_50)))))))) (.cse1 (forall ((v_arrayElimCell_47 Int) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1184 (Array Int Int))) (let ((.cse31 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1184))) (or (forall ((v_ArrVal_1181 (Array Int Int)) (v_arrayElimCell_49 Int) (v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (let ((.cse30 (select (store (store .cse31 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1177) .cse11 v_ArrVal_1186) (select (select (store (store .cse12 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1181) .cse11 v_ArrVal_1185) .cse13) .cse14)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse30 v_arrayElimCell_47)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse30 v_arrayElimCell_49))))) (not (= (store (store (select .cse31 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse8 (select v_ArrVal_1177 .cse8)) .cse9 (select v_ArrVal_1177 .cse9)) v_ArrVal_1177)))))) (.cse2 (or .cse15 (forall ((v_ArrVal_1181 (Array Int Int)) (v_arrayElimCell_47 Int) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int)) (v_ArrVal_1184 (Array Int Int))) (let ((.cse29 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1184))) (or (not (= (store (store (select .cse29 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse8 (select v_ArrVal_1177 .cse8)) .cse9 (select v_ArrVal_1177 .cse9)) v_ArrVal_1177)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store .cse29 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1177) .cse11 v_ArrVal_1186) (select (select (store (store .cse12 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1181) .cse11 v_ArrVal_1185) .cse13) .cse14)) v_arrayElimCell_47))))))) (.cse5 (forall ((v_arrayElimCell_47 Int) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1184 (Array Int Int))) (let ((.cse27 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1184))) (or (not (= (store (store (select .cse27 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse8 (select v_ArrVal_1177 .cse8)) .cse9 (select v_ArrVal_1177 .cse9)) v_ArrVal_1177)) (forall ((v_ArrVal_1181 (Array Int Int)) (v_arrayElimCell_50 Int) (v_arrayElimCell_49 Int) (v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (let ((.cse28 (select (store (store .cse27 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1177) .cse11 v_ArrVal_1186) (select (select (store (store .cse12 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1181) .cse11 v_ArrVal_1185) .cse13) .cse14)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse28 v_arrayElimCell_47)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse28 v_arrayElimCell_50)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse28 v_arrayElimCell_49))))))))) (.cse3 (= .cse11 .cse13))) (and (or (and (or (and .cse0 .cse1 .cse2) .cse3) .cse4 .cse5) (= |c_ULTIMATE.start_dll_insert_~last~0#1.offset| .cse6)) (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1184 (Array Int Int))) (let ((.cse7 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1184))) (or (not (= (store (store (select .cse7 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse8 (select v_ArrVal_1177 .cse8)) .cse9 (select v_ArrVal_1177 .cse9)) v_ArrVal_1177)) (forall ((v_ArrVal_1181 (Array Int Int)) (v_arrayElimCell_50 Int) (v_arrayElimCell_49 Int) (v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (let ((.cse10 (select (store (store .cse7 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1177) .cse11 v_ArrVal_1186) (select (select (store (store .cse12 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1181) .cse11 v_ArrVal_1185) .cse13) .cse14)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse10 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse10 v_arrayElimCell_50)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse10 v_arrayElimCell_49)))))))) (or .cse15 (forall ((v_ArrVal_1181 (Array Int Int)) (v_arrayElimCell_50 Int) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int)) (v_ArrVal_1184 (Array Int Int))) (let ((.cse17 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1184))) (let ((.cse16 (select (store (store .cse17 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1177) .cse11 v_ArrVal_1186) (select (select (store (store .cse12 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1181) .cse11 v_ArrVal_1185) .cse13) .cse14)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse16 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) (not (= (store (store (select .cse17 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse8 (select v_ArrVal_1177 .cse8)) .cse9 (select v_ArrVal_1177 .cse9)) v_ArrVal_1177)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse16 v_arrayElimCell_50))))))) (or .cse3 (and (or (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int)) (v_ArrVal_1184 (Array Int Int))) (let ((.cse18 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1184))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1177) .cse11 v_ArrVal_1186) (select (select (store (store .cse12 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1181) .cse11 v_ArrVal_1185) .cse13) .cse14)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) (not (= (store (store (select .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse8 (select v_ArrVal_1177 .cse8)) .cse9 (select v_ArrVal_1177 .cse9)) v_ArrVal_1177))))) .cse15) .cse0 (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1184 (Array Int Int))) (let ((.cse19 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1184))) (or (not (= (store (store (select .cse19 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse8 (select v_ArrVal_1177 .cse8)) .cse9 (select v_ArrVal_1177 .cse9)) v_ArrVal_1177)) (forall ((v_ArrVal_1181 (Array Int Int)) (v_arrayElimCell_49 Int) (v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (let ((.cse20 (select (store (store .cse19 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1177) .cse11 v_ArrVal_1186) (select (select (store (store .cse12 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1181) .cse11 v_ArrVal_1185) .cse13) .cse14)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse20 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse20 v_arrayElimCell_49)))))))))) (or (let ((.cse22 (select |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) (and .cse4 (or (and (or .cse21 (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_arrayElimCell_49 Int) (v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int)) (v_ArrVal_1184 (Array Int Int))) (or (not (= (store (store .cse22 .cse8 (select v_ArrVal_1177 .cse8)) .cse9 (select v_ArrVal_1177 .cse9)) v_ArrVal_1177)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1184) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1177) .cse11 v_ArrVal_1186) (select (select (store (store .cse12 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1181) .cse11 v_ArrVal_1185) .cse13) .cse14)) v_arrayElimCell_49))))) .cse1 .cse2) .cse3) (or .cse21 (forall ((v_ArrVal_1181 (Array Int Int)) (v_arrayElimCell_50 Int) (v_ArrVal_1177 (Array Int Int)) (v_arrayElimCell_49 Int) (v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int)) (v_ArrVal_1184 (Array Int Int))) (let ((.cse23 (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1184) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1177) .cse11 v_ArrVal_1186) (select (select (store (store .cse12 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1181) .cse11 v_ArrVal_1185) .cse13) .cse14)))) (or (not (= (store (store .cse22 .cse8 (select v_ArrVal_1177 .cse8)) .cse9 (select v_ArrVal_1177 .cse9)) v_ArrVal_1177)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse23 v_arrayElimCell_50)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse23 v_arrayElimCell_49)))))) .cse5)) (= |c_ULTIMATE.start_dll_insert_~last~0#1.base| .cse13)) (or (not .cse3) (forall ((v_ArrVal_1181 (Array Int Int)) (v_arrayElimCell_50 Int) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int)) (v_ArrVal_1184 (Array Int Int))) (let ((.cse24 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1184))) (or (not (= (store (store (select .cse24 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse8 (select v_ArrVal_1177 .cse8)) .cse9 (select v_ArrVal_1177 .cse9)) v_ArrVal_1177)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store .cse24 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1177) .cse11 v_ArrVal_1186) (select (select (store (store .cse12 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1181) .cse11 v_ArrVal_1185) .cse13) .cse14)) v_arrayElimCell_50)))))) (or .cse21 (forall ((v_ArrVal_1181 (Array Int Int)) (v_arrayElimCell_50 Int) (v_ArrVal_1177 (Array Int Int)) (v_arrayElimCell_49 Int) (v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int)) (v_ArrVal_1184 (Array Int Int))) (let ((.cse25 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1184))) (let ((.cse26 (select (store (store .cse25 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1177) .cse11 v_ArrVal_1186) (select (select (store (store .cse12 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1181) .cse11 v_ArrVal_1185) .cse13) .cse14)))) (or (not (= (store (store (select .cse25 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse8 (select v_ArrVal_1177 .cse8)) .cse9 (select v_ArrVal_1177 .cse9)) v_ArrVal_1177)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse26 v_arrayElimCell_50)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse26 v_arrayElimCell_49)))))))))))) is different from false [2025-01-09 02:48:25,479 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse27 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|))) (let ((.cse28 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse37 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse38 (+ .cse27 4)) (.cse19 (= |c_ULTIMATE.start_node_create_#res#1.base| .cse0))) (let ((.cse4 (not .cse19)) (.cse9 (store |c_#memory_$Pointer$#1.base| .cse1 (store .cse37 .cse38 |c_ULTIMATE.start_node_create_#res#1.base|))) (.cse8 (select .cse37 .cse38)) (.cse10 (+ .cse28 4)) (.cse6 (+ 8 |c_ULTIMATE.start_node_create_#res#1.offset|)) (.cse7 (+ |c_ULTIMATE.start_node_create_#res#1.offset| 4))) (let ((.cse12 (forall ((v_arrayElimCell_47 Int) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1184 (Array Int Int))) (let ((.cse36 (store |c_#memory_int#1| .cse1 v_ArrVal_1184))) (or (forall ((v_ArrVal_1181 (Array Int Int)) (v_arrayElimCell_50 Int) (v_arrayElimCell_49 Int) (v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (let ((.cse35 (select (store (store .cse36 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1177) .cse8 v_ArrVal_1186) (select (select (store (store .cse9 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1181) .cse8 v_ArrVal_1185) .cse0) .cse10)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse35 v_arrayElimCell_47)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse35 v_arrayElimCell_50)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse35 v_arrayElimCell_49))))) (not (= (store (store (select .cse36 |c_ULTIMATE.start_node_create_#res#1.base|) .cse6 (select v_ArrVal_1177 .cse6)) .cse7 (select v_ArrVal_1177 .cse7)) v_ArrVal_1177)))))) (.cse13 (or (forall ((v_ArrVal_1181 (Array Int Int)) (v_arrayElimCell_50 Int) (v_arrayElimCell_47 Int) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int)) (v_ArrVal_1184 (Array Int Int))) (let ((.cse34 (store |c_#memory_int#1| .cse1 v_ArrVal_1184))) (let ((.cse33 (select (store (store .cse34 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1177) .cse8 v_ArrVal_1186) (select (select (store (store .cse9 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1181) .cse8 v_ArrVal_1185) .cse0) .cse10)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse33 v_arrayElimCell_47)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse33 v_arrayElimCell_50)) (not (= (store (store (select .cse34 |c_ULTIMATE.start_node_create_#res#1.base|) .cse6 (select v_ArrVal_1177 .cse6)) .cse7 (select v_ArrVal_1177 .cse7)) v_ArrVal_1177)))))) .cse19)) (.cse2 (= .cse8 .cse0)) (.cse3 (or .cse19 (forall ((v_ArrVal_1181 (Array Int Int)) (v_arrayElimCell_47 Int) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int)) (v_ArrVal_1184 (Array Int Int))) (let ((.cse32 (store |c_#memory_int#1| .cse1 v_ArrVal_1184))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store .cse32 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1177) .cse8 v_ArrVal_1186) (select (select (store (store .cse9 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1181) .cse8 v_ArrVal_1185) .cse0) .cse10)) v_arrayElimCell_47)) (not (= (store (store (select .cse32 |c_ULTIMATE.start_node_create_#res#1.base|) .cse6 (select v_ArrVal_1177 .cse6)) .cse7 (select v_ArrVal_1177 .cse7)) v_ArrVal_1177))))))) (.cse20 (or .cse4 (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_arrayElimCell_49 Int) (v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int)) (v_ArrVal_1184 (Array Int Int))) (let ((.cse31 (store |c_#memory_int#1| .cse1 v_ArrVal_1184))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store .cse31 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1177) .cse8 v_ArrVal_1186) (select (select (store (store .cse9 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1181) .cse8 v_ArrVal_1185) .cse0) .cse10)) v_arrayElimCell_49)) (not (= (store (store (select .cse31 |c_ULTIMATE.start_node_create_#res#1.base|) .cse6 (select v_ArrVal_1177 .cse6)) .cse7 (select v_ArrVal_1177 .cse7)) v_ArrVal_1177))))))) (.cse11 (forall ((v_arrayElimCell_47 Int) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1184 (Array Int Int))) (let ((.cse30 (store |c_#memory_int#1| .cse1 v_ArrVal_1184))) (or (forall ((v_ArrVal_1181 (Array Int Int)) (v_arrayElimCell_49 Int) (v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (let ((.cse29 (select (store (store .cse30 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1177) .cse8 v_ArrVal_1186) (select (select (store (store .cse9 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1181) .cse8 v_ArrVal_1185) .cse0) .cse10)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse29 v_arrayElimCell_47)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse29 v_arrayElimCell_49))))) (not (= (store (store (select .cse30 |c_ULTIMATE.start_node_create_#res#1.base|) .cse6 (select v_ArrVal_1177 .cse6)) .cse7 (select v_ArrVal_1177 .cse7)) v_ArrVal_1177))))))) (and (or (= .cse0 .cse1) (let ((.cse5 (select |c_#memory_int#1| |c_ULTIMATE.start_node_create_#res#1.base|))) (and (or .cse2 (and .cse3 (or .cse4 (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_arrayElimCell_49 Int) (v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int)) (v_ArrVal_1184 (Array Int Int))) (or (not (= (store (store .cse5 .cse6 (select v_ArrVal_1177 .cse6)) .cse7 (select v_ArrVal_1177 .cse7)) v_ArrVal_1177)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#1| .cse1 v_ArrVal_1184) |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1177) .cse8 v_ArrVal_1186) (select (select (store (store .cse9 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1181) .cse8 v_ArrVal_1185) .cse0) .cse10)) v_arrayElimCell_49))))) .cse11)) .cse12 .cse13 (or .cse4 (forall ((v_ArrVal_1181 (Array Int Int)) (v_arrayElimCell_50 Int) (v_ArrVal_1177 (Array Int Int)) (v_arrayElimCell_49 Int) (v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int)) (v_ArrVal_1184 (Array Int Int))) (let ((.cse14 (select (store (store (store |c_#memory_int#1| .cse1 v_ArrVal_1184) |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1177) .cse8 v_ArrVal_1186) (select (select (store (store .cse9 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1181) .cse8 v_ArrVal_1185) .cse0) .cse10)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse14 v_arrayElimCell_50)) (not (= (store (store .cse5 .cse6 (select v_ArrVal_1177 .cse6)) .cse7 (select v_ArrVal_1177 .cse7)) v_ArrVal_1177)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse14 v_arrayElimCell_49))))))))) (or .cse4 (forall ((v_ArrVal_1181 (Array Int Int)) (v_arrayElimCell_50 Int) (v_ArrVal_1177 (Array Int Int)) (v_arrayElimCell_49 Int) (v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int)) (v_ArrVal_1184 (Array Int Int))) (let ((.cse16 (store |c_#memory_int#1| .cse1 v_ArrVal_1184))) (let ((.cse15 (select (store (store .cse16 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1177) .cse8 v_ArrVal_1186) (select (select (store (store .cse9 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1181) .cse8 v_ArrVal_1185) .cse0) .cse10)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse15 v_arrayElimCell_50)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse15 v_arrayElimCell_49)) (not (= (store (store (select .cse16 |c_ULTIMATE.start_node_create_#res#1.base|) .cse6 (select v_ArrVal_1177 .cse6)) .cse7 (select v_ArrVal_1177 .cse7)) v_ArrVal_1177))))))) (or (forall ((v_ArrVal_1181 (Array Int Int)) (v_arrayElimCell_50 Int) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int)) (v_ArrVal_1184 (Array Int Int))) (let ((.cse17 (store |c_#memory_int#1| .cse1 v_ArrVal_1184))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store .cse17 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1177) .cse8 v_ArrVal_1186) (select (select (store (store .cse9 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1181) .cse8 v_ArrVal_1185) .cse0) .cse10)) v_arrayElimCell_50)) (not (= (store (store (select .cse17 |c_ULTIMATE.start_node_create_#res#1.base|) .cse6 (select v_ArrVal_1177 .cse6)) .cse7 (select v_ArrVal_1177 .cse7)) v_ArrVal_1177))))) (not .cse2)) (or .cse2 (and (or (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int)) (v_ArrVal_1184 (Array Int Int))) (let ((.cse18 (store |c_#memory_int#1| .cse1 v_ArrVal_1184))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store .cse18 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1177) .cse8 v_ArrVal_1186) (select (select (store (store .cse9 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1181) .cse8 v_ArrVal_1185) .cse0) .cse10)) |c_ULTIMATE.start_node_create_#res#1.offset|)) (not (= (store (store (select .cse18 |c_ULTIMATE.start_node_create_#res#1.base|) .cse6 (select v_ArrVal_1177 .cse6)) .cse7 (select v_ArrVal_1177 .cse7)) v_ArrVal_1177))))) .cse19) .cse20 (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1184 (Array Int Int))) (let ((.cse22 (store |c_#memory_int#1| .cse1 v_ArrVal_1184))) (or (forall ((v_ArrVal_1181 (Array Int Int)) (v_arrayElimCell_49 Int) (v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (let ((.cse21 (select (store (store .cse22 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1177) .cse8 v_ArrVal_1186) (select (select (store (store .cse9 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1181) .cse8 v_ArrVal_1185) .cse0) .cse10)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse21 |c_ULTIMATE.start_node_create_#res#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse21 v_arrayElimCell_49))))) (not (= (store (store (select .cse22 |c_ULTIMATE.start_node_create_#res#1.base|) .cse6 (select v_ArrVal_1177 .cse6)) .cse7 (select v_ArrVal_1177 .cse7)) v_ArrVal_1177))))))) (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1184 (Array Int Int))) (let ((.cse24 (store |c_#memory_int#1| .cse1 v_ArrVal_1184))) (or (forall ((v_ArrVal_1181 (Array Int Int)) (v_arrayElimCell_50 Int) (v_arrayElimCell_49 Int) (v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (let ((.cse23 (select (store (store .cse24 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1177) .cse8 v_ArrVal_1186) (select (select (store (store .cse9 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1181) .cse8 v_ArrVal_1185) .cse0) .cse10)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse23 v_arrayElimCell_50)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse23 |c_ULTIMATE.start_node_create_#res#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse23 v_arrayElimCell_49))))) (not (= (store (store (select .cse24 |c_ULTIMATE.start_node_create_#res#1.base|) .cse6 (select v_ArrVal_1177 .cse6)) .cse7 (select v_ArrVal_1177 .cse7)) v_ArrVal_1177))))) (or (forall ((v_ArrVal_1181 (Array Int Int)) (v_arrayElimCell_50 Int) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int)) (v_ArrVal_1184 (Array Int Int))) (let ((.cse26 (store |c_#memory_int#1| .cse1 v_ArrVal_1184))) (let ((.cse25 (select (store (store .cse26 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1177) .cse8 v_ArrVal_1186) (select (select (store (store .cse9 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1181) .cse8 v_ArrVal_1185) .cse0) .cse10)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse25 v_arrayElimCell_50)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse25 |c_ULTIMATE.start_node_create_#res#1.offset|)) (not (= (store (store (select .cse26 |c_ULTIMATE.start_node_create_#res#1.base|) .cse6 (select v_ArrVal_1177 .cse6)) .cse7 (select v_ArrVal_1177 .cse7)) v_ArrVal_1177)))))) .cse19) (or (= .cse27 .cse28) (and .cse12 .cse13 (or .cse2 (and .cse3 .cse20 .cse11))))))))) is different from false [2025-01-09 02:48:25,596 INFO L349 Elim1Store]: treesize reduction 139, result has 52.1 percent of original size [2025-01-09 02:48:25,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20151 treesize of output 19237 [2025-01-09 02:48:25,619 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:48:25,620 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 761 treesize of output 761 [2025-01-09 02:48:25,636 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 688 treesize of output 682 [2025-01-09 02:48:25,650 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 521 treesize of output 513 [2025-01-09 02:48:26,341 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 5 treesize of output 3 [2025-01-09 02:48:26,353 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 5 treesize of output 3 [2025-01-09 02:48:26,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-01-09 02:48:26,382 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 5 treesize of output 3 [2025-01-09 02:48:26,384 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 6 treesize of output 4 [2025-01-09 02:48:26,464 INFO L349 Elim1Store]: treesize reduction 342, result has 40.1 percent of original size [2025-01-09 02:48:26,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 40262 treesize of output 38370 [2025-01-09 02:48:26,512 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:48:26,513 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 1 case distinctions, treesize of input 1401 treesize of output 1333 [2025-01-09 02:48:26,534 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:48:26,535 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 1395 treesize of output 1387 [2025-01-09 02:48:26,563 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:48:26,563 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 1043 treesize of output 1035 [2025-01-09 02:48:28,016 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:48:28,017 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 11 treesize of output 15 [2025-01-09 02:48:28,261 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:48:28,266 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 1088 treesize of output 1060 [2025-01-09 02:48:28,478 INFO L349 Elim1Store]: treesize reduction 556, result has 35.9 percent of original size [2025-01-09 02:48:28,479 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 4 new quantified variables, introduced 7 case distinctions, treesize of input 60373 treesize of output 57508 [2025-01-09 02:48:28,533 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:48:28,534 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 2086 treesize of output 1950 [2025-01-09 02:48:28,573 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:48:28,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1943 treesize of output 1949 [2025-01-09 02:48:28,620 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:48:28,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1564 treesize of output 1564 [2025-01-09 02:48:30,312 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:48:30,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 229 treesize of output 247 [2025-01-09 02:48:30,449 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:48:30,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 978 treesize of output 976 [2025-01-09 02:48:30,870 INFO L349 Elim1Store]: treesize reduction 417, result has 52.4 percent of original size [2025-01-09 02:48:30,871 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 4 new quantified variables, introduced 7 case distinctions, treesize of input 60373 treesize of output 57655 [2025-01-09 02:48:30,924 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:48:30,924 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 2265 treesize of output 2129 [2025-01-09 02:48:30,965 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:48:30,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2205 treesize of output 2207 [2025-01-09 02:48:31,050 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:48:31,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1564 treesize of output 1564 [2025-01-09 02:49:16,462 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:16,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 44