./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety-realloc/array-realloc-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/array-memsafety-realloc/array-realloc-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 a7528f200456114b53348dcc6f65daa446d01523914ddd1f3b2ed0ccb2daf1cf --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 06:14:55,563 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 06:14:55,639 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 06:14:55,644 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 06:14:55,644 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 06:14:55,672 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 06:14:55,674 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 06:14:55,674 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 06:14:55,674 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 06:14:55,674 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 06:14:55,675 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 06:14:55,675 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 06:14:55,675 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 06:14:55,675 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 06:14:55,675 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 06:14:55,675 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 06:14:55,675 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 06:14:55,675 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 06:14:55,675 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 06:14:55,675 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 06:14:55,676 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 06:14:55,676 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 06:14:55,676 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 06:14:55,676 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 06:14:55,676 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 06:14:55,676 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 06:14:55,676 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 06:14:55,676 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 06:14:55,676 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 06:14:55,676 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 06:14:55,676 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 06:14:55,676 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 06:14:55,676 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 06:14:55,676 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:14:55,677 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 06:14:55,677 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 06:14:55,677 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 06:14:55,677 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 06:14:55,677 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 06:14:55,677 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 06:14:55,677 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 06:14:55,677 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 06:14:55,677 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-jdk21/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 -> a7528f200456114b53348dcc6f65daa446d01523914ddd1f3b2ed0ccb2daf1cf [2025-02-08 06:14:55,962 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 06:14:55,969 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 06:14:55,972 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 06:14:55,973 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 06:14:55,973 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 06:14:55,975 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety-realloc/array-realloc-1.i [2025-02-08 06:14:57,260 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ffa052f23/e6a85311009f40c19be93853355387e3/FLAGe6033dfb0 [2025-02-08 06:14:57,513 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 06:14:57,513 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-memsafety-realloc/array-realloc-1.i [2025-02-08 06:14:57,528 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ffa052f23/e6a85311009f40c19be93853355387e3/FLAGe6033dfb0 [2025-02-08 06:14:57,813 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ffa052f23/e6a85311009f40c19be93853355387e3 [2025-02-08 06:14:57,815 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 06:14:57,816 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 06:14:57,817 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 06:14:57,817 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 06:14:57,820 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 06:14:57,821 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:14:57" (1/1) ... [2025-02-08 06:14:57,822 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d1c6a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:14:57, skipping insertion in model container [2025-02-08 06:14:57,822 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:14:57" (1/1) ... [2025-02-08 06:14:57,859 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 06:14:58,056 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:14:58,067 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:14:58,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:14:58,077 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 06:14:58,128 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:14:58,147 INFO L204 MainTranslator]: Completed translation [2025-02-08 06:14:58,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:14:58 WrapperNode [2025-02-08 06:14:58,148 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 06:14:58,148 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 06:14:58,148 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 06:14:58,148 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 06:14:58,153 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:14:58" (1/1) ... [2025-02-08 06:14:58,163 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:14:58" (1/1) ... [2025-02-08 06:14:58,181 INFO L138 Inliner]: procedures = 117, calls = 11, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 54 [2025-02-08 06:14:58,182 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 06:14:58,182 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 06:14:58,183 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 06:14:58,183 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 06:14:58,189 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:14:58" (1/1) ... [2025-02-08 06:14:58,189 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:14:58" (1/1) ... [2025-02-08 06:14:58,191 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:14:58" (1/1) ... [2025-02-08 06:14:58,198 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-08 06:14:58,198 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:14:58" (1/1) ... [2025-02-08 06:14:58,198 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:14:58" (1/1) ... [2025-02-08 06:14:58,202 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:14:58" (1/1) ... [2025-02-08 06:14:58,203 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:14:58" (1/1) ... [2025-02-08 06:14:58,204 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:14:58" (1/1) ... [2025-02-08 06:14:58,204 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:14:58" (1/1) ... [2025-02-08 06:14:58,206 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 06:14:58,207 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 06:14:58,207 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 06:14:58,207 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 06:14:58,208 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:14:58" (1/1) ... [2025-02-08 06:14:58,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:14:58,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:14:58,235 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 06:14:58,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 06:14:58,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 06:14:58,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 06:14:58,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 06:14:58,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 06:14:58,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 06:14:58,331 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 06:14:58,333 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 06:14:58,470 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2025-02-08 06:14:58,470 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 06:14:58,480 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 06:14:58,480 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 06:14:58,481 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:14:58 BoogieIcfgContainer [2025-02-08 06:14:58,481 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 06:14:58,483 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 06:14:58,483 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 06:14:58,487 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 06:14:58,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 06:14:57" (1/3) ... [2025-02-08 06:14:58,488 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67dc5caa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:14:58, skipping insertion in model container [2025-02-08 06:14:58,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:14:58" (2/3) ... [2025-02-08 06:14:58,490 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67dc5caa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:14:58, skipping insertion in model container [2025-02-08 06:14:58,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:14:58" (3/3) ... [2025-02-08 06:14:58,491 INFO L128 eAbstractionObserver]: Analyzing ICFG array-realloc-1.i [2025-02-08 06:14:58,503 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 06:14:58,504 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG array-realloc-1.i that has 1 procedures, 29 locations, 1 initial locations, 1 loop locations, and 9 error locations. [2025-02-08 06:14:58,544 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 06:14:58,555 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;@acfe90c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 06:14:58,556 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-02-08 06:14:58,560 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 28 states have internal predecessors, (31), 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-02-08 06:14:58,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 06:14:58,565 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:14:58,565 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 06:14:58,566 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 6 more)] === [2025-02-08 06:14:58,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:14:58,570 INFO L85 PathProgramCache]: Analyzing trace with hash 2010560788, now seen corresponding path program 1 times [2025-02-08 06:14:58,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:14:58,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63382561] [2025-02-08 06:14:58,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:14:58,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:14:58,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 06:14:58,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 06:14:58,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:14:58,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:14:58,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:14:58,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:14:58,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63382561] [2025-02-08 06:14:58,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63382561] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:14:58,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:14:58,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:14:58,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008234631] [2025-02-08 06:14:58,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:14:58,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:14:58,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:14:58,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:14:58,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:14:58,886 INFO L87 Difference]: Start difference. First operand has 29 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 28 states have internal predecessors, (31), 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 3.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-02-08 06:14:58,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:14:58,942 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2025-02-08 06:14:58,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:14:58,944 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.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 6 [2025-02-08 06:14:58,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:14:58,950 INFO L225 Difference]: With dead ends: 36 [2025-02-08 06:14:58,950 INFO L226 Difference]: Without dead ends: 31 [2025-02-08 06:14:58,953 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-02-08 06:14:58,955 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 8 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:14:58,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 42 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:14:58,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-02-08 06:14:58,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2025-02-08 06:14:58,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.619047619047619) internal successors, (34), 28 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-02-08 06:14:58,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2025-02-08 06:14:58,985 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 6 [2025-02-08 06:14:58,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:14:58,986 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2025-02-08 06:14:58,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.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-02-08 06:14:58,986 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2025-02-08 06:14:58,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 06:14:58,987 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:14:58,987 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 06:14:58,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 06:14:58,988 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 6 more)] === [2025-02-08 06:14:58,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:14:58,989 INFO L85 PathProgramCache]: Analyzing trace with hash 2010560789, now seen corresponding path program 1 times [2025-02-08 06:14:58,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:14:58,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093660127] [2025-02-08 06:14:58,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:14:58,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:14:59,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 06:14:59,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 06:14:59,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:14:59,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:14:59,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:14:59,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:14:59,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093660127] [2025-02-08 06:14:59,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093660127] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:14:59,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:14:59,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:14:59,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913886006] [2025-02-08 06:14:59,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:14:59,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:14:59,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:14:59,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:14:59,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:14:59,297 INFO L87 Difference]: Start difference. First operand 29 states and 34 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-02-08 06:14:59,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:14:59,368 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2025-02-08 06:14:59,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:14:59,368 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-02-08 06:14:59,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:14:59,369 INFO L225 Difference]: With dead ends: 46 [2025-02-08 06:14:59,369 INFO L226 Difference]: Without dead ends: 46 [2025-02-08 06:14:59,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:14:59,371 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 22 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:14:59,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 56 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:14:59,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-02-08 06:14:59,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 35. [2025-02-08 06:14:59,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 34 states have internal predecessors, (42), 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-02-08 06:14:59,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2025-02-08 06:14:59,376 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 6 [2025-02-08 06:14:59,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:14:59,376 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2025-02-08 06:14:59,376 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-02-08 06:14:59,376 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2025-02-08 06:14:59,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 06:14:59,376 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:14:59,376 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 06:14:59,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 06:14:59,377 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 6 more)] === [2025-02-08 06:14:59,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:14:59,377 INFO L85 PathProgramCache]: Analyzing trace with hash 2010561434, now seen corresponding path program 1 times [2025-02-08 06:14:59,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:14:59,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87426483] [2025-02-08 06:14:59,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:14:59,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:14:59,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 06:14:59,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 06:14:59,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:14:59,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:14:59,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:14:59,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:14:59,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87426483] [2025-02-08 06:14:59,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87426483] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:14:59,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:14:59,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:14:59,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364457345] [2025-02-08 06:14:59,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:14:59,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:14:59,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:14:59,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:14:59,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:14:59,436 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 4 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-02-08 06:14:59,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:14:59,448 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2025-02-08 06:14:59,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:14:59,449 INFO L78 Accepts]: Start accepts. Automaton has has 4 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-02-08 06:14:59,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:14:59,449 INFO L225 Difference]: With dead ends: 30 [2025-02-08 06:14:59,450 INFO L226 Difference]: Without dead ends: 30 [2025-02-08 06:14:59,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-02-08 06:14:59,451 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 22 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:14:59,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 39 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:14:59,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-02-08 06:14:59,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-02-08 06:14:59,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.434782608695652) internal successors, (33), 29 states have internal predecessors, (33), 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-02-08 06:14:59,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2025-02-08 06:14:59,454 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 6 [2025-02-08 06:14:59,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:14:59,454 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2025-02-08 06:14:59,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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-02-08 06:14:59,454 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2025-02-08 06:14:59,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 06:14:59,455 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:14:59,455 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 06:14:59,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 06:14:59,455 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 6 more)] === [2025-02-08 06:14:59,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:14:59,455 INFO L85 PathProgramCache]: Analyzing trace with hash -857336169, now seen corresponding path program 1 times [2025-02-08 06:14:59,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:14:59,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717213671] [2025-02-08 06:14:59,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:14:59,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:14:59,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 06:14:59,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 06:14:59,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:14:59,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:14:59,718 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:14:59,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:14:59,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717213671] [2025-02-08 06:14:59,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717213671] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:14:59,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190788991] [2025-02-08 06:14:59,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:14:59,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:14:59,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:14:59,723 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:14:59,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 06:14:59,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 06:14:59,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 06:14:59,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:14:59,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:14:59,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-08 06:14:59,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:14:59,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 06:14:59,896 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:14:59,896 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:15:00,043 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:15:00,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190788991] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:15:00,044 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:15:00,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-02-08 06:15:00,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125504600] [2025-02-08 06:15:00,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:15:00,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 06:15:00,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:15:00,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 06:15:00,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-02-08 06:15:00,046 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 12 states have internal predecessors, (21), 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-02-08 06:15:00,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:15:00,300 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2025-02-08 06:15:00,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-08 06:15:00,300 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 12 states have internal predecessors, (21), 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-02-08 06:15:00,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:15:00,302 INFO L225 Difference]: With dead ends: 90 [2025-02-08 06:15:00,302 INFO L226 Difference]: Without dead ends: 90 [2025-02-08 06:15:00,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2025-02-08 06:15:00,303 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 117 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:15:00,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 79 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:15:00,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-02-08 06:15:00,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 46. [2025-02-08 06:15:00,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 39 states have (on average 1.358974358974359) internal successors, (53), 45 states have internal predecessors, (53), 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-02-08 06:15:00,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2025-02-08 06:15:00,311 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 10 [2025-02-08 06:15:00,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:15:00,311 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2025-02-08 06:15:00,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 12 states have internal predecessors, (21), 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-02-08 06:15:00,311 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2025-02-08 06:15:00,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 06:15:00,311 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:15:00,311 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:15:00,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 06:15:00,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:15:00,512 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 6 more)] === [2025-02-08 06:15:00,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:15:00,513 INFO L85 PathProgramCache]: Analyzing trace with hash -807596686, now seen corresponding path program 1 times [2025-02-08 06:15:00,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:15:00,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61191072] [2025-02-08 06:15:00,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:15:00,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:15:00,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 06:15:00,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 06:15:00,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:15:00,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:15:00,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:15:00,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:15:00,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61191072] [2025-02-08 06:15:00,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61191072] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:15:00,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:15:00,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:15:00,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823636180] [2025-02-08 06:15:00,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:15:00,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:15:00,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:15:00,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:15:00,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:15:00,558 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 3 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-02-08 06:15:00,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:15:00,600 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2025-02-08 06:15:00,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:15:00,601 INFO L78 Accepts]: Start accepts. Automaton has has 3 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 11 [2025-02-08 06:15:00,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:15:00,602 INFO L225 Difference]: With dead ends: 46 [2025-02-08 06:15:00,602 INFO L226 Difference]: Without dead ends: 46 [2025-02-08 06:15:00,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:15:00,603 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 5 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:15:00,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 28 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:15:00,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-02-08 06:15:00,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-02-08 06:15:00,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 45 states have internal predecessors, (51), 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-02-08 06:15:00,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2025-02-08 06:15:00,611 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 11 [2025-02-08 06:15:00,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:15:00,612 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2025-02-08 06:15:00,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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-02-08 06:15:00,612 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2025-02-08 06:15:00,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 06:15:00,612 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:15:00,612 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:15:00,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 06:15:00,613 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 6 more)] === [2025-02-08 06:15:00,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:15:00,615 INFO L85 PathProgramCache]: Analyzing trace with hash -807597487, now seen corresponding path program 1 times [2025-02-08 06:15:00,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:15:00,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287163388] [2025-02-08 06:15:00,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:15:00,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:15:00,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 06:15:00,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 06:15:00,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:15:00,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:15:00,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:15:00,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:15:00,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287163388] [2025-02-08 06:15:00,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287163388] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:15:00,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:15:00,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:15:00,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524763353] [2025-02-08 06:15:00,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:15:00,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:15:00,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:15:00,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:15:00,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:15:00,666 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand has 3 states, 2 states have (on average 5.5) 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-02-08 06:15:00,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:15:00,688 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2025-02-08 06:15:00,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:15:00,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) 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 11 [2025-02-08 06:15:00,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:15:00,689 INFO L225 Difference]: With dead ends: 45 [2025-02-08 06:15:00,690 INFO L226 Difference]: Without dead ends: 45 [2025-02-08 06:15:00,690 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-02-08 06:15:00,691 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 3 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:15:00,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 23 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:15:00,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-02-08 06:15:00,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-02-08 06:15:00,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 44 states have internal predecessors, (50), 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-02-08 06:15:00,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2025-02-08 06:15:00,696 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 11 [2025-02-08 06:15:00,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:15:00,696 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2025-02-08 06:15:00,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) 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-02-08 06:15:00,697 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2025-02-08 06:15:00,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-08 06:15:00,698 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:15:00,698 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:15:00,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 06:15:00,699 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 6 more)] === [2025-02-08 06:15:00,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:15:00,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1270036088, now seen corresponding path program 1 times [2025-02-08 06:15:00,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:15:00,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947061705] [2025-02-08 06:15:00,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:15:00,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:15:00,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 06:15:00,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 06:15:00,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:15:00,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:15:00,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:15:00,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:15:00,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947061705] [2025-02-08 06:15:00,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947061705] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:15:00,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:15:00,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:15:00,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496539883] [2025-02-08 06:15:00,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:15:00,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:15:00,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:15:00,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:15:00,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:15:00,730 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 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-02-08 06:15:00,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:15:00,736 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2025-02-08 06:15:00,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:15:00,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 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) Word has length 14 [2025-02-08 06:15:00,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:15:00,737 INFO L225 Difference]: With dead ends: 44 [2025-02-08 06:15:00,737 INFO L226 Difference]: Without dead ends: 44 [2025-02-08 06:15:00,737 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-02-08 06:15:00,738 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 2 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:15:00,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 24 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:15:00,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-02-08 06:15:00,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-02-08 06:15:00,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 43 states have internal predecessors, (49), 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-02-08 06:15:00,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2025-02-08 06:15:00,745 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 14 [2025-02-08 06:15:00,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:15:00,745 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2025-02-08 06:15:00,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 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-02-08 06:15:00,745 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2025-02-08 06:15:00,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-08 06:15:00,745 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:15:00,746 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:15:00,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 06:15:00,746 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 6 more)] === [2025-02-08 06:15:00,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:15:00,746 INFO L85 PathProgramCache]: Analyzing trace with hash 716413038, now seen corresponding path program 1 times [2025-02-08 06:15:00,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:15:00,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235400272] [2025-02-08 06:15:00,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:15:00,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:15:00,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 06:15:00,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 06:15:00,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:15:00,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:15:00,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:15:00,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:15:00,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235400272] [2025-02-08 06:15:00,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235400272] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:15:00,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:15:00,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:15:00,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931381080] [2025-02-08 06:15:00,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:15:00,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:15:00,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:15:00,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:15:00,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:15:00,780 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 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-02-08 06:15:00,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:15:00,796 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2025-02-08 06:15:00,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:15:00,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 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) Word has length 15 [2025-02-08 06:15:00,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:15:00,799 INFO L225 Difference]: With dead ends: 43 [2025-02-08 06:15:00,799 INFO L226 Difference]: Without dead ends: 43 [2025-02-08 06:15:00,800 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-02-08 06:15:00,800 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 3 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:15:00,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 15 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:15:00,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-02-08 06:15:00,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-02-08 06:15:00,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 42 states have internal predecessors, (48), 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-02-08 06:15:00,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2025-02-08 06:15:00,805 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 15 [2025-02-08 06:15:00,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:15:00,806 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2025-02-08 06:15:00,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 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-02-08 06:15:00,806 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2025-02-08 06:15:00,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-08 06:15:00,806 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:15:00,806 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:15:00,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 06:15:00,807 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 6 more)] === [2025-02-08 06:15:00,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:15:00,809 INFO L85 PathProgramCache]: Analyzing trace with hash 733967670, now seen corresponding path program 1 times [2025-02-08 06:15:00,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:15:00,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608876748] [2025-02-08 06:15:00,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:15:00,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:15:00,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 06:15:00,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 06:15:00,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:15:00,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 06:15:00,825 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 06:15:00,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 06:15:00,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 06:15:00,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:15:00,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 06:15:00,847 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 06:15:00,847 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 06:15:00,848 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (8 of 9 remaining) [2025-02-08 06:15:00,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 9 remaining) [2025-02-08 06:15:00,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (6 of 9 remaining) [2025-02-08 06:15:00,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE (5 of 9 remaining) [2025-02-08 06:15:00,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE (4 of 9 remaining) [2025-02-08 06:15:00,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE (3 of 9 remaining) [2025-02-08 06:15:00,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE (2 of 9 remaining) [2025-02-08 06:15:00,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 9 remaining) [2025-02-08 06:15:00,853 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 9 remaining) [2025-02-08 06:15:00,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 06:15:00,857 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:15:00,877 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 06:15:00,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 06:15:00 BoogieIcfgContainer [2025-02-08 06:15:00,881 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 06:15:00,882 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 06:15:00,882 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 06:15:00,882 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 06:15:00,883 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:14:58" (3/4) ... [2025-02-08 06:15:00,883 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-08 06:15:00,925 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 8. [2025-02-08 06:15:00,973 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 06:15:00,976 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 06:15:00,976 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 06:15:00,977 INFO L158 Benchmark]: Toolchain (without parser) took 3161.03ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 98.0MB in the end (delta: 23.9MB). Peak memory consumption was 24.9MB. Max. memory is 16.1GB. [2025-02-08 06:15:00,977 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 192.9MB. Free memory is still 112.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 06:15:00,977 INFO L158 Benchmark]: CACSL2BoogieTranslator took 331.01ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 105.3MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 06:15:00,977 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.72ms. Allocated memory is still 167.8MB. Free memory was 105.3MB in the beginning and 103.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 06:15:00,978 INFO L158 Benchmark]: Boogie Preprocessor took 23.67ms. Allocated memory is still 167.8MB. Free memory was 103.9MB in the beginning and 102.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 06:15:00,978 INFO L158 Benchmark]: IcfgBuilder took 273.99ms. Allocated memory is still 167.8MB. Free memory was 102.5MB in the beginning and 88.3MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 06:15:00,979 INFO L158 Benchmark]: TraceAbstraction took 2398.10ms. Allocated memory is still 167.8MB. Free memory was 87.8MB in the beginning and 103.5MB in the end (delta: -15.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 06:15:00,980 INFO L158 Benchmark]: Witness Printer took 94.46ms. Allocated memory is still 167.8MB. Free memory was 103.5MB in the beginning and 98.0MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 06:15:00,981 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 192.9MB. Free memory is still 112.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 331.01ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 105.3MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.72ms. Allocated memory is still 167.8MB. Free memory was 105.3MB in the beginning and 103.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 23.67ms. Allocated memory is still 167.8MB. Free memory was 103.9MB in the beginning and 102.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 273.99ms. Allocated memory is still 167.8MB. Free memory was 102.5MB in the beginning and 88.3MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2398.10ms. Allocated memory is still 167.8MB. Free memory was 87.8MB in the beginning and 103.5MB in the end (delta: -15.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 94.46ms. Allocated memory is still 167.8MB. Free memory was 103.5MB in the beginning and 98.0MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 538]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: [L512] int num; [L513] int ind, newsize, i = 1; [L528] num = __VERIFIER_nondet_int() [L529] COND FALSE !(!(num > 0 && num < 100)) [L532] int *a = (int *)malloc(sizeof(int)); [L533] COND FALSE !(a == ((void *)0)) [L536] newsize = 0 [L537] CALL expandArray(a) [L515] int *a = (int *)arg; [L516] int *b = ((void *)0); VAL [a={-1:0}, b={0:0}, i=1, ind=0, newsize=0, num=1] [L517] COND TRUE newsize < num [L518] newsize = newsize + 1 [L519] EXPR, FCALL realloc(a, sizeof(int) * newsize) [L519] b = realloc(a, sizeof(int) * newsize) [L520] b[newsize - 1] = i VAL [b={2:0}, i=1, ind=0, newsize=1, num=1] [L521] a = b VAL [a={2:0}, b={2:0}, i=1, ind=0, newsize=1, num=1] [L517] COND FALSE !(newsize < num) VAL [a={2:0}, b={2:0}, i=1, ind=0, newsize=1, num=1] [L523] COND TRUE b != ((void *)0) VAL [a={2:0}, b={2:0}, i=1, ind=0, newsize=1, num=1] [L524] free(b) VAL [a={2:0}, i=1, ind=0, newsize=1, num=1] [L524] free(b) VAL [a={2:0}, i=1, ind=0, newsize=1, num=1] [L524] free(b) [L525] return 0; [L537] RET expandArray(a) [L538] free(a) VAL [i=1, ind=0, newsize=1, num=1] [L538] free(a) VAL [i=1, ind=0, newsize=1, num=1] [L538] free(a) VAL [i=1, ind=0, newsize=1, num=1] - UnprovableResult [Line: 527]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 524]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 524]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 524]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 29 locations, 9 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 182 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 182 mSDsluCounter, 306 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 150 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 247 IncrementalHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 156 mSDtfsCounter, 247 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=4, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 57 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 105 NumberOfCodeBlocks, 105 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 89 ConstructedInterpolants, 0 QuantifiedInterpolants, 366 SizeOfPredicates, 0 NumberOfNonLiveVariables, 128 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 4/13 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-02-08 06:15:00,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-free)