./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-regression/mutex_lock_struct.c_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 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 ../sv-benchmarks/c/ldv-regression/mutex_lock_struct.c_1.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 ef3dcd2558e22d4d1b628613d50eb3ab943d89de0514f54496f8c445070b9e01 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:52:18,008 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:52:18,057 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 11:52:18,061 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:52:18,061 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:52:18,085 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:52:18,085 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:52:18,085 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:52:18,087 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 11:52:18,087 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 11:52:18,087 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:52:18,088 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:52:18,088 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:52:18,088 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:52:18,088 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:52:18,088 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:52:18,088 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:52:18,088 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:52:18,088 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:52:18,088 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:52:18,088 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 11:52:18,088 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 11:52:18,088 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 11:52:18,088 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:52:18,088 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 11:52:18,088 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:52:18,088 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:52:18,089 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:52:18,089 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:52:18,089 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:52:18,089 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:52:18,089 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 11:52:18,089 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:52:18,089 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:52:18,089 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:52:18,089 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:52:18,089 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:52:18,089 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:52:18,089 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:52:18,089 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:52:18,089 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:52:18,089 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:52:18,089 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 -> ef3dcd2558e22d4d1b628613d50eb3ab943d89de0514f54496f8c445070b9e01 [2025-03-17 11:52:18,355 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:52:18,363 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:52:18,365 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:52:18,366 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:52:18,367 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:52:18,368 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/mutex_lock_struct.c_1.i [2025-03-17 11:52:19,547 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/981411f28/31aa07c250cb4afcb02705649ca8670d/FLAGf92ed6982 [2025-03-17 11:52:19,791 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:52:19,797 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/mutex_lock_struct.c_1.i [2025-03-17 11:52:19,827 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/981411f28/31aa07c250cb4afcb02705649ca8670d/FLAGf92ed6982 [2025-03-17 11:52:20,127 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/981411f28/31aa07c250cb4afcb02705649ca8670d [2025-03-17 11:52:20,129 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:52:20,130 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:52:20,132 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:52:20,132 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:52:20,135 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:52:20,136 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:52:20" (1/1) ... [2025-03-17 11:52:20,138 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19211522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:52:20, skipping insertion in model container [2025-03-17 11:52:20,138 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:52:20" (1/1) ... [2025-03-17 11:52:20,149 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:52:20,247 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:52:20,256 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:52:20,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:52:20,277 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:52:20,278 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:52:20 WrapperNode [2025-03-17 11:52:20,278 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:52:20,279 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:52:20,279 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:52:20,279 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:52:20,284 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:52:20" (1/1) ... [2025-03-17 11:52:20,289 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:52:20" (1/1) ... [2025-03-17 11:52:20,299 INFO L138 Inliner]: procedures = 15, calls = 19, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 33 [2025-03-17 11:52:20,301 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:52:20,302 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:52:20,302 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:52:20,302 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:52:20,307 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:52:20" (1/1) ... [2025-03-17 11:52:20,307 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:52:20" (1/1) ... [2025-03-17 11:52:20,312 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:52:20" (1/1) ... [2025-03-17 11:52:20,323 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-03-17 11:52:20,323 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:52:20" (1/1) ... [2025-03-17 11:52:20,324 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:52:20" (1/1) ... [2025-03-17 11:52:20,328 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:52:20" (1/1) ... [2025-03-17 11:52:20,330 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:52:20" (1/1) ... [2025-03-17 11:52:20,333 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:52:20" (1/1) ... [2025-03-17 11:52:20,333 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:52:20" (1/1) ... [2025-03-17 11:52:20,334 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:52:20,337 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:52:20,337 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:52:20,337 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:52:20,338 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:52:20" (1/1) ... [2025-03-17 11:52:20,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:52:20,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:52:20,366 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-03-17 11:52:20,368 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-03-17 11:52:20,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:52:20,386 INFO L130 BoogieDeclarations]: Found specification of procedure err [2025-03-17 11:52:20,386 INFO L138 BoogieDeclarations]: Found implementation of procedure err [2025-03-17 11:52:20,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 11:52:20,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 11:52:20,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 11:52:20,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 11:52:20,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 11:52:20,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:52:20,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:52:20,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 11:52:20,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 11:52:20,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 11:52:20,440 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:52:20,442 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:52:20,583 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2025-03-17 11:52:20,584 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:52:20,593 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:52:20,593 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:52:20,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:52:20 BoogieIcfgContainer [2025-03-17 11:52:20,595 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:52:20,597 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:52:20,597 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:52:20,602 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:52:20,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:52:20" (1/3) ... [2025-03-17 11:52:20,603 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e7a70d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:52:20, skipping insertion in model container [2025-03-17 11:52:20,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:52:20" (2/3) ... [2025-03-17 11:52:20,604 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e7a70d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:52:20, skipping insertion in model container [2025-03-17 11:52:20,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:52:20" (3/3) ... [2025-03-17 11:52:20,605 INFO L128 eAbstractionObserver]: Analyzing ICFG mutex_lock_struct.c_1.i [2025-03-17 11:52:20,617 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:52:20,619 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mutex_lock_struct.c_1.i that has 2 procedures, 32 locations, 1 initial locations, 0 loop locations, and 12 error locations. [2025-03-17 11:52:20,650 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:52:20,659 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@5203d090, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:52:20,659 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-03-17 11:52:20,663 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 16 states have (on average 1.875) internal successors, (30), 30 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 11:52:20,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-03-17 11:52:20,668 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:52:20,669 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-03-17 11:52:20,669 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [errErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2025-03-17 11:52:20,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:52:20,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1919, now seen corresponding path program 1 times [2025-03-17 11:52:20,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:52:20,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452762465] [2025-03-17 11:52:20,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:52:20,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:52:20,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 11:52:20,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 11:52:20,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:52:20,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:52:20,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:52:20,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:52:20,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452762465] [2025-03-17 11:52:20,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452762465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:52:20,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:52:20,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 11:52:20,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604670438] [2025-03-17 11:52:20,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:52:20,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:52:20,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:52:20,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:52:20,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:52:20,894 INFO L87 Difference]: Start difference. First operand has 32 states, 16 states have (on average 1.875) internal successors, (30), 30 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-03-17 11:52:20,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:52:20,946 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2025-03-17 11:52:20,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:52:20,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2025-03-17 11:52:20,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:52:20,953 INFO L225 Difference]: With dead ends: 29 [2025-03-17 11:52:20,953 INFO L226 Difference]: Without dead ends: 27 [2025-03-17 11:52:20,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-03-17 11:52:20,956 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 19 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:52:20,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 19 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:52:20,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-17 11:52:20,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-03-17 11:52:20,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 25 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:52:20,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2025-03-17 11:52:20,981 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 2 [2025-03-17 11:52:20,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:52:20,982 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2025-03-17 11:52:20,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-03-17 11:52:20,982 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2025-03-17 11:52:20,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-03-17 11:52:20,982 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:52:20,982 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-03-17 11:52:20,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:52:20,983 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [errErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2025-03-17 11:52:20,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:52:20,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1920, now seen corresponding path program 1 times [2025-03-17 11:52:20,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:52:20,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747709288] [2025-03-17 11:52:20,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:52:20,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:52:20,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 11:52:20,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 11:52:20,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:52:20,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:52:21,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:52:21,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:52:21,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747709288] [2025-03-17 11:52:21,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747709288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:52:21,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:52:21,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 11:52:21,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991217338] [2025-03-17 11:52:21,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:52:21,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:52:21,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:52:21,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:52:21,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:52:21,078 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-03-17 11:52:21,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:52:21,118 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2025-03-17 11:52:21,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:52:21,118 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2025-03-17 11:52:21,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:52:21,118 INFO L225 Difference]: With dead ends: 26 [2025-03-17 11:52:21,118 INFO L226 Difference]: Without dead ends: 26 [2025-03-17 11:52:21,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-03-17 11:52:21,119 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 10 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:52:21,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 27 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:52:21,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-17 11:52:21,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-03-17 11:52:21,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 24 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:52:21,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2025-03-17 11:52:21,122 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 2 [2025-03-17 11:52:21,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:52:21,122 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2025-03-17 11:52:21,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-03-17 11:52:21,122 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2025-03-17 11:52:21,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 11:52:21,122 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:52:21,122 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 11:52:21,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:52:21,123 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [errErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2025-03-17 11:52:21,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:52:21,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1844028, now seen corresponding path program 1 times [2025-03-17 11:52:21,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:52:21,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641261950] [2025-03-17 11:52:21,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:52:21,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:52:21,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 11:52:21,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 11:52:21,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:52:21,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:52:21,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:52:21,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:52:21,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641261950] [2025-03-17 11:52:21,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641261950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:52:21,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:52:21,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:52:21,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290306737] [2025-03-17 11:52:21,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:52:21,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:52:21,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:52:21,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:52:21,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:52:21,178 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:52:21,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:52:21,233 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2025-03-17 11:52:21,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:52:21,234 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-17 11:52:21,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:52:21,235 INFO L225 Difference]: With dead ends: 24 [2025-03-17 11:52:21,235 INFO L226 Difference]: Without dead ends: 24 [2025-03-17 11:52:21,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:52:21,236 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 19 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:52:21,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 20 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:52:21,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-17 11:52:21,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-03-17 11:52:21,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 22 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:52:21,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2025-03-17 11:52:21,239 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 4 [2025-03-17 11:52:21,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:52:21,239 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2025-03-17 11:52:21,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:52:21,239 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2025-03-17 11:52:21,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 11:52:21,239 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:52:21,240 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 11:52:21,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:52:21,240 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [errErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2025-03-17 11:52:21,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:52:21,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1844029, now seen corresponding path program 1 times [2025-03-17 11:52:21,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:52:21,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000908952] [2025-03-17 11:52:21,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:52:21,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:52:21,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 11:52:21,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 11:52:21,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:52:21,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:52:21,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:52:21,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:52:21,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000908952] [2025-03-17 11:52:21,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000908952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:52:21,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:52:21,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:52:21,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975776264] [2025-03-17 11:52:21,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:52:21,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:52:21,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:52:21,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:52:21,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:52:21,395 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:52:21,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:52:21,434 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2025-03-17 11:52:21,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:52:21,435 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-17 11:52:21,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:52:21,435 INFO L225 Difference]: With dead ends: 22 [2025-03-17 11:52:21,435 INFO L226 Difference]: Without dead ends: 22 [2025-03-17 11:52:21,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:52:21,436 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 8 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:52:21,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 34 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:52:21,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-17 11:52:21,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-03-17 11:52:21,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 20 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:52:21,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2025-03-17 11:52:21,439 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 4 [2025-03-17 11:52:21,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:52:21,439 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2025-03-17 11:52:21,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:52:21,439 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2025-03-17 11:52:21,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-17 11:52:21,439 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:52:21,439 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:52:21,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:52:21,439 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errErr0ASSERT_VIOLATIONMEMORY_LEAK === [errErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2025-03-17 11:52:21,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:52:21,440 INFO L85 PathProgramCache]: Analyzing trace with hash -2103699097, now seen corresponding path program 1 times [2025-03-17 11:52:21,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:52:21,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589328943] [2025-03-17 11:52:21,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:52:21,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:52:21,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 11:52:21,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 11:52:21,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:52:21,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:52:21,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:52:21,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:52:21,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589328943] [2025-03-17 11:52:21,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589328943] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:52:21,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:52:21,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:52:21,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542782854] [2025-03-17 11:52:21,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:52:21,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:52:21,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:52:21,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:52:21,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:52:21,520 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:52:21,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:52:21,560 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2025-03-17 11:52:21,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:52:21,560 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-17 11:52:21,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:52:21,561 INFO L225 Difference]: With dead ends: 21 [2025-03-17 11:52:21,561 INFO L226 Difference]: Without dead ends: 21 [2025-03-17 11:52:21,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:52:21,562 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 5 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:52:21,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 53 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:52:21,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-17 11:52:21,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-03-17 11:52:21,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 19 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:52:21,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 20 transitions. [2025-03-17 11:52:21,563 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 20 transitions. Word has length 8 [2025-03-17 11:52:21,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:52:21,564 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 20 transitions. [2025-03-17 11:52:21,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:52:21,564 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 20 transitions. [2025-03-17 11:52:21,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-17 11:52:21,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:52:21,568 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:52:21,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:52:21,568 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [errErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2025-03-17 11:52:21,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:52:21,568 INFO L85 PathProgramCache]: Analyzing trace with hash -2103685196, now seen corresponding path program 1 times [2025-03-17 11:52:21,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:52:21,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003288592] [2025-03-17 11:52:21,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:52:21,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:52:21,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 11:52:21,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 11:52:21,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:52:21,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:52:21,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:52:21,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:52:21,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003288592] [2025-03-17 11:52:21,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003288592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:52:21,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:52:21,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:52:21,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893821127] [2025-03-17 11:52:21,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:52:21,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:52:21,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:52:21,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:52:21,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:52:21,645 INFO L87 Difference]: Start difference. First operand 21 states and 20 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 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-03-17 11:52:21,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:52:21,686 INFO L93 Difference]: Finished difference Result 19 states and 18 transitions. [2025-03-17 11:52:21,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:52:21,687 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 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 8 [2025-03-17 11:52:21,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:52:21,687 INFO L225 Difference]: With dead ends: 19 [2025-03-17 11:52:21,687 INFO L226 Difference]: Without dead ends: 19 [2025-03-17 11:52:21,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:52:21,688 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 12 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:52:21,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 19 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:52:21,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-03-17 11:52:21,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-03-17 11:52:21,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 17 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:52:21,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 18 transitions. [2025-03-17 11:52:21,689 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 18 transitions. Word has length 8 [2025-03-17 11:52:21,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:52:21,689 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 18 transitions. [2025-03-17 11:52:21,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 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-03-17 11:52:21,689 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 18 transitions. [2025-03-17 11:52:21,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-17 11:52:21,690 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:52:21,690 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:52:21,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:52:21,690 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [errErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2025-03-17 11:52:21,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:52:21,690 INFO L85 PathProgramCache]: Analyzing trace with hash -2103685195, now seen corresponding path program 1 times [2025-03-17 11:52:21,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:52:21,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136195532] [2025-03-17 11:52:21,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:52:21,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:52:21,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 11:52:21,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 11:52:21,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:52:21,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:52:21,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:52:21,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:52:21,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136195532] [2025-03-17 11:52:21,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136195532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:52:21,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:52:21,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:52:21,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304469604] [2025-03-17 11:52:21,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:52:21,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:52:21,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:52:21,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:52:21,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:52:21,783 INFO L87 Difference]: Start difference. First operand 19 states and 18 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-03-17 11:52:21,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:52:21,801 INFO L93 Difference]: Finished difference Result 17 states and 16 transitions. [2025-03-17 11:52:21,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:52:21,802 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2025-03-17 11:52:21,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:52:21,802 INFO L225 Difference]: With dead ends: 17 [2025-03-17 11:52:21,802 INFO L226 Difference]: Without dead ends: 17 [2025-03-17 11:52:21,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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-03-17 11:52:21,803 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 3 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:52:21,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 18 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:52:21,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-03-17 11:52:21,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2025-03-17 11:52:21,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 15 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:52:21,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 16 transitions. [2025-03-17 11:52:21,804 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 16 transitions. Word has length 8 [2025-03-17 11:52:21,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:52:21,804 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 16 transitions. [2025-03-17 11:52:21,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-03-17 11:52:21,805 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 16 transitions. [2025-03-17 11:52:21,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-17 11:52:21,805 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:52:21,805 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:52:21,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:52:21,805 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errErr0ASSERT_VIOLATIONMEMORY_LEAK === [errErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2025-03-17 11:52:21,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:52:21,806 INFO L85 PathProgramCache]: Analyzing trace with hash 935114407, now seen corresponding path program 1 times [2025-03-17 11:52:21,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:52:21,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112835526] [2025-03-17 11:52:21,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:52:21,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:52:21,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 11:52:21,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 11:52:21,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:52:21,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:52:21,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:52:21,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:52:21,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112835526] [2025-03-17 11:52:21,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112835526] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:52:21,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:52:21,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 11:52:21,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782784950] [2025-03-17 11:52:21,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:52:21,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:52:21,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:52:21,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:52:21,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:52:21,878 INFO L87 Difference]: Start difference. First operand 17 states and 16 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:52:21,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:52:21,909 INFO L93 Difference]: Finished difference Result 13 states and 12 transitions. [2025-03-17 11:52:21,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:52:21,910 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-17 11:52:21,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:52:21,910 INFO L225 Difference]: With dead ends: 13 [2025-03-17 11:52:21,910 INFO L226 Difference]: Without dead ends: 13 [2025-03-17 11:52:21,910 INFO L434 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-03-17 11:52:21,911 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 2 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:52:21,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 18 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:52:21,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-03-17 11:52:21,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-03-17 11:52:21,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.0) internal successors, (12), 12 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:52:21,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 12 transitions. [2025-03-17 11:52:21,912 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 12 transitions. Word has length 12 [2025-03-17 11:52:21,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:52:21,913 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 12 transitions. [2025-03-17 11:52:21,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:52:21,913 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 12 transitions. [2025-03-17 11:52:21,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-17 11:52:21,913 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:52:21,913 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:52:21,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:52:21,913 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [errErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2025-03-17 11:52:21,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:52:21,914 INFO L85 PathProgramCache]: Analyzing trace with hash 935120301, now seen corresponding path program 1 times [2025-03-17 11:52:21,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:52:21,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554902324] [2025-03-17 11:52:21,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:52:21,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:52:21,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 11:52:21,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 11:52:21,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:52:21,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:52:22,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:52:22,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:52:22,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554902324] [2025-03-17 11:52:22,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554902324] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:52:22,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:52:22,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:52:22,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080123215] [2025-03-17 11:52:22,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:52:22,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:52:22,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:52:22,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:52:22,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:52:22,003 INFO L87 Difference]: Start difference. First operand 13 states and 12 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:52:22,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:52:22,018 INFO L93 Difference]: Finished difference Result 12 states and 11 transitions. [2025-03-17 11:52:22,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:52:22,019 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-17 11:52:22,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:52:22,019 INFO L225 Difference]: With dead ends: 12 [2025-03-17 11:52:22,019 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 11:52:22,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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-03-17 11:52:22,020 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:52:22,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:52:22,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 11:52:22,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 11:52:22,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-03-17 11:52:22,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 11:52:22,021 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2025-03-17 11:52:22,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:52:22,021 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 11:52:22,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:52:22,022 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 11:52:22,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 11:52:22,024 INFO L782 garLoopResultBuilder]: Registering result SAFE for location errErr0ASSERT_VIOLATIONMEMORY_LEAK (11 of 12 remaining) [2025-03-17 11:52:22,025 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (10 of 12 remaining) [2025-03-17 11:52:22,025 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 12 remaining) [2025-03-17 11:52:22,025 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 12 remaining) [2025-03-17 11:52:22,025 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 12 remaining) [2025-03-17 11:52:22,025 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 12 remaining) [2025-03-17 11:52:22,025 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 12 remaining) [2025-03-17 11:52:22,026 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 12 remaining) [2025-03-17 11:52:22,026 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 12 remaining) [2025-03-17 11:52:22,026 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 12 remaining) [2025-03-17 11:52:22,026 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 12 remaining) [2025-03-17 11:52:22,026 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 12 remaining) [2025-03-17 11:52:22,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 11:52:22,029 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:52:22,031 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 11:52:22,033 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 11:52:22 BoogieIcfgContainer [2025-03-17 11:52:22,033 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 11:52:22,034 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 11:52:22,034 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 11:52:22,034 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 11:52:22,035 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:52:20" (3/4) ... [2025-03-17 11:52:22,036 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 11:52:22,039 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure err [2025-03-17 11:52:22,043 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-03-17 11:52:22,043 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-17 11:52:22,043 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 11:52:22,043 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-17 11:52:22,097 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 11:52:22,097 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 11:52:22,097 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 11:52:22,098 INFO L158 Benchmark]: Toolchain (without parser) took 1967.18ms. Allocated memory is still 142.6MB. Free memory was 112.6MB in the beginning and 104.4MB in the end (delta: 8.2MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. [2025-03-17 11:52:22,099 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 124.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:52:22,099 INFO L158 Benchmark]: CACSL2BoogieTranslator took 146.62ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 101.8MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 11:52:22,099 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.75ms. Allocated memory is still 142.6MB. Free memory was 101.8MB in the beginning and 100.8MB in the end (delta: 976.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:52:22,099 INFO L158 Benchmark]: Boogie Preprocessor took 32.21ms. Allocated memory is still 142.6MB. Free memory was 100.8MB in the beginning and 99.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:52:22,099 INFO L158 Benchmark]: IcfgBuilder took 257.79ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 87.2MB in the end (delta: 12.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 11:52:22,099 INFO L158 Benchmark]: TraceAbstraction took 1436.45ms. Allocated memory is still 142.6MB. Free memory was 86.7MB in the beginning and 110.0MB in the end (delta: -23.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:52:22,099 INFO L158 Benchmark]: Witness Printer took 62.97ms. Allocated memory is still 142.6MB. Free memory was 110.0MB in the beginning and 104.4MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 11:52:22,100 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 124.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 146.62ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 101.8MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.75ms. Allocated memory is still 142.6MB. Free memory was 101.8MB in the beginning and 100.8MB in the end (delta: 976.7kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.21ms. Allocated memory is still 142.6MB. Free memory was 100.8MB in the beginning and 99.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 257.79ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 87.2MB in the end (delta: 12.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1436.45ms. Allocated memory is still 142.6MB. Free memory was 86.7MB in the beginning and 110.0MB in the end (delta: -23.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 62.97ms. Allocated memory is still 142.6MB. Free memory was 110.0MB in the beginning and 104.4MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 3]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 33]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 32 locations, 36 edges, 12 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 78 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 78 mSDsluCounter, 213 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 107 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 207 IncrementalHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 106 mSDtfsCounter, 207 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=0, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 60 NumberOfCodeBlocks, 60 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 51 ConstructedInterpolants, 0 QuantifiedInterpolants, 275 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 12 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-17 11:52:22,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE