./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/list-ext3-properties/dll_nullified-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_nullified-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 3b4637ab5710a1ca22a981e8047278048fbbf856825d3649b2cb9d48de11d175 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:38:00,022 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:38:00,066 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-30 10:38:00,070 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:38:00,070 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:38:00,086 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:38:00,087 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:38:00,088 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:38:00,088 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:38:00,088 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:38:00,089 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:38:00,089 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:38:00,089 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:38:00,089 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:38:00,090 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:38:00,090 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:38:00,090 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:38:00,090 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:38:00,090 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:38:00,090 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:38:00,090 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-30 10:38:00,090 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-30 10:38:00,090 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-30 10:38:00,091 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:38:00,091 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-30 10:38:00,091 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:38:00,091 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:38:00,091 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:38:00,091 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:38:00,091 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:38:00,091 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:38:00,091 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:38:00,092 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:38:00,092 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:38:00,092 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:38:00,092 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:38:00,092 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:38:00,092 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:38:00,092 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:38:00,092 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:38:00,092 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:38:00,092 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:38:00,092 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:38:00,093 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:38:00,093 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:38:00,093 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:38:00,093 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 -> 3b4637ab5710a1ca22a981e8047278048fbbf856825d3649b2cb9d48de11d175 [2025-04-30 10:38:00,299 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:38:00,307 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:38:00,309 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:38:00,310 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:38:00,310 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:38:00,311 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext3-properties/dll_nullified-2.i [2025-04-30 10:38:01,594 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89d850427/fc42266018b544cda5814b779b85bba1/FLAGb7921a935 [2025-04-30 10:38:01,826 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:38:01,826 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext3-properties/dll_nullified-2.i [2025-04-30 10:38:01,835 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89d850427/fc42266018b544cda5814b779b85bba1/FLAGb7921a935 [2025-04-30 10:38:02,795 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89d850427/fc42266018b544cda5814b779b85bba1 [2025-04-30 10:38:02,797 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:38:02,797 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:38:02,798 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:38:02,798 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:38:02,803 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:38:02,804 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:38:02" (1/1) ... [2025-04-30 10:38:02,805 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ba17d22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:02, skipping insertion in model container [2025-04-30 10:38:02,805 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:38:02" (1/1) ... [2025-04-30 10:38:02,831 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:38:03,050 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:38:03,060 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:38:03,114 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:38:03,131 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:38:03,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:03 WrapperNode [2025-04-30 10:38:03,131 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:38:03,132 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:38:03,132 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:38:03,132 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:38:03,139 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:38:03" (1/1) ... [2025-04-30 10:38:03,149 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:38:03" (1/1) ... [2025-04-30 10:38:03,163 INFO L138 Inliner]: procedures = 122, calls = 26, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 107 [2025-04-30 10:38:03,165 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:38:03,166 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:38:03,166 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:38:03,166 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:38:03,172 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:03" (1/1) ... [2025-04-30 10:38:03,173 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:03" (1/1) ... [2025-04-30 10:38:03,175 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:03" (1/1) ... [2025-04-30 10:38:03,193 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 6 writes are split as follows [0, 6]. [2025-04-30 10:38:03,193 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:03" (1/1) ... [2025-04-30 10:38:03,193 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:03" (1/1) ... [2025-04-30 10:38:03,198 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:03" (1/1) ... [2025-04-30 10:38:03,201 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:03" (1/1) ... [2025-04-30 10:38:03,203 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:03" (1/1) ... [2025-04-30 10:38:03,204 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:03" (1/1) ... [2025-04-30 10:38:03,205 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:03" (1/1) ... [2025-04-30 10:38:03,212 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:38:03,216 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:38:03,216 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:38:03,216 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:38:03,217 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:03" (1/1) ... [2025-04-30 10:38:03,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:38:03,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:38:03,239 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:38:03,241 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:38:03,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-30 10:38:03,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-30 10:38:03,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-30 10:38:03,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-30 10:38:03,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-30 10:38:03,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:38:03,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-30 10:38:03,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-30 10:38:03,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-30 10:38:03,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-30 10:38:03,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-30 10:38:03,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-30 10:38:03,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-30 10:38:03,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:38:03,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:38:03,334 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:38:03,335 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:38:03,591 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2025-04-30 10:38:03,591 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:38:03,598 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:38:03,599 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-30 10:38:03,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:38:03 BoogieIcfgContainer [2025-04-30 10:38:03,599 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:38:03,601 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:38:03,601 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:38:03,604 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:38:03,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:38:02" (1/3) ... [2025-04-30 10:38:03,605 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@408bf49e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:38:03, skipping insertion in model container [2025-04-30 10:38:03,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:03" (2/3) ... [2025-04-30 10:38:03,606 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@408bf49e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:38:03, skipping insertion in model container [2025-04-30 10:38:03,606 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:38:03" (3/3) ... [2025-04-30 10:38:03,607 INFO L128 eAbstractionObserver]: Analyzing ICFG dll_nullified-2.i [2025-04-30 10:38:03,618 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:38:03,619 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll_nullified-2.i that has 1 procedures, 86 locations, 98 edges, 1 initial locations, 3 loop locations, and 35 error locations. [2025-04-30 10:38:03,649 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:38:03,659 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;@44cecd5e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:38:03,660 INFO L341 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2025-04-30 10:38:03,663 INFO L278 IsEmpty]: Start isEmpty. Operand has 86 states, 50 states have (on average 1.96) internal successors, (98), 85 states have internal predecessors, (98), 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:38:03,666 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-30 10:38:03,666 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:03,667 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-04-30 10:38:03,667 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-04-30 10:38:03,671 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:03,671 INFO L85 PathProgramCache]: Analyzing trace with hash 28694887, now seen corresponding path program 1 times [2025-04-30 10:38:03,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:03,676 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960122383] [2025-04-30 10:38:03,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:03,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:03,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-30 10:38:03,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-30 10:38:03,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:03,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:03,845 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:38:03,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:03,846 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960122383] [2025-04-30 10:38:03,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960122383] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:38:03,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:38:03,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:38:03,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563094450] [2025-04-30 10:38:03,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:38:03,850 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:38:03,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:03,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:38:03,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:38:03,868 INFO L87 Difference]: Start difference. First operand has 86 states, 50 states have (on average 1.96) internal successors, (98), 85 states have internal predecessors, (98), 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) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:38:03,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:03,951 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2025-04-30 10:38:03,951 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:38:03,952 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2025-04-30 10:38:03,952 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:03,956 INFO L225 Difference]: With dead ends: 80 [2025-04-30 10:38:03,956 INFO L226 Difference]: Without dead ends: 77 [2025-04-30 10:38:03,957 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:38:03,959 INFO L437 NwaCegarLoop]: 74 mSDtfsCounter, 10 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:03,959 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 123 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:38:03,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-04-30 10:38:03,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-04-30 10:38:03,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 47 states have (on average 1.8085106382978724) internal successors, (85), 76 states have internal predecessors, (85), 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:38:03,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2025-04-30 10:38:03,987 INFO L79 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 5 [2025-04-30 10:38:03,987 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:03,987 INFO L485 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2025-04-30 10:38:03,987 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:38:03,987 INFO L278 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2025-04-30 10:38:03,987 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-30 10:38:03,987 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:03,987 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-04-30 10:38:03,987 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:38:03,987 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-04-30 10:38:03,989 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:03,989 INFO L85 PathProgramCache]: Analyzing trace with hash 28694886, now seen corresponding path program 1 times [2025-04-30 10:38:03,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:03,990 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114776332] [2025-04-30 10:38:03,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:03,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:03,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-30 10:38:04,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-30 10:38:04,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:04,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:04,054 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:38:04,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:04,055 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114776332] [2025-04-30 10:38:04,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114776332] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:38:04,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:38:04,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:38:04,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232115145] [2025-04-30 10:38:04,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:38:04,057 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:38:04,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:04,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:38:04,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:38:04,058 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:38:04,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:04,112 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2025-04-30 10:38:04,112 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:38:04,112 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2025-04-30 10:38:04,112 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:04,113 INFO L225 Difference]: With dead ends: 72 [2025-04-30 10:38:04,113 INFO L226 Difference]: Without dead ends: 72 [2025-04-30 10:38:04,113 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:38:04,114 INFO L437 NwaCegarLoop]: 71 mSDtfsCounter, 10 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:04,114 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 114 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:38:04,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-04-30 10:38:04,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-04-30 10:38:04,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 47 states have (on average 1.702127659574468) internal successors, (80), 71 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:38:04,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2025-04-30 10:38:04,122 INFO L79 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 5 [2025-04-30 10:38:04,123 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:04,123 INFO L485 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2025-04-30 10:38:04,123 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:38:04,123 INFO L278 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2025-04-30 10:38:04,124 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-30 10:38:04,124 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:04,124 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-04-30 10:38:04,125 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:38:04,125 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-04-30 10:38:04,125 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:04,125 INFO L85 PathProgramCache]: Analyzing trace with hash 28728523, now seen corresponding path program 1 times [2025-04-30 10:38:04,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:04,125 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834658988] [2025-04-30 10:38:04,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:04,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:04,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-30 10:38:04,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-30 10:38:04,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:04,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:04,180 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:38:04,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:04,180 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834658988] [2025-04-30 10:38:04,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834658988] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:38:04,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:38:04,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:38:04,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977715237] [2025-04-30 10:38:04,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:38:04,181 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:38:04,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:04,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:38:04,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:38:04,181 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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:38:04,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:04,194 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2025-04-30 10:38:04,196 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:38:04,196 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2025-04-30 10:38:04,196 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:04,197 INFO L225 Difference]: With dead ends: 84 [2025-04-30 10:38:04,197 INFO L226 Difference]: Without dead ends: 84 [2025-04-30 10:38:04,197 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:38:04,197 INFO L437 NwaCegarLoop]: 78 mSDtfsCounter, 12 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 153 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:38:04,197 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 153 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:38:04,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-04-30 10:38:04,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 73. [2025-04-30 10:38:04,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 48 states have (on average 1.6875) internal successors, (81), 72 states have internal predecessors, (81), 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:38:04,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2025-04-30 10:38:04,205 INFO L79 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 5 [2025-04-30 10:38:04,205 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:04,205 INFO L485 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2025-04-30 10:38:04,205 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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:38:04,205 INFO L278 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2025-04-30 10:38:04,205 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-30 10:38:04,206 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:04,206 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:04,206 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:38:04,206 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-04-30 10:38:04,206 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:04,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1261145165, now seen corresponding path program 1 times [2025-04-30 10:38:04,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:04,206 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975803198] [2025-04-30 10:38:04,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:04,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:04,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-30 10:38:04,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-30 10:38:04,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:04,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:04,289 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:38:04,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:04,289 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975803198] [2025-04-30 10:38:04,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975803198] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:38:04,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:38:04,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:38:04,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078750357] [2025-04-30 10:38:04,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:38:04,290 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:38:04,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:04,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:38:04,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:38:04,290 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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:38:04,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:04,305 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2025-04-30 10:38:04,305 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:38:04,305 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2025-04-30 10:38:04,305 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:04,306 INFO L225 Difference]: With dead ends: 80 [2025-04-30 10:38:04,306 INFO L226 Difference]: Without dead ends: 80 [2025-04-30 10:38:04,306 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:38:04,306 INFO L437 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:04,307 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 148 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:38:04,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-04-30 10:38:04,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-04-30 10:38:04,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 55 states have (on average 1.6) internal successors, (88), 79 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:38:04,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2025-04-30 10:38:04,310 INFO L79 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 11 [2025-04-30 10:38:04,310 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:04,310 INFO L485 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2025-04-30 10:38:04,310 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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:38:04,310 INFO L278 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2025-04-30 10:38:04,310 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-30 10:38:04,310 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:04,310 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:04,311 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:38:04,311 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-04-30 10:38:04,311 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:04,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1593488543, now seen corresponding path program 1 times [2025-04-30 10:38:04,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:04,311 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832381797] [2025-04-30 10:38:04,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:04,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:04,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-30 10:38:04,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-30 10:38:04,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:04,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:04,407 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:38:04,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:04,407 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832381797] [2025-04-30 10:38:04,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832381797] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:38:04,408 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743053298] [2025-04-30 10:38:04,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:04,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:04,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:38:04,410 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:38:04,411 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:38:04,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-30 10:38:04,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-30 10:38:04,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:04,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:04,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-30 10:38:04,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:38:04,537 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:38:04,538 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:38:04,564 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:38:04,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743053298] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:38:04,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:38:04,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-04-30 10:38:04,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006189156] [2025-04-30 10:38:04,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:38:04,565 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:38:04,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:04,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:38:04,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:38:04,566 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:38:04,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:04,585 INFO L93 Difference]: Finished difference Result 106 states and 116 transitions. [2025-04-30 10:38:04,585 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:38:04,585 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-30 10:38:04,586 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:04,586 INFO L225 Difference]: With dead ends: 106 [2025-04-30 10:38:04,586 INFO L226 Difference]: Without dead ends: 106 [2025-04-30 10:38:04,586 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:38:04,587 INFO L437 NwaCegarLoop]: 78 mSDtfsCounter, 32 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 250 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:38:04,587 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 250 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:38:04,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-04-30 10:38:04,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 102. [2025-04-30 10:38:04,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 77 states have (on average 1.5064935064935066) internal successors, (116), 101 states have internal predecessors, (116), 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:38:04,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 116 transitions. [2025-04-30 10:38:04,590 INFO L79 Accepts]: Start accepts. Automaton has 102 states and 116 transitions. Word has length 14 [2025-04-30 10:38:04,590 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:04,590 INFO L485 AbstractCegarLoop]: Abstraction has 102 states and 116 transitions. [2025-04-30 10:38:04,591 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:38:04,591 INFO L278 IsEmpty]: Start isEmpty. Operand 102 states and 116 transitions. [2025-04-30 10:38:04,591 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-30 10:38:04,591 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:04,591 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:04,600 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:38:04,794 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:04,794 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:38:04,795 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:04,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1040797085, now seen corresponding path program 1 times [2025-04-30 10:38:04,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:04,795 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778133563] [2025-04-30 10:38:04,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:04,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:04,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-30 10:38:04,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-30 10:38:04,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:04,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:04,936 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:38:04,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:04,936 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778133563] [2025-04-30 10:38:04,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778133563] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:38:04,936 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869924137] [2025-04-30 10:38:04,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:04,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:04,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:38:04,939 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:38:04,940 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:38:05,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-30 10:38:05,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-30 10:38:05,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:05,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:05,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-30 10:38:05,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:38:05,062 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:38:05,089 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-30 10:38:05,089 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:38:05,108 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:38:05,109 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:38:05,138 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:38:05,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869924137] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:38:05,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:38:05,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2025-04-30 10:38:05,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155369491] [2025-04-30 10:38:05,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:38:05,139 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:38:05,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:05,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:38:05,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:38:05,140 INFO L87 Difference]: Start difference. First operand 102 states and 116 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:38:05,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:05,219 INFO L93 Difference]: Finished difference Result 101 states and 113 transitions. [2025-04-30 10:38:05,219 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:38:05,220 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-30 10:38:05,220 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:05,220 INFO L225 Difference]: With dead ends: 101 [2025-04-30 10:38:05,220 INFO L226 Difference]: Without dead ends: 101 [2025-04-30 10:38:05,220 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:38:05,221 INFO L437 NwaCegarLoop]: 68 mSDtfsCounter, 3 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:05,221 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 194 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:38:05,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-04-30 10:38:05,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-04-30 10:38:05,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 77 states have (on average 1.4675324675324675) internal successors, (113), 100 states have internal predecessors, (113), 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:38:05,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 113 transitions. [2025-04-30 10:38:05,227 INFO L79 Accepts]: Start accepts. Automaton has 101 states and 113 transitions. Word has length 20 [2025-04-30 10:38:05,227 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:05,228 INFO L485 AbstractCegarLoop]: Abstraction has 101 states and 113 transitions. [2025-04-30 10:38:05,228 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:38:05,228 INFO L278 IsEmpty]: Start isEmpty. Operand 101 states and 113 transitions. [2025-04-30 10:38:05,228 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-30 10:38:05,228 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:05,228 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:05,234 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:38:05,428 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,SelfDestructingSolverStorable5 [2025-04-30 10:38:05,429 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:38:05,429 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:05,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1040797084, now seen corresponding path program 1 times [2025-04-30 10:38:05,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:05,429 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522673826] [2025-04-30 10:38:05,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:05,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:05,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-30 10:38:05,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-30 10:38:05,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:05,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:05,662 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:38:05,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:05,662 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522673826] [2025-04-30 10:38:05,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522673826] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:38:05,662 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337538329] [2025-04-30 10:38:05,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:05,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:05,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:38:05,664 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:38:05,666 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:38:05,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-30 10:38:05,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-30 10:38:05,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:05,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:05,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-30 10:38:05,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:38:05,771 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:38:05,830 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-30 10:38:05,830 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:38:05,901 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:38:05,901 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:38:06,115 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:38:06,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337538329] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:38:06,115 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:38:06,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 10 [2025-04-30 10:38:06,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178938021] [2025-04-30 10:38:06,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:38:06,117 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-30 10:38:06,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:06,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-30 10:38:06,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:38:06,118 INFO L87 Difference]: Start difference. First operand 101 states and 113 transitions. Second operand has 11 states, 10 states have (on average 5.0) internal successors, (50), 11 states have internal predecessors, (50), 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:38:06,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:06,240 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2025-04-30 10:38:06,240 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:38:06,241 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.0) internal successors, (50), 11 states have internal predecessors, (50), 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 20 [2025-04-30 10:38:06,241 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:06,241 INFO L225 Difference]: With dead ends: 100 [2025-04-30 10:38:06,241 INFO L226 Difference]: Without dead ends: 100 [2025-04-30 10:38:06,241 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-04-30 10:38:06,242 INFO L437 NwaCegarLoop]: 68 mSDtfsCounter, 14 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:06,242 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 236 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:38:06,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-04-30 10:38:06,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-04-30 10:38:06,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 77 states have (on average 1.4285714285714286) internal successors, (110), 99 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:38:06,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2025-04-30 10:38:06,249 INFO L79 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 20 [2025-04-30 10:38:06,249 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:06,249 INFO L485 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2025-04-30 10:38:06,249 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.0) internal successors, (50), 11 states have internal predecessors, (50), 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:38:06,249 INFO L278 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2025-04-30 10:38:06,250 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-30 10:38:06,251 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:06,251 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2025-04-30 10:38:06,257 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:38:06,451 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:06,452 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-04-30 10:38:06,452 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:06,452 INFO L85 PathProgramCache]: Analyzing trace with hash 58048075, now seen corresponding path program 2 times [2025-04-30 10:38:06,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:06,452 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087655177] [2025-04-30 10:38:06,453 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:38:06,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:06,473 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-04-30 10:38:06,481 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-04-30 10:38:06,481 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:38:06,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:06,547 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 38 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-30 10:38:06,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:06,548 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087655177] [2025-04-30 10:38:06,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087655177] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:38:06,548 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133606130] [2025-04-30 10:38:06,548 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:38:06,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:06,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:38:06,550 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:38:06,551 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:38:06,621 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-04-30 10:38:06,662 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-04-30 10:38:06,662 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:38:06,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:06,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-30 10:38:06,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:38:06,726 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:38:06,726 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:38:06,784 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:38:06,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133606130] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:38:06,784 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:38:06,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 9 [2025-04-30 10:38:06,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358161241] [2025-04-30 10:38:06,785 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:38:06,785 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:38:06,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:06,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:38:06,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:38:06,785 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 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:38:06,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:06,926 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2025-04-30 10:38:06,926 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-30 10:38:06,927 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 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) Word has length 41 [2025-04-30 10:38:06,927 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:06,927 INFO L225 Difference]: With dead ends: 110 [2025-04-30 10:38:06,927 INFO L226 Difference]: Without dead ends: 110 [2025-04-30 10:38:06,927 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 72 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=145, Invalid=317, Unknown=0, NotChecked=0, Total=462 [2025-04-30 10:38:06,928 INFO L437 NwaCegarLoop]: 67 mSDtfsCounter, 29 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:06,928 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 387 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:38:06,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-04-30 10:38:06,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-04-30 10:38:06,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 87 states have (on average 1.3448275862068966) internal successors, (117), 109 states have internal predecessors, (117), 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:38:06,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 117 transitions. [2025-04-30 10:38:06,934 INFO L79 Accepts]: Start accepts. Automaton has 110 states and 117 transitions. Word has length 41 [2025-04-30 10:38:06,934 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:06,934 INFO L485 AbstractCegarLoop]: Abstraction has 110 states and 117 transitions. [2025-04-30 10:38:06,934 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 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:38:06,934 INFO L278 IsEmpty]: Start isEmpty. Operand 110 states and 117 transitions. [2025-04-30 10:38:06,936 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-30 10:38:06,936 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:06,936 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:06,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-30 10:38:07,140 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:07,140 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-04-30 10:38:07,140 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:07,140 INFO L85 PathProgramCache]: Analyzing trace with hash 898113029, now seen corresponding path program 1 times [2025-04-30 10:38:07,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:07,141 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041899865] [2025-04-30 10:38:07,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:07,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:07,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-30 10:38:07,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-30 10:38:07,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:07,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:07,430 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-04-30 10:38:07,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:07,431 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041899865] [2025-04-30 10:38:07,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041899865] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:38:07,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:38:07,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:38:07,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816971900] [2025-04-30 10:38:07,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:38:07,432 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:38:07,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:07,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:38:07,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:38:07,433 INFO L87 Difference]: Start difference. First operand 110 states and 117 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:38:07,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:07,569 INFO L93 Difference]: Finished difference Result 141 states and 164 transitions. [2025-04-30 10:38:07,569 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:38:07,570 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-30 10:38:07,570 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:07,570 INFO L225 Difference]: With dead ends: 141 [2025-04-30 10:38:07,570 INFO L226 Difference]: Without dead ends: 141 [2025-04-30 10:38:07,570 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:38:07,571 INFO L437 NwaCegarLoop]: 46 mSDtfsCounter, 43 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:07,571 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 174 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:38:07,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-04-30 10:38:07,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 137. [2025-04-30 10:38:07,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 114 states have (on average 1.412280701754386) internal successors, (161), 136 states have internal predecessors, (161), 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:38:07,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 161 transitions. [2025-04-30 10:38:07,574 INFO L79 Accepts]: Start accepts. Automaton has 137 states and 161 transitions. Word has length 54 [2025-04-30 10:38:07,576 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:07,576 INFO L485 AbstractCegarLoop]: Abstraction has 137 states and 161 transitions. [2025-04-30 10:38:07,576 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:38:07,576 INFO L278 IsEmpty]: Start isEmpty. Operand 137 states and 161 transitions. [2025-04-30 10:38:07,576 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-30 10:38:07,576 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:07,577 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:07,578 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-30 10:38:07,578 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-04-30 10:38:07,578 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:07,579 INFO L85 PathProgramCache]: Analyzing trace with hash 898113028, now seen corresponding path program 1 times [2025-04-30 10:38:07,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:07,579 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959066090] [2025-04-30 10:38:07,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:07,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:07,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-30 10:38:07,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-30 10:38:07,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:07,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:07,727 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-04-30 10:38:07,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:07,728 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959066090] [2025-04-30 10:38:07,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959066090] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:38:07,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:38:07,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:38:07,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818096963] [2025-04-30 10:38:07,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:38:07,728 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:38:07,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:07,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:38:07,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:38:07,729 INFO L87 Difference]: Start difference. First operand 137 states and 161 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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:38:07,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:07,831 INFO L93 Difference]: Finished difference Result 131 states and 148 transitions. [2025-04-30 10:38:07,831 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:38:07,831 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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 54 [2025-04-30 10:38:07,832 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:07,833 INFO L225 Difference]: With dead ends: 131 [2025-04-30 10:38:07,833 INFO L226 Difference]: Without dead ends: 131 [2025-04-30 10:38:07,833 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:38:07,834 INFO L437 NwaCegarLoop]: 37 mSDtfsCounter, 47 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:07,834 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 129 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:38:07,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-04-30 10:38:07,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2025-04-30 10:38:07,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 116 states have (on average 1.2758620689655173) internal successors, (148), 130 states have internal predecessors, (148), 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:38:07,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 148 transitions. [2025-04-30 10:38:07,838 INFO L79 Accepts]: Start accepts. Automaton has 131 states and 148 transitions. Word has length 54 [2025-04-30 10:38:07,838 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:07,838 INFO L485 AbstractCegarLoop]: Abstraction has 131 states and 148 transitions. [2025-04-30 10:38:07,838 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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:38:07,838 INFO L278 IsEmpty]: Start isEmpty. Operand 131 states and 148 transitions. [2025-04-30 10:38:07,839 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-04-30 10:38:07,839 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:07,839 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:07,839 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-30 10:38:07,839 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-04-30 10:38:07,839 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:07,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1961011425, now seen corresponding path program 1 times [2025-04-30 10:38:07,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:07,839 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089066316] [2025-04-30 10:38:07,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:07,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:07,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-04-30 10:38:07,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-04-30 10:38:07,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:07,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:07,977 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-04-30 10:38:07,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:07,978 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089066316] [2025-04-30 10:38:07,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089066316] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:38:07,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:38:07,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:38:07,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218422626] [2025-04-30 10:38:07,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:38:07,979 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:38:07,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:07,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:38:07,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:38:07,979 INFO L87 Difference]: Start difference. First operand 131 states and 148 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:38:08,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:08,065 INFO L93 Difference]: Finished difference Result 137 states and 153 transitions. [2025-04-30 10:38:08,065 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:38:08,065 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 57 [2025-04-30 10:38:08,065 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:08,066 INFO L225 Difference]: With dead ends: 137 [2025-04-30 10:38:08,066 INFO L226 Difference]: Without dead ends: 137 [2025-04-30 10:38:08,066 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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:38:08,066 INFO L437 NwaCegarLoop]: 47 mSDtfsCounter, 44 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:08,066 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 213 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:38:08,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-04-30 10:38:08,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 131. [2025-04-30 10:38:08,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 116 states have (on average 1.2672413793103448) internal successors, (147), 130 states have internal predecessors, (147), 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:38:08,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 147 transitions. [2025-04-30 10:38:08,070 INFO L79 Accepts]: Start accepts. Automaton has 131 states and 147 transitions. Word has length 57 [2025-04-30 10:38:08,070 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:08,070 INFO L485 AbstractCegarLoop]: Abstraction has 131 states and 147 transitions. [2025-04-30 10:38:08,070 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:38:08,073 INFO L278 IsEmpty]: Start isEmpty. Operand 131 states and 147 transitions. [2025-04-30 10:38:08,073 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-04-30 10:38:08,073 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:08,076 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:08,076 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-30 10:38:08,077 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-04-30 10:38:08,077 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:08,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1707426010, now seen corresponding path program 1 times [2025-04-30 10:38:08,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:08,077 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847032695] [2025-04-30 10:38:08,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:08,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:08,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-04-30 10:38:08,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-04-30 10:38:08,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:08,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:08,655 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 56 proven. 8 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-04-30 10:38:08,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:08,655 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847032695] [2025-04-30 10:38:08,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847032695] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:38:08,656 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342671883] [2025-04-30 10:38:08,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:08,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:08,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:38:08,658 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:38:08,660 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:38:08,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-04-30 10:38:08,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-04-30 10:38:08,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:08,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:08,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-04-30 10:38:08,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:38:08,861 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:38:08,882 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:38:08,883 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 11 treesize of output 11 [2025-04-30 10:38:08,888 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-30 10:38:08,899 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 27 treesize of output 11 [2025-04-30 10:38:08,908 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 21 treesize of output 20 [2025-04-30 10:38:08,935 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:38:08,935 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2025-04-30 10:38:08,945 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:38:08,945 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2025-04-30 10:38:08,956 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 18 [2025-04-30 10:38:09,021 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 60 proven. 10 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-04-30 10:38:09,021 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:38:09,034 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1545 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1545) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)) is different from false [2025-04-30 10:38:09,045 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1545 (Array Int Int)) (v_ArrVal_1544 (Array Int Int))) (or (not (= (let ((.cse0 (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0 (select v_ArrVal_1544 .cse0))) v_ArrVal_1544)) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1545) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0))) is different from false [2025-04-30 10:38:09,057 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1545 (Array Int Int)) (v_ArrVal_1544 (Array Int Int))) (or (not (= (let ((.cse1 (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (store (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0 (select v_ArrVal_1544 .cse0))) .cse1 (select v_ArrVal_1544 .cse1))) v_ArrVal_1544)) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1545) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0))) is different from false [2025-04-30 10:38:09,066 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1545 (Array Int Int)) (v_ArrVal_1544 (Array Int Int))) (or (not (= (let ((.cse1 (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (store (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (store (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 16 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0) .cse0 (select v_ArrVal_1544 .cse0))) .cse1 (select v_ArrVal_1544 .cse1))) v_ArrVal_1544)) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1545) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0))) is different from false [2025-04-30 10:38:09,077 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1545 (Array Int Int)) (v_ArrVal_1544 (Array Int Int))) (or (not (= (let ((.cse2 (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (store (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (store (store (let ((.cse0 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0 (select v_ArrVal_1544 .cse0))) (+ 16 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0) .cse1 (select v_ArrVal_1544 .cse1))) .cse2 (select v_ArrVal_1544 .cse2))) v_ArrVal_1544)) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1545) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0))) is different from false [2025-04-30 10:38:09,087 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 61 treesize of output 59 [2025-04-30 10:38:09,091 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 9 treesize of output 7 [2025-04-30 10:38:09,134 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 60 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 6 not checked. [2025-04-30 10:38:09,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342671883] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:38:09,135 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:38:09,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 16] total 24 [2025-04-30 10:38:09,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713452597] [2025-04-30 10:38:09,135 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:38:09,136 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-30 10:38:09,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:09,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-30 10:38:09,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=300, Unknown=5, NotChecked=190, Total=552 [2025-04-30 10:38:09,136 INFO L87 Difference]: Start difference. First operand 131 states and 147 transitions. Second operand has 24 states, 24 states have (on average 3.1666666666666665) internal successors, (76), 24 states have internal predecessors, (76), 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:38:09,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:09,463 INFO L93 Difference]: Finished difference Result 135 states and 149 transitions. [2025-04-30 10:38:09,464 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-30 10:38:09,464 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.1666666666666665) internal successors, (76), 24 states have internal predecessors, (76), 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 64 [2025-04-30 10:38:09,464 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:09,465 INFO L225 Difference]: With dead ends: 135 [2025-04-30 10:38:09,465 INFO L226 Difference]: Without dead ends: 135 [2025-04-30 10:38:09,466 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 120 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=590, Unknown=5, NotChecked=270, Total=992 [2025-04-30 10:38:09,467 INFO L437 NwaCegarLoop]: 46 mSDtfsCounter, 84 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 309 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:09,467 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 785 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 380 Invalid, 0 Unknown, 309 Unchecked, 0.2s Time] [2025-04-30 10:38:09,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-04-30 10:38:09,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 131. [2025-04-30 10:38:09,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 116 states have (on average 1.2586206896551724) internal successors, (146), 130 states have internal predecessors, (146), 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:38:09,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 146 transitions. [2025-04-30 10:38:09,472 INFO L79 Accepts]: Start accepts. Automaton has 131 states and 146 transitions. Word has length 64 [2025-04-30 10:38:09,472 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:09,472 INFO L485 AbstractCegarLoop]: Abstraction has 131 states and 146 transitions. [2025-04-30 10:38:09,472 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.1666666666666665) internal successors, (76), 24 states have internal predecessors, (76), 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:38:09,472 INFO L278 IsEmpty]: Start isEmpty. Operand 131 states and 146 transitions. [2025-04-30 10:38:09,473 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-04-30 10:38:09,473 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:09,474 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:09,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-30 10:38:09,674 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,SelfDestructingSolverStorable11 [2025-04-30 10:38:09,674 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:38:09,675 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:09,675 INFO L85 PathProgramCache]: Analyzing trace with hash -180448149, now seen corresponding path program 1 times [2025-04-30 10:38:09,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:09,675 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510366781] [2025-04-30 10:38:09,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:09,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:09,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-04-30 10:38:09,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-04-30 10:38:09,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:09,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:10,555 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 50 proven. 32 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-04-30 10:38:10,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:10,555 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510366781] [2025-04-30 10:38:10,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510366781] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:38:10,556 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508891420] [2025-04-30 10:38:10,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:10,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:10,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:38:10,558 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:38:10,559 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:38:10,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-04-30 10:38:10,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-04-30 10:38:10,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:10,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:10,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-30 10:38:10,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:38:10,735 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:38:10,761 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:38:10,761 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 11 treesize of output 11 [2025-04-30 10:38:10,775 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-30 10:38:10,795 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 22 [2025-04-30 10:38:10,828 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:38:10,828 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 25 [2025-04-30 10:38:10,836 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:38:10,836 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 25 [2025-04-30 10:38:10,848 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 27 treesize of output 20 [2025-04-30 10:38:10,933 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 60 proven. 10 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-04-30 10:38:10,933 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:38:11,010 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1920 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1920) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) 0)) is different from false [2025-04-30 10:38:11,021 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1920 (Array Int Int)) (v_ArrVal_1919 (Array Int Int))) (or (not (= (let ((.cse0 (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0 (select v_ArrVal_1919 .cse0))) v_ArrVal_1919)) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1919) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1920) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) 0))) is different from false [2025-04-30 10:38:11,042 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1920 (Array Int Int)) (v_ArrVal_1919 (Array Int Int))) (or (not (= (let ((.cse1 (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (store (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0 (select v_ArrVal_1919 .cse0))) .cse1 (select v_ArrVal_1919 .cse1))) v_ArrVal_1919)) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1919) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1920) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) 0))) is different from false [2025-04-30 10:38:11,050 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1920 (Array Int Int)) (v_ArrVal_1919 (Array Int Int))) (or (not (= v_ArrVal_1919 (let ((.cse1 (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (store (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (store (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 16 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0) .cse0 (select v_ArrVal_1919 .cse0))) .cse1 (select v_ArrVal_1919 .cse1))))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1919) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1920) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) 0))) is different from false [2025-04-30 10:38:11,055 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 58 treesize of output 56 [2025-04-30 10:38:11,099 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 60 proven. 5 refuted. 0 times theorem prover too weak. 31 trivial. 5 not checked. [2025-04-30 10:38:11,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1508891420] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:38:11,099 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:38:11,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 16] total 31 [2025-04-30 10:38:11,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836824492] [2025-04-30 10:38:11,099 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:38:11,100 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-30 10:38:11,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:11,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-30 10:38:11,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=630, Unknown=4, NotChecked=212, Total=930 [2025-04-30 10:38:11,100 INFO L87 Difference]: Start difference. First operand 131 states and 146 transitions. Second operand has 31 states, 31 states have (on average 3.2903225806451615) internal successors, (102), 31 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:38:11,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:11,557 INFO L93 Difference]: Finished difference Result 135 states and 148 transitions. [2025-04-30 10:38:11,558 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-30 10:38:11,558 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.2903225806451615) internal successors, (102), 31 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 66 [2025-04-30 10:38:11,558 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:11,558 INFO L225 Difference]: With dead ends: 135 [2025-04-30 10:38:11,559 INFO L226 Difference]: Without dead ends: 135 [2025-04-30 10:38:11,559 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 119 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=203, Invalid=1291, Unknown=4, NotChecked=308, Total=1806 [2025-04-30 10:38:11,559 INFO L437 NwaCegarLoop]: 45 mSDtfsCounter, 104 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 243 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:11,560 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 804 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 461 Invalid, 0 Unknown, 243 Unchecked, 0.2s Time] [2025-04-30 10:38:11,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-04-30 10:38:11,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 131. [2025-04-30 10:38:11,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 116 states have (on average 1.25) internal successors, (145), 130 states have internal predecessors, (145), 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:38:11,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 145 transitions. [2025-04-30 10:38:11,562 INFO L79 Accepts]: Start accepts. Automaton has 131 states and 145 transitions. Word has length 66 [2025-04-30 10:38:11,562 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:11,562 INFO L485 AbstractCegarLoop]: Abstraction has 131 states and 145 transitions. [2025-04-30 10:38:11,562 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.2903225806451615) internal successors, (102), 31 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:38:11,562 INFO L278 IsEmpty]: Start isEmpty. Operand 131 states and 145 transitions. [2025-04-30 10:38:11,563 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-04-30 10:38:11,563 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:11,563 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:11,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-30 10:38:11,763 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:11,764 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-04-30 10:38:11,764 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:11,764 INFO L85 PathProgramCache]: Analyzing trace with hash -160144121, now seen corresponding path program 1 times [2025-04-30 10:38:11,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:11,764 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608348] [2025-04-30 10:38:11,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:11,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:11,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-04-30 10:38:11,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-04-30 10:38:11,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:11,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:11,872 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-04-30 10:38:11,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:11,873 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608348] [2025-04-30 10:38:11,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608348] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:38:11,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:38:11,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:38:11,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752714312] [2025-04-30 10:38:11,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:38:11,873 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:38:11,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:11,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:38:11,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:38:11,874 INFO L87 Difference]: Start difference. First operand 131 states and 145 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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:38:11,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:11,888 INFO L93 Difference]: Finished difference Result 137 states and 151 transitions. [2025-04-30 10:38:11,888 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:38:11,888 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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 66 [2025-04-30 10:38:11,888 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:11,889 INFO L225 Difference]: With dead ends: 137 [2025-04-30 10:38:11,889 INFO L226 Difference]: Without dead ends: 137 [2025-04-30 10:38:11,889 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:38:11,889 INFO L437 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:11,889 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 191 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:38:11,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-04-30 10:38:11,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 134. [2025-04-30 10:38:11,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 119 states have (on average 1.2436974789915967) internal successors, (148), 133 states have internal predecessors, (148), 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:38:11,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 148 transitions. [2025-04-30 10:38:11,892 INFO L79 Accepts]: Start accepts. Automaton has 134 states and 148 transitions. Word has length 66 [2025-04-30 10:38:11,893 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:11,893 INFO L485 AbstractCegarLoop]: Abstraction has 134 states and 148 transitions. [2025-04-30 10:38:11,893 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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:38:11,893 INFO L278 IsEmpty]: Start isEmpty. Operand 134 states and 148 transitions. [2025-04-30 10:38:11,893 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-04-30 10:38:11,893 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:11,893 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 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:38:11,894 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-30 10:38:11,894 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-04-30 10:38:11,894 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:11,894 INFO L85 PathProgramCache]: Analyzing trace with hash -669551833, now seen corresponding path program 1 times [2025-04-30 10:38:11,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:11,894 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967069502] [2025-04-30 10:38:11,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:11,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:11,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-04-30 10:38:11,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-30 10:38:11,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:11,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:12,376 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 56 proven. 8 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-04-30 10:38:12,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:12,376 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967069502] [2025-04-30 10:38:12,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967069502] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:38:12,377 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764776348] [2025-04-30 10:38:12,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:12,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:12,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:38:12,385 INFO L229 MonitoredProcess]: Starting monitored process 8 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:38:12,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-30 10:38:12,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-04-30 10:38:12,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-30 10:38:12,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:12,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:12,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-30 10:38:12,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:38:12,597 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-30 10:38:12,650 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:38:12,651 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 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-30 10:38:12,682 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:38:12,706 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-30 10:38:12,720 INFO L325 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-04-30 10:38:12,720 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2025-04-30 10:38:12,801 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:38:12,801 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 26 treesize of output 20 [2025-04-30 10:38:12,838 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 60 proven. 10 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-04-30 10:38:12,838 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:38:13,140 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:38:13,140 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 28 treesize of output 34 [2025-04-30 10:38:13,146 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:38:13,146 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 39 treesize of output 35 [2025-04-30 10:38:13,152 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 22 treesize of output 18 [2025-04-30 10:38:13,176 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:38:13,176 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 26 treesize of output 32 [2025-04-30 10:38:13,182 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:38:13,182 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 35 treesize of output 33 [2025-04-30 10:38:13,187 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-04-30 10:38:13,348 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 60 proven. 10 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-04-30 10:38:13,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764776348] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:38:13,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:38:13,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 32 [2025-04-30 10:38:13,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551703710] [2025-04-30 10:38:13,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:38:13,349 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-30 10:38:13,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:13,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-30 10:38:13,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=902, Unknown=6, NotChecked=0, Total=992 [2025-04-30 10:38:13,350 INFO L87 Difference]: Start difference. First operand 134 states and 148 transitions. Second operand has 32 states, 32 states have (on average 3.15625) internal successors, (101), 32 states have internal predecessors, (101), 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:38:13,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:13,987 INFO L93 Difference]: Finished difference Result 128 states and 137 transitions. [2025-04-30 10:38:13,988 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-30 10:38:13,988 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.15625) internal successors, (101), 32 states have internal predecessors, (101), 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 67 [2025-04-30 10:38:13,988 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:13,991 INFO L225 Difference]: With dead ends: 128 [2025-04-30 10:38:13,991 INFO L226 Difference]: Without dead ends: 124 [2025-04-30 10:38:13,992 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=265, Invalid=1799, Unknown=6, NotChecked=0, Total=2070 [2025-04-30 10:38:13,992 INFO L437 NwaCegarLoop]: 50 mSDtfsCounter, 58 mSDsluCounter, 930 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:13,992 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 980 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 820 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-30 10:38:13,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-04-30 10:38:13,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 120. [2025-04-30 10:38:13,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 105 states have (on average 1.2380952380952381) internal successors, (130), 119 states have internal predecessors, (130), 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:38:13,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 130 transitions. [2025-04-30 10:38:13,994 INFO L79 Accepts]: Start accepts. Automaton has 120 states and 130 transitions. Word has length 67 [2025-04-30 10:38:13,994 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:13,994 INFO L485 AbstractCegarLoop]: Abstraction has 120 states and 130 transitions. [2025-04-30 10:38:13,994 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.15625) internal successors, (101), 32 states have internal predecessors, (101), 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:38:13,994 INFO L278 IsEmpty]: Start isEmpty. Operand 120 states and 130 transitions. [2025-04-30 10:38:13,994 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-04-30 10:38:13,994 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:13,995 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:14,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-30 10:38:14,195 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:14,195 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-04-30 10:38:14,196 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:14,196 INFO L85 PathProgramCache]: Analyzing trace with hash -94605744, now seen corresponding path program 1 times [2025-04-30 10:38:14,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:14,196 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934086781] [2025-04-30 10:38:14,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:14,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:14,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-04-30 10:38:14,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-30 10:38:14,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:14,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:14,801 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 50 proven. 32 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-04-30 10:38:14,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:14,801 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934086781] [2025-04-30 10:38:14,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934086781] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:38:14,801 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463044950] [2025-04-30 10:38:14,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:14,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:14,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:38:14,803 INFO L229 MonitoredProcess]: Starting monitored process 9 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:38:14,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-30 10:38:14,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-04-30 10:38:15,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-30 10:38:15,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:15,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:15,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 646 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-04-30 10:38:15,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:38:15,011 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:38:15,028 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:38:15,028 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 11 treesize of output 11 [2025-04-30 10:38:15,041 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-30 10:38:15,054 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:38:15,062 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:38:15,068 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:38:15,111 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 60 proven. 10 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-04-30 10:38:15,111 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:38:15,712 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2850 (Array Int Int)) (v_ArrVal_2849 (Array Int Int))) (or (= 0 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2849) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2850) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 16 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (not (= v_ArrVal_2849 (let ((.cse0 (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0 (select v_ArrVal_2849 .cse0))))))) is different from false [2025-04-30 10:38:15,721 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2850 (Array Int Int)) (v_ArrVal_2849 (Array Int Int))) (or (= 0 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2849) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2850) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 16 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (not (= v_ArrVal_2849 (let ((.cse1 (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (store (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0 (select v_ArrVal_2849 .cse0))) .cse1 (select v_ArrVal_2849 .cse1))))))) is different from false [2025-04-30 10:38:15,725 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 53 treesize of output 51 [2025-04-30 10:38:15,728 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-30 10:38:15,759 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 60 proven. 8 refuted. 0 times theorem prover too weak. 31 trivial. 2 not checked. [2025-04-30 10:38:15,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463044950] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:38:15,759 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:38:15,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 14] total 24 [2025-04-30 10:38:15,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51780763] [2025-04-30 10:38:15,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:38:15,759 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-30 10:38:15,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:15,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-30 10:38:15,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=396, Unknown=10, NotChecked=82, Total=552 [2025-04-30 10:38:15,760 INFO L87 Difference]: Start difference. First operand 120 states and 130 transitions. Second operand has 24 states, 24 states have (on average 4.083333333333333) internal successors, (98), 24 states have internal predecessors, (98), 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:38:16,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:16,047 INFO L93 Difference]: Finished difference Result 120 states and 129 transitions. [2025-04-30 10:38:16,047 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-30 10:38:16,048 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.083333333333333) internal successors, (98), 24 states have internal predecessors, (98), 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 68 [2025-04-30 10:38:16,048 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:16,048 INFO L225 Difference]: With dead ends: 120 [2025-04-30 10:38:16,048 INFO L226 Difference]: Without dead ends: 120 [2025-04-30 10:38:16,048 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 129 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=126, Invalid=684, Unknown=10, NotChecked=110, Total=930 [2025-04-30 10:38:16,049 INFO L437 NwaCegarLoop]: 52 mSDtfsCounter, 21 mSDsluCounter, 861 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 78 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:16,049 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 913 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 450 Invalid, 0 Unknown, 78 Unchecked, 0.2s Time] [2025-04-30 10:38:16,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-04-30 10:38:16,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-04-30 10:38:16,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 105 states have (on average 1.2285714285714286) internal successors, (129), 119 states have internal predecessors, (129), 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:38:16,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 129 transitions. [2025-04-30 10:38:16,051 INFO L79 Accepts]: Start accepts. Automaton has 120 states and 129 transitions. Word has length 68 [2025-04-30 10:38:16,051 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:16,051 INFO L485 AbstractCegarLoop]: Abstraction has 120 states and 129 transitions. [2025-04-30 10:38:16,051 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.083333333333333) internal successors, (98), 24 states have internal predecessors, (98), 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:38:16,051 INFO L278 IsEmpty]: Start isEmpty. Operand 120 states and 129 transitions. [2025-04-30 10:38:16,051 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-04-30 10:38:16,052 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:16,052 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:16,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-30 10:38:16,252 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-30 10:38:16,252 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-04-30 10:38:16,252 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:16,253 INFO L85 PathProgramCache]: Analyzing trace with hash -94598896, now seen corresponding path program 1 times [2025-04-30 10:38:16,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:16,253 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771502649] [2025-04-30 10:38:16,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:16,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:16,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-04-30 10:38:16,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-30 10:38:16,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:16,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:17,157 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 60 proven. 27 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-30 10:38:17,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:17,157 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771502649] [2025-04-30 10:38:17,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771502649] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:38:17,158 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968696984] [2025-04-30 10:38:17,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:17,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:17,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:38:17,160 INFO L229 MonitoredProcess]: Starting monitored process 10 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:38:17,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-30 10:38:17,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-04-30 10:38:17,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-30 10:38:17,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:17,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:17,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-04-30 10:38:17,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:38:17,395 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:38:17,398 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:38:17,459 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:38:17,459 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 11 treesize of output 11 [2025-04-30 10:38:17,462 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-04-30 10:38:17,489 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-30 10:38:17,491 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-30 10:38:17,513 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:38:17,518 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 29 treesize of output 13 [2025-04-30 10:38:17,533 INFO L325 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-04-30 10:38:17,534 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-04-30 10:38:17,538 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 13 [2025-04-30 10:38:17,655 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 31 treesize of output 13 [2025-04-30 10:38:17,658 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:38:17,688 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 60 proven. 11 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-04-30 10:38:17,688 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:38:17,843 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_3230 (Array Int Int)) (v_ArrVal_3229 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3230) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3229) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0)))) (forall ((v_ArrVal_3230 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3230) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) 4))))) is different from false [2025-04-30 10:38:17,853 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse1 (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_3230 (Array Int Int)) (v_ArrVal_3225 Int) (v_ArrVal_3226 Int) (v_ArrVal_3229 (Array Int Int))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse0 .cse1 v_ArrVal_3226)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3230) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1 v_ArrVal_3225)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3229) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2)))) (forall ((v_ArrVal_3230 (Array Int Int)) (v_ArrVal_3226 Int)) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse0 .cse1 v_ArrVal_3226)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3230) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) 4))))) is different from false [2025-04-30 10:38:17,861 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:38:17,861 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 29 treesize of output 35 [2025-04-30 10:38:17,862 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 40 treesize of output 28 [2025-04-30 10:38:17,871 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:38:17,871 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 55 treesize of output 61 [2025-04-30 10:38:17,876 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:38:17,876 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 46 [2025-04-30 10:38:17,879 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:38:17,880 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 33 treesize of output 21 [2025-04-30 10:38:17,881 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:38:17,882 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 24 treesize of output 12 [2025-04-30 10:38:18,087 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 60 proven. 8 refuted. 0 times theorem prover too weak. 31 trivial. 3 not checked. [2025-04-30 10:38:18,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968696984] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:38:18,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:38:18,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 12] total 35 [2025-04-30 10:38:18,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496277804] [2025-04-30 10:38:18,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:38:18,088 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-30 10:38:18,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:18,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-30 10:38:18,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1021, Unknown=2, NotChecked=130, Total=1260 [2025-04-30 10:38:18,089 INFO L87 Difference]: Start difference. First operand 120 states and 129 transitions. Second operand has 36 states, 35 states have (on average 3.8) internal successors, (133), 36 states have internal predecessors, (133), 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:38:18,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:18,865 INFO L93 Difference]: Finished difference Result 173 states and 196 transitions. [2025-04-30 10:38:18,866 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-30 10:38:18,866 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 3.8) internal successors, (133), 36 states have internal predecessors, (133), 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 68 [2025-04-30 10:38:18,866 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:18,867 INFO L225 Difference]: With dead ends: 173 [2025-04-30 10:38:18,867 INFO L226 Difference]: Without dead ends: 173 [2025-04-30 10:38:18,867 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 116 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=237, Invalid=1749, Unknown=2, NotChecked=174, Total=2162 [2025-04-30 10:38:18,868 INFO L437 NwaCegarLoop]: 43 mSDtfsCounter, 180 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 1168 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 1476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 274 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:18,868 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 856 Invalid, 1476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1168 Invalid, 0 Unknown, 274 Unchecked, 0.5s Time] [2025-04-30 10:38:18,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-04-30 10:38:18,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 144. [2025-04-30 10:38:18,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 130 states have (on average 1.2384615384615385) internal successors, (161), 143 states have internal predecessors, (161), 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:38:18,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 161 transitions. [2025-04-30 10:38:18,870 INFO L79 Accepts]: Start accepts. Automaton has 144 states and 161 transitions. Word has length 68 [2025-04-30 10:38:18,870 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:18,870 INFO L485 AbstractCegarLoop]: Abstraction has 144 states and 161 transitions. [2025-04-30 10:38:18,870 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 3.8) internal successors, (133), 36 states have internal predecessors, (133), 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:38:18,871 INFO L278 IsEmpty]: Start isEmpty. Operand 144 states and 161 transitions. [2025-04-30 10:38:18,871 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-04-30 10:38:18,871 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:18,871 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:18,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-30 10:38:19,074 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-30 10:38:19,074 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-04-30 10:38:19,074 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:19,074 INFO L85 PathProgramCache]: Analyzing trace with hash -94598897, now seen corresponding path program 1 times [2025-04-30 10:38:19,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:19,074 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294708183] [2025-04-30 10:38:19,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:19,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:19,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-04-30 10:38:19,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-30 10:38:19,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:19,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:19,612 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 50 proven. 33 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-04-30 10:38:19,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:19,613 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294708183] [2025-04-30 10:38:19,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294708183] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:38:19,613 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060664361] [2025-04-30 10:38:19,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:19,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:19,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:38:19,615 INFO L229 MonitoredProcess]: Starting monitored process 11 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:38:19,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-30 10:38:19,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-04-30 10:38:19,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-30 10:38:19,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:19,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:19,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-30 10:38:19,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:38:19,836 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:38:19,848 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:38:19,849 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 11 treesize of output 11 [2025-04-30 10:38:19,861 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-30 10:38:19,874 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:38:19,884 INFO L325 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-04-30 10:38:19,884 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-04-30 10:38:19,961 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 31 treesize of output 13 [2025-04-30 10:38:19,964 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 60 proven. 11 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-04-30 10:38:19,964 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:38:20,046 INFO L325 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2025-04-30 10:38:20,046 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 21 treesize of output 20 [2025-04-30 10:38:20,052 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3603 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3603) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) is different from false [2025-04-30 10:38:20,056 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3602 Int) (v_ArrVal_3603 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_3602)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3603) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) is different from false [2025-04-30 10:38:20,062 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:38:20,062 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 27 treesize of output 33 [2025-04-30 10:38:20,065 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 36 treesize of output 24 [2025-04-30 10:38:20,067 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 7 treesize of output 3 [2025-04-30 10:38:20,104 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 60 proven. 8 refuted. 0 times theorem prover too weak. 31 trivial. 3 not checked. [2025-04-30 10:38:20,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060664361] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:38:20,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:38:20,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 26 [2025-04-30 10:38:20,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714483801] [2025-04-30 10:38:20,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:38:20,104 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-30 10:38:20,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:20,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-30 10:38:20,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=537, Unknown=2, NotChecked=94, Total=702 [2025-04-30 10:38:20,105 INFO L87 Difference]: Start difference. First operand 144 states and 161 transitions. Second operand has 27 states, 26 states have (on average 4.461538461538462) internal successors, (116), 27 states have internal predecessors, (116), 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:38:20,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:20,518 INFO L93 Difference]: Finished difference Result 144 states and 160 transitions. [2025-04-30 10:38:20,518 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-30 10:38:20,519 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 4.461538461538462) internal successors, (116), 27 states have internal predecessors, (116), 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 68 [2025-04-30 10:38:20,519 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:20,519 INFO L225 Difference]: With dead ends: 144 [2025-04-30 10:38:20,519 INFO L226 Difference]: Without dead ends: 144 [2025-04-30 10:38:20,520 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 123 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=1024, Unknown=2, NotChecked=134, Total=1332 [2025-04-30 10:38:20,520 INFO L437 NwaCegarLoop]: 36 mSDtfsCounter, 65 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 186 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:20,520 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 470 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 769 Invalid, 0 Unknown, 186 Unchecked, 0.3s Time] [2025-04-30 10:38:20,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-04-30 10:38:20,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2025-04-30 10:38:20,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 130 states have (on average 1.2307692307692308) internal successors, (160), 143 states have internal predecessors, (160), 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:38:20,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 160 transitions. [2025-04-30 10:38:20,522 INFO L79 Accepts]: Start accepts. Automaton has 144 states and 160 transitions. Word has length 68 [2025-04-30 10:38:20,522 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:20,522 INFO L485 AbstractCegarLoop]: Abstraction has 144 states and 160 transitions. [2025-04-30 10:38:20,523 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 4.461538461538462) internal successors, (116), 27 states have internal predecessors, (116), 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:38:20,523 INFO L278 IsEmpty]: Start isEmpty. Operand 144 states and 160 transitions. [2025-04-30 10:38:20,523 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-04-30 10:38:20,523 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:20,523 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 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:38:20,531 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-30 10:38:20,724 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-04-30 10:38:20,724 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-04-30 10:38:20,724 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:20,724 INFO L85 PathProgramCache]: Analyzing trace with hash -697168844, now seen corresponding path program 1 times [2025-04-30 10:38:20,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:20,724 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718505247] [2025-04-30 10:38:20,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:20,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:20,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-04-30 10:38:20,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-04-30 10:38:20,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:20,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:20,890 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-04-30 10:38:20,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:20,891 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718505247] [2025-04-30 10:38:20,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718505247] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:38:20,891 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2128388385] [2025-04-30 10:38:20,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:20,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:20,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:38:20,894 INFO L229 MonitoredProcess]: Starting monitored process 12 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:38:20,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-30 10:38:21,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-04-30 10:38:21,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-04-30 10:38:21,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:21,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:21,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-30 10:38:21,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:38:21,146 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-04-30 10:38:21,157 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-04-30 10:38:21,168 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-04-30 10:38:21,181 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-04-30 10:38:21,192 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-04-30 10:38:21,215 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:38:21,215 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 11 treesize of output 11 [2025-04-30 10:38:21,217 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2025-04-30 10:38:21,217 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:38:21,309 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2025-04-30 10:38:21,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2128388385] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:38:21,309 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:38:21,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 5 [2025-04-30 10:38:21,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078397351] [2025-04-30 10:38:21,310 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:38:21,310 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:38:21,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:21,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:38:21,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:38:21,311 INFO L87 Difference]: Start difference. First operand 144 states and 160 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 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:38:21,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:21,346 INFO L93 Difference]: Finished difference Result 144 states and 158 transitions. [2025-04-30 10:38:21,346 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:38:21,346 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 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 71 [2025-04-30 10:38:21,347 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:21,347 INFO L225 Difference]: With dead ends: 144 [2025-04-30 10:38:21,347 INFO L226 Difference]: Without dead ends: 144 [2025-04-30 10:38:21,347 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 140 SyntacticMatches, 5 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:38:21,347 INFO L437 NwaCegarLoop]: 38 mSDtfsCounter, 127 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:21,348 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 44 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:38:21,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-04-30 10:38:21,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2025-04-30 10:38:21,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 130 states have (on average 1.2153846153846153) internal successors, (158), 143 states have internal predecessors, (158), 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:38:21,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 158 transitions. [2025-04-30 10:38:21,350 INFO L79 Accepts]: Start accepts. Automaton has 144 states and 158 transitions. Word has length 71 [2025-04-30 10:38:21,350 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:21,350 INFO L485 AbstractCegarLoop]: Abstraction has 144 states and 158 transitions. [2025-04-30 10:38:21,350 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 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:38:21,350 INFO L278 IsEmpty]: Start isEmpty. Operand 144 states and 158 transitions. [2025-04-30 10:38:21,350 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-04-30 10:38:21,351 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:21,351 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:21,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-30 10:38:21,551 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:21,551 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-04-30 10:38:21,551 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:21,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1654200433, now seen corresponding path program 1 times [2025-04-30 10:38:21,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:21,552 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322655486] [2025-04-30 10:38:21,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:21,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:21,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-04-30 10:38:21,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-04-30 10:38:21,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:21,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:22,662 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 67 proven. 37 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:38:22,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:22,662 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322655486] [2025-04-30 10:38:22,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322655486] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:38:22,662 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570505347] [2025-04-30 10:38:22,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:22,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:22,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:38:22,664 INFO L229 MonitoredProcess]: Starting monitored process 13 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:38:22,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-30 10:38:22,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-04-30 10:38:22,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-04-30 10:38:22,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:22,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:22,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 678 conjuncts, 75 conjuncts are in the unsatisfiable core [2025-04-30 10:38:22,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:38:22,904 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:38:22,927 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-30 10:38:22,927 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:38:22,956 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-30 10:38:22,985 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-30 10:38:22,995 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 19 treesize of output 18 [2025-04-30 10:38:23,027 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-04-30 10:38:23,041 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-04-30 10:38:23,059 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 16 [2025-04-30 10:38:23,148 INFO L325 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-04-30 10:38:23,149 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 16 treesize of output 18 [2025-04-30 10:38:23,176 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 16 [2025-04-30 10:38:23,189 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 16 [2025-04-30 10:38:23,197 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 16 [2025-04-30 10:38:23,205 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-30 10:38:23,207 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 16 [2025-04-30 10:38:23,211 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-30 10:38:23,240 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 16 [2025-04-30 10:38:23,249 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:38:23,252 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 29 treesize of output 13 [2025-04-30 10:38:23,272 INFO L325 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-04-30 10:38:23,272 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 101 [2025-04-30 10:38:23,276 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:38:23,284 INFO L325 Elim1Store]: treesize reduction 33, result has 36.5 percent of original size [2025-04-30 10:38:23,284 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 1 case distinctions, treesize of input 64 treesize of output 39 [2025-04-30 10:38:23,287 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 13 [2025-04-30 10:38:23,529 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 68 treesize of output 44 [2025-04-30 10:38:23,532 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 39 treesize of output 21 [2025-04-30 10:38:23,607 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 73 proven. 25 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-30 10:38:23,607 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:38:23,796 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4367 (Array Int Int)) (v_ArrVal_4368 (Array Int Int)) (v_ArrVal_4369 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_4368) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0))) (or (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_4369) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_4367) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0)) .cse1) 0) (< .cse1 0) (not (= v_ArrVal_4369 (let ((.cse2 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse2 (select v_ArrVal_4369 .cse2))))))))) is different from false [2025-04-30 10:38:23,821 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4362 (Array Int Int)) (v_ArrVal_4367 (Array Int Int)) (v_ArrVal_4368 (Array Int Int)) (v_ArrVal_4369 (Array Int Int)) (v_ArrVal_4365 Int) (v_ArrVal_4363 Int)) (let ((.cse2 (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4362)) (.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2 v_ArrVal_4363)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_4368) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3))) (or (not (= v_ArrVal_4369 (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12))) (store (select .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse1 (select v_ArrVal_4369 .cse1))))) (= (select (select (store .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_4369) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2 v_ArrVal_4365)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_4367) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3)) .cse4) 0) (< .cse4 0))))) is different from false [2025-04-30 10:38:23,847 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:38:23,848 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 61 treesize of output 67 [2025-04-30 10:38:23,856 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 104 treesize of output 92 [2025-04-30 10:38:23,861 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 45 treesize of output 41 [2025-04-30 10:38:23,872 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:38:23,873 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 103 treesize of output 78 [2025-04-30 10:38:23,877 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 120 treesize of output 96 [2025-04-30 10:38:23,883 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 35 treesize of output 27 [2025-04-30 10:38:24,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:24,746 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:24,753 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:29,877 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse3 (not (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (.cse0 (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 16 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)) (.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse2 (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (and (or (forall ((v_ArrVal_4353 (Array Int Int)) (v_ArrVal_4354 (Array Int Int)) (v_arrayElimCell_97 Int)) (or (not (= (store (store .cse0 .cse1 (select v_ArrVal_4353 .cse1)) .cse2 (select v_ArrVal_4353 .cse2)) v_ArrVal_4353)) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4353) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_4354) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_arrayElimCell_97) 0) (< v_arrayElimCell_97 0) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_arrayElimCell_97))) (forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_80| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_80|) 0)) (= |v_ULTIMATE.start_dll_create_~new_head~0#1.base_80| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_prenex_33 Int) (v_prenex_30 Int)) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_31) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_prenex_32) v_prenex_30) v_prenex_33) 0) (< v_prenex_33 0))) .cse3) (or .cse3 (and (forall ((v_arrayElimCell_96 Int) (v_prenex_21 (Array Int Int)) (v_prenex_22 Int) (v_ArrVal_4369 (Array Int Int)) (v_arrayElimCell_98 Int)) (or (< v_arrayElimCell_98 0) (= (select v_ArrVal_4369 v_prenex_22) 0) (= 0 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_21) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4369) v_arrayElimCell_96) v_arrayElimCell_98)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_22))) (forall ((v_prenex_19 (Array Int Int)) (v_prenex_17 Int) (v_prenex_20 Int) (v_prenex_18 (Array Int Int))) (or (< v_prenex_20 0) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_18) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_prenex_19) v_prenex_17) v_prenex_20) 0))))) (forall ((v_prenex_27 Int) (v_ArrVal_4362 (Array Int Int)) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_57| Int) (v_prenex_29 Int) (v_prenex_28 Int) (v_prenex_23 Int) (v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (v_prenex_26 (Array Int Int))) (or (< |v_ULTIMATE.start_dll_create_~head~0#1.offset_57| v_prenex_29) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_create_~head~0#1.offset_57|) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_25) v_prenex_27 v_ArrVal_4362) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_prenex_26) v_prenex_23) v_prenex_28) 0) (not (= (let ((.cse4 (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_57| 12))) (store (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_prenex_24) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_25) v_prenex_27 v_ArrVal_4362) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4 (select v_prenex_26 .cse4))) v_prenex_26)) (not (= (store (store .cse0 .cse1 (select v_prenex_24 .cse1)) .cse2 (select v_prenex_24 .cse2)) v_prenex_24)) (< v_prenex_29 0) (= (select v_prenex_26 v_prenex_29) 0) (< v_prenex_28 0) (not (= (select |c_#valid| v_prenex_27) 0)))))) is different from false [2025-04-30 10:38:34,391 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 52 treesize of output 48 [2025-04-30 10:38:34,395 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 48 treesize of output 44 [2025-04-30 10:38:34,398 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 22 treesize of output 20 [2025-04-30 10:38:34,414 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 61 treesize of output 59 [2025-04-30 10:38:34,420 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 9 treesize of output 7 [2025-04-30 10:38:34,426 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:38:34,427 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:38:34,427 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:38:34,428 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:38:34,429 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 19 treesize of output 17 [2025-04-30 10:38:34,443 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:38:34,463 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:38:34,463 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 1043 treesize of output 1033 [2025-04-30 10:38:34,512 INFO L325 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2025-04-30 10:38:34,512 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 92 treesize of output 106 [2025-04-30 10:38:34,523 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 53 treesize of output 49 [2025-04-30 10:38:34,642 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:38:34,642 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:38:34,643 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:38:34,643 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:38:34,644 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:38:34,644 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:38:34,663 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:38:34,663 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 15 [2025-04-30 10:38:34,684 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:38:34,684 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:38:34,725 INFO L325 Elim1Store]: treesize reduction 50, result has 30.6 percent of original size [2025-04-30 10:38:34,725 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 22 [2025-04-30 10:38:34,744 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:38:34,745 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:38:34,745 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:38:34,746 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:38:34,746 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:38:34,746 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:38:34,761 INFO L325 Elim1Store]: treesize reduction 14, result has 6.7 percent of original size [2025-04-30 10:38:34,762 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 1 [2025-04-30 10:38:34,830 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:38:34,907 INFO L325 Elim1Store]: treesize reduction 263, result has 29.7 percent of original size [2025-04-30 10:38:34,907 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 159 treesize of output 223 [2025-04-30 10:38:35,087 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:38:35,148 INFO L325 Elim1Store]: treesize reduction 28, result has 71.1 percent of original size [2025-04-30 10:38:35,149 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 199 treesize of output 243 [2025-04-30 10:38:35,623 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:38:35,625 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:38:35,643 INFO L325 Elim1Store]: treesize reduction 77, result has 11.5 percent of original size [2025-04-30 10:38:35,644 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 12 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 179 treesize of output 165 [2025-04-30 10:38:35,683 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:35,701 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:38:35,701 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 92 treesize of output 96 [2025-04-30 10:38:35,744 INFO L325 Elim1Store]: treesize reduction 11, result has 42.1 percent of original size [2025-04-30 10:38:35,744 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 40 treesize of output 40 [2025-04-30 10:38:36,074 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 65 proven. 18 refuted. 7 times theorem prover too weak. 11 trivial. 8 not checked. [2025-04-30 10:38:36,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570505347] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:38:36,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:38:36,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 23] total 53 [2025-04-30 10:38:36,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318377760] [2025-04-30 10:38:36,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:38:36,075 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-04-30 10:38:36,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:36,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-04-30 10:38:36,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=2231, Unknown=30, NotChecked=294, Total=2756 [2025-04-30 10:38:36,076 INFO L87 Difference]: Start difference. First operand 144 states and 158 transitions. Second operand has 53 states, 53 states have (on average 3.169811320754717) internal successors, (168), 53 states have internal predecessors, (168), 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:38:38,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:38,381 INFO L93 Difference]: Finished difference Result 154 states and 167 transitions. [2025-04-30 10:38:38,381 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-30 10:38:38,381 INFO L79 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.169811320754717) internal successors, (168), 53 states have internal predecessors, (168), 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 78 [2025-04-30 10:38:38,381 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:38,382 INFO L225 Difference]: With dead ends: 154 [2025-04-30 10:38:38,382 INFO L226 Difference]: Without dead ends: 154 [2025-04-30 10:38:38,383 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 130 SyntacticMatches, 7 SemanticMatches, 77 ConstructedPredicates, 3 IntricatePredicates, 2 DeprecatedPredicates, 1140 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=777, Invalid=4905, Unknown=30, NotChecked=450, Total=6162 [2025-04-30 10:38:38,383 INFO L437 NwaCegarLoop]: 51 mSDtfsCounter, 126 mSDsluCounter, 1345 mSDsCounter, 0 mSdLazyCounter, 1614 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 1396 SdHoareTripleChecker+Invalid, 1943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 293 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:38,383 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 1396 Invalid, 1943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1614 Invalid, 0 Unknown, 293 Unchecked, 1.0s Time] [2025-04-30 10:38:38,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-04-30 10:38:38,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 144. [2025-04-30 10:38:38,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 130 states have (on average 1.2076923076923076) internal successors, (157), 143 states have internal predecessors, (157), 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:38:38,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 157 transitions. [2025-04-30 10:38:38,389 INFO L79 Accepts]: Start accepts. Automaton has 144 states and 157 transitions. Word has length 78 [2025-04-30 10:38:38,389 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:38,389 INFO L485 AbstractCegarLoop]: Abstraction has 144 states and 157 transitions. [2025-04-30 10:38:38,389 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 3.169811320754717) internal successors, (168), 53 states have internal predecessors, (168), 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:38:38,389 INFO L278 IsEmpty]: Start isEmpty. Operand 144 states and 157 transitions. [2025-04-30 10:38:38,390 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-04-30 10:38:38,390 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:38,390 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:38,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-30 10:38:38,591 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:38,591 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-04-30 10:38:38,591 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:38,591 INFO L85 PathProgramCache]: Analyzing trace with hash 527156982, now seen corresponding path program 1 times [2025-04-30 10:38:38,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:38,591 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156130892] [2025-04-30 10:38:38,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:38,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:38,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-04-30 10:38:38,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-04-30 10:38:38,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:38,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:39,789 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 65 proven. 41 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:38:39,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:39,789 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156130892] [2025-04-30 10:38:39,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156130892] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:38:39,789 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773651024] [2025-04-30 10:38:39,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:39,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:39,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:38:39,792 INFO L229 MonitoredProcess]: Starting monitored process 14 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:38:39,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-30 10:38:39,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-04-30 10:38:40,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-04-30 10:38:40,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:40,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:40,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 76 conjuncts are in the unsatisfiable core [2025-04-30 10:38:40,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:38:40,042 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:38:40,060 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-30 10:38:40,060 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:38:40,096 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-30 10:38:40,124 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 19 treesize of output 18 [2025-04-30 10:38:40,158 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-04-30 10:38:40,171 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-04-30 10:38:40,189 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 16 [2025-04-30 10:38:40,260 INFO L325 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-04-30 10:38:40,261 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 16 treesize of output 18 [2025-04-30 10:38:40,288 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 16 [2025-04-30 10:38:40,296 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 16 [2025-04-30 10:38:40,305 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 16 [2025-04-30 10:38:40,312 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-30 10:38:40,317 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 16 [2025-04-30 10:38:40,322 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-30 10:38:40,360 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:38:40,365 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 29 treesize of output 13 [2025-04-30 10:38:40,369 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 16 [2025-04-30 10:38:40,394 INFO L325 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-04-30 10:38:40,395 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 101 [2025-04-30 10:38:40,400 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:38:40,410 INFO L325 Elim1Store]: treesize reduction 33, result has 36.5 percent of original size [2025-04-30 10:38:40,410 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 1 case distinctions, treesize of input 64 treesize of output 39 [2025-04-30 10:38:40,414 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 13 [2025-04-30 10:38:40,665 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 68 treesize of output 44 [2025-04-30 10:38:40,668 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 39 treesize of output 21 [2025-04-30 10:38:40,764 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 71 proven. 29 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-30 10:38:40,764 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:38:40,941 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4760 (Array Int Int)) (v_ArrVal_4758 (Array Int Int)) (v_ArrVal_4759 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_4760) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2))) (or (not (= (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse0 (select v_ArrVal_4758 .cse0))) v_ArrVal_4758)) (< .cse1 0) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_4758) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_4759) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2)) (+ .cse1 8)) 0))))) is different from false [2025-04-30 10:38:40,958 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4760 (Array Int Int)) (v_ArrVal_4755 Int) (v_ArrVal_4753 Int) (v_ArrVal_4757 (Array Int Int)) (v_ArrVal_4758 (Array Int Int)) (v_ArrVal_4759 (Array Int Int))) (let ((.cse2 (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2 v_ArrVal_4753)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_4760) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3)) (.cse1 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4757))) (or (< .cse0 0) (= (select (select (store .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_4758) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2 v_ArrVal_4755)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_4759) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3)) (+ .cse0 8)) 0) (not (= v_ArrVal_4758 (let ((.cse4 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12))) (store (select .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse4 (select v_ArrVal_4758 .cse4))))))))) is different from false [2025-04-30 10:38:40,969 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:38:40,969 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 63 treesize of output 69 [2025-04-30 10:38:40,976 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 108 treesize of output 96 [2025-04-30 10:38:40,980 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 47 treesize of output 43 [2025-04-30 10:38:40,994 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:38:40,994 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 107 treesize of output 82 [2025-04-30 10:38:40,998 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 128 treesize of output 104 [2025-04-30 10:38:41,001 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 37 treesize of output 29 [2025-04-30 10:38:41,788 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:41,797 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:41,820 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:42,920 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 16 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)) (.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse3 (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (.cse4 (not (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0)))) (and (forall ((v_prenex_55 Int) (|v_ULTIMATE.start_dll_create_~new_head~0#1.base_87| Int) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_63| Int) (v_ArrVal_4744 (Array Int Int)) (v_prenex_57 (Array Int Int)) (v_arrayElimCell_156 Int) (v_prenex_56 (Array Int Int)) (v_prenex_54 Int) (v_ArrVal_4757 (Array Int Int))) (or (< v_arrayElimCell_156 0) (not (= (let ((.cse0 (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_63| 12))) (store (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4744) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_56) |v_ULTIMATE.start_dll_create_~new_head~0#1.base_87| v_ArrVal_4757) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0 (select v_prenex_57 .cse0))) v_prenex_57)) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_56) |v_ULTIMATE.start_dll_create_~new_head~0#1.base_87| v_ArrVal_4757) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_prenex_57) v_prenex_54) (+ v_prenex_55 8)) 0) (< |v_ULTIMATE.start_dll_create_~head~0#1.offset_63| v_arrayElimCell_156) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_create_~head~0#1.offset_63|) (= (select v_prenex_57 (+ v_arrayElimCell_156 8)) 0) (not (= (store (store .cse1 .cse2 (select v_ArrVal_4744 .cse2)) .cse3 (select v_ArrVal_4744 .cse3)) v_ArrVal_4744)) (< v_prenex_55 0) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_87|) 0)))) (or (forall ((v_prenex_61 (Array Int Int)) (v_prenex_59 (Array Int Int)) (v_prenex_60 Int)) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_prenex_59) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_61) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ v_prenex_60 8)) 0) (not (= v_prenex_59 (store (store .cse1 .cse2 (select v_prenex_59 .cse2)) .cse3 (select v_prenex_59 .cse3)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_60) (< v_prenex_60 0))) (forall ((v_prenex_58 Int)) (or (not (= (select |c_#valid| v_prenex_58) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_prenex_58)))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) .cse4 (forall ((v_arrayElimCell_155 Int) (v_arrayElimCell_157 Int) (v_ArrVal_4745 (Array Int Int)) (v_ArrVal_4758 (Array Int Int))) (or (< v_arrayElimCell_157 0) (= 0 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_4745) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4758) v_arrayElimCell_155) (+ v_arrayElimCell_157 8)))))) (or (and (forall ((v_prenex_65 (Array Int Int)) (v_prenex_63 Int) (v_prenex_62 Int) (v_prenex_66 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_65) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_prenex_66) v_prenex_62) (+ v_prenex_63 8)) 0) (< v_prenex_63 0))) (forall ((v_prenex_53 (Array Int Int)) (v_prenex_52 (Array Int Int)) (v_prenex_51 Int) (v_prenex_64 Int) (v_prenex_50 Int)) (or (< v_prenex_51 0) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_52) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_prenex_53) v_prenex_50) (+ v_prenex_51 8)) 0) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_64) (= (select v_prenex_53 (+ v_prenex_64 8)) 0)))) .cse4))) is different from false [2025-04-30 10:38:42,951 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:38:42,951 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 658 treesize of output 656 [2025-04-30 10:38:42,993 INFO L325 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2025-04-30 10:38:42,993 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 145 treesize of output 146 [2025-04-30 10:38:43,039 INFO L325 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2025-04-30 10:38:43,039 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 148 treesize of output 162 [2025-04-30 10:38:43,185 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:38:43,203 INFO L325 Elim1Store]: treesize reduction 36, result has 40.0 percent of original size [2025-04-30 10:38:43,203 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 24 [2025-04-30 10:38:43,214 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:38:43,215 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:38:43,215 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:38:43,223 INFO L325 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2025-04-30 10:38:43,223 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 1 [2025-04-30 10:38:43,228 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:38:43,242 INFO L325 Elim1Store]: treesize reduction 75, result has 1.3 percent of original size [2025-04-30 10:38:43,242 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 1 [2025-04-30 10:38:43,299 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:38:43,363 INFO L325 Elim1Store]: treesize reduction 204, result has 32.2 percent of original size [2025-04-30 10:38:43,363 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 208 treesize of output 259 [2025-04-30 10:38:43,383 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:38:43,383 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 53 treesize of output 55 [2025-04-30 10:38:43,448 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:38:43,448 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 85 treesize of output 87 [2025-04-30 10:38:43,532 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:38:43,532 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 85 treesize of output 87 [2025-04-30 10:38:44,093 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:38:44,102 INFO L325 Elim1Store]: treesize reduction 19, result has 34.5 percent of original size [2025-04-30 10:38:44,102 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 50 [2025-04-30 10:38:44,125 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:38:44,164 INFO L325 Elim1Store]: treesize reduction 18, result has 76.6 percent of original size [2025-04-30 10:38:44,165 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 76 treesize of output 110 [2025-04-30 10:38:44,411 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:38:44,448 INFO L325 Elim1Store]: treesize reduction 18, result has 76.6 percent of original size [2025-04-30 10:38:44,448 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 110 treesize of output 140 [2025-04-30 10:38:44,779 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:38:44,794 INFO L325 Elim1Store]: treesize reduction 19, result has 34.5 percent of original size [2025-04-30 10:38:44,794 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 50 [2025-04-30 10:38:44,846 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:38:44,847 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:38:44,856 INFO L325 Elim1Store]: treesize reduction 15, result has 21.1 percent of original size [2025-04-30 10:38:44,856 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 44 [2025-04-30 10:38:44,907 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:38:44,918 INFO L325 Elim1Store]: treesize reduction 19, result has 34.5 percent of original size [2025-04-30 10:38:44,918 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 50 [2025-04-30 10:38:44,971 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:38:44,972 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:38:44,998 INFO L325 Elim1Store]: treesize reduction 11, result has 47.6 percent of original size [2025-04-30 10:38:44,998 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 50 [2025-04-30 10:38:45,052 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:38:45,054 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:38:45,058 INFO L325 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2025-04-30 10:38:45,059 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 40 [2025-04-30 10:38:45,096 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:38:45,096 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 28 treesize of output 20 [2025-04-30 10:38:45,115 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:38:45,115 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 28 treesize of output 30 [2025-04-30 10:38:45,145 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:38:45,146 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 28 treesize of output 20 [2025-04-30 10:38:45,177 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:38:45,177 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 28 treesize of output 30 [2025-04-30 10:38:45,318 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:38:45,318 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 28 treesize of output 30 [2025-04-30 10:38:45,350 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:38:45,350 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 28 treesize of output 30 [2025-04-30 10:38:45,377 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:38:45,377 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 28 treesize of output 20 [2025-04-30 10:38:45,401 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:38:45,401 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 28 treesize of output 30 [2025-04-30 10:38:45,693 INFO L325 Elim1Store]: treesize reduction 10, result has 77.8 percent of original size [2025-04-30 10:38:45,693 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 121 treesize of output 119 [2025-04-30 10:38:45,820 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 58 treesize of output 56 [2025-04-30 10:38:45,825 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:38:45,826 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:38:45,827 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 111 treesize of output 103 [2025-04-30 10:38:45,831 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-30 10:38:45,843 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 130 treesize of output 118 [2025-04-30 10:38:45,846 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 25 treesize of output 21 [2025-04-30 10:38:45,848 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 20 [2025-04-30 10:38:46,116 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 64 proven. 22 refuted. 6 times theorem prover too weak. 11 trivial. 8 not checked. [2025-04-30 10:38:46,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773651024] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:38:46,116 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:38:46,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 24] total 54 [2025-04-30 10:38:46,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020596988] [2025-04-30 10:38:46,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:38:46,116 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-04-30 10:38:46,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:46,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-04-30 10:38:46,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=2329, Unknown=23, NotChecked=300, Total=2862 [2025-04-30 10:38:46,118 INFO L87 Difference]: Start difference. First operand 144 states and 157 transitions. Second operand has 54 states, 54 states have (on average 3.1481481481481484) internal successors, (170), 54 states have internal predecessors, (170), 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:38:48,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:48,061 INFO L93 Difference]: Finished difference Result 154 states and 166 transitions. [2025-04-30 10:38:48,061 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-30 10:38:48,061 INFO L79 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 3.1481481481481484) internal successors, (170), 54 states have internal predecessors, (170), 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 80 [2025-04-30 10:38:48,062 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:48,062 INFO L225 Difference]: With dead ends: 154 [2025-04-30 10:38:48,062 INFO L226 Difference]: Without dead ends: 154 [2025-04-30 10:38:48,063 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 134 SyntacticMatches, 6 SemanticMatches, 76 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1299 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=690, Invalid=4849, Unknown=23, NotChecked=444, Total=6006 [2025-04-30 10:38:48,063 INFO L437 NwaCegarLoop]: 50 mSDtfsCounter, 104 mSDsluCounter, 1205 mSDsCounter, 0 mSdLazyCounter, 1474 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 1255 SdHoareTripleChecker+Invalid, 1803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 290 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:48,064 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 1255 Invalid, 1803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1474 Invalid, 0 Unknown, 290 Unchecked, 0.9s Time] [2025-04-30 10:38:48,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-04-30 10:38:48,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 144. [2025-04-30 10:38:48,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 130 states have (on average 1.2) internal successors, (156), 143 states have internal predecessors, (156), 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:38:48,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 156 transitions. [2025-04-30 10:38:48,066 INFO L79 Accepts]: Start accepts. Automaton has 144 states and 156 transitions. Word has length 80 [2025-04-30 10:38:48,066 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:48,066 INFO L485 AbstractCegarLoop]: Abstraction has 144 states and 156 transitions. [2025-04-30 10:38:48,067 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 3.1481481481481484) internal successors, (170), 54 states have internal predecessors, (170), 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:38:48,067 INFO L278 IsEmpty]: Start isEmpty. Operand 144 states and 156 transitions. [2025-04-30 10:38:48,067 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-04-30 10:38:48,067 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:48,067 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:48,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-30 10:38:48,267 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-04-30 10:38:48,267 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-04-30 10:38:48,268 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:48,268 INFO L85 PathProgramCache]: Analyzing trace with hash -208629252, now seen corresponding path program 1 times [2025-04-30 10:38:48,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:48,268 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13675623] [2025-04-30 10:38:48,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:48,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:48,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-04-30 10:38:48,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-04-30 10:38:48,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:48,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:49,312 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 64 proven. 34 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:38:49,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:49,312 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13675623] [2025-04-30 10:38:49,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13675623] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:38:49,313 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641865053] [2025-04-30 10:38:49,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:49,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:49,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:38:49,314 INFO L229 MonitoredProcess]: Starting monitored process 15 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:38:49,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-30 10:38:49,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-04-30 10:38:49,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-04-30 10:38:49,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:49,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:49,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 694 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-04-30 10:38:49,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:38:49,597 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-30 10:38:49,658 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-30 10:38:49,658 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-04-30 10:38:49,714 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:38:49,754 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-30 10:38:49,775 INFO L325 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-04-30 10:38:49,775 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 39 [2025-04-30 10:38:49,836 INFO L325 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2025-04-30 10:38:49,837 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2025-04-30 10:38:49,875 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 33 treesize of output 24 [2025-04-30 10:38:49,884 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 33 treesize of output 24 [2025-04-30 10:38:49,894 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 33 treesize of output 24 [2025-04-30 10:38:49,904 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 38 treesize of output 29 [2025-04-30 10:38:49,912 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 19 treesize of output 1 [2025-04-30 10:38:49,947 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:38:49,952 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 32 [2025-04-30 10:38:49,989 INFO L325 Elim1Store]: treesize reduction 56, result has 29.1 percent of original size [2025-04-30 10:38:49,989 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 3 case distinctions, treesize of input 104 treesize of output 59 [2025-04-30 10:38:49,993 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 30 treesize of output 13 [2025-04-30 10:38:50,410 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 112 treesize of output 94 [2025-04-30 10:38:50,696 INFO L325 Elim1Store]: treesize reduction 30, result has 83.6 percent of original size [2025-04-30 10:38:50,696 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 138 treesize of output 208 [2025-04-30 10:38:51,379 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 60 proven. 32 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-30 10:38:51,379 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:38:52,047 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:38:52,047 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 250 treesize of output 270 [2025-04-30 10:38:52,053 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 259 treesize of output 247 [2025-04-30 10:38:52,056 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 258 treesize of output 246 [2025-04-30 10:38:52,057 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 242 treesize of output 238 [2025-04-30 10:38:52,059 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 238 treesize of output 234 [2025-04-30 10:38:52,325 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:38:52,325 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 2 case distinctions, treesize of input 88 treesize of output 65 [2025-04-30 10:38:52,335 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:38:52,335 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 2 case distinctions, treesize of input 86 treesize of output 63 [2025-04-30 10:38:52,345 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:38:52,345 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 2 case distinctions, treesize of input 88 treesize of output 65 [2025-04-30 10:38:52,475 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:38:52,475 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 2 case distinctions, treesize of input 86 treesize of output 63 [2025-04-30 10:38:52,484 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:38:52,484 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 2 case distinctions, treesize of input 88 treesize of output 65 [2025-04-30 10:38:52,497 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:38:52,497 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 2 case distinctions, treesize of input 88 treesize of output 65 [2025-04-30 10:38:56,826 INFO L325 Elim1Store]: treesize reduction 33, result has 53.5 percent of original size [2025-04-30 10:38:56,826 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 67 treesize of output 89 [2025-04-30 10:38:56,884 INFO L325 Elim1Store]: treesize reduction 35, result has 53.3 percent of original size [2025-04-30 10:38:56,885 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 71 treesize of output 93 [2025-04-30 10:38:56,899 INFO L325 Elim1Store]: treesize reduction 19, result has 34.5 percent of original size [2025-04-30 10:38:56,900 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 76 treesize of output 70 [2025-04-30 10:38:57,501 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:38:57,501 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 33 treesize of output 39 [2025-04-30 10:38:57,503 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:38:57,508 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:38:57,508 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 47 treesize of output 41 [2025-04-30 10:38:57,512 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 37 treesize of output 25 [2025-04-30 10:38:57,514 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 18 [2025-04-30 10:38:57,529 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:38:57,529 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 35 treesize of output 41 [2025-04-30 10:38:57,532 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:38:57,538 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:38:57,538 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 51 treesize of output 43 [2025-04-30 10:38:57,544 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 39 treesize of output 27 [2025-04-30 10:38:57,547 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 22 treesize of output 18 [2025-04-30 10:38:57,936 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 60 proven. 32 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-30 10:38:57,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641865053] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:38:57,937 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:38:57,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18, 21] total 55 [2025-04-30 10:38:57,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908972841] [2025-04-30 10:38:57,937 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:38:57,937 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-04-30 10:38:57,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:57,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-04-30 10:38:57,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=2773, Unknown=26, NotChecked=0, Total=2970 [2025-04-30 10:38:57,938 INFO L87 Difference]: Start difference. First operand 144 states and 156 transitions. Second operand has 55 states, 55 states have (on average 3.309090909090909) internal successors, (182), 55 states have internal predecessors, (182), 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:39:00,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:00,746 INFO L93 Difference]: Finished difference Result 141 states and 149 transitions. [2025-04-30 10:39:00,748 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-30 10:39:00,748 INFO L79 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 3.309090909090909) internal successors, (182), 55 states have internal predecessors, (182), 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 81 [2025-04-30 10:39:00,748 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:00,749 INFO L225 Difference]: With dead ends: 141 [2025-04-30 10:39:00,749 INFO L226 Difference]: Without dead ends: 137 [2025-04-30 10:39:00,750 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 135 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1270 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=560, Invalid=5420, Unknown=26, NotChecked=0, Total=6006 [2025-04-30 10:39:00,751 INFO L437 NwaCegarLoop]: 55 mSDtfsCounter, 77 mSDsluCounter, 1669 mSDsCounter, 0 mSdLazyCounter, 1947 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 1724 SdHoareTripleChecker+Invalid, 1976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:00,752 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 1724 Invalid, 1976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1947 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-04-30 10:39:00,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-04-30 10:39:00,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 130. [2025-04-30 10:39:00,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 116 states have (on average 1.1896551724137931) internal successors, (138), 129 states have internal predecessors, (138), 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:39:00,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 138 transitions. [2025-04-30 10:39:00,754 INFO L79 Accepts]: Start accepts. Automaton has 130 states and 138 transitions. Word has length 81 [2025-04-30 10:39:00,754 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:00,754 INFO L485 AbstractCegarLoop]: Abstraction has 130 states and 138 transitions. [2025-04-30 10:39:00,754 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 3.309090909090909) internal successors, (182), 55 states have internal predecessors, (182), 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:39:00,755 INFO L278 IsEmpty]: Start isEmpty. Operand 130 states and 138 transitions. [2025-04-30 10:39:00,755 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-04-30 10:39:00,755 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:00,755 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:39:00,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-04-30 10:39:00,955 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:39:00,956 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-04-30 10:39:00,956 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:00,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1309092379, now seen corresponding path program 1 times [2025-04-30 10:39:00,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:39:00,956 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186182678] [2025-04-30 10:39:00,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:00,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:39:00,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-04-30 10:39:00,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-04-30 10:39:00,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:00,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:02,158 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 64 proven. 44 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:39:02,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:39:02,159 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186182678] [2025-04-30 10:39:02,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186182678] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:39:02,160 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410762032] [2025-04-30 10:39:02,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:02,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:39:02,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:39:02,162 INFO L229 MonitoredProcess]: Starting monitored process 16 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:39:02,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-30 10:39:02,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-04-30 10:39:02,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-04-30 10:39:02,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:02,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:02,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 692 conjuncts, 69 conjuncts are in the unsatisfiable core [2025-04-30 10:39:02,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:39:02,432 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:39:02,451 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-30 10:39:02,452 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:39:02,492 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-30 10:39:02,521 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-30 10:39:02,529 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-30 10:39:02,539 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:39:02,603 INFO L325 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-04-30 10:39:02,603 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 16 treesize of output 18 [2025-04-30 10:39:02,636 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:39:02,643 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:39:02,647 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:39:02,654 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-30 10:39:02,656 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:39:02,659 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-30 10:39:02,688 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:39:02,691 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 29 treesize of output 13 [2025-04-30 10:39:02,694 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:39:02,711 INFO L325 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-04-30 10:39:02,711 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 90 [2025-04-30 10:39:02,714 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:39:02,714 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 51 treesize of output 17 [2025-04-30 10:39:02,716 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 13 [2025-04-30 10:39:02,862 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-04-30 10:39:02,864 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 33 treesize of output 15 [2025-04-30 10:39:02,951 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 70 proven. 32 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-30 10:39:02,951 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:39:03,143 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5534 (Array Int Int)) (v_ArrVal_5533 (Array Int Int)) (v_ArrVal_5535 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_5534) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0))) (or (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_5535) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_5533) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0)) (+ 16 .cse1)) 0) (< .cse1 0) (not (= (let ((.cse2 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse2 (select v_ArrVal_5535 .cse2))) v_ArrVal_5535)))))) is different from false [2025-04-30 10:39:03,161 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5530 (Array Int Int)) (v_ArrVal_5529 Int) (v_ArrVal_5528 Int) (v_ArrVal_5534 (Array Int Int)) (v_ArrVal_5533 (Array Int Int)) (v_ArrVal_5535 (Array Int Int))) (let ((.cse2 (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_5530)) (.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2 v_ArrVal_5529)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_5534) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3))) (or (not (= v_ArrVal_5535 (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12))) (store (select .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse1 (select v_ArrVal_5535 .cse1))))) (= (select (select (store .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_5535) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2 v_ArrVal_5528)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_5533) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3)) (+ .cse4 16)) 0) (< .cse4 0))))) is different from false [2025-04-30 10:39:03,174 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:39:03,174 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 63 treesize of output 69 [2025-04-30 10:39:03,179 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 108 treesize of output 96 [2025-04-30 10:39:03,183 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 47 treesize of output 43 [2025-04-30 10:39:03,191 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:39:03,191 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 107 treesize of output 82 [2025-04-30 10:39:03,196 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 128 treesize of output 104 [2025-04-30 10:39:03,200 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 37 treesize of output 29 [2025-04-30 10:39:04,523 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:39:04,532 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:39:04,540 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 Killed by 15