./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/loop-acceleration/array_3-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/loop-acceleration/array_3-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9c5d8dd6c87f471ee77fd3b765c8ecabfaf01dd976e127275ea7c589f724f472 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 12:21:11,479 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 12:21:11,540 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 12:21:11,546 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 12:21:11,546 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 12:21:11,566 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 12:21:11,567 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 12:21:11,567 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 12:21:11,568 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 12:21:11,568 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 12:21:11,568 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 12:21:11,569 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 12:21:11,569 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 12:21:11,569 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 12:21:11,569 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 12:21:11,569 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 12:21:11,569 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 12:21:11,569 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 12:21:11,569 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 12:21:11,570 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 12:21:11,570 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 12:21:11,570 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 12:21:11,570 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 12:21:11,570 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 12:21:11,570 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 12:21:11,570 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 12:21:11,570 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 12:21:11,570 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 12:21:11,570 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 12:21:11,571 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 12:21:11,571 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 12:21:11,571 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 12:21:11,571 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 12:21:11,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 12:21:11,571 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 12:21:11,571 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 12:21:11,572 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 12:21:11,572 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 12:21:11,572 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 12:21:11,572 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 12:21:11,572 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 12:21:11,572 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 12:21:11,572 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 -> 9c5d8dd6c87f471ee77fd3b765c8ecabfaf01dd976e127275ea7c589f724f472 [2025-03-17 12:21:11,787 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 12:21:11,795 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 12:21:11,797 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 12:21:11,798 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 12:21:11,798 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 12:21:11,799 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-acceleration/array_3-1.i [2025-03-17 12:21:12,942 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6ee592f0/9b02a8b9dae54678a903cfbc7ffb049d/FLAGb3cf9880d [2025-03-17 12:21:13,157 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 12:21:13,157 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-acceleration/array_3-1.i [2025-03-17 12:21:13,190 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6ee592f0/9b02a8b9dae54678a903cfbc7ffb049d/FLAGb3cf9880d [2025-03-17 12:21:13,510 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6ee592f0/9b02a8b9dae54678a903cfbc7ffb049d [2025-03-17 12:21:13,512 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 12:21:13,513 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 12:21:13,513 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 12:21:13,513 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 12:21:13,516 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 12:21:13,517 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:21:13" (1/1) ... [2025-03-17 12:21:13,517 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c548629 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:13, skipping insertion in model container [2025-03-17 12:21:13,517 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:21:13" (1/1) ... [2025-03-17 12:21:13,528 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 12:21:13,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 12:21:13,649 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 12:21:13,659 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 12:21:13,669 INFO L204 MainTranslator]: Completed translation [2025-03-17 12:21:13,669 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:13 WrapperNode [2025-03-17 12:21:13,670 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 12:21:13,671 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 12:21:13,671 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 12:21:13,671 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 12:21:13,675 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:13" (1/1) ... [2025-03-17 12:21:13,680 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:13" (1/1) ... [2025-03-17 12:21:13,692 INFO L138 Inliner]: procedures = 16, calls = 12, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 42 [2025-03-17 12:21:13,692 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 12:21:13,693 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 12:21:13,693 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 12:21:13,693 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 12:21:13,699 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:13" (1/1) ... [2025-03-17 12:21:13,699 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:13" (1/1) ... [2025-03-17 12:21:13,700 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:13" (1/1) ... [2025-03-17 12:21:13,713 INFO L175 MemorySlicer]: Split 4 memory accesses to 2 slices as follows [2, 2]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-17 12:21:13,713 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:13" (1/1) ... [2025-03-17 12:21:13,713 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:13" (1/1) ... [2025-03-17 12:21:13,717 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:13" (1/1) ... [2025-03-17 12:21:13,718 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:13" (1/1) ... [2025-03-17 12:21:13,718 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:13" (1/1) ... [2025-03-17 12:21:13,719 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:13" (1/1) ... [2025-03-17 12:21:13,722 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 12:21:13,722 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 12:21:13,722 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 12:21:13,722 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 12:21:13,723 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:13" (1/1) ... [2025-03-17 12:21:13,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 12:21:13,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:21:13,757 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 12:21:13,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 12:21:13,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 12:21:13,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 12:21:13,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 12:21:13,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 12:21:13,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 12:21:13,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 12:21:13,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 12:21:13,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 12:21:13,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 12:21:13,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 12:21:13,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 12:21:13,824 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 12:21:13,825 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 12:21:13,933 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-03-17 12:21:13,933 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 12:21:13,939 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 12:21:13,939 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 12:21:13,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:21:13 BoogieIcfgContainer [2025-03-17 12:21:13,940 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 12:21:13,941 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 12:21:13,941 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 12:21:13,944 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 12:21:13,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:21:13" (1/3) ... [2025-03-17 12:21:13,944 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33027703 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:21:13, skipping insertion in model container [2025-03-17 12:21:13,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:13" (2/3) ... [2025-03-17 12:21:13,946 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33027703 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:21:13, skipping insertion in model container [2025-03-17 12:21:13,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:21:13" (3/3) ... [2025-03-17 12:21:13,947 INFO L128 eAbstractionObserver]: Analyzing ICFG array_3-1.i [2025-03-17 12:21:13,958 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 12:21:13,960 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG array_3-1.i that has 1 procedures, 22 locations, 1 initial locations, 2 loop locations, and 6 error locations. [2025-03-17 12:21:13,994 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 12:21:14,004 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;@226b9f75, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 12:21:14,004 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-17 12:21:14,007 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 15 states have (on average 1.8) internal successors, (27), 21 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-17 12:21:14,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-17 12:21:14,012 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:14,012 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-17 12:21:14,013 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2025-03-17 12:21:14,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:14,016 INFO L85 PathProgramCache]: Analyzing trace with hash 56407, now seen corresponding path program 1 times [2025-03-17 12:21:14,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:14,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262088516] [2025-03-17 12:21:14,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:14,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:14,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 12:21:14,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 12:21:14,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:14,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:14,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:21:14,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:14,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262088516] [2025-03-17 12:21:14,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262088516] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:14,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:14,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:21:14,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502458533] [2025-03-17 12:21:14,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:14,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:14,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:14,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:14,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:14,163 INFO L87 Difference]: Start difference. First operand has 22 states, 15 states have (on average 1.8) internal successors, (27), 21 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) Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:14,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:14,203 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2025-03-17 12:21:14,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:14,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 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 3 [2025-03-17 12:21:14,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:14,208 INFO L225 Difference]: With dead ends: 30 [2025-03-17 12:21:14,208 INFO L226 Difference]: Without dead ends: 28 [2025-03-17 12:21:14,209 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-17 12:21:14,211 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 7 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:21:14,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 26 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:14,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-17 12:21:14,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. [2025-03-17 12:21:14,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 22 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:14,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2025-03-17 12:21:14,238 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 3 [2025-03-17 12:21:14,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:14,238 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2025-03-17 12:21:14,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:14,238 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2025-03-17 12:21:14,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-17 12:21:14,238 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:14,238 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-17 12:21:14,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 12:21:14,241 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2025-03-17 12:21:14,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:14,241 INFO L85 PathProgramCache]: Analyzing trace with hash 56568, now seen corresponding path program 1 times [2025-03-17 12:21:14,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:14,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567888339] [2025-03-17 12:21:14,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:14,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:14,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 12:21:14,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 12:21:14,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:14,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:14,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:21:14,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:14,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567888339] [2025-03-17 12:21:14,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567888339] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:14,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:14,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 12:21:14,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153929213] [2025-03-17 12:21:14,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:14,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:14,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:14,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:14,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:14,298 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:14,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:14,315 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2025-03-17 12:21:14,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:14,315 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 3 [2025-03-17 12:21:14,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:14,316 INFO L225 Difference]: With dead ends: 21 [2025-03-17 12:21:14,316 INFO L226 Difference]: Without dead ends: 21 [2025-03-17 12:21:14,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:14,317 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 13 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 14 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-17 12:21:14,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 14 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:14,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-17 12:21:14,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-03-17 12:21:14,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 20 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-17 12:21:14,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2025-03-17 12:21:14,319 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 3 [2025-03-17 12:21:14,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:14,319 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2025-03-17 12:21:14,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:14,319 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2025-03-17 12:21:14,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-17 12:21:14,319 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:14,319 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-17 12:21:14,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 12:21:14,319 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2025-03-17 12:21:14,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:14,321 INFO L85 PathProgramCache]: Analyzing trace with hash 56569, now seen corresponding path program 1 times [2025-03-17 12:21:14,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:14,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119224157] [2025-03-17 12:21:14,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:14,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:14,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 12:21:14,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 12:21:14,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:14,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:14,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:21:14,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:14,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119224157] [2025-03-17 12:21:14,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119224157] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:14,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:14,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 12:21:14,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535745351] [2025-03-17 12:21:14,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:14,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:14,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:14,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:14,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:14,429 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:14,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:14,451 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2025-03-17 12:21:14,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:14,452 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 3 [2025-03-17 12:21:14,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:14,453 INFO L225 Difference]: With dead ends: 23 [2025-03-17 12:21:14,453 INFO L226 Difference]: Without dead ends: 23 [2025-03-17 12:21:14,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:14,454 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:21:14,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 23 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:14,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-17 12:21:14,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2025-03-17 12:21:14,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:14,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2025-03-17 12:21:14,459 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 3 [2025-03-17 12:21:14,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:14,459 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2025-03-17 12:21:14,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:14,459 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2025-03-17 12:21:14,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 12:21:14,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:14,460 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 12:21:14,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 12:21:14,460 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2025-03-17 12:21:14,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:14,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1685209309, now seen corresponding path program 1 times [2025-03-17 12:21:14,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:14,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626052783] [2025-03-17 12:21:14,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:14,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:14,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 12:21:14,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 12:21:14,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:14,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21: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-17 12:21:14,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:14,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626052783] [2025-03-17 12:21:14,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626052783] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:21:14,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939821008] [2025-03-17 12:21:14,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:14,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:21:14,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:21:14,511 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:21:14,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 12:21:14,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 12:21:14,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 12:21:14,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:14,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:14,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 12:21:14,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:21:14,595 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-17 12:21:14,596 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:21:14,625 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-17 12:21:14,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939821008] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:21:14,626 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:21:14,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-17 12:21:14,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185839969] [2025-03-17 12:21:14,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:21:14,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 12:21:14,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:14,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 12:21:14,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:21:14,628 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:14,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:14,673 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2025-03-17 12:21:14,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:21:14,674 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-17 12:21:14,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:14,675 INFO L225 Difference]: With dead ends: 39 [2025-03-17 12:21:14,675 INFO L226 Difference]: Without dead ends: 39 [2025-03-17 12:21:14,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:21:14,676 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 23 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:21:14,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 28 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:14,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-17 12:21:14,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2025-03-17 12:21:14,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 32 states have (on average 1.4375) internal successors, (46), 35 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:14,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2025-03-17 12:21:14,681 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 46 transitions. Word has length 6 [2025-03-17 12:21:14,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:14,681 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 46 transitions. [2025-03-17 12:21:14,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:14,682 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2025-03-17 12:21:14,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 12:21:14,682 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:14,682 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2025-03-17 12:21:14,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 12:21:14,882 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-17 12:21:14,883 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2025-03-17 12:21:14,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:14,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1685209470, now seen corresponding path program 1 times [2025-03-17 12:21:14,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:14,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956113315] [2025-03-17 12:21:14,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:14,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:14,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 12:21:14,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 12:21:14,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:14,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:15,015 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:21:15,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:15,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956113315] [2025-03-17 12:21:15,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956113315] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:15,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:15,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:15,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302038029] [2025-03-17 12:21:15,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:15,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 12:21:15,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:15,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 12:21:15,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 12:21:15,019 INFO L87 Difference]: Start difference. First operand 36 states and 46 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:15,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:15,072 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2025-03-17 12:21:15,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 12:21:15,073 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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 6 [2025-03-17 12:21:15,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:15,073 INFO L225 Difference]: With dead ends: 36 [2025-03-17 12:21:15,074 INFO L226 Difference]: Without dead ends: 36 [2025-03-17 12:21:15,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 12:21:15,075 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 8 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:21:15,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 30 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:15,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-17 12:21:15,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2025-03-17 12:21:15,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 32 states have (on average 1.25) internal successors, (40), 34 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:15,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2025-03-17 12:21:15,080 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 6 [2025-03-17 12:21:15,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:15,080 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2025-03-17 12:21:15,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:15,082 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2025-03-17 12:21:15,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-17 12:21:15,083 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:15,083 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1] [2025-03-17 12:21:15,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 12:21:15,083 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2025-03-17 12:21:15,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:15,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1483939816, now seen corresponding path program 2 times [2025-03-17 12:21:15,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:15,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496163247] [2025-03-17 12:21:15,084 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:21:15,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:15,095 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-17 12:21:15,099 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 15 statements. [2025-03-17 12:21:15,100 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 12:21:15,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:15,153 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-17 12:21:15,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:15,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496163247] [2025-03-17 12:21:15,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496163247] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:15,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:15,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:21:15,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616024614] [2025-03-17 12:21:15,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:15,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 12:21:15,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:15,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 12:21:15,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 12:21:15,155 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:15,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:15,170 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2025-03-17 12:21:15,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 12:21:15,171 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 15 [2025-03-17 12:21:15,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:15,171 INFO L225 Difference]: With dead ends: 35 [2025-03-17 12:21:15,171 INFO L226 Difference]: Without dead ends: 35 [2025-03-17 12:21:15,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 12:21:15,172 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 20 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:21:15,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 17 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:15,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-17 12:21:15,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2025-03-17 12:21:15,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:15,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2025-03-17 12:21:15,174 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 15 [2025-03-17 12:21:15,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:15,175 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2025-03-17 12:21:15,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:15,175 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2025-03-17 12:21:15,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-17 12:21:15,175 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:15,175 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:15,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 12:21:15,175 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2025-03-17 12:21:15,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:15,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1812996010, now seen corresponding path program 1 times [2025-03-17 12:21:15,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:15,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612040103] [2025-03-17 12:21:15,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:15,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:15,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 12:21:15,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 12:21:15,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:15,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:15,262 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-17 12:21:15,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:15,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612040103] [2025-03-17 12:21:15,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612040103] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:15,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:15,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 12:21:15,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799001078] [2025-03-17 12:21:15,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:15,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 12:21:15,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:15,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 12:21:15,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 12:21:15,263 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:15,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:15,286 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2025-03-17 12:21:15,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 12:21:15,287 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-17 12:21:15,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:15,287 INFO L225 Difference]: With dead ends: 31 [2025-03-17 12:21:15,287 INFO L226 Difference]: Without dead ends: 31 [2025-03-17 12:21:15,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 12:21:15,288 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 4 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:21:15,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 13 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:15,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-17 12:21:15,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-03-17 12:21:15,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:15,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2025-03-17 12:21:15,293 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 20 [2025-03-17 12:21:15,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:15,294 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2025-03-17 12:21:15,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:15,294 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2025-03-17 12:21:15,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-17 12:21:15,294 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:15,294 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:15,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 12:21:15,295 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2025-03-17 12:21:15,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:15,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1812995208, now seen corresponding path program 1 times [2025-03-17 12:21:15,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:15,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209063390] [2025-03-17 12:21:15,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:15,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:15,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 12:21:15,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 12:21:15,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:15,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:15,369 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-17 12:21:15,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:15,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209063390] [2025-03-17 12:21:15,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209063390] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:21:15,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18194134] [2025-03-17 12:21:15,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:15,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:21:15,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:21:15,373 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:21:15,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 12:21:15,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 12:21:15,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 12:21:15,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:15,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:15,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 12:21:15,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:21:15,437 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-17 12:21:15,438 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:21:15,511 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-17 12:21:15,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18194134] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:21:15,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:21:15,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-17 12:21:15,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406723679] [2025-03-17 12:21:15,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:21:15,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 12:21:15,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:15,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 12:21:15,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-03-17 12:21:15,513 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:15,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:15,597 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2025-03-17 12:21:15,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 12:21:15,597 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-17 12:21:15,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:15,597 INFO L225 Difference]: With dead ends: 76 [2025-03-17 12:21:15,598 INFO L226 Difference]: Without dead ends: 76 [2025-03-17 12:21:15,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-03-17 12:21:15,598 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 65 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:21:15,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 37 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:21:15,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-17 12:21:15,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 67. [2025-03-17 12:21:15,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.1818181818181819) internal successors, (78), 66 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:15,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2025-03-17 12:21:15,602 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 20 [2025-03-17 12:21:15,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:15,602 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2025-03-17 12:21:15,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:15,602 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2025-03-17 12:21:15,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-17 12:21:15,602 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:15,602 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:15,608 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-17 12:21:15,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-17 12:21:15,803 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2025-03-17 12:21:15,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:15,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1238904280, now seen corresponding path program 2 times [2025-03-17 12:21:15,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:15,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52254629] [2025-03-17 12:21:15,804 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:21:15,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:15,826 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-17 12:21:15,830 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 38 statements. [2025-03-17 12:21:15,830 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 12:21:15,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:15,913 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 12:21:15,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:15,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52254629] [2025-03-17 12:21:15,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52254629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:15,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:15,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:21:15,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731953401] [2025-03-17 12:21:15,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:15,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 12:21:15,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:15,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 12:21:15,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 12:21:15,914 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:15,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:15,929 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2025-03-17 12:21:15,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 12:21:15,930 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-03-17 12:21:15,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:15,930 INFO L225 Difference]: With dead ends: 66 [2025-03-17 12:21:15,930 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 12:21:15,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 12:21:15,931 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 3 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:21:15,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 19 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:15,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 12:21:15,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 12:21:15,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:15,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 12:21:15,931 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2025-03-17 12:21:15,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:15,932 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 12:21:15,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:15,932 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 12:21:15,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 12:21:15,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining) [2025-03-17 12:21:15,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2025-03-17 12:21:15,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 6 remaining) [2025-03-17 12:21:15,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 6 remaining) [2025-03-17 12:21:15,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 6 remaining) [2025-03-17 12:21:15,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 6 remaining) [2025-03-17 12:21:15,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 12:21:15,939 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1] [2025-03-17 12:21:15,940 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 12:21:15,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 12:21:15 BoogieIcfgContainer [2025-03-17 12:21:15,943 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 12:21:15,944 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 12:21:15,944 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 12:21:15,944 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 12:21:15,945 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:21:13" (3/4) ... [2025-03-17 12:21:15,947 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 12:21:15,954 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-03-17 12:21:15,954 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-17 12:21:15,954 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 12:21:15,954 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-17 12:21:16,011 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 12:21:16,012 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 12:21:16,012 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 12:21:16,013 INFO L158 Benchmark]: Toolchain (without parser) took 2499.75ms. Allocated memory is still 142.6MB. Free memory was 106.5MB in the beginning and 98.4MB in the end (delta: 8.1MB). Peak memory consumption was 4.6MB. Max. memory is 16.1GB. [2025-03-17 12:21:16,013 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 127.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 12:21:16,013 INFO L158 Benchmark]: CACSL2BoogieTranslator took 156.58ms. Allocated memory is still 142.6MB. Free memory was 106.5MB in the beginning and 95.7MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 12:21:16,014 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.76ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 94.8MB in the end (delta: 992.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 12:21:16,014 INFO L158 Benchmark]: Boogie Preprocessor took 28.92ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 93.8MB in the end (delta: 990.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 12:21:16,014 INFO L158 Benchmark]: IcfgBuilder took 217.24ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 82.0MB in the end (delta: 11.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 12:21:16,014 INFO L158 Benchmark]: TraceAbstraction took 2002.39ms. Allocated memory is still 142.6MB. Free memory was 82.0MB in the beginning and 103.8MB in the end (delta: -21.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 12:21:16,014 INFO L158 Benchmark]: Witness Printer took 68.13ms. Allocated memory is still 142.6MB. Free memory was 103.8MB in the beginning and 98.4MB in the end (delta: 5.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 12:21:16,016 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.23ms. Allocated memory is still 201.3MB. Free memory is still 127.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 156.58ms. Allocated memory is still 142.6MB. Free memory was 106.5MB in the beginning and 95.7MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.76ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 94.8MB in the end (delta: 992.3kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.92ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 93.8MB in the end (delta: 990.0kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 217.24ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 82.0MB in the end (delta: 11.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2002.39ms. Allocated memory is still 142.6MB. Free memory was 82.0MB in the beginning and 103.8MB in the end (delta: -21.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 68.13ms. Allocated memory is still 142.6MB. Free memory was 103.8MB in the beginning and 98.4MB in the end (delta: 5.4MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 20]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 12]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 22 locations, 27 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 9, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 144 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 144 mSDsluCounter, 207 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 108 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 215 IncrementalHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 99 mSDtfsCounter, 215 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred 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, 9 MinimizatonAttempts, 20 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 140 NumberOfCodeBlocks, 98 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 153 ConstructedInterpolants, 0 QuantifiedInterpolants, 659 SizeOfPredicates, 0 NumberOfNonLiveVariables, 153 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 13 InterpolantComputations, 7 PerfectInterpolantSequences, 191/260 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-17 12:21:16,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE