./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-regression/alias_of_return.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-regression/alias_of_return.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 ba0bcfe856788bd0caa6dc699e0af14f5977926f33f52c273bc3aa3b61532a90 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 22:44:57,807 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:44:57,864 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-08 22:44:57,868 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:44:57,868 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:44:57,886 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:44:57,886 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:44:57,886 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:44:57,887 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 22:44:57,887 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 22:44:57,887 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:44:57,887 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:44:57,887 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:44:57,887 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:44:57,887 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:44:57,887 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:44:57,887 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:44:57,887 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:44:57,887 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:44:57,887 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:44:57,887 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-08 22:44:57,887 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-08 22:44:57,887 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-08 22:44:57,888 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:44:57,888 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 22:44:57,888 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:44:57,888 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:44:57,888 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:44:57,888 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:44:57,888 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:44:57,888 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:44:57,888 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 22:44:57,888 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:44:57,888 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:44:57,888 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:44:57,888 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:44:57,888 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:44:57,888 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:44:57,888 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:44:57,890 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:44:57,890 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:44:57,890 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:44:57,890 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 -> ba0bcfe856788bd0caa6dc699e0af14f5977926f33f52c273bc3aa3b61532a90 [2025-03-08 22:44:58,147 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:44:58,155 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:44:58,157 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:44:58,158 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:44:58,158 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:44:58,160 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/alias_of_return.i [2025-03-08 22:44:59,261 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a527eb34/742b94b462bc4b0d98a95835dc49d1d5/FLAGda2fa3407 [2025-03-08 22:44:59,474 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:44:59,476 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/alias_of_return.i [2025-03-08 22:44:59,482 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a527eb34/742b94b462bc4b0d98a95835dc49d1d5/FLAGda2fa3407 [2025-03-08 22:44:59,825 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a527eb34/742b94b462bc4b0d98a95835dc49d1d5 [2025-03-08 22:44:59,827 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:44:59,829 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:44:59,830 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:44:59,830 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:44:59,833 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:44:59,833 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:44:59" (1/1) ... [2025-03-08 22:44:59,834 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@116e09af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:44:59, skipping insertion in model container [2025-03-08 22:44:59,834 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:44:59" (1/1) ... [2025-03-08 22:44:59,843 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:44:59,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:44:59,958 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:44:59,966 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:44:59,979 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:44:59,979 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:44:59 WrapperNode [2025-03-08 22:44:59,980 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:44:59,980 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:44:59,980 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:44:59,981 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:44:59,985 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:44:59" (1/1) ... [2025-03-08 22:44:59,990 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:44:59" (1/1) ... [2025-03-08 22:45:00,001 INFO L138 Inliner]: procedures = 14, calls = 15, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 30 [2025-03-08 22:45:00,002 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:45:00,002 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:45:00,002 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:45:00,002 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:45:00,007 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:44:59" (1/1) ... [2025-03-08 22:45:00,007 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:44:59" (1/1) ... [2025-03-08 22:45:00,013 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:44:59" (1/1) ... [2025-03-08 22:45:00,023 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-03-08 22:45:00,024 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:44:59" (1/1) ... [2025-03-08 22:45:00,025 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:44:59" (1/1) ... [2025-03-08 22:45:00,029 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:44:59" (1/1) ... [2025-03-08 22:45:00,029 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:44:59" (1/1) ... [2025-03-08 22:45:00,031 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:44:59" (1/1) ... [2025-03-08 22:45:00,033 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:44:59" (1/1) ... [2025-03-08 22:45:00,034 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:45:00,035 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:45:00,035 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:45:00,035 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:45:00,036 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:44:59" (1/1) ... [2025-03-08 22:45:00,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:45:00,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:45:00,065 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-08 22:45:00,067 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-08 22:45:00,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 22:45:00,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 22:45:00,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 22:45:00,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 22:45:00,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 22:45:00,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 22:45:00,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:45:00,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:45:00,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 22:45:00,088 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 22:45:00,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 22:45:00,131 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:45:00,132 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:45:00,237 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-03-08 22:45:00,238 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:45:00,246 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:45:00,247 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:45:00,247 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:45:00 BoogieIcfgContainer [2025-03-08 22:45:00,248 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:45:00,249 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:45:00,249 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:45:00,253 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:45:00,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:44:59" (1/3) ... [2025-03-08 22:45:00,254 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59e37ca7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:45:00, skipping insertion in model container [2025-03-08 22:45:00,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:44:59" (2/3) ... [2025-03-08 22:45:00,255 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59e37ca7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:45:00, skipping insertion in model container [2025-03-08 22:45:00,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:45:00" (3/3) ... [2025-03-08 22:45:00,256 INFO L128 eAbstractionObserver]: Analyzing ICFG alias_of_return.i [2025-03-08 22:45:00,266 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:45:00,267 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG alias_of_return.i that has 1 procedures, 24 locations, 1 initial locations, 0 loop locations, and 8 error locations. [2025-03-08 22:45:00,300 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:45:00,310 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;@5e90ec58, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:45:00,311 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-08 22:45:00,314 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 15 states have (on average 1.6) internal successors, (24), 23 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:45:00,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-08 22:45:00,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:45:00,319 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-08 22:45:00,319 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-08 22:45:00,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:45:00,324 INFO L85 PathProgramCache]: Analyzing trace with hash 52596, now seen corresponding path program 1 times [2025-03-08 22:45:00,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:45:00,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387137422] [2025-03-08 22:45:00,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:45:00,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:45:00,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-08 22:45:00,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-08 22:45:00,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:45:00,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:45:00,493 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-08 22:45:00,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:45:00,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387137422] [2025-03-08 22:45:00,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387137422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:45:00,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:45:00,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:45:00,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783543029] [2025-03-08 22:45:00,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:45:00,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:45:00,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:45:00,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:45:00,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:45:00,521 INFO L87 Difference]: Start difference. First operand has 24 states, 15 states have (on average 1.6) internal successors, (24), 23 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 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-08 22:45:00,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:45:00,549 INFO L93 Difference]: Finished difference Result 20 states and 19 transitions. [2025-03-08 22:45:00,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:45:00,551 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 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-08 22:45:00,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:45:00,554 INFO L225 Difference]: With dead ends: 20 [2025-03-08 22:45:00,555 INFO L226 Difference]: Without dead ends: 18 [2025-03-08 22:45:00,557 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-08 22:45:00,559 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 11 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:45:00,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 12 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:45:00,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-03-08 22:45:00,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-03-08 22:45:00,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 17 states have internal predecessors, (17), 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-08 22:45:00,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 17 transitions. [2025-03-08 22:45:00,580 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 17 transitions. Word has length 3 [2025-03-08 22:45:00,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:45:00,580 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 17 transitions. [2025-03-08 22:45:00,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 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-08 22:45:00,580 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 17 transitions. [2025-03-08 22:45:00,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-08 22:45:00,580 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:45:00,581 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-08 22:45:00,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 22:45:00,581 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-08 22:45:00,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:45:00,581 INFO L85 PathProgramCache]: Analyzing trace with hash 52597, now seen corresponding path program 1 times [2025-03-08 22:45:00,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:45:00,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915207075] [2025-03-08 22:45:00,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:45:00,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:45:00,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-08 22:45:00,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-08 22:45:00,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:45:00,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:45:00,659 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-08 22:45:00,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:45:00,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915207075] [2025-03-08 22:45:00,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915207075] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:45:00,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:45:00,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:45:00,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187980362] [2025-03-08 22:45:00,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:45:00,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:45:00,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:45:00,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:45:00,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:45:00,662 INFO L87 Difference]: Start difference. First operand 18 states and 17 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 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-08 22:45:00,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:45:00,681 INFO L93 Difference]: Finished difference Result 16 states and 15 transitions. [2025-03-08 22:45:00,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:45:00,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 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-08 22:45:00,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:45:00,681 INFO L225 Difference]: With dead ends: 16 [2025-03-08 22:45:00,682 INFO L226 Difference]: Without dead ends: 16 [2025-03-08 22:45:00,682 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-08 22:45:00,682 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:45:00,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 15 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:45:00,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-03-08 22:45:00,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-03-08 22:45:00,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 15 states have internal predecessors, (15), 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-08 22:45:00,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 15 transitions. [2025-03-08 22:45:00,688 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 15 transitions. Word has length 3 [2025-03-08 22:45:00,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:45:00,688 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 15 transitions. [2025-03-08 22:45:00,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 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-08 22:45:00,688 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 15 transitions. [2025-03-08 22:45:00,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-08 22:45:00,688 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:45:00,688 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-08 22:45:00,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 22:45:00,689 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-08 22:45:00,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:45:00,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1566875453, now seen corresponding path program 1 times [2025-03-08 22:45:00,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:45:00,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278978859] [2025-03-08 22:45:00,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:45:00,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:45:00,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 22:45:00,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 22:45:00,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:45:00,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:45:00,794 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-08 22:45:00,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:45:00,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278978859] [2025-03-08 22:45:00,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278978859] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:45:00,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:45:00,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:45:00,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853374509] [2025-03-08 22:45:00,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:45:00,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:45:00,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:45:00,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:45:00,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:45:00,796 INFO L87 Difference]: Start difference. First operand 16 states and 15 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 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-08 22:45:00,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:45:00,842 INFO L93 Difference]: Finished difference Result 15 states and 14 transitions. [2025-03-08 22:45:00,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:45:00,843 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 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-08 22:45:00,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:45:00,843 INFO L225 Difference]: With dead ends: 15 [2025-03-08 22:45:00,843 INFO L226 Difference]: Without dead ends: 15 [2025-03-08 22:45:00,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:45:00,844 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 9 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:45:00,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 15 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:45:00,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-03-08 22:45:00,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-03-08 22:45:00,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 14 states have internal predecessors, (14), 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-08 22:45:00,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 14 transitions. [2025-03-08 22:45:00,846 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 14 transitions. Word has length 6 [2025-03-08 22:45:00,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:45:00,846 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 14 transitions. [2025-03-08 22:45:00,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 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-08 22:45:00,846 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 14 transitions. [2025-03-08 22:45:00,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-08 22:45:00,846 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:45:00,846 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-08 22:45:00,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 22:45:00,846 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-08 22:45:00,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:45:00,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1566875454, now seen corresponding path program 1 times [2025-03-08 22:45:00,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:45:00,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031515735] [2025-03-08 22:45:00,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:45:00,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:45:00,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 22:45:00,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 22:45:00,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:45:00,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:45:00,975 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-08 22:45:00,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:45:00,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031515735] [2025-03-08 22:45:00,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031515735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:45:00,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:45:00,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:45:00,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441911043] [2025-03-08 22:45:00,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:45:00,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:45:00,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:45:00,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:45:00,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:45:00,978 INFO L87 Difference]: Start difference. First operand 15 states and 14 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 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-08 22:45:01,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:45:01,041 INFO L93 Difference]: Finished difference Result 14 states and 13 transitions. [2025-03-08 22:45:01,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:45:01,042 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 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-08 22:45:01,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:45:01,042 INFO L225 Difference]: With dead ends: 14 [2025-03-08 22:45:01,042 INFO L226 Difference]: Without dead ends: 14 [2025-03-08 22:45:01,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:45:01,043 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 3 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:45:01,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 25 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:45:01,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-03-08 22:45:01,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-03-08 22:45:01,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 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-08 22:45:01,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 13 transitions. [2025-03-08 22:45:01,047 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 13 transitions. Word has length 6 [2025-03-08 22:45:01,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:45:01,047 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 13 transitions. [2025-03-08 22:45:01,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 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-08 22:45:01,047 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 13 transitions. [2025-03-08 22:45:01,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 22:45:01,047 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:45:01,047 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:45:01,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 22:45:01,048 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-08 22:45:01,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:45:01,049 INFO L85 PathProgramCache]: Analyzing trace with hash -816886823, now seen corresponding path program 1 times [2025-03-08 22:45:01,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:45:01,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49418026] [2025-03-08 22:45:01,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:45:01,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:45:01,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 22:45:01,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 22:45:01,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:45:01,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:45:01,176 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-08 22:45:01,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:45:01,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49418026] [2025-03-08 22:45:01,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49418026] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:45:01,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:45:01,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 22:45:01,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888619121] [2025-03-08 22:45:01,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:45:01,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:45:01,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:45:01,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:45:01,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:45:01,177 INFO L87 Difference]: Start difference. First operand 14 states and 13 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 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-08 22:45:01,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:45:01,198 INFO L93 Difference]: Finished difference Result 11 states and 10 transitions. [2025-03-08 22:45:01,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:45:01,199 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 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 10 [2025-03-08 22:45:01,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:45:01,199 INFO L225 Difference]: With dead ends: 11 [2025-03-08 22:45:01,199 INFO L226 Difference]: Without dead ends: 11 [2025-03-08 22:45:01,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:45:01,199 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:45:01,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:45:01,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2025-03-08 22:45:01,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2025-03-08 22:45:01,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.0) internal successors, (10), 10 states have internal predecessors, (10), 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-08 22:45:01,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 10 transitions. [2025-03-08 22:45:01,201 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 10 transitions. Word has length 10 [2025-03-08 22:45:01,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:45:01,201 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 10 transitions. [2025-03-08 22:45:01,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 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-08 22:45:01,201 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 10 transitions. [2025-03-08 22:45:01,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 22:45:01,201 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:45:01,201 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:45:01,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 22:45:01,201 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-08 22:45:01,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:45:01,202 INFO L85 PathProgramCache]: Analyzing trace with hash -816886022, now seen corresponding path program 1 times [2025-03-08 22:45:01,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:45:01,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733407241] [2025-03-08 22:45:01,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:45:01,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:45:01,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 22:45:01,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 22:45:01,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:45:01,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:45:01,251 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-08 22:45:01,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:45:01,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733407241] [2025-03-08 22:45:01,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733407241] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:45:01,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:45:01,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:45:01,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919562236] [2025-03-08 22:45:01,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:45:01,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:45:01,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:45:01,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:45:01,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:45:01,256 INFO L87 Difference]: Start difference. First operand 11 states and 10 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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-08 22:45:01,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:45:01,271 INFO L93 Difference]: Finished difference Result 10 states and 9 transitions. [2025-03-08 22:45:01,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:45:01,272 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2025-03-08 22:45:01,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:45:01,272 INFO L225 Difference]: With dead ends: 10 [2025-03-08 22:45:01,272 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 22:45:01,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-08 22:45:01,273 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:45:01,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:45:01,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 22:45:01,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 22:45:01,273 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-08 22:45:01,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 22:45:01,274 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2025-03-08 22:45:01,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:45:01,274 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 22:45:01,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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-08 22:45:01,274 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 22:45:01,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 22:45:01,278 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2025-03-08 22:45:01,279 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2025-03-08 22:45:01,279 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 8 remaining) [2025-03-08 22:45:01,279 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 8 remaining) [2025-03-08 22:45:01,279 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 8 remaining) [2025-03-08 22:45:01,279 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 8 remaining) [2025-03-08 22:45:01,279 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 8 remaining) [2025-03-08 22:45:01,279 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 8 remaining) [2025-03-08 22:45:01,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 22:45:01,281 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-08 22:45:01,283 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 22:45:01,285 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 10:45:01 BoogieIcfgContainer [2025-03-08 22:45:01,286 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 22:45:01,286 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 22:45:01,286 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 22:45:01,287 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 22:45:01,287 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:45:00" (3/4) ... [2025-03-08 22:45:01,288 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 22:45:01,293 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-03-08 22:45:01,294 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-08 22:45:01,294 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 22:45:01,294 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-08 22:45:01,341 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 22:45:01,341 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 22:45:01,341 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 22:45:01,342 INFO L158 Benchmark]: Toolchain (without parser) took 1513.02ms. Allocated memory is still 142.6MB. Free memory was 106.0MB in the beginning and 70.6MB in the end (delta: 35.3MB). Peak memory consumption was 37.3MB. Max. memory is 16.1GB. [2025-03-08 22:45:01,343 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:45:01,343 INFO L158 Benchmark]: CACSL2BoogieTranslator took 150.19ms. Allocated memory is still 142.6MB. Free memory was 106.0MB in the beginning and 95.3MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 22:45:01,343 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.28ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 94.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:45:01,343 INFO L158 Benchmark]: Boogie Preprocessor took 32.50ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 93.5MB in the end (delta: 675.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:45:01,344 INFO L158 Benchmark]: IcfgBuilder took 212.55ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 81.8MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 22:45:01,344 INFO L158 Benchmark]: TraceAbstraction took 1036.42ms. Allocated memory is still 142.6MB. Free memory was 81.8MB in the beginning and 76.1MB in the end (delta: 5.7MB). Peak memory consumption was 3.8MB. Max. memory is 16.1GB. [2025-03-08 22:45:01,344 INFO L158 Benchmark]: Witness Printer took 54.86ms. Allocated memory is still 142.6MB. Free memory was 76.1MB in the beginning and 70.6MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 22:45:01,346 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.19ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 150.19ms. Allocated memory is still 142.6MB. Free memory was 106.0MB in the beginning and 95.3MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.28ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 94.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.50ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 93.5MB in the end (delta: 675.9kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 212.55ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 81.8MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1036.42ms. Allocated memory is still 142.6MB. Free memory was 81.8MB in the beginning and 76.1MB in the end (delta: 5.7MB). Peak memory consumption was 3.8MB. Max. memory is 16.1GB. * Witness Printer took 54.86ms. Allocated memory is still 142.6MB. Free memory was 76.1MB in the beginning and 70.6MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 18]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 3]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 24 locations, 24 edges, 8 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 29 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 29 mSDsluCounter, 90 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 44 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 112 IncrementalHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 46 mSDtfsCounter, 112 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=0, InterpolantAutomatonStates: 26, 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, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 38 NumberOfCodeBlocks, 38 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 32 ConstructedInterpolants, 0 QuantifiedInterpolants, 145 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-08 22:45:01,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE