./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext3/freeAlloca.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 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/memsafety-ext3/freeAlloca.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 cb3174b12ccafcfa2421015218ce7e009c2319e912e783d4246aed1266b2586b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:40:11,411 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:40:11,459 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 07:40:11,466 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:40:11,466 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:40:11,481 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:40:11,482 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:40:11,482 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:40:11,482 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:40:11,482 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:40:11,482 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:40:11,483 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:40:11,483 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:40:11,483 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:40:11,483 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:40:11,483 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:40:11,483 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:40:11,483 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:40:11,483 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:40:11,483 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:40:11,484 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:40:11,484 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:40:11,484 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 07:40:11,484 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:40:11,484 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:40:11,484 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:40:11,484 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:40:11,484 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:40:11,484 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:40:11,484 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:40:11,484 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:40:11,485 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:40:11,485 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:40:11,485 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:40:11,485 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:40:11,485 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:40:11,485 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 07:40:11,485 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 07:40:11,485 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:40:11,485 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:40:11,485 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:40:11,485 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:40:11,486 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 -> cb3174b12ccafcfa2421015218ce7e009c2319e912e783d4246aed1266b2586b [2025-03-04 07:40:11,699 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:40:11,705 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:40:11,706 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:40:11,707 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:40:11,707 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:40:11,709 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext3/freeAlloca.c [2025-03-04 07:40:12,827 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/585f725ac/4bfcdce899bb4017856d6b7310c35aac/FLAG28741dd09 [2025-03-04 07:40:13,049 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:40:13,050 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext3/freeAlloca.c [2025-03-04 07:40:13,055 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/585f725ac/4bfcdce899bb4017856d6b7310c35aac/FLAG28741dd09 [2025-03-04 07:40:13,394 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/585f725ac/4bfcdce899bb4017856d6b7310c35aac [2025-03-04 07:40:13,395 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:40:13,396 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:40:13,397 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:40:13,397 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:40:13,400 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:40:13,400 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:40:13" (1/1) ... [2025-03-04 07:40:13,401 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79da9237 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:40:13, skipping insertion in model container [2025-03-04 07:40:13,401 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:40:13" (1/1) ... [2025-03-04 07:40:13,410 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:40:13,512 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:40:13,521 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:40:13,529 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:40:13,539 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:40:13,540 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:40:13 WrapperNode [2025-03-04 07:40:13,541 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:40:13,542 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:40:13,542 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:40:13,542 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:40:13,546 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:40:13" (1/1) ... [2025-03-04 07:40:13,551 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:40:13" (1/1) ... [2025-03-04 07:40:13,561 INFO L138 Inliner]: procedures = 10, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 30 [2025-03-04 07:40:13,562 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:40:13,562 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:40:13,562 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:40:13,562 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:40:13,567 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:40:13" (1/1) ... [2025-03-04 07:40:13,567 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:40:13" (1/1) ... [2025-03-04 07:40:13,568 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:40:13" (1/1) ... [2025-03-04 07:40:13,578 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 1 writes are split as follows [1]. [2025-03-04 07:40:13,578 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:40:13" (1/1) ... [2025-03-04 07:40:13,578 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:40:13" (1/1) ... [2025-03-04 07:40:13,581 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:40:13" (1/1) ... [2025-03-04 07:40:13,582 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:40:13" (1/1) ... [2025-03-04 07:40:13,584 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:40:13" (1/1) ... [2025-03-04 07:40:13,584 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:40:13" (1/1) ... [2025-03-04 07:40:13,585 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:40:13,588 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:40:13,588 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:40:13,588 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:40:13,589 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:40:13" (1/1) ... [2025-03-04 07:40:13,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:40:13,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:40:13,618 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-04 07:40:13,624 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-04 07:40:13,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 07:40:13,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:40:13,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:40:13,640 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 07:40:13,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 07:40:13,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:40:13,689 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:40:13,690 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:40:13,799 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7: call ULTIMATE.dealloc(main_#t~malloc1#1.base, main_#t~malloc1#1.offset);havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; [2025-03-04 07:40:13,804 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-04 07:40:13,804 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:40:13,809 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:40:13,810 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:40:13,810 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:40:13 BoogieIcfgContainer [2025-03-04 07:40:13,810 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:40:13,812 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:40:13,812 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:40:13,815 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:40:13,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:40:13" (1/3) ... [2025-03-04 07:40:13,816 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57b01bb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:40:13, skipping insertion in model container [2025-03-04 07:40:13,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:40:13" (2/3) ... [2025-03-04 07:40:13,816 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57b01bb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:40:13, skipping insertion in model container [2025-03-04 07:40:13,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:40:13" (3/3) ... [2025-03-04 07:40:13,817 INFO L128 eAbstractionObserver]: Analyzing ICFG freeAlloca.c [2025-03-04 07:40:13,827 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:40:13,828 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG freeAlloca.c that has 1 procedures, 22 locations, 1 initial locations, 1 loop locations, and 8 error locations. [2025-03-04 07:40:13,856 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:40:13,866 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;@588bfeae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:40:13,866 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-04 07:40:13,869 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 21 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:40:13,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 07:40:13,875 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:40:13,875 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 07:40:13,876 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 5 more)] === [2025-03-04 07:40:13,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:40:13,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1630366, now seen corresponding path program 1 times [2025-03-04 07:40:13,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:40:13,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084515480] [2025-03-04 07:40:13,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:40:13,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:40:13,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 07:40:13,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 07:40:13,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:40:13,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:40:14,037 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-04 07:40:14,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:40:14,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084515480] [2025-03-04 07:40:14,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084515480] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:40:14,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:40:14,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:40:14,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048819944] [2025-03-04 07:40:14,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:40:14,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:40:14,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:40:14,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:40:14,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:40:14,065 INFO L87 Difference]: Start difference. First operand has 22 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 21 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:40:14,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:40:14,094 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2025-03-04 07:40:14,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:40:14,096 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-04 07:40:14,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:40:14,099 INFO L225 Difference]: With dead ends: 26 [2025-03-04 07:40:14,100 INFO L226 Difference]: Without dead ends: 24 [2025-03-04 07:40:14,101 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-04 07:40:14,104 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 3 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:40:14,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 35 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:40:14,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-04 07:40:14,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2025-03-04 07:40:14,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 20 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-04 07:40:14,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2025-03-04 07:40:14,129 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 4 [2025-03-04 07:40:14,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:40:14,130 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2025-03-04 07:40:14,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:40:14,131 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2025-03-04 07:40:14,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 07:40:14,131 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:40:14,131 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 07:40:14,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 07:40:14,132 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 5 more)] === [2025-03-04 07:40:14,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:40:14,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1630526, now seen corresponding path program 1 times [2025-03-04 07:40:14,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:40:14,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360873718] [2025-03-04 07:40:14,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:40:14,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:40:14,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 07:40:14,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 07:40:14,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:40:14,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:40:14,189 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-04 07:40:14,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:40:14,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360873718] [2025-03-04 07:40:14,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360873718] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:40:14,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:40:14,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:40:14,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140259022] [2025-03-04 07:40:14,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:40:14,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:40:14,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:40:14,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:40:14,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:40:14,191 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:40:14,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:40:14,214 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2025-03-04 07:40:14,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:40:14,214 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-04 07:40:14,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:40:14,214 INFO L225 Difference]: With dead ends: 19 [2025-03-04 07:40:14,215 INFO L226 Difference]: Without dead ends: 19 [2025-03-04 07:40:14,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:40:14,216 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 9 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:40:14,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 10 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:40:14,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-03-04 07:40:14,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2025-03-04 07:40:14,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 17 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:40:14,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2025-03-04 07:40:14,221 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 4 [2025-03-04 07:40:14,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:40:14,221 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2025-03-04 07:40:14,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:40:14,222 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2025-03-04 07:40:14,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 07:40:14,222 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:40:14,222 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 07:40:14,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 07:40:14,222 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 5 more)] === [2025-03-04 07:40:14,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:40:14,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1630527, now seen corresponding path program 1 times [2025-03-04 07:40:14,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:40:14,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362031947] [2025-03-04 07:40:14,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:40:14,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:40:14,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 07:40:14,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 07:40:14,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:40:14,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:40:14,336 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-04 07:40:14,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:40:14,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362031947] [2025-03-04 07:40:14,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362031947] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:40:14,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:40:14,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:40:14,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33945114] [2025-03-04 07:40:14,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:40:14,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:40:14,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:40:14,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:40:14,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:40:14,339 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:40:14,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:40:14,365 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2025-03-04 07:40:14,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:40:14,366 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-04 07:40:14,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:40:14,367 INFO L225 Difference]: With dead ends: 20 [2025-03-04 07:40:14,367 INFO L226 Difference]: Without dead ends: 20 [2025-03-04 07:40:14,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:40:14,367 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 1 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:40:14,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 20 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:40:14,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-04 07:40:14,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2025-03-04 07:40:14,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 18 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:40:14,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2025-03-04 07:40:14,369 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 4 [2025-03-04 07:40:14,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:40:14,369 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2025-03-04 07:40:14,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:40:14,369 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2025-03-04 07:40:14,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 07:40:14,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:40:14,369 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:40:14,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 07:40:14,371 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 5 more)] === [2025-03-04 07:40:14,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:40:14,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1330346867, now seen corresponding path program 1 times [2025-03-04 07:40:14,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:40:14,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781475292] [2025-03-04 07:40:14,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:40:14,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:40:14,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 07:40:14,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 07:40:14,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:40:14,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:40:14,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:40:14,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:40:14,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781475292] [2025-03-04 07:40:14,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781475292] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:40:14,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610387161] [2025-03-04 07:40:14,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:40:14,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:40:14,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:40:14,425 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-04 07:40:14,427 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-04 07:40:14,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 07:40:14,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 07:40:14,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:40:14,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:40:14,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 07:40:14,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:40:14,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:40:14,507 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:40:14,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:40:14,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1610387161] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:40:14,533 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:40:14,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 07:40:14,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847549378] [2025-03-04 07:40:14,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:40:14,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:40:14,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:40:14,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:40:14,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:40:14,534 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:40:14,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:40:14,570 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2025-03-04 07:40:14,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:40:14,571 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 07:40:14,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:40:14,571 INFO L225 Difference]: With dead ends: 27 [2025-03-04 07:40:14,571 INFO L226 Difference]: Without dead ends: 27 [2025-03-04 07:40:14,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:40:14,573 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 4 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:40:14,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 50 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:40:14,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-04 07:40:14,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-03-04 07:40:14,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:40:14,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2025-03-04 07:40:14,577 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 7 [2025-03-04 07:40:14,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:40:14,577 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2025-03-04 07:40:14,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:40:14,578 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2025-03-04 07:40:14,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 07:40:14,578 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:40:14,578 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-04 07:40:14,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 07:40:14,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:40:14,779 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 5 more)] === [2025-03-04 07:40:14,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:40:14,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1330347027, now seen corresponding path program 1 times [2025-03-04 07:40:14,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:40:14,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138712055] [2025-03-04 07:40:14,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:40:14,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:40:14,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 07:40:14,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 07:40:14,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:40:14,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:40:14,878 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:40:14,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:40:14,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138712055] [2025-03-04 07:40:14,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138712055] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:40:14,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929335001] [2025-03-04 07:40:14,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:40:14,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:40:14,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:40:14,881 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-04 07:40:14,882 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-04 07:40:14,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 07:40:14,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 07:40:14,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:40:14,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:40:14,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 07:40:14,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:40:14,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 07:40:14,992 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:40:14,992 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:40:15,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:40:15,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [929335001] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:40:15,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:40:15,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 07:40:15,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248415384] [2025-03-04 07:40:15,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:40:15,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:40:15,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:40:15,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:40:15,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:40:15,058 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:40:15,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:40:15,120 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2025-03-04 07:40:15,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:40:15,121 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 07:40:15,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:40:15,121 INFO L225 Difference]: With dead ends: 28 [2025-03-04 07:40:15,121 INFO L226 Difference]: Without dead ends: 28 [2025-03-04 07:40:15,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:40:15,122 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 4 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:40:15,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 30 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:40:15,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-04 07:40:15,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-04 07:40:15,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 27 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:40:15,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2025-03-04 07:40:15,124 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 7 [2025-03-04 07:40:15,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:40:15,124 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2025-03-04 07:40:15,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:40:15,124 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2025-03-04 07:40:15,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 07:40:15,127 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:40:15,127 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1] [2025-03-04 07:40:15,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 07:40:15,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:40:15,331 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 5 more)] === [2025-03-04 07:40:15,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:40:15,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1255702625, now seen corresponding path program 2 times [2025-03-04 07:40:15,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:40:15,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105231356] [2025-03-04 07:40:15,331 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:40:15,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:40:15,340 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 07:40:15,345 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-03-04 07:40:15,347 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 07:40:15,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:40:15,377 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 07:40:15,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:40:15,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105231356] [2025-03-04 07:40:15,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105231356] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:40:15,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:40:15,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:40:15,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205033284] [2025-03-04 07:40:15,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:40:15,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:40:15,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:40:15,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:40:15,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:40:15,378 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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-04 07:40:15,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:40:15,393 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2025-03-04 07:40:15,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:40:15,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-04 07:40:15,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:40:15,393 INFO L225 Difference]: With dead ends: 29 [2025-03-04 07:40:15,393 INFO L226 Difference]: Without dead ends: 29 [2025-03-04 07:40:15,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:40:15,394 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 5 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:40:15,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 15 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:40:15,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-04 07:40:15,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2025-03-04 07:40:15,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 23 states have (on average 1.173913043478261) internal successors, (27), 25 states have internal predecessors, (27), 0 states have call successors, (0), 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-04 07:40:15,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2025-03-04 07:40:15,398 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 16 [2025-03-04 07:40:15,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:40:15,398 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2025-03-04 07:40:15,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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-04 07:40:15,399 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2025-03-04 07:40:15,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 07:40:15,399 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:40:15,399 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1] [2025-03-04 07:40:15,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 07:40:15,399 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 5 more)] === [2025-03-04 07:40:15,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:40:15,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1255702465, now seen corresponding path program 2 times [2025-03-04 07:40:15,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:40:15,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959783021] [2025-03-04 07:40:15,400 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:40:15,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:40:15,405 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 07:40:15,408 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 07:40:15,409 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:40:15,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:40:15,564 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:40:15,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:40:15,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959783021] [2025-03-04 07:40:15,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959783021] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:40:15,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860864421] [2025-03-04 07:40:15,565 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:40:15,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:40:15,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:40:15,567 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-04 07:40:15,569 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-04 07:40:15,592 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 07:40:15,601 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 07:40:15,601 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:40:15,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:40:15,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 07:40:15,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:40:15,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 07:40:15,702 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:40:15,703 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:40:15,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860864421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:40:15,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:40:15,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2025-03-04 07:40:15,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633897905] [2025-03-04 07:40:15,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:40:15,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:40:15,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:40:15,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:40:15,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:40:15,704 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:40:15,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:40:15,745 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2025-03-04 07:40:15,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:40:15,745 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-04 07:40:15,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:40:15,746 INFO L225 Difference]: With dead ends: 26 [2025-03-04 07:40:15,746 INFO L226 Difference]: Without dead ends: 26 [2025-03-04 07:40:15,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:40:15,746 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:40:15,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 21 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:40:15,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-04 07:40:15,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2025-03-04 07:40:15,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:40:15,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2025-03-04 07:40:15,748 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 16 [2025-03-04 07:40:15,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:40:15,749 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2025-03-04 07:40:15,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:40:15,749 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2025-03-04 07:40:15,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 07:40:15,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:40:15,749 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:40:15,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 07:40:15,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:40:15,950 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 5 more)] === [2025-03-04 07:40:15,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:40:15,950 INFO L85 PathProgramCache]: Analyzing trace with hash 528198061, now seen corresponding path program 1 times [2025-03-04 07:40:15,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:40:15,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112449541] [2025-03-04 07:40:15,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:40:15,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:40:15,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 07:40:15,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 07:40:15,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:40:15,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:40:16,014 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:40:16,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:40:16,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112449541] [2025-03-04 07:40:16,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112449541] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:40:16,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351220109] [2025-03-04 07:40:16,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:40:16,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:40:16,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:40:16,017 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-04 07:40:16,018 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-04 07:40:16,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 07:40:16,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 07:40:16,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:40:16,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:40:16,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 07:40:16,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:40:16,084 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:40:16,084 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:40:16,139 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:40:16,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351220109] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:40:16,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:40:16,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-04 07:40:16,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553760289] [2025-03-04 07:40:16,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:40:16,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 07:40:16,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:40:16,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 07:40:16,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-04 07:40:16,141 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:40:16,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:40:16,175 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2025-03-04 07:40:16,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 07:40:16,176 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-04 07:40:16,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:40:16,176 INFO L225 Difference]: With dead ends: 42 [2025-03-04 07:40:16,176 INFO L226 Difference]: Without dead ends: 42 [2025-03-04 07:40:16,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-04 07:40:16,176 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 4 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:40:16,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 42 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:40:16,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-04 07:40:16,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-03-04 07:40:16,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 40 states have (on average 1.075) internal successors, (43), 41 states have internal predecessors, (43), 0 states have call successors, (0), 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-04 07:40:16,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2025-03-04 07:40:16,179 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 19 [2025-03-04 07:40:16,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:40:16,179 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2025-03-04 07:40:16,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:40:16,179 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2025-03-04 07:40:16,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-04 07:40:16,180 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:40:16,180 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:40:16,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 07:40:16,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:40:16,381 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 5 more)] === [2025-03-04 07:40:16,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:40:16,381 INFO L85 PathProgramCache]: Analyzing trace with hash -142517459, now seen corresponding path program 2 times [2025-03-04 07:40:16,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:40:16,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181045215] [2025-03-04 07:40:16,381 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:40:16,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:40:16,389 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-04 07:40:16,402 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 07:40:16,402 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:40:16,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 07:40:16,402 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 07:40:16,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 07:40:16,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 07:40:16,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:40:16,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 07:40:16,438 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 07:40:16,438 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 07:40:16,438 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (7 of 8 remaining) [2025-03-04 07:40:16,440 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2025-03-04 07:40:16,440 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (5 of 8 remaining) [2025-03-04 07:40:16,440 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE (4 of 8 remaining) [2025-03-04 07:40:16,440 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 8 remaining) [2025-03-04 07:40:16,440 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 8 remaining) [2025-03-04 07:40:16,440 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 8 remaining) [2025-03-04 07:40:16,440 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 8 remaining) [2025-03-04 07:40:16,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 07:40:16,443 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1] [2025-03-04 07:40:16,466 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 07:40:16,468 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 07:40:16 BoogieIcfgContainer [2025-03-04 07:40:16,469 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 07:40:16,469 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 07:40:16,469 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 07:40:16,469 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 07:40:16,470 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:40:13" (3/4) ... [2025-03-04 07:40:16,471 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-04 07:40:16,509 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 13. [2025-03-04 07:40:16,553 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 07:40:16,553 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 07:40:16,553 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 07:40:16,554 INFO L158 Benchmark]: Toolchain (without parser) took 3157.70ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 101.6MB in the end (delta: 20.9MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. [2025-03-04 07:40:16,554 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 115.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:40:16,554 INFO L158 Benchmark]: CACSL2BoogieTranslator took 144.26ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 112.5MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 07:40:16,554 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.90ms. Allocated memory is still 167.8MB. Free memory was 112.5MB in the beginning and 111.4MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:40:16,555 INFO L158 Benchmark]: Boogie Preprocessor took 25.41ms. Allocated memory is still 167.8MB. Free memory was 111.4MB in the beginning and 109.5MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 07:40:16,555 INFO L158 Benchmark]: IcfgBuilder took 222.08ms. Allocated memory is still 167.8MB. Free memory was 109.5MB in the beginning and 97.9MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 07:40:16,555 INFO L158 Benchmark]: TraceAbstraction took 2656.98ms. Allocated memory is still 167.8MB. Free memory was 96.8MB in the beginning and 107.8MB in the end (delta: -11.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:40:16,555 INFO L158 Benchmark]: Witness Printer took 84.19ms. Allocated memory is still 167.8MB. Free memory was 107.8MB in the beginning and 101.6MB in the end (delta: 6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 07:40:16,556 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.20ms. Allocated memory is still 201.3MB. Free memory is still 115.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 144.26ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 112.5MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.90ms. Allocated memory is still 167.8MB. Free memory was 112.5MB in the beginning and 111.4MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.41ms. Allocated memory is still 167.8MB. Free memory was 111.4MB in the beginning and 109.5MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 222.08ms. Allocated memory is still 167.8MB. Free memory was 109.5MB in the beginning and 97.9MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2656.98ms. Allocated memory is still 167.8MB. Free memory was 96.8MB in the beginning and 107.8MB in the end (delta: -11.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 84.19ms. Allocated memory is still 167.8MB. Free memory was 107.8MB in the beginning and 101.6MB in the end (delta: 6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 14]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: [L7] char *p = alloca(10 * sizeof(char)); [L9] int i = 0; VAL [i=0, p={11:0}] [L9] COND TRUE i < 10 [L10] p[i] = __VERIFIER_nondet_char() [L9] i++ VAL [i=1, p={11:0}] [L9] COND TRUE i < 10 [L10] p[i] = __VERIFIER_nondet_char() [L9] i++ VAL [i=2, p={11:0}] [L9] COND TRUE i < 10 [L10] p[i] = __VERIFIER_nondet_char() [L9] i++ VAL [i=3, p={11:0}] [L9] COND TRUE i < 10 [L10] p[i] = __VERIFIER_nondet_char() [L9] i++ VAL [i=4, p={11:0}] [L9] COND TRUE i < 10 [L10] p[i] = __VERIFIER_nondet_char() [L9] i++ VAL [i=5, p={11:0}] [L9] COND TRUE i < 10 [L10] p[i] = __VERIFIER_nondet_char() [L9] i++ VAL [i=6, p={11:0}] [L9] COND TRUE i < 10 [L10] p[i] = __VERIFIER_nondet_char() [L9] i++ VAL [i=7, p={11:0}] [L9] COND TRUE i < 10 [L10] p[i] = __VERIFIER_nondet_char() [L9] i++ VAL [i=8, p={11:0}] [L9] COND TRUE i < 10 [L10] p[i] = __VERIFIER_nondet_char() [L9] i++ VAL [i=9, p={11:0}] [L9] COND TRUE i < 10 [L10] p[i] = __VERIFIER_nondet_char() [L9] i++ VAL [i=10, p={11:0}] [L9] COND FALSE !(i < 10) [L13] EXPR p[2] [L13] COND TRUE p[2] == 'a' [L14] free(p) [L14] free(p) - UnprovableResult [Line: 6]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 14]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 14]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 22 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 9, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 31 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 31 mSDsluCounter, 223 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 115 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 200 IncrementalHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 108 mSDtfsCounter, 200 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 106 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=8, InterpolantAutomatonStates: 44, 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, 8 MinimizatonAttempts, 10 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 163 NumberOfCodeBlocks, 151 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 144 ConstructedInterpolants, 0 QuantifiedInterpolants, 885 SizeOfPredicates, 2 NumberOfNonLiveVariables, 248 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 15 InterpolantComputations, 5 PerfectInterpolantSequences, 60/149 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 proved your program to be incorrect! [2025-03-04 07:40:16,573 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-free)