./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/locks/test_locks_15-1.c --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/locks/test_locks_15-1.c -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 11a9c91fdf6b42598924d9a4ae5a3db9994a05118a3b564c2bd29b9bad4177b0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 12:21:48,068 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 12:21:48,130 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 12:21:48,137 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 12:21:48,138 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 12:21:48,153 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 12:21:48,154 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 12:21:48,154 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 12:21:48,154 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 12:21:48,154 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 12:21:48,155 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 12:21:48,155 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 12:21:48,155 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 12:21:48,155 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 12:21:48,155 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 12:21:48,156 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 12:21:48,156 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 12:21:48,156 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 12:21:48,156 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 12:21:48,156 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 12:21:48,156 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 12:21:48,156 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 12:21:48,156 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 12:21:48,156 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 12:21:48,156 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 12:21:48,156 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 12:21:48,156 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 12:21:48,156 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 12:21:48,156 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 12:21:48,156 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 12:21:48,157 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 12:21:48,157 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 12:21:48,157 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 12:21:48,157 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 12:21:48,157 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 12:21:48,157 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 12:21:48,157 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 12:21:48,157 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 12:21:48,157 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 12:21:48,157 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 12:21:48,157 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 12:21:48,157 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 12:21:48,157 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 -> 11a9c91fdf6b42598924d9a4ae5a3db9994a05118a3b564c2bd29b9bad4177b0 [2025-03-17 12:21:48,394 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 12:21:48,403 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 12:21:48,405 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 12:21:48,407 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 12:21:48,408 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 12:21:48,409 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_15-1.c [2025-03-17 12:21:49,623 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f77a0e2bf/5b76c80ecd254079b0863fb4084f8120/FLAG9fde90606 [2025-03-17 12:21:49,839 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 12:21:49,847 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_15-1.c [2025-03-17 12:21:49,855 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f77a0e2bf/5b76c80ecd254079b0863fb4084f8120/FLAG9fde90606 [2025-03-17 12:21:49,872 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f77a0e2bf/5b76c80ecd254079b0863fb4084f8120 [2025-03-17 12:21:49,873 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 12:21:49,874 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 12:21:49,875 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 12:21:49,875 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 12:21:49,879 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 12:21:49,880 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:21:49" (1/1) ... [2025-03-17 12:21:49,881 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41826497 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:49, skipping insertion in model container [2025-03-17 12:21:49,881 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:21:49" (1/1) ... [2025-03-17 12:21:49,896 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 12:21:50,021 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 12:21:50,033 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 12:21:50,054 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 12:21:50,067 INFO L204 MainTranslator]: Completed translation [2025-03-17 12:21:50,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:50 WrapperNode [2025-03-17 12:21:50,067 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 12:21:50,068 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 12:21:50,068 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 12:21:50,068 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 12:21:50,072 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:50" (1/1) ... [2025-03-17 12:21:50,079 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:50" (1/1) ... [2025-03-17 12:21:50,099 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 208 [2025-03-17 12:21:50,103 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 12:21:50,104 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 12:21:50,104 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 12:21:50,104 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 12:21:50,110 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:50" (1/1) ... [2025-03-17 12:21:50,110 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:50" (1/1) ... [2025-03-17 12:21:50,111 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:50" (1/1) ... [2025-03-17 12:21:50,121 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 12:21:50,121 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:50" (1/1) ... [2025-03-17 12:21:50,121 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:50" (1/1) ... [2025-03-17 12:21:50,123 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:50" (1/1) ... [2025-03-17 12:21:50,124 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:50" (1/1) ... [2025-03-17 12:21:50,125 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:50" (1/1) ... [2025-03-17 12:21:50,125 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:50" (1/1) ... [2025-03-17 12:21:50,126 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 12:21:50,127 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 12:21:50,127 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 12:21:50,127 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 12:21:50,130 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:50" (1/1) ... [2025-03-17 12:21:50,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 12:21:50,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:21:50,158 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 12:21:50,161 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 12:21:50,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 12:21:50,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 12:21:50,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 12:21:50,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 12:21:50,229 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 12:21:50,230 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 12:21:50,501 INFO L? ?]: Removed 38 outVars from TransFormulas that were not future-live. [2025-03-17 12:21:50,502 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 12:21:50,508 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 12:21:50,509 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 12:21:50,509 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:21:50 BoogieIcfgContainer [2025-03-17 12:21:50,509 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 12:21:50,510 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 12:21:50,510 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 12:21:50,515 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 12:21:50,515 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:21:49" (1/3) ... [2025-03-17 12:21:50,516 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4db410d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:21:50, skipping insertion in model container [2025-03-17 12:21:50,516 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:50" (2/3) ... [2025-03-17 12:21:50,516 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4db410d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:21:50, skipping insertion in model container [2025-03-17 12:21:50,516 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:21:50" (3/3) ... [2025-03-17 12:21:50,517 INFO L128 eAbstractionObserver]: Analyzing ICFG test_locks_15-1.c [2025-03-17 12:21:50,530 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 12:21:50,531 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test_locks_15-1.c that has 1 procedures, 56 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2025-03-17 12:21:50,559 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 12:21:50,566 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;@2418c251, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 12:21:50,567 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-17 12:21:50,571 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 53 states have (on average 1.9245283018867925) internal successors, (102), 55 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:50,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 12:21:50,574 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:50,574 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 12:21:50,575 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:50,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:50,578 INFO L85 PathProgramCache]: Analyzing trace with hash 5597082, now seen corresponding path program 1 times [2025-03-17 12:21:50,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:50,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416127621] [2025-03-17 12:21:50,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:50,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:50,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 12:21:50,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 12:21:50,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:50,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:50,691 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 12:21:50,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:50,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416127621] [2025-03-17 12:21:50,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416127621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:50,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:50,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:21:50,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258590511] [2025-03-17 12:21:50,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:50,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 12:21:50,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:50,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 12:21:50,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 12:21:50,722 INFO L87 Difference]: Start difference. First operand has 56 states, 53 states have (on average 1.9245283018867925) internal successors, (102), 55 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 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 12:21:50,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:50,733 INFO L93 Difference]: Finished difference Result 56 states and 100 transitions. [2025-03-17 12:21:50,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 12:21:50,734 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 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 12:21:50,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:50,738 INFO L225 Difference]: With dead ends: 56 [2025-03-17 12:21:50,739 INFO L226 Difference]: Without dead ends: 54 [2025-03-17 12:21:50,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 12:21:50,742 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:21:50,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:50,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-17 12:21:50,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-03-17 12:21:50,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 52 states have (on average 1.8846153846153846) internal successors, (98), 53 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:50,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 98 transitions. [2025-03-17 12:21:50,765 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 98 transitions. Word has length 4 [2025-03-17 12:21:50,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:50,766 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 98 transitions. [2025-03-17 12:21:50,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 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 12:21:50,766 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 98 transitions. [2025-03-17 12:21:50,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 12:21:50,766 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:50,766 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 12:21:50,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 12:21:50,767 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:50,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:50,767 INFO L85 PathProgramCache]: Analyzing trace with hash 173614478, now seen corresponding path program 1 times [2025-03-17 12:21:50,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:50,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849417717] [2025-03-17 12:21:50,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:50,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:50,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 12:21:50,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 12:21:50,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:50,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:50,832 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 12:21:50,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:50,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849417717] [2025-03-17 12:21:50,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849417717] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:50,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:50,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 12:21:50,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412262647] [2025-03-17 12:21:50,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:50,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:50,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:50,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:50,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:50,837 INFO L87 Difference]: Start difference. First operand 54 states and 98 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:50,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:50,842 INFO L93 Difference]: Finished difference Result 53 states and 97 transitions. [2025-03-17 12:21:50,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:50,842 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-17 12:21:50,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:50,843 INFO L225 Difference]: With dead ends: 53 [2025-03-17 12:21:50,843 INFO L226 Difference]: Without dead ends: 51 [2025-03-17 12:21:50,843 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 12:21:50,844 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 93 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:21:50,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:50,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-17 12:21:50,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-03-17 12:21:50,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.9) internal successors, (95), 50 states have internal predecessors, (95), 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 12:21:50,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 95 transitions. [2025-03-17 12:21:50,847 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 95 transitions. Word has length 5 [2025-03-17 12:21:50,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:50,847 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 95 transitions. [2025-03-17 12:21:50,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:50,848 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 95 transitions. [2025-03-17 12:21:50,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-17 12:21:50,848 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:50,848 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:50,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 12:21:50,848 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:50,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:50,849 INFO L85 PathProgramCache]: Analyzing trace with hash -232750167, now seen corresponding path program 1 times [2025-03-17 12:21:50,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:50,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255342424] [2025-03-17 12:21:50,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:50,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:50,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 12:21:50,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 12:21:50,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:50,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:50,929 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 12:21:50,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:50,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255342424] [2025-03-17 12:21:50,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255342424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:50,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:50,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:50,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758254498] [2025-03-17 12:21:50,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:50,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:50,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:50,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:50,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:50,930 INFO L87 Difference]: Start difference. First operand 51 states and 95 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:50,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:50,956 INFO L93 Difference]: Finished difference Result 100 states and 185 transitions. [2025-03-17 12:21:50,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:50,957 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-03-17 12:21:50,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:50,958 INFO L225 Difference]: With dead ends: 100 [2025-03-17 12:21:50,958 INFO L226 Difference]: Without dead ends: 100 [2025-03-17 12:21:50,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:50,958 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 75 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:21:50,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 186 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:50,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-17 12:21:50,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2025-03-17 12:21:50,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.90625) internal successors, (183), 96 states have internal predecessors, (183), 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 12:21:50,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 183 transitions. [2025-03-17 12:21:50,968 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 183 transitions. Word has length 22 [2025-03-17 12:21:50,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:50,968 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 183 transitions. [2025-03-17 12:21:50,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:50,968 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 183 transitions. [2025-03-17 12:21:50,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-17 12:21:50,968 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:50,968 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:50,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 12:21:50,968 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:50,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:50,969 INFO L85 PathProgramCache]: Analyzing trace with hash -232723259, now seen corresponding path program 1 times [2025-03-17 12:21:50,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:50,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118525921] [2025-03-17 12:21:50,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:50,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:50,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 12:21:50,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 12:21:50,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:50,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:51,040 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 12:21:51,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:51,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118525921] [2025-03-17 12:21:51,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118525921] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:51,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:51,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:51,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457874821] [2025-03-17 12:21:51,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:51,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:51,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:51,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:51,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:51,042 INFO L87 Difference]: Start difference. First operand 97 states and 183 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:51,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:51,073 INFO L93 Difference]: Finished difference Result 136 states and 250 transitions. [2025-03-17 12:21:51,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:51,077 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-03-17 12:21:51,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:51,078 INFO L225 Difference]: With dead ends: 136 [2025-03-17 12:21:51,078 INFO L226 Difference]: Without dead ends: 136 [2025-03-17 12:21:51,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:51,079 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 77 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:21:51,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 136 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:51,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-03-17 12:21:51,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 133. [2025-03-17 12:21:51,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.878787878787879) internal successors, (248), 132 states have internal predecessors, (248), 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 12:21:51,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 248 transitions. [2025-03-17 12:21:51,089 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 248 transitions. Word has length 22 [2025-03-17 12:21:51,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:51,089 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 248 transitions. [2025-03-17 12:21:51,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:51,090 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 248 transitions. [2025-03-17 12:21:51,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-17 12:21:51,090 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:51,090 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:51,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 12:21:51,090 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:51,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:51,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1229795612, now seen corresponding path program 1 times [2025-03-17 12:21:51,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:51,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979767868] [2025-03-17 12:21:51,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:51,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:51,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 12:21:51,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 12:21:51,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:51,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 12:21:51,106 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 12:21:51,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 12:21:51,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 12:21:51,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:51,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 12:21:51,137 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 12:21:51,137 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 12:21:51,139 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2025-03-17 12:21:51,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2025-03-17 12:21:51,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 12:21:51,145 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-17 12:21:51,179 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 12:21:51,181 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 12:21:51 BoogieIcfgContainer [2025-03-17 12:21:51,181 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 12:21:51,181 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 12:21:51,182 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 12:21:51,182 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 12:21:51,182 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:21:50" (3/4) ... [2025-03-17 12:21:51,184 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 12:21:51,184 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 12:21:51,185 INFO L158 Benchmark]: Toolchain (without parser) took 1310.44ms. Allocated memory is still 142.6MB. Free memory was 110.0MB in the beginning and 99.5MB in the end (delta: 10.5MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. [2025-03-17 12:21:51,185 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 12:21:51,186 INFO L158 Benchmark]: CACSL2BoogieTranslator took 192.22ms. Allocated memory is still 142.6MB. Free memory was 110.0MB in the beginning and 97.7MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 12:21:51,186 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.15ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 96.7MB in the end (delta: 1.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 12:21:51,186 INFO L158 Benchmark]: Boogie Preprocessor took 22.75ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 94.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 12:21:51,186 INFO L158 Benchmark]: IcfgBuilder took 382.12ms. Allocated memory is still 142.6MB. Free memory was 94.6MB in the beginning and 76.8MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 12:21:51,186 INFO L158 Benchmark]: TraceAbstraction took 670.64ms. Allocated memory is still 142.6MB. Free memory was 75.7MB in the beginning and 99.5MB in the end (delta: -23.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 12:21:51,186 INFO L158 Benchmark]: Witness Printer took 2.80ms. Allocated memory is still 142.6MB. Free memory was 99.5MB in the beginning and 99.5MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 12:21:51,187 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.22ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 192.22ms. Allocated memory is still 142.6MB. Free memory was 110.0MB in the beginning and 97.7MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.15ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 96.7MB in the end (delta: 1.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.75ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 94.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 382.12ms. Allocated memory is still 142.6MB. Free memory was 94.6MB in the beginning and 76.8MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 670.64ms. Allocated memory is still 142.6MB. Free memory was 75.7MB in the beginning and 99.5MB in the end (delta: -23.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.80ms. Allocated memory is still 142.6MB. Free memory was 99.5MB in the beginning and 99.5MB in the end (delta: 41.6kB). There was no memory consumed. 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 - UnprovableResult [Line: 3]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 3. Possible FailurePath: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L44] int p13 = __VERIFIER_nondet_int(); [L45] int lk13; [L47] int p14 = __VERIFIER_nondet_int(); [L48] int lk14; [L50] int p15 = __VERIFIER_nondet_int(); [L51] int lk15; [L54] int cond; VAL [p10=1, p11=1, p12=1, p13=1, p14=1, p15=1, p1=0, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=1, p9=0] [L56] COND TRUE 1 [L57] cond = __VERIFIER_nondet_int() [L58] COND FALSE !(cond == 0) [L61] lk1 = 0 [L63] lk2 = 0 [L65] lk3 = 0 [L67] lk4 = 0 [L69] lk5 = 0 [L71] lk6 = 0 [L73] lk7 = 0 [L75] lk8 = 0 [L77] lk9 = 0 [L79] lk10 = 0 [L81] lk11 = 0 [L83] lk12 = 0 [L85] lk13 = 0 [L87] lk14 = 0 [L89] lk15 = 0 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p10=1, p11=1, p12=1, p13=1, p14=1, p15=1, p1=0, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=1, p9=0] [L93] COND FALSE !(p1 != 0) VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p10=1, p11=1, p12=1, p13=1, p14=1, p15=1, p1=0, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=1, p9=0] [L97] COND FALSE !(p2 != 0) VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p10=1, p11=1, p12=1, p13=1, p14=1, p15=1, p1=0, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=1, p9=0] [L101] COND TRUE p3 != 0 [L102] lk3 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=1, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p10=1, p11=1, p12=1, p13=1, p14=1, p15=1, p1=0, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=1, p9=0] [L105] COND TRUE p4 != 0 [L106] lk4 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=1, lk4=1, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p10=1, p11=1, p12=1, p13=1, p14=1, p15=1, p1=0, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=1, p9=0] [L109] COND TRUE p5 != 0 [L110] lk5 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=0, lk7=0, lk8=0, lk9=0, p10=1, p11=1, p12=1, p13=1, p14=1, p15=1, p1=0, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=1, p9=0] [L113] COND TRUE p6 != 0 [L114] lk6 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=0, lk8=0, lk9=0, p10=1, p11=1, p12=1, p13=1, p14=1, p15=1, p1=0, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=1, p9=0] [L117] COND TRUE p7 != 0 [L118] lk7 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=0, lk9=0, p10=1, p11=1, p12=1, p13=1, p14=1, p15=1, p1=0, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=1, p9=0] [L121] COND TRUE p8 != 0 [L122] lk8 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=0, p10=1, p11=1, p12=1, p13=1, p14=1, p15=1, p1=0, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=1, p9=0] [L125] COND FALSE !(p9 != 0) VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=0, p10=1, p11=1, p12=1, p13=1, p14=1, p15=1, p1=0, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=1, p9=0] [L129] COND TRUE p10 != 0 [L130] lk10 = 1 VAL [lk10=1, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=0, p10=1, p11=1, p12=1, p13=1, p14=1, p15=1, p1=0, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=1, p9=0] [L133] COND TRUE p11 != 0 [L134] lk11 = 1 VAL [lk10=1, lk11=1, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=0, p10=1, p11=1, p12=1, p13=1, p14=1, p15=1, p1=0, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=1, p9=0] [L137] COND TRUE p12 != 0 [L138] lk12 = 1 VAL [lk10=1, lk11=1, lk12=1, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=0, p10=1, p11=1, p12=1, p13=1, p14=1, p15=1, p1=0, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=1, p9=0] [L141] COND TRUE p13 != 0 [L142] lk13 = 1 VAL [lk10=1, lk11=1, lk12=1, lk13=1, lk14=0, lk15=0, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=0, p10=1, p11=1, p12=1, p13=1, p14=1, p15=1, p1=0, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=1, p9=0] [L145] COND TRUE p14 != 0 [L146] lk14 = 1 VAL [lk10=1, lk11=1, lk12=1, lk13=1, lk14=1, lk15=0, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=0, p10=1, p11=1, p12=1, p13=1, p14=1, p15=1, p1=0, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=1, p9=0] [L149] COND TRUE p15 != 0 [L150] lk15 = 1 VAL [lk10=1, lk11=1, lk12=1, lk13=1, lk14=1, lk15=1, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=0, p10=1, p11=1, p12=1, p13=1, p14=1, p15=1, p1=0, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=1, p9=0] [L155] COND FALSE !(p1 != 0) VAL [lk10=1, lk11=1, lk12=1, lk13=1, lk14=1, lk15=1, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=0, p10=1, p11=1, p12=1, p13=1, p14=1, p15=1, p1=0, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=1, p9=0] [L160] COND FALSE !(p2 != 0) VAL [lk10=1, lk11=1, lk12=1, lk13=1, lk14=1, lk15=1, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=0, p10=1, p11=1, p12=1, p13=1, p14=1, p15=1, p1=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=1, p9=0] [L233] CALL reach_error() [L3] __assert_fail("0", "test_locks_15-1.c", 3, "reach_error") - UnprovableResult [Line: 6]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 56 locations, 102 edges, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 245 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 245 mSDsluCounter, 519 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 126 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10 IncrementalHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 393 mSDtfsCounter, 10 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=4, InterpolantAutomatonStates: 11, 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, 4 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 75 NumberOfCodeBlocks, 75 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 49 ConstructedInterpolants, 0 QuantifiedInterpolants, 132 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 12:21:51,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/locks/test_locks_15-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 11a9c91fdf6b42598924d9a4ae5a3db9994a05118a3b564c2bd29b9bad4177b0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 12:21:53,105 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 12:21:53,198 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-03-17 12:21:53,203 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 12:21:53,204 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 12:21:53,223 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 12:21:53,225 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 12:21:53,225 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 12:21:53,225 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 12:21:53,225 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 12:21:53,226 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 12:21:53,226 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 12:21:53,226 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 12:21:53,226 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 12:21:53,226 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 12:21:53,226 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 12:21:53,226 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 12:21:53,226 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 12:21:53,226 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 12:21:53,227 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 12:21:53,227 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 12:21:53,227 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 12:21:53,227 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 12:21:53,227 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 12:21:53,227 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 12:21:53,227 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 12:21:53,227 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 12:21:53,227 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 12:21:53,227 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 12:21:53,227 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 12:21:53,227 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 12:21:53,227 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 12:21:53,227 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 12:21:53,227 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 12:21:53,227 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 12:21:53,227 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 12:21:53,228 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 12:21:53,228 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 12:21:53,228 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 12:21:53,228 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 12:21:53,228 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 12:21:53,228 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 12:21:53,228 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 12:21:53,228 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 12:21:53,229 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 -> 11a9c91fdf6b42598924d9a4ae5a3db9994a05118a3b564c2bd29b9bad4177b0 [2025-03-17 12:21:53,473 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 12:21:53,480 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 12:21:53,484 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 12:21:53,485 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 12:21:53,486 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 12:21:53,487 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_15-1.c [2025-03-17 12:21:54,676 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c12978c6/68da0af496724b43a90e3513bf0c56b4/FLAGe9a54e9d2 [2025-03-17 12:21:54,877 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 12:21:54,879 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_15-1.c [2025-03-17 12:21:54,886 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c12978c6/68da0af496724b43a90e3513bf0c56b4/FLAGe9a54e9d2 [2025-03-17 12:21:54,904 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c12978c6/68da0af496724b43a90e3513bf0c56b4 [2025-03-17 12:21:54,906 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 12:21:54,907 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 12:21:54,909 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 12:21:54,909 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 12:21:54,913 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 12:21:54,913 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:21:54" (1/1) ... [2025-03-17 12:21:54,914 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5491e5bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:54, skipping insertion in model container [2025-03-17 12:21:54,914 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:21:54" (1/1) ... [2025-03-17 12:21:54,931 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 12:21:55,067 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 12:21:55,077 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 12:21:55,105 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 12:21:55,118 INFO L204 MainTranslator]: Completed translation [2025-03-17 12:21:55,118 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:55 WrapperNode [2025-03-17 12:21:55,119 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 12:21:55,119 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 12:21:55,120 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 12:21:55,120 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 12:21:55,124 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:55" (1/1) ... [2025-03-17 12:21:55,132 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:55" (1/1) ... [2025-03-17 12:21:55,146 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 192 [2025-03-17 12:21:55,147 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 12:21:55,147 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 12:21:55,148 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 12:21:55,148 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 12:21:55,153 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:55" (1/1) ... [2025-03-17 12:21:55,153 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:55" (1/1) ... [2025-03-17 12:21:55,155 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:55" (1/1) ... [2025-03-17 12:21:55,166 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 12:21:55,166 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:55" (1/1) ... [2025-03-17 12:21:55,166 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:55" (1/1) ... [2025-03-17 12:21:55,170 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:55" (1/1) ... [2025-03-17 12:21:55,171 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:55" (1/1) ... [2025-03-17 12:21:55,171 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:55" (1/1) ... [2025-03-17 12:21:55,172 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:55" (1/1) ... [2025-03-17 12:21:55,177 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 12:21:55,178 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 12:21:55,178 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 12:21:55,178 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 12:21:55,179 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:55" (1/1) ... [2025-03-17 12:21:55,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 12:21:55,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:21:55,203 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 12:21:55,208 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 12:21:55,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 12:21:55,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 12:21:55,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 12:21:55,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 12:21:55,283 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 12:21:55,285 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 12:21:55,524 INFO L? ?]: Removed 38 outVars from TransFormulas that were not future-live. [2025-03-17 12:21:55,524 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 12:21:55,532 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 12:21:55,533 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 12:21:55,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:21:55 BoogieIcfgContainer [2025-03-17 12:21:55,533 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 12:21:55,535 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 12:21:55,536 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 12:21:55,539 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 12:21:55,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:21:54" (1/3) ... [2025-03-17 12:21:55,540 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5355dada and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:21:55, skipping insertion in model container [2025-03-17 12:21:55,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:55" (2/3) ... [2025-03-17 12:21:55,540 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5355dada and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:21:55, skipping insertion in model container [2025-03-17 12:21:55,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:21:55" (3/3) ... [2025-03-17 12:21:55,541 INFO L128 eAbstractionObserver]: Analyzing ICFG test_locks_15-1.c [2025-03-17 12:21:55,552 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 12:21:55,554 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test_locks_15-1.c that has 1 procedures, 56 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2025-03-17 12:21:55,586 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 12:21:55,596 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;@55f132d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 12:21:55,596 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-17 12:21:55,599 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 53 states have (on average 1.9245283018867925) internal successors, (102), 55 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:55,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 12:21:55,603 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:55,603 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 12:21:55,604 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:55,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:55,608 INFO L85 PathProgramCache]: Analyzing trace with hash 5597082, now seen corresponding path program 1 times [2025-03-17 12:21:55,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 12:21:55,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1038489832] [2025-03-17 12:21:55,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:55,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:21:55,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:21:55,620 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:21:55,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 12:21:55,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 12:21:55,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 12:21:55,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:55,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:55,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 12:21:55,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:21:55,695 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 12:21:55,695 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 12:21:55,696 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 12:21:55,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038489832] [2025-03-17 12:21:55,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038489832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:55,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:55,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:21:55,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381849393] [2025-03-17 12:21:55,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:55,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 12:21:55,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 12:21:55,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 12:21:55,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 12:21:55,723 INFO L87 Difference]: Start difference. First operand has 56 states, 53 states have (on average 1.9245283018867925) internal successors, (102), 55 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 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 12:21:55,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:55,734 INFO L93 Difference]: Finished difference Result 56 states and 100 transitions. [2025-03-17 12:21:55,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 12:21:55,736 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 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 12:21:55,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:55,741 INFO L225 Difference]: With dead ends: 56 [2025-03-17 12:21:55,742 INFO L226 Difference]: Without dead ends: 54 [2025-03-17 12:21:55,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 12:21:55,746 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:21:55,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:55,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-17 12:21:55,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-03-17 12:21:55,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 52 states have (on average 1.8846153846153846) internal successors, (98), 53 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:55,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 98 transitions. [2025-03-17 12:21:55,773 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 98 transitions. Word has length 4 [2025-03-17 12:21:55,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:55,774 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 98 transitions. [2025-03-17 12:21:55,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 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 12:21:55,774 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 98 transitions. [2025-03-17 12:21:55,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 12:21:55,774 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:55,774 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 12:21:55,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 12:21:55,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:21:55,975 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:55,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:55,976 INFO L85 PathProgramCache]: Analyzing trace with hash 173614478, now seen corresponding path program 1 times [2025-03-17 12:21:55,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 12:21:55,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1527252702] [2025-03-17 12:21:55,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:55,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:21:55,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:21:55,978 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:21:55,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 12:21:56,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 12:21:56,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 12:21:56,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:56,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:56,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 12:21:56,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:21:56,043 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 12:21:56,043 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 12:21:56,043 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 12:21:56,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527252702] [2025-03-17 12:21:56,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1527252702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:56,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:56,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 12:21:56,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820868828] [2025-03-17 12:21:56,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:56,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:56,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 12:21:56,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:56,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:56,045 INFO L87 Difference]: Start difference. First operand 54 states and 98 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:56,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:56,056 INFO L93 Difference]: Finished difference Result 53 states and 97 transitions. [2025-03-17 12:21:56,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:56,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-17 12:21:56,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:56,057 INFO L225 Difference]: With dead ends: 53 [2025-03-17 12:21:56,058 INFO L226 Difference]: Without dead ends: 51 [2025-03-17 12:21:56,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 12:21:56,059 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 93 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:21:56,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:56,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-17 12:21:56,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-03-17 12:21:56,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.9) internal successors, (95), 50 states have internal predecessors, (95), 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 12:21:56,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 95 transitions. [2025-03-17 12:21:56,064 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 95 transitions. Word has length 5 [2025-03-17 12:21:56,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:56,064 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 95 transitions. [2025-03-17 12:21:56,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:56,064 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 95 transitions. [2025-03-17 12:21:56,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-17 12:21:56,065 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:56,065 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:56,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 12:21:56,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:21:56,266 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:56,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:56,268 INFO L85 PathProgramCache]: Analyzing trace with hash -232750167, now seen corresponding path program 1 times [2025-03-17 12:21:56,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 12:21:56,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [43048265] [2025-03-17 12:21:56,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:56,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:21:56,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:21:56,270 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:21:56,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 12:21:56,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 12:21:56,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 12:21:56,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:56,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:56,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 12:21:56,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:21:56,375 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 12:21:56,375 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 12:21:56,376 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 12:21:56,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43048265] [2025-03-17 12:21:56,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43048265] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:56,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:56,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:56,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94137027] [2025-03-17 12:21:56,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:56,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:56,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 12:21:56,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:56,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:56,377 INFO L87 Difference]: Start difference. First operand 51 states and 95 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:56,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:56,404 INFO L93 Difference]: Finished difference Result 100 states and 185 transitions. [2025-03-17 12:21:56,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:56,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-03-17 12:21:56,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:56,406 INFO L225 Difference]: With dead ends: 100 [2025-03-17 12:21:56,406 INFO L226 Difference]: Without dead ends: 100 [2025-03-17 12:21:56,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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 12:21:56,407 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 75 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:21:56,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 186 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:56,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-17 12:21:56,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2025-03-17 12:21:56,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.90625) internal successors, (183), 96 states have internal predecessors, (183), 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 12:21:56,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 183 transitions. [2025-03-17 12:21:56,418 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 183 transitions. Word has length 22 [2025-03-17 12:21:56,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:56,418 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 183 transitions. [2025-03-17 12:21:56,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:56,418 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 183 transitions. [2025-03-17 12:21:56,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-17 12:21:56,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:56,418 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:56,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 12:21:56,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:21:56,619 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:56,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:56,619 INFO L85 PathProgramCache]: Analyzing trace with hash -232723259, now seen corresponding path program 1 times [2025-03-17 12:21:56,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 12:21:56,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1066254732] [2025-03-17 12:21:56,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:56,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:21:56,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:21:56,622 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:21:56,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 12:21:56,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 12:21:56,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 12:21:56,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:56,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:56,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 12:21:56,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:21:56,696 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 12:21:56,696 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 12:21:56,696 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 12:21:56,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066254732] [2025-03-17 12:21:56,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066254732] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:56,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:56,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:56,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448986216] [2025-03-17 12:21:56,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:56,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:56,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 12:21:56,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:56,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:56,697 INFO L87 Difference]: Start difference. First operand 97 states and 183 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:56,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:56,718 INFO L93 Difference]: Finished difference Result 136 states and 250 transitions. [2025-03-17 12:21:56,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:56,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-03-17 12:21:56,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:56,719 INFO L225 Difference]: With dead ends: 136 [2025-03-17 12:21:56,719 INFO L226 Difference]: Without dead ends: 136 [2025-03-17 12:21:56,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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 12:21:56,720 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 77 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:21:56,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 136 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:56,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-03-17 12:21:56,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 133. [2025-03-17 12:21:56,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.878787878787879) internal successors, (248), 132 states have internal predecessors, (248), 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 12:21:56,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 248 transitions. [2025-03-17 12:21:56,731 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 248 transitions. Word has length 22 [2025-03-17 12:21:56,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:56,731 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 248 transitions. [2025-03-17 12:21:56,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:56,731 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 248 transitions. [2025-03-17 12:21:56,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-17 12:21:56,732 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:56,732 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:56,740 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 12:21:56,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:21:56,932 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:56,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:56,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1229795612, now seen corresponding path program 1 times [2025-03-17 12:21:56,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 12:21:56,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1196197841] [2025-03-17 12:21:56,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:56,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:21:56,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:21:56,935 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:21:56,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 12:21:56,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 12:21:56,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 12:21:56,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:56,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 12:21:56,969 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 12:21:56,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 12:21:56,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 12:21:56,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:56,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 12:21:57,004 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-03-17 12:21:57,004 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 12:21:57,005 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2025-03-17 12:21:57,006 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2025-03-17 12:21:57,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 12:21:57,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:21:57,210 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-17 12:21:57,237 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 12:21:57,242 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 12:21:57 BoogieIcfgContainer [2025-03-17 12:21:57,242 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 12:21:57,247 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 12:21:57,247 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 12:21:57,247 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 12:21:57,247 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:21:55" (3/4) ... [2025-03-17 12:21:57,249 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 12:21:57,250 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 12:21:57,250 INFO L158 Benchmark]: Toolchain (without parser) took 2342.89ms. Allocated memory is still 117.4MB. Free memory was 92.8MB in the beginning and 64.8MB in the end (delta: 28.0MB). Peak memory consumption was 29.7MB. Max. memory is 16.1GB. [2025-03-17 12:21:57,250 INFO L158 Benchmark]: CDTParser took 1.14ms. Allocated memory is still 83.9MB. Free memory is still 63.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 12:21:57,251 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.66ms. Allocated memory is still 117.4MB. Free memory was 92.6MB in the beginning and 80.2MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 12:21:57,251 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.61ms. Allocated memory is still 117.4MB. Free memory was 80.2MB in the beginning and 78.8MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 12:21:57,251 INFO L158 Benchmark]: Boogie Preprocessor took 29.67ms. Allocated memory is still 117.4MB. Free memory was 78.8MB in the beginning and 77.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 12:21:57,251 INFO L158 Benchmark]: IcfgBuilder took 355.30ms. Allocated memory is still 117.4MB. Free memory was 77.4MB in the beginning and 58.0MB in the end (delta: 19.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 12:21:57,251 INFO L158 Benchmark]: TraceAbstraction took 1707.06ms. Allocated memory is still 117.4MB. Free memory was 57.3MB in the beginning and 64.8MB in the end (delta: -7.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 12:21:57,251 INFO L158 Benchmark]: Witness Printer took 3.14ms. Allocated memory is still 117.4MB. Free memory was 64.8MB in the beginning and 64.8MB in the end (delta: 15.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 12:21:57,252 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.14ms. Allocated memory is still 83.9MB. Free memory is still 63.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 209.66ms. Allocated memory is still 117.4MB. Free memory was 92.6MB in the beginning and 80.2MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.61ms. Allocated memory is still 117.4MB. Free memory was 80.2MB in the beginning and 78.8MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.67ms. Allocated memory is still 117.4MB. Free memory was 78.8MB in the beginning and 77.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 355.30ms. Allocated memory is still 117.4MB. Free memory was 77.4MB in the beginning and 58.0MB in the end (delta: 19.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1707.06ms. Allocated memory is still 117.4MB. Free memory was 57.3MB in the beginning and 64.8MB in the end (delta: -7.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.14ms. Allocated memory is still 117.4MB. Free memory was 64.8MB in the beginning and 64.8MB in the end (delta: 15.1kB). There was no memory consumed. 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 - UnprovableResult [Line: 3]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 3. Possible FailurePath: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L44] int p13 = __VERIFIER_nondet_int(); [L45] int lk13; [L47] int p14 = __VERIFIER_nondet_int(); [L48] int lk14; [L50] int p15 = __VERIFIER_nondet_int(); [L51] int lk15; [L54] int cond; [L56] COND TRUE 1 [L57] cond = __VERIFIER_nondet_int() [L58] COND FALSE !(cond == 0) [L61] lk1 = 0 [L63] lk2 = 0 [L65] lk3 = 0 [L67] lk4 = 0 [L69] lk5 = 0 [L71] lk6 = 0 [L73] lk7 = 0 [L75] lk8 = 0 [L77] lk9 = 0 [L79] lk10 = 0 [L81] lk11 = 0 [L83] lk12 = 0 [L85] lk13 = 0 [L87] lk14 = 0 [L89] lk15 = 0 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0] [L93] COND FALSE !(p1 != 0) VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0] [L97] COND FALSE !(p2 != 0) VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p2=0] [L101] COND TRUE p3 != 0 [L102] lk3 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=1, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p2=0, p3=1] [L105] COND TRUE p4 != 0 [L106] lk4 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=1, lk4=1, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p2=0, p3=1, p4=1] [L109] COND TRUE p5 != 0 [L110] lk5 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p2=0, p3=1, p4=1, p5=1] [L113] COND TRUE p6 != 0 [L114] lk6 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=0, lk8=0, lk9=0, p1=0, p2=0, p3=1, p4=1, p5=1, p6=1] [L117] COND TRUE p7 != 0 [L118] lk7 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=0, lk9=0, p1=0, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1] [L121] COND TRUE p8 != 0 [L122] lk8 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=0, p1=0, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=1] [L125] COND FALSE !(p9 != 0) VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=0, p1=0, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=1, p9=0] [L129] COND TRUE p10 != 0 [L130] lk10 = 1 VAL [lk10=1, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=0, p10=1, p1=0, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=1, p9=0] [L133] COND TRUE p11 != 0 [L134] lk11 = 1 VAL [lk10=1, lk11=1, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=0, p10=1, p11=1, p1=0, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=1, p9=0] [L137] COND TRUE p12 != 0 [L138] lk12 = 1 VAL [lk10=1, lk11=1, lk12=1, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=0, p10=1, p11=1, p12=1, p1=0, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=1, p9=0] [L141] COND TRUE p13 != 0 [L142] lk13 = 1 VAL [lk10=1, lk11=1, lk12=1, lk13=1, lk14=0, lk15=0, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=0, p10=1, p11=1, p12=1, p13=1, p1=0, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=1, p9=0] [L145] COND TRUE p14 != 0 [L146] lk14 = 1 VAL [lk10=1, lk11=1, lk12=1, lk13=1, lk14=1, lk15=0, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=0, p10=1, p11=1, p12=1, p13=1, p14=1, p1=0, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=1, p9=0] [L149] COND TRUE p15 != 0 [L150] lk15 = 1 VAL [lk10=1, lk11=1, lk12=1, lk13=1, lk14=1, lk15=1, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=0, p10=1, p11=1, p12=1, p13=1, p14=1, p15=1, p1=0, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=1, p9=0] [L155] COND FALSE !(p1 != 0) VAL [lk10=1, lk11=1, lk12=1, lk13=1, lk14=1, lk15=1, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=0, p10=1, p11=1, p12=1, p13=1, p14=1, p15=1, p1=0, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=1, p9=0] [L160] COND FALSE !(p2 != 0) VAL [lk10=1, lk11=1, lk12=1, lk13=1, lk14=1, lk15=1, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=0, p10=1, p11=1, p12=1, p13=1, p14=1, p15=1, p1=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=1, p9=0] [L233] CALL reach_error() [L3] __assert_fail("0", "test_locks_15-1.c", 3, "reach_error") - UnprovableResult [Line: 6]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 56 locations, 102 edges, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 245 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 245 mSDsluCounter, 519 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 126 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10 IncrementalHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 393 mSDtfsCounter, 10 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=4, InterpolantAutomatonStates: 11, 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, 4 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 75 NumberOfCodeBlocks, 75 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 49 ConstructedInterpolants, 0 QuantifiedInterpolants, 132 SizeOfPredicates, 0 NumberOfNonLiveVariables, 157 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 12:21:57,268 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample