./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/list-ext3-properties/dll_circular_traversal-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/list-ext3-properties/dll_circular_traversal-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4fb6aa6206205a747f158782e93b3c9333c1a2cdc4e8dab70046fca960e31961 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:37:37,977 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:37:38,018 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-30 10:37:38,023 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:37:38,023 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:37:38,040 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:37:38,040 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:37:38,040 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:37:38,041 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:37:38,041 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:37:38,041 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:37:38,041 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:37:38,041 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:37:38,041 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:37:38,041 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:37:38,041 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:37:38,041 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:37:38,041 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:37:38,042 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:37:38,042 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:37:38,042 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-30 10:37:38,042 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-30 10:37:38,042 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-30 10:37:38,042 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:37:38,042 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-30 10:37:38,042 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:37:38,042 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:37:38,042 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:37:38,042 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:37:38,042 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:37:38,042 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:37:38,043 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:37:38,043 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:37:38,043 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:37:38,043 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:37:38,043 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:37:38,043 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:37:38,043 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:37:38,043 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:37:38,043 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:37:38,043 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:37:38,043 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:37:38,043 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:37:38,043 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:37:38,043 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:37:38,043 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:37:38,043 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 4fb6aa6206205a747f158782e93b3c9333c1a2cdc4e8dab70046fca960e31961 [2025-04-30 10:37:38,237 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:37:38,245 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:37:38,247 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:37:38,248 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:37:38,248 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:37:38,250 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext3-properties/dll_circular_traversal-2.i [2025-04-30 10:37:39,452 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/043ccd874/88440d0d7bc74036906e07b0652320bc/FLAG11d683ce3 [2025-04-30 10:37:39,708 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:37:39,708 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext3-properties/dll_circular_traversal-2.i [2025-04-30 10:37:39,721 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/043ccd874/88440d0d7bc74036906e07b0652320bc/FLAG11d683ce3 [2025-04-30 10:37:40,503 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/043ccd874/88440d0d7bc74036906e07b0652320bc [2025-04-30 10:37:40,505 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:37:40,506 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:37:40,507 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:37:40,507 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:37:40,509 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:37:40,510 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:37:40" (1/1) ... [2025-04-30 10:37:40,510 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35221752 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:37:40, skipping insertion in model container [2025-04-30 10:37:40,511 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:37:40" (1/1) ... [2025-04-30 10:37:40,533 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:37:40,747 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:37:40,752 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:37:40,797 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:37:40,813 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:37:40,813 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:37:40 WrapperNode [2025-04-30 10:37:40,813 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:37:40,814 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:37:40,814 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:37:40,814 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:37:40,818 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:37:40" (1/1) ... [2025-04-30 10:37:40,826 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:37:40" (1/1) ... [2025-04-30 10:37:40,843 INFO L138 Inliner]: procedures = 122, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 93 [2025-04-30 10:37:40,843 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:37:40,843 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:37:40,843 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:37:40,843 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:37:40,849 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:37:40" (1/1) ... [2025-04-30 10:37:40,850 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:37:40" (1/1) ... [2025-04-30 10:37:40,856 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:37:40" (1/1) ... [2025-04-30 10:37:40,865 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 10 writes are split as follows [0, 10]. [2025-04-30 10:37:40,865 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:37:40" (1/1) ... [2025-04-30 10:37:40,866 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:37:40" (1/1) ... [2025-04-30 10:37:40,873 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:37:40" (1/1) ... [2025-04-30 10:37:40,873 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:37:40" (1/1) ... [2025-04-30 10:37:40,881 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:37:40" (1/1) ... [2025-04-30 10:37:40,882 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:37:40" (1/1) ... [2025-04-30 10:37:40,883 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:37:40" (1/1) ... [2025-04-30 10:37:40,886 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:37:40,889 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:37:40,889 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:37:40,889 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:37:40,889 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:37:40" (1/1) ... [2025-04-30 10:37:40,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:37:40,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:37:40,913 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-30 10:37:40,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-30 10:37:40,931 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2025-04-30 10:37:40,931 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2025-04-30 10:37:40,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-30 10:37:40,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-30 10:37:40,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-30 10:37:40,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-30 10:37:40,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-30 10:37:40,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:37:40,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-30 10:37:40,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-30 10:37:40,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-30 10:37:40,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-30 10:37:40,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-30 10:37:40,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-30 10:37:40,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-30 10:37:40,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:37:40,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:37:41,026 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:37:41,028 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:37:41,045 INFO L726 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2025-04-30 10:37:41,261 INFO L? ?]: Removed 78 outVars from TransFormulas that were not future-live. [2025-04-30 10:37:41,262 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:37:41,271 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:37:41,272 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-04-30 10:37:41,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:37:41 BoogieIcfgContainer [2025-04-30 10:37:41,273 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:37:41,274 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:37:41,275 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:37:41,278 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:37:41,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:37:40" (1/3) ... [2025-04-30 10:37:41,279 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@298b37bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:37:41, skipping insertion in model container [2025-04-30 10:37:41,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:37:40" (2/3) ... [2025-04-30 10:37:41,279 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@298b37bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:37:41, skipping insertion in model container [2025-04-30 10:37:41,280 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:37:41" (3/3) ... [2025-04-30 10:37:41,281 INFO L128 eAbstractionObserver]: Analyzing ICFG dll_circular_traversal-2.i [2025-04-30 10:37:41,291 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:37:41,292 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll_circular_traversal-2.i that has 2 procedures, 84 locations, 96 edges, 1 initial locations, 3 loop locations, and 35 error locations. [2025-04-30 10:37:41,316 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:37:41,323 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@6dc56c3e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:37:41,323 INFO L341 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2025-04-30 10:37:41,326 INFO L278 IsEmpty]: Start isEmpty. Operand has 83 states, 45 states have (on average 2.0) internal successors, (90), 81 states have internal predecessors, (90), 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-04-30 10:37:41,329 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-04-30 10:37:41,329 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:37:41,330 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-04-30 10:37:41,330 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-04-30 10:37:41,333 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:37:41,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1079622, now seen corresponding path program 1 times [2025-04-30 10:37:41,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:37:41,338 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387074562] [2025-04-30 10:37:41,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:37:41,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:37:41,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-30 10:37:41,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-30 10:37:41,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:37:41,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:37:41,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:37:41,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:37:41,478 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387074562] [2025-04-30 10:37:41,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387074562] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:37:41,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:37:41,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:37:41,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23184201] [2025-04-30 10:37:41,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:37:41,485 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:37:41,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:37:41,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:37:41,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:37:41,505 INFO L87 Difference]: Start difference. First operand has 83 states, 45 states have (on average 2.0) internal successors, (90), 81 states have internal predecessors, (90), 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, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-04-30 10:37:41,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:37:41,586 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2025-04-30 10:37:41,587 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:37:41,587 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2025-04-30 10:37:41,588 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:37:41,591 INFO L225 Difference]: With dead ends: 78 [2025-04-30 10:37:41,592 INFO L226 Difference]: Without dead ends: 72 [2025-04-30 10:37:41,593 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:37:41,596 INFO L437 NwaCegarLoop]: 63 mSDtfsCounter, 21 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:37:41,597 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 95 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:37:41,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-04-30 10:37:41,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-04-30 10:37:41,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 41 states have (on average 1.829268292682927) internal successors, (75), 71 states have internal predecessors, (75), 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-04-30 10:37:41,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2025-04-30 10:37:41,619 INFO L79 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 4 [2025-04-30 10:37:41,620 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:37:41,620 INFO L485 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2025-04-30 10:37:41,620 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-04-30 10:37:41,620 INFO L278 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2025-04-30 10:37:41,620 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-04-30 10:37:41,620 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:37:41,620 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-04-30 10:37:41,620 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:37:41,621 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-04-30 10:37:41,621 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:37:41,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1079623, now seen corresponding path program 1 times [2025-04-30 10:37:41,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:37:41,621 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048257614] [2025-04-30 10:37:41,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:37:41,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:37:41,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-30 10:37:41,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-30 10:37:41,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:37:41,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:37:41,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:37:41,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:37:41,700 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048257614] [2025-04-30 10:37:41,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048257614] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:37:41,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:37:41,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:37:41,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052778655] [2025-04-30 10:37:41,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:37:41,701 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:37:41,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:37:41,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:37:41,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:37:41,702 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-04-30 10:37:41,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:37:41,751 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2025-04-30 10:37:41,751 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:37:41,751 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2025-04-30 10:37:41,751 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:37:41,752 INFO L225 Difference]: With dead ends: 68 [2025-04-30 10:37:41,752 INFO L226 Difference]: Without dead ends: 68 [2025-04-30 10:37:41,752 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:37:41,752 INFO L437 NwaCegarLoop]: 56 mSDtfsCounter, 19 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:37:41,753 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 88 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:37:41,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-04-30 10:37:41,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-04-30 10:37:41,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 41 states have (on average 1.7317073170731707) internal successors, (71), 67 states have internal predecessors, (71), 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-04-30 10:37:41,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2025-04-30 10:37:41,756 INFO L79 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 4 [2025-04-30 10:37:41,756 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:37:41,756 INFO L485 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2025-04-30 10:37:41,756 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-04-30 10:37:41,757 INFO L278 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2025-04-30 10:37:41,757 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-30 10:37:41,757 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:37:41,757 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:37:41,757 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:37:41,757 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-04-30 10:37:41,757 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:37:41,758 INFO L85 PathProgramCache]: Analyzing trace with hash -401985393, now seen corresponding path program 1 times [2025-04-30 10:37:41,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:37:41,758 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074203716] [2025-04-30 10:37:41,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:37:41,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:37:41,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-30 10:37:41,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-30 10:37:41,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:37:41,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:37:41,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:37:41,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:37:41,852 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074203716] [2025-04-30 10:37:41,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074203716] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:37:41,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:37:41,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:37:41,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495080749] [2025-04-30 10:37:41,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:37:41,853 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:37:41,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:37:41,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:37:41,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:37:41,854 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-04-30 10:37:41,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:37:41,898 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2025-04-30 10:37:41,898 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:37:41,898 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2025-04-30 10:37:41,898 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:37:41,899 INFO L225 Difference]: With dead ends: 66 [2025-04-30 10:37:41,899 INFO L226 Difference]: Without dead ends: 66 [2025-04-30 10:37:41,899 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:37:41,900 INFO L437 NwaCegarLoop]: 61 mSDtfsCounter, 5 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:37:41,900 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 94 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:37:41,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-04-30 10:37:41,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-04-30 10:37:41,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 41 states have (on average 1.6829268292682926) internal successors, (69), 65 states have internal predecessors, (69), 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-04-30 10:37:41,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2025-04-30 10:37:41,905 INFO L79 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 10 [2025-04-30 10:37:41,905 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:37:41,905 INFO L485 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2025-04-30 10:37:41,905 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-04-30 10:37:41,905 INFO L278 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2025-04-30 10:37:41,905 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-30 10:37:41,905 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:37:41,906 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:37:41,906 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:37:41,906 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-04-30 10:37:41,906 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:37:41,906 INFO L85 PathProgramCache]: Analyzing trace with hash -401985392, now seen corresponding path program 1 times [2025-04-30 10:37:41,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:37:41,906 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181186209] [2025-04-30 10:37:41,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:37:41,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:37:41,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-30 10:37:41,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-30 10:37:41,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:37:41,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:37:42,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:37:42,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:37:42,011 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181186209] [2025-04-30 10:37:42,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181186209] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:37:42,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:37:42,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:37:42,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825156465] [2025-04-30 10:37:42,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:37:42,012 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:37:42,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:37:42,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:37:42,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:37:42,012 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-04-30 10:37:42,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:37:42,047 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2025-04-30 10:37:42,048 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:37:42,048 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2025-04-30 10:37:42,048 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:37:42,048 INFO L225 Difference]: With dead ends: 64 [2025-04-30 10:37:42,048 INFO L226 Difference]: Without dead ends: 64 [2025-04-30 10:37:42,049 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:37:42,049 INFO L437 NwaCegarLoop]: 61 mSDtfsCounter, 5 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:37:42,049 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 97 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:37:42,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-04-30 10:37:42,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-04-30 10:37:42,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 41 states have (on average 1.6341463414634145) internal successors, (67), 63 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-04-30 10:37:42,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2025-04-30 10:37:42,053 INFO L79 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 10 [2025-04-30 10:37:42,053 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:37:42,053 INFO L485 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2025-04-30 10:37:42,053 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-04-30 10:37:42,053 INFO L278 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2025-04-30 10:37:42,053 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-30 10:37:42,053 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:37:42,054 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:37:42,054 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:37:42,054 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-04-30 10:37:42,055 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:37:42,055 INFO L85 PathProgramCache]: Analyzing trace with hash -401966685, now seen corresponding path program 1 times [2025-04-30 10:37:42,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:37:42,055 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705694519] [2025-04-30 10:37:42,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:37:42,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:37:42,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-30 10:37:42,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-30 10:37:42,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:37:42,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:37:42,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:37:42,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:37:42,112 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705694519] [2025-04-30 10:37:42,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705694519] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:37:42,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:37:42,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:37:42,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814287609] [2025-04-30 10:37:42,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:37:42,112 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:37:42,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:37:42,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:37:42,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:37:42,113 INFO L87 Difference]: Start difference. First operand 64 states and 67 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-04-30 10:37:42,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:37:42,125 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2025-04-30 10:37:42,126 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:37:42,126 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2025-04-30 10:37:42,126 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:37:42,126 INFO L225 Difference]: With dead ends: 72 [2025-04-30 10:37:42,126 INFO L226 Difference]: Without dead ends: 72 [2025-04-30 10:37:42,126 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:37:42,127 INFO L437 NwaCegarLoop]: 65 mSDtfsCounter, 7 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:37:42,127 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 122 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:37:42,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-04-30 10:37:42,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 65. [2025-04-30 10:37:42,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 42 states have (on average 1.619047619047619) internal successors, (68), 64 states have internal predecessors, (68), 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-04-30 10:37:42,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2025-04-30 10:37:42,133 INFO L79 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 10 [2025-04-30 10:37:42,133 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:37:42,135 INFO L485 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2025-04-30 10:37:42,135 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-04-30 10:37:42,135 INFO L278 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2025-04-30 10:37:42,135 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-30 10:37:42,135 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:37:42,135 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:37:42,136 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:37:42,136 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-04-30 10:37:42,136 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:37:42,136 INFO L85 PathProgramCache]: Analyzing trace with hash 239094258, now seen corresponding path program 1 times [2025-04-30 10:37:42,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:37:42,136 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570110752] [2025-04-30 10:37:42,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:37:42,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:37:42,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-30 10:37:42,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-30 10:37:42,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:37:42,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:37:42,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:37:42,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:37:42,256 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570110752] [2025-04-30 10:37:42,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570110752] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:37:42,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:37:42,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:37:42,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129364684] [2025-04-30 10:37:42,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:37:42,257 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:37:42,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:37:42,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:37:42,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:37:42,258 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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-04-30 10:37:42,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:37:42,323 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2025-04-30 10:37:42,323 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:37:42,324 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2025-04-30 10:37:42,324 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:37:42,324 INFO L225 Difference]: With dead ends: 69 [2025-04-30 10:37:42,324 INFO L226 Difference]: Without dead ends: 69 [2025-04-30 10:37:42,324 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:37:42,326 INFO L437 NwaCegarLoop]: 52 mSDtfsCounter, 18 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:37:42,327 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 109 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:37:42,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-04-30 10:37:42,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-04-30 10:37:42,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 46 states have (on average 1.5869565217391304) internal successors, (73), 68 states have internal predecessors, (73), 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-04-30 10:37:42,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2025-04-30 10:37:42,329 INFO L79 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 12 [2025-04-30 10:37:42,329 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:37:42,329 INFO L485 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2025-04-30 10:37:42,329 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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-04-30 10:37:42,329 INFO L278 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2025-04-30 10:37:42,330 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-30 10:37:42,330 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:37:42,330 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:37:42,330 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-30 10:37:42,330 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-04-30 10:37:42,330 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:37:42,330 INFO L85 PathProgramCache]: Analyzing trace with hash 239094259, now seen corresponding path program 1 times [2025-04-30 10:37:42,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:37:42,330 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445376382] [2025-04-30 10:37:42,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:37:42,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:37:42,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-30 10:37:42,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-30 10:37:42,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:37:42,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:37:42,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:37:42,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:37:42,479 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445376382] [2025-04-30 10:37:42,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445376382] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:37:42,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:37:42,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:37:42,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945175666] [2025-04-30 10:37:42,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:37:42,480 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:37:42,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:37:42,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:37:42,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:37:42,481 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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-04-30 10:37:42,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:37:42,547 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2025-04-30 10:37:42,547 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:37:42,548 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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 12 [2025-04-30 10:37:42,548 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:37:42,548 INFO L225 Difference]: With dead ends: 69 [2025-04-30 10:37:42,548 INFO L226 Difference]: Without dead ends: 69 [2025-04-30 10:37:42,548 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:37:42,548 INFO L437 NwaCegarLoop]: 52 mSDtfsCounter, 36 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:37:42,549 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 117 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:37:42,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-04-30 10:37:42,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-04-30 10:37:42,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 46 states have (on average 1.565217391304348) internal successors, (72), 68 states have internal predecessors, (72), 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-04-30 10:37:42,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2025-04-30 10:37:42,551 INFO L79 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 12 [2025-04-30 10:37:42,551 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:37:42,551 INFO L485 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2025-04-30 10:37:42,551 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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-04-30 10:37:42,552 INFO L278 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2025-04-30 10:37:42,552 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-30 10:37:42,552 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:37:42,552 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:37:42,552 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-30 10:37:42,552 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-04-30 10:37:42,552 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:37:42,553 INFO L85 PathProgramCache]: Analyzing trace with hash 5051543, now seen corresponding path program 1 times [2025-04-30 10:37:42,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:37:42,553 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320105737] [2025-04-30 10:37:42,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:37:42,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:37:42,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-30 10:37:42,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-30 10:37:42,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:37:42,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:37:42,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:37:42,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:37:42,614 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320105737] [2025-04-30 10:37:42,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320105737] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:37:42,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:37:42,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:37:42,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227870898] [2025-04-30 10:37:42,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:37:42,615 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:37:42,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:37:42,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:37:42,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:37:42,615 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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-04-30 10:37:42,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:37:42,676 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2025-04-30 10:37:42,676 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:37:42,677 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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 16 [2025-04-30 10:37:42,677 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:37:42,678 INFO L225 Difference]: With dead ends: 67 [2025-04-30 10:37:42,678 INFO L226 Difference]: Without dead ends: 67 [2025-04-30 10:37:42,679 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:37:42,679 INFO L437 NwaCegarLoop]: 55 mSDtfsCounter, 6 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:37:42,679 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 115 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:37:42,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-04-30 10:37:42,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-04-30 10:37:42,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 46 states have (on average 1.5217391304347827) internal successors, (70), 66 states have internal predecessors, (70), 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-04-30 10:37:42,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2025-04-30 10:37:42,682 INFO L79 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 16 [2025-04-30 10:37:42,682 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:37:42,682 INFO L485 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2025-04-30 10:37:42,682 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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-04-30 10:37:42,682 INFO L278 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2025-04-30 10:37:42,683 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-30 10:37:42,683 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:37:42,683 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:37:42,683 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:37:42,683 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-04-30 10:37:42,683 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:37:42,683 INFO L85 PathProgramCache]: Analyzing trace with hash 5051544, now seen corresponding path program 1 times [2025-04-30 10:37:42,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:37:42,683 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867373615] [2025-04-30 10:37:42,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:37:42,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:37:42,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-30 10:37:42,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-30 10:37:42,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:37:42,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:37:42,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:37:42,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:37:42,748 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867373615] [2025-04-30 10:37:42,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867373615] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:37:42,748 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989951683] [2025-04-30 10:37:42,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:37:42,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:37:42,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:37:42,751 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:37:42,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-30 10:37:42,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-30 10:37:42,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-30 10:37:42,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:37:42,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:37:42,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-30 10:37:42,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:37:42,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:37:42,874 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:37:42,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:37:42,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989951683] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:37:42,900 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:37:42,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-04-30 10:37:42,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708008038] [2025-04-30 10:37:42,901 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:37:42,901 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:37:42,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:37:42,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:37:42,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:37:42,902 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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-04-30 10:37:42,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:37:42,923 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2025-04-30 10:37:42,923 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:37:42,924 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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 16 [2025-04-30 10:37:42,924 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:37:42,924 INFO L225 Difference]: With dead ends: 83 [2025-04-30 10:37:42,924 INFO L226 Difference]: Without dead ends: 83 [2025-04-30 10:37:42,924 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:37:42,925 INFO L437 NwaCegarLoop]: 63 mSDtfsCounter, 14 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:37:42,925 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 228 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:37:42,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-04-30 10:37:42,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2025-04-30 10:37:42,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 80 states have internal predecessors, (86), 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-04-30 10:37:42,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2025-04-30 10:37:42,927 INFO L79 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 16 [2025-04-30 10:37:42,928 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:37:42,928 INFO L485 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2025-04-30 10:37:42,928 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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-04-30 10:37:42,928 INFO L278 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2025-04-30 10:37:42,928 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-30 10:37:42,928 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:37:42,928 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:37:42,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-30 10:37:43,131 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:37:43,131 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-04-30 10:37:43,132 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:37:43,132 INFO L85 PathProgramCache]: Analyzing trace with hash 541587431, now seen corresponding path program 1 times [2025-04-30 10:37:43,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:37:43,132 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609431509] [2025-04-30 10:37:43,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:37:43,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:37:43,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-30 10:37:43,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-30 10:37:43,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:37:43,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:37:43,275 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:37:43,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:37:43,275 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609431509] [2025-04-30 10:37:43,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609431509] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:37:43,275 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100783207] [2025-04-30 10:37:43,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:37:43,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:37:43,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:37:43,278 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:37:43,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-30 10:37:43,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-30 10:37:43,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-30 10:37:43,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:37:43,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:37:43,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-30 10:37:43,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:37:43,389 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-30 10:37:43,436 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-30 10:37:43,436 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-04-30 10:37:43,472 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:37:43,472 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:37:43,575 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:37:43,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100783207] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:37:43,575 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:37:43,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 4] total 6 [2025-04-30 10:37:43,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163266194] [2025-04-30 10:37:43,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:37:43,575 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:37:43,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:37:43,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:37:43,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:37:43,576 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 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-04-30 10:37:43,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:37:43,669 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2025-04-30 10:37:43,671 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:37:43,671 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 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 18 [2025-04-30 10:37:43,671 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:37:43,672 INFO L225 Difference]: With dead ends: 79 [2025-04-30 10:37:43,672 INFO L226 Difference]: Without dead ends: 79 [2025-04-30 10:37:43,672 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:37:43,672 INFO L437 NwaCegarLoop]: 55 mSDtfsCounter, 6 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:37:43,672 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 187 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:37:43,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-04-30 10:37:43,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-04-30 10:37:43,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 60 states have (on average 1.3666666666666667) internal successors, (82), 78 states have internal predecessors, (82), 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-04-30 10:37:43,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2025-04-30 10:37:43,674 INFO L79 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 18 [2025-04-30 10:37:43,674 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:37:43,674 INFO L485 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2025-04-30 10:37:43,675 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 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-04-30 10:37:43,675 INFO L278 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2025-04-30 10:37:43,675 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-30 10:37:43,675 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:37:43,675 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:37:43,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-30 10:37:43,876 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-04-30 10:37:43,876 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-04-30 10:37:43,876 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:37:43,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1464923895, now seen corresponding path program 1 times [2025-04-30 10:37:43,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:37:43,877 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727001202] [2025-04-30 10:37:43,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:37:43,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:37:43,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-30 10:37:43,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-30 10:37:43,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:37:43,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:37:43,980 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-04-30 10:37:43,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:37:43,980 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727001202] [2025-04-30 10:37:43,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727001202] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:37:43,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:37:43,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:37:43,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40579321] [2025-04-30 10:37:43,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:37:43,981 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:37:43,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:37:43,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:37:43,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:37:43,981 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 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-04-30 10:37:44,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:37:44,078 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2025-04-30 10:37:44,078 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:37:44,078 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 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 37 [2025-04-30 10:37:44,079 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:37:44,079 INFO L225 Difference]: With dead ends: 76 [2025-04-30 10:37:44,079 INFO L226 Difference]: Without dead ends: 76 [2025-04-30 10:37:44,079 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:37:44,079 INFO L437 NwaCegarLoop]: 39 mSDtfsCounter, 18 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:37:44,080 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 119 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:37:44,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-04-30 10:37:44,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-04-30 10:37:44,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 61 states have (on average 1.3114754098360655) internal successors, (80), 75 states have internal predecessors, (80), 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-04-30 10:37:44,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2025-04-30 10:37:44,082 INFO L79 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 37 [2025-04-30 10:37:44,082 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:37:44,082 INFO L485 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2025-04-30 10:37:44,082 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 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-04-30 10:37:44,082 INFO L278 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2025-04-30 10:37:44,082 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-30 10:37:44,083 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:37:44,083 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:37:44,083 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-30 10:37:44,083 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-04-30 10:37:44,083 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:37:44,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1464923894, now seen corresponding path program 1 times [2025-04-30 10:37:44,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:37:44,083 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617519925] [2025-04-30 10:37:44,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:37:44,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:37:44,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-30 10:37:44,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-30 10:37:44,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:37:44,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:37:44,319 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-30 10:37:44,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:37:44,320 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617519925] [2025-04-30 10:37:44,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617519925] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:37:44,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:37:44,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:37:44,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907729405] [2025-04-30 10:37:44,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:37:44,320 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:37:44,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:37:44,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:37:44,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:37:44,321 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 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-04-30 10:37:44,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:37:44,420 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2025-04-30 10:37:44,420 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:37:44,421 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 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 37 [2025-04-30 10:37:44,421 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:37:44,421 INFO L225 Difference]: With dead ends: 83 [2025-04-30 10:37:44,421 INFO L226 Difference]: Without dead ends: 83 [2025-04-30 10:37:44,421 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:37:44,422 INFO L437 NwaCegarLoop]: 47 mSDtfsCounter, 10 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:37:44,422 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 151 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:37:44,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-04-30 10:37:44,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2025-04-30 10:37:44,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 64 states have (on average 1.296875) internal successors, (83), 78 states have internal predecessors, (83), 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-04-30 10:37:44,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2025-04-30 10:37:44,424 INFO L79 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 37 [2025-04-30 10:37:44,424 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:37:44,424 INFO L485 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2025-04-30 10:37:44,424 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 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-04-30 10:37:44,424 INFO L278 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2025-04-30 10:37:44,424 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-30 10:37:44,424 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:37:44,424 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:37:44,424 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-30 10:37:44,425 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-04-30 10:37:44,425 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:37:44,425 INFO L85 PathProgramCache]: Analyzing trace with hash 949139109, now seen corresponding path program 1 times [2025-04-30 10:37:44,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:37:44,425 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669865526] [2025-04-30 10:37:44,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:37:44,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:37:44,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-30 10:37:44,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-30 10:37:44,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:37:44,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:37:44,965 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-30 10:37:44,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:37:44,965 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669865526] [2025-04-30 10:37:44,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669865526] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:37:44,966 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917800539] [2025-04-30 10:37:44,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:37:44,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:37:44,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:37:44,968 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:37:44,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-30 10:37:45,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-30 10:37:45,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-30 10:37:45,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:37:45,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:37:45,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-30 10:37:45,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:37:45,182 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-30 10:37:45,182 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-04-30 10:37:45,285 INFO L325 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2025-04-30 10:37:45,286 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2025-04-30 10:37:45,435 INFO L325 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2025-04-30 10:37:45,436 INFO L354 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 16 treesize of output 18 [2025-04-30 10:37:45,477 INFO L354 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 11 treesize of output 7 [2025-04-30 10:37:45,508 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-30 10:37:45,560 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-30 10:37:45,582 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-04-30 10:37:45,640 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:37:45,640 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:37:45,661 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_843 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_843) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|)) is different from false [2025-04-30 10:37:45,667 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_843 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_843) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) is different from false [2025-04-30 10:37:45,672 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_843 (Array Int Int)) (v_ArrVal_842 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_842) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_843) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) is different from false [2025-04-30 10:37:45,677 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:37:45,677 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2025-04-30 10:37:45,680 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 110 [2025-04-30 10:37:45,684 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2025-04-30 10:37:45,687 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2025-04-30 10:37:46,134 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:37:46,135 INFO L354 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 106 treesize of output 124 [2025-04-30 10:37:46,218 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2025-04-30 10:37:46,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917800539] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:37:46,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:37:46,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18, 18] total 41 [2025-04-30 10:37:46,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888546169] [2025-04-30 10:37:46,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:37:46,219 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-30 10:37:46,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:37:46,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-30 10:37:46,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1261, Unknown=3, NotChecked=222, Total=1640 [2025-04-30 10:37:46,220 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand has 41 states, 41 states have (on average 2.4878048780487805) internal successors, (102), 41 states have internal predecessors, (102), 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-04-30 10:37:46,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:37:46,754 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2025-04-30 10:37:46,754 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-30 10:37:46,754 INFO L79 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.4878048780487805) internal successors, (102), 41 states have internal predecessors, (102), 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 41 [2025-04-30 10:37:46,755 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:37:46,755 INFO L225 Difference]: With dead ends: 79 [2025-04-30 10:37:46,755 INFO L226 Difference]: Without dead ends: 79 [2025-04-30 10:37:46,756 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=361, Invalid=2000, Unknown=3, NotChecked=288, Total=2652 [2025-04-30 10:37:46,756 INFO L437 NwaCegarLoop]: 41 mSDtfsCounter, 68 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 87 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:37:46,756 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 824 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 524 Invalid, 0 Unknown, 87 Unchecked, 0.3s Time] [2025-04-30 10:37:46,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-04-30 10:37:46,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-04-30 10:37:46,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 64 states have (on average 1.28125) internal successors, (82), 78 states have internal predecessors, (82), 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-04-30 10:37:46,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2025-04-30 10:37:46,759 INFO L79 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 41 [2025-04-30 10:37:46,759 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:37:46,759 INFO L485 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2025-04-30 10:37:46,759 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.4878048780487805) internal successors, (102), 41 states have internal predecessors, (102), 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-04-30 10:37:46,759 INFO L278 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2025-04-30 10:37:46,759 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-30 10:37:46,760 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:37:46,760 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:37:46,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-30 10:37:46,963 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:37:46,963 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-04-30 10:37:46,963 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:37:46,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1592424604, now seen corresponding path program 1 times [2025-04-30 10:37:46,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:37:46,964 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800857656] [2025-04-30 10:37:46,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:37:46,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:37:46,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-30 10:37:47,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-30 10:37:47,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:37:47,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:37:47,726 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 39 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:37:47,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:37:47,726 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800857656] [2025-04-30 10:37:47,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800857656] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:37:47,726 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952021990] [2025-04-30 10:37:47,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:37:47,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:37:47,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:37:47,728 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:37:47,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-30 10:37:47,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-30 10:37:47,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-30 10:37:47,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:37:47,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:37:47,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-04-30 10:37:47,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:37:47,901 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-30 10:37:47,901 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-04-30 10:37:47,952 INFO L325 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2025-04-30 10:37:47,952 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2025-04-30 10:37:48,042 INFO L325 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2025-04-30 10:37:48,042 INFO L354 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 16 treesize of output 18 [2025-04-30 10:37:48,060 INFO L354 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 13 treesize of output 9 [2025-04-30 10:37:48,080 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-04-30 10:37:48,093 INFO L325 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-04-30 10:37:48,093 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-04-30 10:37:48,142 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2025-04-30 10:37:48,153 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 19 [2025-04-30 10:37:48,239 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:37:48,239 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 32 [2025-04-30 10:37:48,248 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:37:48,249 INFO L354 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 41 treesize of output 17 [2025-04-30 10:37:48,254 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:37:48,254 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:37:48,403 INFO L325 Elim1Store]: treesize reduction 5, result has 75.0 percent of original size [2025-04-30 10:37:48,403 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2025-04-30 10:37:52,497 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:37:52,498 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 34 [2025-04-30 10:37:52,499 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 58 [2025-04-30 10:37:52,502 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2025-04-30 10:37:52,504 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2025-04-30 10:37:52,776 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-30 10:37:52,776 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2025-04-30 10:37:52,787 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 35 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:37:52,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [952021990] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:37:52,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:37:52,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 18] total 45 [2025-04-30 10:37:52,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470992859] [2025-04-30 10:37:52,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:37:52,789 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-04-30 10:37:52,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:37:52,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-04-30 10:37:52,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1825, Unknown=46, NotChecked=0, Total=2070 [2025-04-30 10:37:52,790 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand has 46 states, 45 states have (on average 2.4444444444444446) internal successors, (110), 46 states have internal predecessors, (110), 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-04-30 10:37:53,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:37:53,435 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2025-04-30 10:37:53,435 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-30 10:37:53,435 INFO L79 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.4444444444444446) internal successors, (110), 46 states have internal predecessors, (110), 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 43 [2025-04-30 10:37:53,435 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:37:53,435 INFO L225 Difference]: With dead ends: 83 [2025-04-30 10:37:53,435 INFO L226 Difference]: Without dead ends: 83 [2025-04-30 10:37:53,437 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 926 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=403, Invalid=2739, Unknown=50, NotChecked=0, Total=3192 [2025-04-30 10:37:53,437 INFO L437 NwaCegarLoop]: 28 mSDtfsCounter, 73 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-30 10:37:53,437 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 419 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-30 10:37:53,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-04-30 10:37:53,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-04-30 10:37:53,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 68 states have (on average 1.3088235294117647) internal successors, (89), 82 states have internal predecessors, (89), 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-04-30 10:37:53,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2025-04-30 10:37:53,439 INFO L79 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 43 [2025-04-30 10:37:53,439 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:37:53,440 INFO L485 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2025-04-30 10:37:53,440 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.4444444444444446) internal successors, (110), 46 states have internal predecessors, (110), 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-04-30 10:37:53,440 INFO L278 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2025-04-30 10:37:53,440 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-30 10:37:53,440 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:37:53,440 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:37:53,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-30 10:37:53,641 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:37:53,641 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-04-30 10:37:53,641 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:37:53,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1592424605, now seen corresponding path program 1 times [2025-04-30 10:37:53,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:37:53,641 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971687784] [2025-04-30 10:37:53,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:37:53,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:37:53,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-30 10:37:53,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-30 10:37:53,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:37:53,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:37:54,567 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-30 10:37:54,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:37:54,567 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971687784] [2025-04-30 10:37:54,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971687784] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:37:54,567 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819821263] [2025-04-30 10:37:54,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:37:54,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:37:54,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:37:54,569 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:37:54,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-30 10:37:54,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-30 10:37:54,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-30 10:37:54,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:37:54,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:37:54,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 76 conjuncts are in the unsatisfiable core [2025-04-30 10:37:54,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:37:54,744 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-30 10:37:54,745 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-04-30 10:37:54,773 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-30 10:37:54,780 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-30 10:37:54,780 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-04-30 10:37:54,857 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-30 10:37:54,857 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-04-30 10:37:54,873 INFO L325 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2025-04-30 10:37:54,873 INFO L354 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 16 treesize of output 18 [2025-04-30 10:37:54,904 INFO L354 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 13 treesize of output 9 [2025-04-30 10:37:54,908 INFO L354 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 13 treesize of output 9 [2025-04-30 10:37:54,940 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-04-30 10:37:54,946 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-04-30 10:37:54,959 INFO L325 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-04-30 10:37:54,959 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-04-30 10:37:54,963 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-04-30 10:37:55,015 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-30 10:37:55,019 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2025-04-30 10:37:55,028 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 19 [2025-04-30 10:37:55,034 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-04-30 10:37:55,127 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:37:55,127 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 32 [2025-04-30 10:37:55,133 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-04-30 10:37:55,141 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 17 [2025-04-30 10:37:55,145 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-04-30 10:37:55,183 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 36 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:37:55,183 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:37:55,464 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_1344 (Array Int Int)) (v_ArrVal_1343 (Array Int Int)) (v_ArrVal_1341 (Array Int Int)) (v_ArrVal_1340 (Array Int Int))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1340) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1343) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1341) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1344) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0)))) (forall ((v_ArrVal_1343 (Array Int Int)) (v_ArrVal_1340 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1340) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1343) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))))) is different from false [2025-04-30 10:37:55,494 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)) (.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (forall ((v_ArrVal_1338 (Array Int Int))) (or (forall ((v_ArrVal_1343 (Array Int Int)) (v_ArrVal_1340 (Array Int Int))) (<= 0 (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1338) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1340) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1343) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (not (= v_ArrVal_1338 (store .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1338 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))))) (forall ((v_ArrVal_1338 (Array Int Int))) (or (forall ((v_ArrVal_1344 (Array Int Int)) (v_ArrVal_1343 (Array Int Int)) (v_ArrVal_1341 (Array Int Int)) (v_ArrVal_1340 (Array Int Int)) (v_ArrVal_1339 Int)) (<= (+ 4 (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1338) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1340) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1343) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0)) (select |c_#length| (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1339)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1341) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1344) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0)))) (not (= v_ArrVal_1338 (store .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1338 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))))))) is different from false [2025-04-30 10:37:55,501 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 72 [2025-04-30 10:37:55,503 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 50 [2025-04-30 10:37:55,506 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-04-30 10:37:55,524 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:37:55,524 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 53 [2025-04-30 10:37:55,526 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:37:55,527 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:37:55,528 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 40 treesize of output 38 [2025-04-30 10:37:55,530 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:37:55,530 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:37:55,531 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 28 treesize of output 16 [2025-04-30 10:37:55,796 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-30 10:37:55,796 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-04-30 10:37:55,800 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 6 not checked. [2025-04-30 10:37:55,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819821263] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:37:55,800 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:37:55,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 44 [2025-04-30 10:37:55,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502373792] [2025-04-30 10:37:55,800 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:37:55,801 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-04-30 10:37:55,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:37:55,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-04-30 10:37:55,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1615, Unknown=46, NotChecked=166, Total=1980 [2025-04-30 10:37:55,802 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand has 45 states, 44 states have (on average 2.6136363636363638) internal successors, (115), 45 states have internal predecessors, (115), 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-04-30 10:37:56,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:37:56,792 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2025-04-30 10:37:56,792 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-30 10:37:56,792 INFO L79 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.6136363636363638) internal successors, (115), 45 states have internal predecessors, (115), 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 43 [2025-04-30 10:37:56,792 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:37:56,792 INFO L225 Difference]: With dead ends: 89 [2025-04-30 10:37:56,793 INFO L226 Difference]: Without dead ends: 89 [2025-04-30 10:37:56,793 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 809 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=342, Invalid=2696, Unknown=50, NotChecked=218, Total=3306 [2025-04-30 10:37:56,795 INFO L437 NwaCegarLoop]: 32 mSDtfsCounter, 65 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 1102 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 1257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 132 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-30 10:37:56,795 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 574 Invalid, 1257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1102 Invalid, 0 Unknown, 132 Unchecked, 0.5s Time] [2025-04-30 10:37:56,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-04-30 10:37:56,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 85. [2025-04-30 10:37:56,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 71 states have (on average 1.267605633802817) internal successors, (90), 84 states have internal predecessors, (90), 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-04-30 10:37:56,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2025-04-30 10:37:56,801 INFO L79 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 43 [2025-04-30 10:37:56,801 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:37:56,801 INFO L485 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2025-04-30 10:37:56,801 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.6136363636363638) internal successors, (115), 45 states have internal predecessors, (115), 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-04-30 10:37:56,801 INFO L278 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2025-04-30 10:37:56,801 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-30 10:37:56,801 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:37:56,802 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:37:56,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-30 10:37:57,002 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-30 10:37:57,002 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-04-30 10:37:57,003 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:37:57,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1311771539, now seen corresponding path program 1 times [2025-04-30 10:37:57,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:37:57,003 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999978684] [2025-04-30 10:37:57,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:37:57,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:37:57,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-30 10:37:57,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-30 10:37:57,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:37:57,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:37:57,094 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-04-30 10:37:57,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:37:57,094 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999978684] [2025-04-30 10:37:57,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999978684] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:37:57,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:37:57,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:37:57,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12231993] [2025-04-30 10:37:57,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:37:57,095 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:37:57,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:37:57,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:37:57,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:37:57,095 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 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-04-30 10:37:57,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:37:57,168 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2025-04-30 10:37:57,169 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:37:57,169 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 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 45 [2025-04-30 10:37:57,169 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:37:57,169 INFO L225 Difference]: With dead ends: 88 [2025-04-30 10:37:57,169 INFO L226 Difference]: Without dead ends: 88 [2025-04-30 10:37:57,169 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:37:57,170 INFO L437 NwaCegarLoop]: 38 mSDtfsCounter, 14 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:37:57,170 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 137 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:37:57,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-04-30 10:37:57,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2025-04-30 10:37:57,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 71 states have (on average 1.2535211267605635) internal successors, (89), 83 states have internal predecessors, (89), 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-04-30 10:37:57,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2025-04-30 10:37:57,171 INFO L79 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 45 [2025-04-30 10:37:57,171 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:37:57,171 INFO L485 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2025-04-30 10:37:57,172 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 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-04-30 10:37:57,172 INFO L278 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2025-04-30 10:37:57,172 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-30 10:37:57,172 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:37:57,172 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:37:57,172 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-30 10:37:57,172 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-04-30 10:37:57,172 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:37:57,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1311771540, now seen corresponding path program 1 times [2025-04-30 10:37:57,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:37:57,174 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523032454] [2025-04-30 10:37:57,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:37:57,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:37:57,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-30 10:37:57,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-30 10:37:57,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:37:57,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:37:57,317 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-30 10:37:57,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:37:57,318 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523032454] [2025-04-30 10:37:57,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523032454] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:37:57,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:37:57,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:37:57,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790053914] [2025-04-30 10:37:57,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:37:57,318 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:37:57,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:37:57,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:37:57,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:37:57,319 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 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-04-30 10:37:57,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:37:57,395 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2025-04-30 10:37:57,395 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:37:57,396 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 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 45 [2025-04-30 10:37:57,396 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:37:57,396 INFO L225 Difference]: With dead ends: 87 [2025-04-30 10:37:57,396 INFO L226 Difference]: Without dead ends: 87 [2025-04-30 10:37:57,396 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:37:57,397 INFO L437 NwaCegarLoop]: 37 mSDtfsCounter, 13 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:37:57,397 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 137 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:37:57,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-04-30 10:37:57,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2025-04-30 10:37:57,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 71 states have (on average 1.2394366197183098) internal successors, (88), 82 states have internal predecessors, (88), 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-04-30 10:37:57,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2025-04-30 10:37:57,399 INFO L79 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 45 [2025-04-30 10:37:57,400 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:37:57,400 INFO L485 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2025-04-30 10:37:57,400 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 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-04-30 10:37:57,400 INFO L278 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2025-04-30 10:37:57,401 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-30 10:37:57,401 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:37:57,401 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:37:57,401 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-30 10:37:57,401 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-04-30 10:37:57,401 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:37:57,402 INFO L85 PathProgramCache]: Analyzing trace with hash 2106991800, now seen corresponding path program 1 times [2025-04-30 10:37:57,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:37:57,402 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383093760] [2025-04-30 10:37:57,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:37:57,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:37:57,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-30 10:37:57,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-30 10:37:57,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:37:57,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:37:59,212 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:37:59,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:37:59,212 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383093760] [2025-04-30 10:37:59,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383093760] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:37:59,212 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480780482] [2025-04-30 10:37:59,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:37:59,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:37:59,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:37:59,214 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:37:59,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-30 10:37:59,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-30 10:37:59,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-30 10:37:59,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:37:59,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:37:59,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 91 conjuncts are in the unsatisfiable core [2025-04-30 10:37:59,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:37:59,460 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-30 10:37:59,460 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-04-30 10:37:59,549 INFO L325 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2025-04-30 10:37:59,549 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2025-04-30 10:37:59,623 INFO L354 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 11 treesize of output 7 [2025-04-30 10:37:59,663 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-30 10:37:59,786 INFO L325 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2025-04-30 10:37:59,786 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2025-04-30 10:37:59,851 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-30 10:37:59,856 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-30 10:37:59,864 INFO L354 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 11 treesize of output 7 [2025-04-30 10:37:59,925 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-30 10:37:59,931 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-30 10:37:59,935 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-30 10:37:59,962 INFO L325 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-04-30 10:37:59,963 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 74 [2025-04-30 10:37:59,969 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2025-04-30 10:37:59,974 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-04-30 10:38:00,086 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-30 10:38:00,092 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2025-04-30 10:38:00,096 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-04-30 10:38:00,113 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2025-04-30 10:38:00,116 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-04-30 10:38:00,121 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-30 10:38:00,264 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-30 10:38:00,270 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 34 [2025-04-30 10:38:00,274 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-04-30 10:38:00,286 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 23 [2025-04-30 10:38:00,288 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-04-30 10:38:00,369 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 5 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:38:00,370 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:38:00,492 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1846 (Array Int Int))) (= (let ((.cse0 (+ 4 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_ArrVal_1846) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) .cse0)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) .cse0))) |c_ULTIMATE.start_main_~data_init~0#1|)) is different from false [2025-04-30 10:38:00,496 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1846 (Array Int Int))) (= (let ((.cse0 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1846) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0))) |c_ULTIMATE.start_main_~data_init~0#1|)) is different from false [2025-04-30 10:38:00,503 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1846 (Array Int Int)) (v_ArrVal_1839 (Array Int Int)) (v_ArrVal_1838 (Array Int Int)) (v_ArrVal_1837 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (let ((.cse0 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1837) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1846) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1839) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1838) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0))))) is different from false [2025-04-30 10:38:00,510 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1846 (Array Int Int)) (v_ArrVal_1839 (Array Int Int)) (v_ArrVal_1838 (Array Int Int)) (v_ArrVal_1837 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1837) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1846) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1839) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1838) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) |c_ULTIMATE.start_main_~data_init~0#1|)) is different from false [2025-04-30 10:38:00,520 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1846 (Array Int Int)) (v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1834 (Array Int Int)) (v_ArrVal_1839 (Array Int Int)) (v_ArrVal_1838 (Array Int Int)) (v_ArrVal_1837 (Array Int Int)) (v_ArrVal_1836 (Array Int Int))) (or (not (= v_ArrVal_1836 (let ((.cse0 (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 (select v_ArrVal_1836 .cse0))))) (= (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1836) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1837) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1846) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1835) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1839) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1834) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1838) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) |c_ULTIMATE.start_main_~data_init~0#1|))) is different from false [2025-04-30 10:38:00,537 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1846 (Array Int Int)) (v_ArrVal_1834 (Array Int Int)) (v_ArrVal_1833 (Array Int Int)) (v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1839 (Array Int Int)) (v_ArrVal_1832 Int) (v_ArrVal_1838 (Array Int Int)) (v_ArrVal_1837 (Array Int Int)) (v_ArrVal_1836 (Array Int Int))) (or (not (= v_ArrVal_1836 (let ((.cse0 (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1833) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 (select v_ArrVal_1836 .cse0))))) (not (= v_ArrVal_1831 (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1831 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (= (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1836) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1837) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1846) (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1832)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1835) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1839) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1831) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1834) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1838) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) |c_ULTIMATE.start_main_~data_init~0#1|))) is different from false [2025-04-30 10:38:00,549 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:38:00,549 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 62 [2025-04-30 10:38:00,555 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 364 treesize of output 346 [2025-04-30 10:38:00,561 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 76 [2025-04-30 10:38:00,569 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 998 treesize of output 996 [2025-04-30 10:38:00,575 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 55 [2025-04-30 10:38:00,579 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2025-04-30 10:38:00,586 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2025-04-30 10:38:00,700 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse6 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse2 (not .cse6)) (.cse3 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (or (forall ((v_ArrVal_1846 (Array Int Int)) (v_ArrVal_1833 (Array Int Int)) (v_arrayElimCell_95 Int) (v_arrayElimCell_98 Int) (v_arrayElimCell_97 Int) (v_ArrVal_1837 (Array Int Int)) (v_ArrVal_1836 (Array Int Int)) (v_arrayElimCell_99 Int)) (let ((.cse0 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1836) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1837) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1846))) (or (= (select (select .cse0 v_arrayElimCell_95) v_arrayElimCell_99) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_1836 (store v_ArrVal_1833 .cse1 (select v_ArrVal_1836 .cse1)))) (= (select (select .cse0 v_arrayElimCell_97) v_arrayElimCell_98) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse2) (or (forall ((v_ArrVal_1846 (Array Int Int)) (v_ArrVal_1833 (Array Int Int)) (v_arrayElimCell_95 Int) (v_ArrVal_1837 (Array Int Int)) (v_ArrVal_1836 (Array Int Int)) (v_arrayElimCell_99 Int)) (or (not (= v_ArrVal_1836 (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1833) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 (select v_ArrVal_1836 .cse1)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1836) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1837) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1846) v_arrayElimCell_95) v_arrayElimCell_99) |c_ULTIMATE.start_main_~data_init~0#1|))) (not .cse3)) (or .cse3 (and (forall ((v_ArrVal_1833 (Array Int Int)) (v_ArrVal_1836 (Array Int Int))) (or (not (= v_ArrVal_1836 (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1833) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 (select v_ArrVal_1836 .cse1)))) (forall ((v_ArrVal_1846 (Array Int Int)) (v_arrayElimCell_98 Int) (v_arrayElimCell_97 Int) (v_ArrVal_1837 (Array Int Int))) (let ((.cse4 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1836) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1837) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1846))) (or (= (select (select .cse4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse4 v_arrayElimCell_97) v_arrayElimCell_98) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (or (forall ((v_ArrVal_1846 (Array Int Int)) (v_ArrVal_1833 (Array Int Int)) (v_arrayElimCell_98 Int) (v_arrayElimCell_97 Int) (v_ArrVal_1837 (Array Int Int)) (v_ArrVal_1836 (Array Int Int))) (or (not (= v_ArrVal_1836 (store v_ArrVal_1833 .cse1 (select v_ArrVal_1836 .cse1)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1836) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1837) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1846) v_arrayElimCell_97) v_arrayElimCell_98) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse2))) (forall ((v_ArrVal_1833 (Array Int Int)) (v_ArrVal_1836 (Array Int Int))) (or (not (= v_ArrVal_1836 (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1833) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 (select v_ArrVal_1836 .cse1)))) (forall ((v_ArrVal_1846 (Array Int Int)) (v_arrayElimCell_95 Int) (v_arrayElimCell_98 Int) (v_arrayElimCell_97 Int) (v_ArrVal_1837 (Array Int Int)) (v_arrayElimCell_99 Int)) (let ((.cse5 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1836) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1837) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1846))) (or (= (select (select .cse5 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse5 v_arrayElimCell_95) v_arrayElimCell_99) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse5 v_arrayElimCell_97) v_arrayElimCell_98) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (or .cse6 (let ((.cse7 (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (or (forall ((v_ArrVal_1846 (Array Int Int)) (v_ArrVal_1837 (Array Int Int)) (v_ArrVal_1836 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1836) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1837) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1846) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_1836 (store .cse7 .cse1 (select v_ArrVal_1836 .cse1)))))) .cse3) (forall ((v_ArrVal_1836 (Array Int Int))) (or (not (= v_ArrVal_1836 (store .cse7 .cse1 (select v_ArrVal_1836 .cse1)))) (forall ((v_ArrVal_1846 (Array Int Int)) (v_ArrVal_1837 (Array Int Int))) (let ((.cse8 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1836) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1837) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1846))) (or (= (select (select .cse8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_arrayElimCell_95 Int) (v_arrayElimCell_99 Int)) (= (select (select .cse8 v_arrayElimCell_95) v_arrayElimCell_99) |c_ULTIMATE.start_main_~data_init~0#1|))))))))))))) is different from false [2025-04-30 10:38:00,722 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-04-30 10:38:00,778 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-04-30 10:38:01,563 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse6 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse3 (not .cse6)) (.cse1 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse0 (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (or (forall ((v_ArrVal_1846 (Array Int Int)) (v_ArrVal_1833 (Array Int Int)) (v_arrayElimCell_95 Int) (v_ArrVal_1837 (Array Int Int)) (v_ArrVal_1836 (Array Int Int)) (v_arrayElimCell_99 Int)) (or (not (= v_ArrVal_1836 (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1833) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 (select v_ArrVal_1836 .cse0)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1836) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1837) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1846) v_arrayElimCell_95) v_arrayElimCell_99) |c_ULTIMATE.start_main_~data_init~0#1|))) (not .cse1)) (or .cse1 (and (forall ((v_ArrVal_1833 (Array Int Int)) (v_ArrVal_1836 (Array Int Int))) (or (not (= v_ArrVal_1836 (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1833) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 (select v_ArrVal_1836 .cse0)))) (forall ((v_ArrVal_1846 (Array Int Int)) (v_arrayElimCell_98 Int) (v_arrayElimCell_97 Int) (v_ArrVal_1837 (Array Int Int))) (let ((.cse2 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1836) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1837) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1846))) (or (= (select (select .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse2 v_arrayElimCell_97) v_arrayElimCell_98) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (or .cse3 (forall ((v_ArrVal_1846 (Array Int Int)) (v_arrayElimCell_98 Int) (v_arrayElimCell_97 Int) (v_ArrVal_1837 (Array Int Int)) (v_ArrVal_1836 (Array Int Int))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1836) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1837) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1846) v_arrayElimCell_97) v_arrayElimCell_98) |c_ULTIMATE.start_main_~data_init~0#1|))))) (or .cse3 (forall ((v_ArrVal_1846 (Array Int Int)) (v_arrayElimCell_95 Int) (v_arrayElimCell_98 Int) (v_arrayElimCell_97 Int) (v_ArrVal_1837 (Array Int Int)) (v_ArrVal_1836 (Array Int Int)) (v_arrayElimCell_99 Int)) (let ((.cse4 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1836) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1837) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1846))) (or (= (select (select .cse4 v_arrayElimCell_95) v_arrayElimCell_99) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse4 v_arrayElimCell_97) v_arrayElimCell_98) |c_ULTIMATE.start_main_~data_init~0#1|))))) (forall ((v_ArrVal_1833 (Array Int Int)) (v_ArrVal_1836 (Array Int Int))) (or (not (= v_ArrVal_1836 (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1833) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 (select v_ArrVal_1836 .cse0)))) (forall ((v_ArrVal_1846 (Array Int Int)) (v_arrayElimCell_95 Int) (v_arrayElimCell_98 Int) (v_arrayElimCell_97 Int) (v_ArrVal_1837 (Array Int Int)) (v_arrayElimCell_99 Int)) (let ((.cse5 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1836) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1837) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1846))) (or (= (select (select .cse5 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse5 v_arrayElimCell_95) v_arrayElimCell_99) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse5 v_arrayElimCell_97) v_arrayElimCell_98) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (or .cse6 (let ((.cse7 (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (or (forall ((v_ArrVal_1846 (Array Int Int)) (v_ArrVal_1837 (Array Int Int)) (v_ArrVal_1836 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1836) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1837) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1846) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_1836 (store .cse7 .cse0 (select v_ArrVal_1836 .cse0)))))) .cse1) (forall ((v_ArrVal_1836 (Array Int Int))) (or (not (= v_ArrVal_1836 (store .cse7 .cse0 (select v_ArrVal_1836 .cse0)))) (forall ((v_ArrVal_1846 (Array Int Int)) (v_ArrVal_1837 (Array Int Int))) (let ((.cse8 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1836) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1837) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1846))) (or (= (select (select .cse8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_arrayElimCell_95 Int) (v_arrayElimCell_99 Int)) (= (select (select .cse8 v_arrayElimCell_95) v_arrayElimCell_99) |c_ULTIMATE.start_main_~data_init~0#1|))))))))))))) is different from false [2025-04-30 10:38:13,475 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:38:13,716 INFO L325 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2025-04-30 10:38:13,717 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 15523 treesize of output 15285 [2025-04-30 10:38:13,820 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:38:13,820 INFO L354 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 221 treesize of output 219 [2025-04-30 10:38:13,917 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:38:13,917 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 213 treesize of output 213 [2025-04-30 10:38:14,000 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:38:14,001 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 191 treesize of output 189 [2025-04-30 10:38:14,027 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 98 [2025-04-30 10:38:15,144 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-30 10:38:16,439 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:38:16,439 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 223 treesize of output 217 [2025-04-30 10:38:17,142 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 234 treesize of output 226 [2025-04-30 10:38:17,158 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 104 [2025-04-30 10:38:17,176 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2025-04-30 10:38:17,192 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 94 [2025-04-30 10:38:17,413 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:38:17,562 INFO L325 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2025-04-30 10:38:17,562 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 522 treesize of output 532 [2025-04-30 10:38:17,590 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 228 treesize of output 212 [2025-04-30 10:38:17,653 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:38:17,653 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 221 treesize of output 219 [2025-04-30 10:38:17,694 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:38:17,755 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:38:17,755 INFO L354 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 210 treesize of output 208 [2025-04-30 10:38:17,839 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:38:17,839 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 303 treesize of output 303 [2025-04-30 10:38:18,041 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-04-30 10:38:18,844 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:38:18,844 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 240 treesize of output 238 [2025-04-30 10:38:21,005 INFO L325 Elim1Store]: treesize reduction 30, result has 65.1 percent of original size [2025-04-30 10:38:21,005 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 16029 treesize of output 15812 [2025-04-30 10:38:21,221 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:38:21,221 INFO L354 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 391 treesize of output 379 [2025-04-30 10:38:21,393 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:38:21,394 INFO L354 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 347 treesize of output 353 [2025-04-30 10:38:21,592 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:38:21,593 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 223 treesize of output 237 [2025-04-30 10:38:21,964 INFO L325 Elim1Store]: treesize reduction 32, result has 59.5 percent of original size [2025-04-30 10:38:21,965 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 289 treesize of output 322 [2025-04-30 10:38:22,015 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:38:22,015 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2025-04-30 10:38:22,157 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-04-30 10:38:22,452 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-04-30 10:38:24,547 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:38:24,547 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 45 [2025-04-30 10:38:24,569 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2025-04-30 10:38:24,634 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2025-04-30 10:38:25,013 INFO L325 Elim1Store]: treesize reduction 24, result has 57.1 percent of original size [2025-04-30 10:38:25,013 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 54 treesize of output 72 [2025-04-30 10:38:25,227 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:38:25,227 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 46 [2025-04-30 10:38:25,409 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:38:25,410 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 46 [2025-04-30 10:38:33,973 INFO L325 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-04-30 10:38:33,974 INFO L354 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 75 treesize of output 85 [2025-04-30 10:38:34,417 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:38:34,417 INFO L354 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 570 treesize of output 584 [2025-04-30 10:38:36,394 INFO L325 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-04-30 10:38:36,394 INFO L354 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 275 treesize of output 283 [2025-04-30 10:38:36,885 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:38:36,885 INFO L354 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 275 treesize of output 291 [2025-04-30 10:38:39,124 INFO L325 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-04-30 10:38:39,124 INFO L354 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 326 treesize of output 332 [2025-04-30 10:38:40,827 INFO L325 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-04-30 10:38:40,827 INFO L354 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 326 treesize of output 332 [2025-04-30 10:38:41,723 INFO L325 Elim1Store]: treesize reduction 48, result has 52.5 percent of original size [2025-04-30 10:38:41,723 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1479 treesize of output 1494 Killed by 15