./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-regression/test23-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-regression/test23-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6107b0424f9f7d96b4a493f3ee8e42c81c6509c50d1ec834cc7d1fa0b8a2c5d3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 22:45:34,994 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:45:35,044 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-08 22:45:35,047 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:45:35,047 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:45:35,068 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:45:35,068 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:45:35,068 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:45:35,068 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 22:45:35,068 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 22:45:35,069 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:45:35,069 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:45:35,069 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:45:35,069 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:45:35,069 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:45:35,069 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:45:35,069 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:45:35,069 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:45:35,069 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:45:35,069 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:45:35,069 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-08 22:45:35,071 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-08 22:45:35,071 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-08 22:45:35,071 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:45:35,071 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 22:45:35,071 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:45:35,071 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:45:35,071 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:45:35,071 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:45:35,071 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:45:35,071 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:45:35,071 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 22:45:35,072 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:45:35,072 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:45:35,072 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:45:35,072 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:45:35,072 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:45:35,072 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:45:35,072 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:45:35,072 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:45:35,072 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:45:35,072 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:45:35,072 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6107b0424f9f7d96b4a493f3ee8e42c81c6509c50d1ec834cc7d1fa0b8a2c5d3 [2025-03-08 22:45:35,312 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:45:35,318 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:45:35,320 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:45:35,320 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:45:35,321 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:45:35,322 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/test23-2.c [2025-03-08 22:45:36,439 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64d9a55ea/12c36650f7234df193d3be07a295d8bb/FLAGdae8873c2 [2025-03-08 22:45:36,652 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:45:36,653 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test23-2.c [2025-03-08 22:45:36,658 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64d9a55ea/12c36650f7234df193d3be07a295d8bb/FLAGdae8873c2 [2025-03-08 22:45:37,011 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64d9a55ea/12c36650f7234df193d3be07a295d8bb [2025-03-08 22:45:37,013 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:45:37,014 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:45:37,014 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:45:37,015 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:45:37,018 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:45:37,019 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:45:37" (1/1) ... [2025-03-08 22:45:37,020 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ab5dea7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:45:37, skipping insertion in model container [2025-03-08 22:45:37,020 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:45:37" (1/1) ... [2025-03-08 22:45:37,031 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:45:37,142 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:45:37,153 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:45:37,165 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:45:37,188 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:45:37,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:45:37 WrapperNode [2025-03-08 22:45:37,189 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:45:37,189 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:45:37,190 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:45:37,190 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:45:37,194 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:45:37" (1/1) ... [2025-03-08 22:45:37,198 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:45:37" (1/1) ... [2025-03-08 22:45:37,213 INFO L138 Inliner]: procedures = 16, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 113 [2025-03-08 22:45:37,213 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:45:37,213 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:45:37,214 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:45:37,214 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:45:37,219 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:45:37" (1/1) ... [2025-03-08 22:45:37,219 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:45:37" (1/1) ... [2025-03-08 22:45:37,220 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:45:37" (1/1) ... [2025-03-08 22:45:37,235 INFO L175 MemorySlicer]: Split 46 memory accesses to 2 slices as follows [2, 44]. 96 percent of accesses are in the largest equivalence class. The 38 initializations are split as follows [2, 36]. The 5 writes are split as follows [0, 5]. [2025-03-08 22:45:37,235 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:45:37" (1/1) ... [2025-03-08 22:45:37,235 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:45:37" (1/1) ... [2025-03-08 22:45:37,242 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:45:37" (1/1) ... [2025-03-08 22:45:37,243 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:45:37" (1/1) ... [2025-03-08 22:45:37,244 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:45:37" (1/1) ... [2025-03-08 22:45:37,244 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:45:37" (1/1) ... [2025-03-08 22:45:37,245 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:45:37,246 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:45:37,246 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:45:37,246 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:45:37,250 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:45:37" (1/1) ... [2025-03-08 22:45:37,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:45:37,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:45:37,273 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 22:45:37,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 22:45:37,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 22:45:37,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 22:45:37,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 22:45:37,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 22:45:37,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 22:45:37,293 INFO L130 BoogieDeclarations]: Found specification of procedure get_dummy [2025-03-08 22:45:37,293 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dummy [2025-03-08 22:45:37,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:45:37,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:45:37,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 22:45:37,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 22:45:37,350 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:45:37,351 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:45:37,384 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L25: havoc #t~nondet8; [2025-03-08 22:45:37,520 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L30: havoc check_#t~mem9#1; [2025-03-08 22:45:37,528 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2025-03-08 22:45:37,528 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:45:37,534 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:45:37,535 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:45:37,535 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:45:37 BoogieIcfgContainer [2025-03-08 22:45:37,535 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:45:37,536 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:45:37,536 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:45:37,539 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:45:37,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:45:37" (1/3) ... [2025-03-08 22:45:37,540 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fb4df5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:45:37, skipping insertion in model container [2025-03-08 22:45:37,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:45:37" (2/3) ... [2025-03-08 22:45:37,540 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fb4df5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:45:37, skipping insertion in model container [2025-03-08 22:45:37,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:45:37" (3/3) ... [2025-03-08 22:45:37,541 INFO L128 eAbstractionObserver]: Analyzing ICFG test23-2.c [2025-03-08 22:45:37,554 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:45:37,555 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test23-2.c that has 2 procedures, 55 locations, 1 initial locations, 1 loop locations, and 18 error locations. [2025-03-08 22:45:37,580 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:45:37,588 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;@162d39e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:45:37,588 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-08 22:45:37,591 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 33 states have (on average 1.6666666666666667) internal successors, (55), 51 states have internal predecessors, (55), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:45:37,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-08 22:45:37,593 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:45:37,594 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-08 22:45:37,594 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-08 22:45:37,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:45:37,598 INFO L85 PathProgramCache]: Analyzing trace with hash 94302, now seen corresponding path program 1 times [2025-03-08 22:45:37,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:45:37,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722470613] [2025-03-08 22:45:37,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:45:37,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:45:37,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-08 22:45:37,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-08 22:45:37,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:45:37,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:45:37,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:45:37,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:45:37,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722470613] [2025-03-08 22:45:37,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722470613] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:45:37,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:45:37,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-08 22:45:37,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575381623] [2025-03-08 22:45:37,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:45:37,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:45:37,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:45:37,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:45:37,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:45:37,847 INFO L87 Difference]: Start difference. First operand has 55 states, 33 states have (on average 1.6666666666666667) internal successors, (55), 51 states have internal predecessors, (55), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:45:37,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:45:37,886 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2025-03-08 22:45:37,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:45:37,888 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-08 22:45:37,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:45:37,893 INFO L225 Difference]: With dead ends: 52 [2025-03-08 22:45:37,894 INFO L226 Difference]: Without dead ends: 50 [2025-03-08 22:45:37,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:45:37,897 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 52 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:45:37,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 34 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:45:37,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-08 22:45:37,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-08 22:45:37,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 46 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:45:37,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2025-03-08 22:45:37,924 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 3 [2025-03-08 22:45:37,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:45:37,925 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2025-03-08 22:45:37,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:45:37,925 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2025-03-08 22:45:37,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-08 22:45:37,926 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:45:37,926 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-08 22:45:37,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 22:45:37,926 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-08 22:45:37,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:45:37,926 INFO L85 PathProgramCache]: Analyzing trace with hash 94303, now seen corresponding path program 1 times [2025-03-08 22:45:37,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:45:37,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308978392] [2025-03-08 22:45:37,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:45:37,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:45:37,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-08 22:45:37,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-08 22:45:37,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:45:37,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:45:38,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:45:38,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:45:38,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308978392] [2025-03-08 22:45:38,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308978392] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:45:38,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:45:38,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-08 22:45:38,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578987032] [2025-03-08 22:45:38,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:45:38,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:45:38,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:45:38,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:45:38,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:45:38,023 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:45:38,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:45:38,050 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2025-03-08 22:45:38,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:45:38,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-08 22:45:38,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:45:38,052 INFO L225 Difference]: With dead ends: 48 [2025-03-08 22:45:38,052 INFO L226 Difference]: Without dead ends: 48 [2025-03-08 22:45:38,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:45:38,053 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 48 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:45:38,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 35 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:45:38,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-08 22:45:38,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-08 22:45:38,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 44 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:45:38,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2025-03-08 22:45:38,060 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 3 [2025-03-08 22:45:38,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:45:38,061 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2025-03-08 22:45:38,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:45:38,061 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2025-03-08 22:45:38,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-08 22:45:38,061 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:45:38,061 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:45:38,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 22:45:38,061 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-08 22:45:38,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:45:38,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1191451928, now seen corresponding path program 1 times [2025-03-08 22:45:38,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:45:38,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370275004] [2025-03-08 22:45:38,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:45:38,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:45:38,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 22:45:38,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 22:45:38,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:45:38,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:45:38,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:45:38,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:45:38,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370275004] [2025-03-08 22:45:38,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370275004] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:45:38,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:45:38,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-08 22:45:38,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395765507] [2025-03-08 22:45:38,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:45:38,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:45:38,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:45:38,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:45:38,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:45:38,155 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:45:38,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:45:38,191 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2025-03-08 22:45:38,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:45:38,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-08 22:45:38,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:45:38,191 INFO L225 Difference]: With dead ends: 46 [2025-03-08 22:45:38,191 INFO L226 Difference]: Without dead ends: 46 [2025-03-08 22:45:38,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:45:38,192 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 42 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:45:38,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 31 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:45:38,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-08 22:45:38,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-03-08 22:45:38,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 42 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:45:38,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2025-03-08 22:45:38,199 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 7 [2025-03-08 22:45:38,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:45:38,199 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2025-03-08 22:45:38,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:45:38,199 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2025-03-08 22:45:38,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-08 22:45:38,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:45:38,200 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:45:38,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 22:45:38,201 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-08 22:45:38,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:45:38,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1191451929, now seen corresponding path program 1 times [2025-03-08 22:45:38,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:45:38,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285185324] [2025-03-08 22:45:38,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:45:38,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:45:38,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 22:45:38,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 22:45:38,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:45:38,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:45:38,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:45:38,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:45:38,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285185324] [2025-03-08 22:45:38,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285185324] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:45:38,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:45:38,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-08 22:45:38,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968684497] [2025-03-08 22:45:38,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:45:38,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:45:38,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:45:38,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:45:38,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:45:38,290 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:45:38,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:45:38,310 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2025-03-08 22:45:38,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:45:38,311 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-08 22:45:38,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:45:38,311 INFO L225 Difference]: With dead ends: 44 [2025-03-08 22:45:38,311 INFO L226 Difference]: Without dead ends: 44 [2025-03-08 22:45:38,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:45:38,312 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 40 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:45:38,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 33 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:45:38,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-08 22:45:38,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-03-08 22:45:38,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 40 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:45:38,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2025-03-08 22:45:38,315 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 7 [2025-03-08 22:45:38,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:45:38,316 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2025-03-08 22:45:38,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:45:38,316 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2025-03-08 22:45:38,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 22:45:38,316 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:45:38,316 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:45:38,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 22:45:38,316 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-08 22:45:38,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:45:38,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1668811569, now seen corresponding path program 1 times [2025-03-08 22:45:38,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:45:38,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142922926] [2025-03-08 22:45:38,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:45:38,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:45:38,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 22:45:38,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 22:45:38,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:45:38,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:45:38,554 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:45:38,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:45:38,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142922926] [2025-03-08 22:45:38,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142922926] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:45:38,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080899882] [2025-03-08 22:45:38,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:45:38,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:45:38,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:45:38,557 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:45:38,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 22:45:38,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 22:45:38,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 22:45:38,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:45:38,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:45:38,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-08 22:45:38,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:45:38,921 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:45:38,921 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:45:38,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080899882] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:45:38,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 22:45:38,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 13 [2025-03-08 22:45:38,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998150466] [2025-03-08 22:45:38,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:45:38,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:45:38,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:45:38,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:45:38,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-03-08 22:45:38,923 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 22:45:39,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:45:39,012 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2025-03-08 22:45:39,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:45:39,012 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2025-03-08 22:45:39,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:45:39,013 INFO L225 Difference]: With dead ends: 42 [2025-03-08 22:45:39,013 INFO L226 Difference]: Without dead ends: 42 [2025-03-08 22:45:39,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2025-03-08 22:45:39,013 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 35 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:45:39,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 79 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:45:39,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-08 22:45:39,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-03-08 22:45:39,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 38 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:45:39,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2025-03-08 22:45:39,015 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 23 [2025-03-08 22:45:39,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:45:39,016 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2025-03-08 22:45:39,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 22:45:39,016 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2025-03-08 22:45:39,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 22:45:39,016 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:45:39,016 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:45:39,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 22:45:39,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:45:39,217 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-08 22:45:39,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:45:39,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1668811568, now seen corresponding path program 1 times [2025-03-08 22:45:39,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:45:39,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601270371] [2025-03-08 22:45:39,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:45:39,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:45:39,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 22:45:39,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 22:45:39,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:45:39,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:45:39,665 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:45:39,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:45:39,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601270371] [2025-03-08 22:45:39,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601270371] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:45:39,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783235494] [2025-03-08 22:45:39,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:45:39,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:45:39,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:45:39,667 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:45:39,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 22:45:39,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 22:45:39,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 22:45:39,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:45:39,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:45:39,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-08 22:45:39,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:45:40,247 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:45:40,247 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:45:40,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783235494] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:45:40,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 22:45:40,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 15 [2025-03-08 22:45:40,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445998867] [2025-03-08 22:45:40,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:45:40,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 22:45:40,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:45:40,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 22:45:40,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2025-03-08 22:45:40,248 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand has 10 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:45:40,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:45:40,461 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2025-03-08 22:45:40,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 22:45:40,462 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2025-03-08 22:45:40,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:45:40,462 INFO L225 Difference]: With dead ends: 40 [2025-03-08 22:45:40,462 INFO L226 Difference]: Without dead ends: 40 [2025-03-08 22:45:40,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2025-03-08 22:45:40,463 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 28 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:45:40,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 160 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:45:40,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-08 22:45:40,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-08 22:45:40,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 36 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:45:40,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2025-03-08 22:45:40,465 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 23 [2025-03-08 22:45:40,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:45:40,465 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2025-03-08 22:45:40,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:45:40,465 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2025-03-08 22:45:40,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 22:45:40,466 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:45:40,466 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:45:40,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 22:45:40,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-08 22:45:40,667 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-08 22:45:40,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:45:40,667 INFO L85 PathProgramCache]: Analyzing trace with hash -193550990, now seen corresponding path program 1 times [2025-03-08 22:45:40,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:45:40,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458008044] [2025-03-08 22:45:40,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:45:40,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:45:40,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 22:45:40,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 22:45:40,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:45:40,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:45:40,702 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 22:45:40,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:45:40,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458008044] [2025-03-08 22:45:40,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458008044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:45:40,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:45:40,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:45:40,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274396427] [2025-03-08 22:45:40,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:45:40,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:45:40,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:45:40,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:45:40,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:45:40,703 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 22:45:40,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:45:40,719 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2025-03-08 22:45:40,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:45:40,720 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2025-03-08 22:45:40,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:45:40,720 INFO L225 Difference]: With dead ends: 39 [2025-03-08 22:45:40,720 INFO L226 Difference]: Without dead ends: 37 [2025-03-08 22:45:40,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:45:40,721 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 20 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:45:40,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 33 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:45:40,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-08 22:45:40,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-03-08 22:45:40,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 33 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:45:40,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2025-03-08 22:45:40,723 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 24 [2025-03-08 22:45:40,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:45:40,723 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2025-03-08 22:45:40,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 22:45:40,723 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2025-03-08 22:45:40,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 22:45:40,727 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:45:40,728 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:45:40,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 22:45:40,728 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-08 22:45:40,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:45:40,729 INFO L85 PathProgramCache]: Analyzing trace with hash 2060858184, now seen corresponding path program 1 times [2025-03-08 22:45:40,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:45:40,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296027581] [2025-03-08 22:45:40,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:45:40,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:45:40,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 22:45:40,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 22:45:40,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:45:40,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:45:40,811 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 22:45:40,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:45:40,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296027581] [2025-03-08 22:45:40,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296027581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:45:40,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:45:40,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:45:40,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534086573] [2025-03-08 22:45:40,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:45:40,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:45:40,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:45:40,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:45:40,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:45:40,812 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 22:45:40,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:45:40,848 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2025-03-08 22:45:40,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:45:40,849 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2025-03-08 22:45:40,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:45:40,849 INFO L225 Difference]: With dead ends: 36 [2025-03-08 22:45:40,850 INFO L226 Difference]: Without dead ends: 36 [2025-03-08 22:45:40,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:45:40,851 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 14 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:45:40,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 86 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:45:40,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-08 22:45:40,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-03-08 22:45:40,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 32 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:45:40,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2025-03-08 22:45:40,853 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 27 [2025-03-08 22:45:40,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:45:40,853 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2025-03-08 22:45:40,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 22:45:40,853 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2025-03-08 22:45:40,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 22:45:40,856 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:45:40,856 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:45:40,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 22:45:40,857 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-08 22:45:40,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:45:40,857 INFO L85 PathProgramCache]: Analyzing trace with hash 2060858185, now seen corresponding path program 1 times [2025-03-08 22:45:40,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:45:40,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310234684] [2025-03-08 22:45:40,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:45:40,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:45:40,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 22:45:40,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 22:45:40,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:45:40,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:45:41,013 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 22:45:41,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:45:41,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310234684] [2025-03-08 22:45:41,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310234684] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:45:41,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:45:41,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:45:41,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634679318] [2025-03-08 22:45:41,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:45:41,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:45:41,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:45:41,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:45:41,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:45:41,015 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 22:45:41,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:45:41,040 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2025-03-08 22:45:41,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:45:41,040 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2025-03-08 22:45:41,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:45:41,041 INFO L225 Difference]: With dead ends: 35 [2025-03-08 22:45:41,041 INFO L226 Difference]: Without dead ends: 35 [2025-03-08 22:45:41,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:45:41,042 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 17 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:45:41,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 74 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:45:41,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-08 22:45:41,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-03-08 22:45:41,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.103448275862069) internal successors, (32), 31 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:45:41,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2025-03-08 22:45:41,044 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 27 [2025-03-08 22:45:41,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:45:41,044 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2025-03-08 22:45:41,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 22:45:41,044 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2025-03-08 22:45:41,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-08 22:45:41,045 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:45:41,045 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:45:41,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 22:45:41,045 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-08 22:45:41,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:45:41,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1531339854, now seen corresponding path program 1 times [2025-03-08 22:45:41,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:45:41,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868910274] [2025-03-08 22:45:41,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:45:41,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:45:41,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-08 22:45:41,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 22:45:41,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:45:41,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:45:41,130 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 22:45:41,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:45:41,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868910274] [2025-03-08 22:45:41,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868910274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:45:41,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:45:41,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:45:41,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754472811] [2025-03-08 22:45:41,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:45:41,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:45:41,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:45:41,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:45:41,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:45:41,132 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 22:45:41,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:45:41,155 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2025-03-08 22:45:41,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:45:41,157 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2025-03-08 22:45:41,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:45:41,157 INFO L225 Difference]: With dead ends: 34 [2025-03-08 22:45:41,157 INFO L226 Difference]: Without dead ends: 34 [2025-03-08 22:45:41,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:45:41,158 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:45:41,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 69 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:45:41,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-08 22:45:41,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-03-08 22:45:41,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 30 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:45:41,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2025-03-08 22:45:41,162 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 30 [2025-03-08 22:45:41,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:45:41,162 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2025-03-08 22:45:41,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 22:45:41,162 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2025-03-08 22:45:41,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-08 22:45:41,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:45:41,163 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:45:41,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 22:45:41,166 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-08 22:45:41,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:45:41,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1531339853, now seen corresponding path program 1 times [2025-03-08 22:45:41,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:45:41,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55299005] [2025-03-08 22:45:41,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:45:41,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:45:41,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-08 22:45:41,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 22:45:41,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:45:41,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:45:42,655 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:45:42,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:45:42,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55299005] [2025-03-08 22:45:42,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55299005] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:45:42,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:45:42,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 22:45:42,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725284491] [2025-03-08 22:45:42,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:45:42,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 22:45:42,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:45:42,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 22:45:42,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2025-03-08 22:45:42,657 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 15 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 22:45:43,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:45:43,046 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2025-03-08 22:45:43,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 22:45:43,046 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2025-03-08 22:45:43,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:45:43,046 INFO L225 Difference]: With dead ends: 38 [2025-03-08 22:45:43,046 INFO L226 Difference]: Without dead ends: 38 [2025-03-08 22:45:43,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2025-03-08 22:45:43,047 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 38 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:45:43,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 167 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:45:43,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-08 22:45:43,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-03-08 22:45:43,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 34 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:45:43,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2025-03-08 22:45:43,051 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 30 [2025-03-08 22:45:43,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:45:43,052 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2025-03-08 22:45:43,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 22:45:43,052 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2025-03-08 22:45:43,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-08 22:45:43,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:45:43,053 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:45:43,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 22:45:43,053 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-08 22:45:43,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:45:43,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1557260882, now seen corresponding path program 1 times [2025-03-08 22:45:43,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:45:43,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834959408] [2025-03-08 22:45:43,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:45:43,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:45:43,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-08 22:45:43,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 22:45:43,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:45:43,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:45:44,280 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:45:44,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:45:44,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834959408] [2025-03-08 22:45:44,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834959408] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:45:44,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094749480] [2025-03-08 22:45:44,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:45:44,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:45:44,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:45:44,283 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:45:44,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 22:45:44,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-08 22:45:44,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 22:45:44,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:45:44,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:45:44,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-08 22:45:44,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:45:44,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 12 [2025-03-08 22:45:44,588 INFO L349 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2025-03-08 22:45:44,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 25 [2025-03-08 22:45:44,618 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 22:45:44,619 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:45:44,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2025-03-08 22:45:44,790 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 22:45:44,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094749480] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:45:44,791 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:45:44,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 30 [2025-03-08 22:45:44,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639440497] [2025-03-08 22:45:44,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:45:44,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-08 22:45:44,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:45:44,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-08 22:45:44,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=789, Unknown=0, NotChecked=0, Total=870 [2025-03-08 22:45:44,793 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand has 30 states, 30 states have (on average 2.0) internal successors, (60), 29 states have internal predecessors, (60), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 22:45:45,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:45:45,490 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2025-03-08 22:45:45,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 22:45:45,490 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.0) internal successors, (60), 29 states have internal predecessors, (60), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2025-03-08 22:45:45,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:45:45,490 INFO L225 Difference]: With dead ends: 42 [2025-03-08 22:45:45,491 INFO L226 Difference]: Without dead ends: 42 [2025-03-08 22:45:45,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=203, Invalid=1777, Unknown=0, NotChecked=0, Total=1980 [2025-03-08 22:45:45,492 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 38 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:45:45,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 312 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:45:45,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-08 22:45:45,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-03-08 22:45:45,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.054054054054054) internal successors, (39), 38 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:45:45,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2025-03-08 22:45:45,493 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 32 [2025-03-08 22:45:45,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:45:45,494 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2025-03-08 22:45:45,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.0) internal successors, (60), 29 states have internal predecessors, (60), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 22:45:45,494 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2025-03-08 22:45:45,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-08 22:45:45,494 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:45:45,494 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:45:45,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 22:45:45,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:45:45,698 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-08 22:45:45,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:45:45,698 INFO L85 PathProgramCache]: Analyzing trace with hash -147353681, now seen corresponding path program 2 times [2025-03-08 22:45:45,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:45:45,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541770502] [2025-03-08 22:45:45,699 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:45:45,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:45:45,708 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-08 22:45:45,742 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 22:45:45,742 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:45:45,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:45:46,429 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:45:46,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:45:46,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541770502] [2025-03-08 22:45:46,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541770502] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:45:46,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022254423] [2025-03-08 22:45:46,429 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:45:46,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:45:46,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:45:46,431 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:45:46,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 22:45:46,466 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-08 22:45:46,491 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 22:45:46,491 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:45:46,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:45:46,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-08 22:45:46,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:45:46,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 12 [2025-03-08 22:45:46,731 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:45:46,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 12 [2025-03-08 22:45:46,752 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 22:45:46,752 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:45:46,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2025-03-08 22:45:47,000 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 22:45:47,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2022254423] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:45:47,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:45:47,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 12] total 34 [2025-03-08 22:45:47,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54314596] [2025-03-08 22:45:47,001 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:45:47,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-08 22:45:47,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:45:47,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-08 22:45:47,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1003, Unknown=0, NotChecked=0, Total=1122 [2025-03-08 22:45:47,002 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand has 34 states, 34 states have (on average 2.235294117647059) internal successors, (76), 33 states have internal predecessors, (76), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 22:45:47,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:45:47,947 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2025-03-08 22:45:47,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-08 22:45:47,947 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.235294117647059) internal successors, (76), 33 states have internal predecessors, (76), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 38 [2025-03-08 22:45:47,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:45:47,948 INFO L225 Difference]: With dead ends: 54 [2025-03-08 22:45:47,948 INFO L226 Difference]: Without dead ends: 54 [2025-03-08 22:45:47,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 614 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=516, Invalid=3024, Unknown=0, NotChecked=0, Total=3540 [2025-03-08 22:45:47,950 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 48 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:45:47,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 398 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:45:47,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-08 22:45:47,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-03-08 22:45:47,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 50 states have internal predecessors, (51), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:45:47,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2025-03-08 22:45:47,956 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 38 [2025-03-08 22:45:47,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:45:47,956 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2025-03-08 22:45:47,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.235294117647059) internal successors, (76), 33 states have internal predecessors, (76), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 22:45:47,956 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2025-03-08 22:45:47,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-08 22:45:47,956 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:45:47,956 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:45:47,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 22:45:48,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:45:48,157 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-08 22:45:48,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:45:48,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1365277993, now seen corresponding path program 3 times [2025-03-08 22:45:48,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:45:48,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92052423] [2025-03-08 22:45:48,158 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 22:45:48,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:45:48,164 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 50 statements into 11 equivalence classes. [2025-03-08 22:45:48,200 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 34 of 50 statements. [2025-03-08 22:45:48,200 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 22:45:48,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:45:48,979 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 11 proven. 20 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-08 22:45:48,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:45:48,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92052423] [2025-03-08 22:45:48,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92052423] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:45:48,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855409705] [2025-03-08 22:45:48,980 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 22:45:48,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:45:48,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:45:48,981 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:45:48,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 22:45:49,015 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 50 statements into 11 equivalence classes. [2025-03-08 22:45:49,057 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 34 of 50 statements. [2025-03-08 22:45:49,057 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 22:45:49,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:45:49,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-08 22:45:49,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:45:49,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 12 [2025-03-08 22:45:49,418 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:45:49,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 111 treesize of output 80 [2025-03-08 22:45:49,800 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 21 proven. 10 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-08 22:45:49,800 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:45:49,935 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:45:49,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 92 [2025-03-08 22:45:52,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 414 treesize of output 369 [2025-03-08 22:45:52,037 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-08 22:45:52,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855409705] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:45:52,037 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:45:52,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 9] total 29 [2025-03-08 22:45:52,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398721263] [2025-03-08 22:45:52,038 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:45:52,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-08 22:45:52,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:45:52,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-08 22:45:52,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=779, Unknown=0, NotChecked=0, Total=870 [2025-03-08 22:45:52,042 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand has 30 states, 29 states have (on average 2.8275862068965516) internal successors, (82), 29 states have internal predecessors, (82), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 22:45:52,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:45:52,647 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2025-03-08 22:45:52,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 22:45:52,647 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.8275862068965516) internal successors, (82), 29 states have internal predecessors, (82), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 50 [2025-03-08 22:45:52,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:45:52,648 INFO L225 Difference]: With dead ends: 53 [2025-03-08 22:45:52,648 INFO L226 Difference]: Without dead ends: 53 [2025-03-08 22:45:52,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=225, Invalid=1497, Unknown=0, NotChecked=0, Total=1722 [2025-03-08 22:45:52,649 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 46 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:45:52,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 303 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:45:52,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-08 22:45:52,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-03-08 22:45:52,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 49 states have internal predecessors, (50), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:45:52,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2025-03-08 22:45:52,652 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 50 [2025-03-08 22:45:52,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:45:52,652 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2025-03-08 22:45:52,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.8275862068965516) internal successors, (82), 29 states have internal predecessors, (82), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 22:45:52,652 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2025-03-08 22:45:52,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-08 22:45:52,652 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:45:52,652 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:45:52,662 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 22:45:52,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-08 22:45:52,853 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-08 22:45:52,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:45:52,853 INFO L85 PathProgramCache]: Analyzing trace with hash 471099721, now seen corresponding path program 1 times [2025-03-08 22:45:52,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:45:52,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519376912] [2025-03-08 22:45:52,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:45:52,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:45:52,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-08 22:45:52,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-08 22:45:52,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:45:52,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:45:54,850 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 2 proven. 110 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:45:54,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:45:54,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519376912] [2025-03-08 22:45:54,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519376912] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:45:54,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143649863] [2025-03-08 22:45:54,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:45:54,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:45:54,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:45:54,853 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:45:54,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 22:45:54,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-08 22:45:54,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-08 22:45:54,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:45:54,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:45:54,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-03-08 22:45:54,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:45:54,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 12 [2025-03-08 22:45:55,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2025-03-08 22:45:55,631 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 22:45:55,631 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:45:56,274 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 22:45:56,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143649863] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:45:56,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:45:56,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 22, 22] total 61 [2025-03-08 22:45:56,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113498844] [2025-03-08 22:45:56,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:45:56,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2025-03-08 22:45:56,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:45:56,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2025-03-08 22:45:56,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=352, Invalid=3308, Unknown=0, NotChecked=0, Total=3660 [2025-03-08 22:45:56,276 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand has 61 states, 61 states have (on average 1.9672131147540983) internal successors, (120), 60 states have internal predecessors, (120), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 22:46:00,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:00,877 INFO L93 Difference]: Finished difference Result 90 states and 101 transitions. [2025-03-08 22:46:00,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-03-08 22:46:00,878 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 1.9672131147540983) internal successors, (120), 60 states have internal predecessors, (120), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 55 [2025-03-08 22:46:00,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:00,878 INFO L225 Difference]: With dead ends: 90 [2025-03-08 22:46:00,878 INFO L226 Difference]: Without dead ends: 75 [2025-03-08 22:46:00,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3463 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1738, Invalid=13268, Unknown=0, NotChecked=0, Total=15006 [2025-03-08 22:46:00,881 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 216 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 2055 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 2082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 2055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:00,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 547 Invalid, 2082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 2055 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 22:46:00,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-08 22:46:00,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-03-08 22:46:00,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 71 states have (on average 1.0140845070422535) internal successors, (72), 71 states have internal predecessors, (72), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:46:00,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2025-03-08 22:46:00,887 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 55 [2025-03-08 22:46:00,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:00,887 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2025-03-08 22:46:00,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 1.9672131147540983) internal successors, (120), 60 states have internal predecessors, (120), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 22:46:00,887 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2025-03-08 22:46:00,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 22:46:00,888 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:00,888 INFO L218 NwaCegarLoop]: trace histogram [22, 21, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:46:00,894 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 22:46:01,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-08 22:46:01,088 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-08 22:46:01,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:01,089 INFO L85 PathProgramCache]: Analyzing trace with hash -541564844, now seen corresponding path program 2 times [2025-03-08 22:46:01,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:01,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167113295] [2025-03-08 22:46:01,089 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:46:01,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:01,095 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-03-08 22:46:01,145 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 22:46:01,145 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:46:01,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:04,544 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 422 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:46:04,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:04,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167113295] [2025-03-08 22:46:04,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167113295] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:46:04,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284792749] [2025-03-08 22:46:04,544 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:46:04,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:46:04,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:46:04,546 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:46:04,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 22:46:04,587 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-03-08 22:46:04,718 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 22:46:04,718 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:46:04,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:04,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-08 22:46:04,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:46:04,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 12 [2025-03-08 22:46:05,682 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:46:05,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 12 [2025-03-08 22:46:05,708 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 442 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 22:46:05,708 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:46:06,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 23 [2025-03-08 22:46:06,612 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 442 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 22:46:06,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284792749] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:46:06,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:46:06,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 28, 28] total 78 [2025-03-08 22:46:06,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215675041] [2025-03-08 22:46:06,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:46:06,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2025-03-08 22:46:06,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:06,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2025-03-08 22:46:06,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=895, Invalid=5111, Unknown=0, NotChecked=0, Total=6006 [2025-03-08 22:46:06,615 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand has 78 states, 77 states have (on average 2.116883116883117) internal successors, (163), 77 states have internal predecessors, (163), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 22:46:07,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:07,931 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2025-03-08 22:46:07,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 22:46:07,931 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 77 states have (on average 2.116883116883117) internal successors, (163), 77 states have internal predecessors, (163), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 77 [2025-03-08 22:46:07,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:07,932 INFO L225 Difference]: With dead ends: 45 [2025-03-08 22:46:07,932 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 22:46:07,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 109 SyntacticMatches, 11 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3930 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1350, Invalid=7962, Unknown=0, NotChecked=0, Total=9312 [2025-03-08 22:46:07,934 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 12 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:07,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 172 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 22:46:07,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 22:46:07,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 22:46:07,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:46:07,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 22:46:07,934 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 77 [2025-03-08 22:46:07,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:07,934 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 22:46:07,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 77 states have (on average 2.116883116883117) internal successors, (163), 77 states have internal predecessors, (163), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 22:46:07,934 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 22:46:07,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 22:46:07,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (17 of 18 remaining) [2025-03-08 22:46:07,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (16 of 18 remaining) [2025-03-08 22:46:07,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 18 remaining) [2025-03-08 22:46:07,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 18 remaining) [2025-03-08 22:46:07,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 18 remaining) [2025-03-08 22:46:07,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 18 remaining) [2025-03-08 22:46:07,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 18 remaining) [2025-03-08 22:46:07,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 18 remaining) [2025-03-08 22:46:07,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 18 remaining) [2025-03-08 22:46:07,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 18 remaining) [2025-03-08 22:46:07,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 18 remaining) [2025-03-08 22:46:07,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 18 remaining) [2025-03-08 22:46:07,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 18 remaining) [2025-03-08 22:46:07,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 18 remaining) [2025-03-08 22:46:07,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 18 remaining) [2025-03-08 22:46:07,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 18 remaining) [2025-03-08 22:46:07,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 18 remaining) [2025-03-08 22:46:07,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 18 remaining) [2025-03-08 22:46:07,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-08 22:46:08,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:46:08,140 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:46:08,141 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 22:46:08,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 10:46:08 BoogieIcfgContainer [2025-03-08 22:46:08,143 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 22:46:08,144 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 22:46:08,144 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 22:46:08,144 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 22:46:08,144 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:45:37" (3/4) ... [2025-03-08 22:46:08,145 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 22:46:08,150 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure get_dummy [2025-03-08 22:46:08,152 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-03-08 22:46:08,153 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-08 22:46:08,153 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 22:46:08,153 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 22:46:08,202 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 22:46:08,203 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 22:46:08,203 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 22:46:08,203 INFO L158 Benchmark]: Toolchain (without parser) took 31189.59ms. Allocated memory was 142.6MB in the beginning and 838.9MB in the end (delta: 696.3MB). Free memory was 106.2MB in the beginning and 659.7MB in the end (delta: -553.6MB). Peak memory consumption was 139.8MB. Max. memory is 16.1GB. [2025-03-08 22:46:08,203 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:46:08,203 INFO L158 Benchmark]: CACSL2BoogieTranslator took 174.50ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 94.0MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 22:46:08,204 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.58ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 92.3MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 22:46:08,204 INFO L158 Benchmark]: Boogie Preprocessor took 31.95ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 91.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:46:08,204 INFO L158 Benchmark]: IcfgBuilder took 289.14ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 73.3MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 22:46:08,204 INFO L158 Benchmark]: TraceAbstraction took 30606.61ms. Allocated memory was 142.6MB in the beginning and 838.9MB in the end (delta: 696.3MB). Free memory was 73.3MB in the beginning and 664.2MB in the end (delta: -590.9MB). Peak memory consumption was 106.2MB. Max. memory is 16.1GB. [2025-03-08 22:46:08,204 INFO L158 Benchmark]: Witness Printer took 59.21ms. Allocated memory is still 838.9MB. Free memory was 664.2MB in the beginning and 659.7MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:46:08,205 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 174.50ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 94.0MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.58ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 92.3MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.95ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 91.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 289.14ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 73.3MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 30606.61ms. Allocated memory was 142.6MB in the beginning and 838.9MB in the end (delta: 696.3MB). Free memory was 73.3MB in the beginning and 664.2MB in the end (delta: -590.9MB). Peak memory consumption was 106.2MB. Max. memory is 16.1GB. * Witness Printer took 59.21ms. Allocated memory is still 838.9MB. Free memory was 664.2MB in the beginning and 659.7MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 33]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 3]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 55 locations, 61 edges, 18 error locations. Started 1 CEGAR loops. OverallTime: 30.6s, OverallIterations: 16, TraceHistogramMax: 22, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 9.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 705 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 695 mSDsluCounter, 2533 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2119 mSDsCounter, 64 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4721 IncrementalHoareTripleChecker+Invalid, 4785 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 64 mSolverCounterUnsat, 414 mSDtfsCounter, 4721 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 863 GetRequests, 420 SyntacticMatches, 15 SemanticMatches, 428 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8796 ImplicationChecksByTransitivity, 13.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=15, InterpolantAutomatonStates: 211, 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, 16 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 18.8s InterpolantComputationTime, 754 NumberOfCodeBlocks, 722 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 978 ConstructedInterpolants, 24 QuantifiedInterpolants, 21317 SizeOfPredicates, 41 NumberOfNonLiveVariables, 1939 ConjunctsInSsa, 233 ConjunctsInUnsatCore, 28 InterpolantComputations, 11 PerfectInterpolantSequences, 1643/2184 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-08 22:46:08,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE