./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrcspn-alloca-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-memory-alloca/openbsd_cstrcspn-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash de88cb9f8af309bfee7e34496a9472de4d446e8ed690818c0d2fc3e900b2d7c4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 22:42:45,156 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:42:45,206 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-03-08 22:42:45,209 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:42:45,209 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:42:45,224 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:42:45,225 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:42:45,225 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:42:45,225 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 22:42:45,225 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 22:42:45,225 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:42:45,225 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:42:45,225 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:42:45,225 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:42:45,226 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:42:45,226 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:42:45,226 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:42:45,226 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:42:45,226 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-08 22:42:45,226 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-08 22:42:45,226 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-08 22:42:45,226 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:42:45,226 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 22:42:45,226 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:42:45,226 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:42:45,226 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:42:45,226 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:42:45,226 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:42:45,226 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 22:42:45,226 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:42:45,226 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:42:45,227 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:42:45,227 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:42:45,227 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:42:45,227 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:42:45,227 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:42:45,227 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:42:45,227 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:42:45,227 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:42:45,227 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> de88cb9f8af309bfee7e34496a9472de4d446e8ed690818c0d2fc3e900b2d7c4 [2025-03-08 22:42:45,436 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:42:45,441 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:42:45,442 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:42:45,443 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:42:45,443 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:42:45,444 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrcspn-alloca-1.i [2025-03-08 22:42:46,602 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74f5e673d/9084ac4974da45e18c9ee47c1c8ef54f/FLAG14ca17740 [2025-03-08 22:42:46,842 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:42:46,842 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/openbsd_cstrcspn-alloca-1.i [2025-03-08 22:42:46,856 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74f5e673d/9084ac4974da45e18c9ee47c1c8ef54f/FLAG14ca17740 [2025-03-08 22:42:47,176 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74f5e673d/9084ac4974da45e18c9ee47c1c8ef54f [2025-03-08 22:42:47,178 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:42:47,180 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:42:47,181 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:42:47,182 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:42:47,185 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:42:47,185 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:42:47" (1/1) ... [2025-03-08 22:42:47,186 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79600425 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:42:47, skipping insertion in model container [2025-03-08 22:42:47,186 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:42:47" (1/1) ... [2025-03-08 22:42:47,206 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:42:47,366 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:42:47,367 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:42:47,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:42:47,375 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:42:47,407 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:42:47,425 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:42:47,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:42:47 WrapperNode [2025-03-08 22:42:47,426 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:42:47,426 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:42:47,426 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:42:47,426 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:42:47,430 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:42:47" (1/1) ... [2025-03-08 22:42:47,436 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:42:47" (1/1) ... [2025-03-08 22:42:47,450 INFO L138 Inliner]: procedures = 111, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 64 [2025-03-08 22:42:47,450 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:42:47,451 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:42:47,451 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:42:47,451 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:42:47,456 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:42:47" (1/1) ... [2025-03-08 22:42:47,457 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:42:47" (1/1) ... [2025-03-08 22:42:47,458 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:42:47" (1/1) ... [2025-03-08 22:42:47,468 INFO L175 MemorySlicer]: Split 4 memory accesses to 2 slices as follows [2, 2]. 50 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 2 writes are split as follows [1, 1]. [2025-03-08 22:42:47,468 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:42:47" (1/1) ... [2025-03-08 22:42:47,468 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:42:47" (1/1) ... [2025-03-08 22:42:47,472 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:42:47" (1/1) ... [2025-03-08 22:42:47,472 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:42:47" (1/1) ... [2025-03-08 22:42:47,473 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:42:47" (1/1) ... [2025-03-08 22:42:47,473 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:42:47" (1/1) ... [2025-03-08 22:42:47,474 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:42:47,475 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:42:47,475 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:42:47,475 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:42:47,476 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:42:47" (1/1) ... [2025-03-08 22:42:47,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:42:47,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:42:47,504 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:42:47,507 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:42:47,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 22:42:47,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 22:42:47,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 22:42:47,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 22:42:47,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 22:42:47,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 22:42:47,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:42:47,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:42:47,602 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:42:47,604 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:42:47,709 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L574: havoc main_#t~ret10#1;call ULTIMATE.dealloc(main_#t~malloc8#1.base, main_#t~malloc8#1.offset);havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call ULTIMATE.dealloc(main_#t~malloc9#1.base, main_#t~malloc9#1.offset);havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset; [2025-03-08 22:42:47,716 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2025-03-08 22:42:47,716 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:42:47,723 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:42:47,723 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:42:47,723 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:42:47 BoogieIcfgContainer [2025-03-08 22:42:47,723 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:42:47,725 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:42:47,725 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:42:47,728 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:42:47,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:42:47" (1/3) ... [2025-03-08 22:42:47,729 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f326c55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:42:47, skipping insertion in model container [2025-03-08 22:42:47,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:42:47" (2/3) ... [2025-03-08 22:42:47,729 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f326c55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:42:47, skipping insertion in model container [2025-03-08 22:42:47,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:42:47" (3/3) ... [2025-03-08 22:42:47,730 INFO L128 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcspn-alloca-1.i [2025-03-08 22:42:47,740 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:42:47,741 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG openbsd_cstrcspn-alloca-1.i that has 1 procedures, 29 locations, 1 initial locations, 2 loop locations, and 9 error locations. [2025-03-08 22:42:47,767 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:42:47,776 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;@3310fdca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:42:47,777 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-03-08 22:42:47,780 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 28 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:42:47,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-08 22:42:47,783 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:42:47,784 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-08 22:42:47,784 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-08 22:42:47,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:42:47,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1921906748, now seen corresponding path program 1 times [2025-03-08 22:42:47,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:42:47,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429385060] [2025-03-08 22:42:47,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:42:47,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:42:47,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 22:42:47,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 22:42:47,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:42:47,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:42:48,029 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:42:48,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:42:48,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429385060] [2025-03-08 22:42:48,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429385060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:42:48,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:42:48,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:42:48,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776000560] [2025-03-08 22:42:48,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:42:48,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:42:48,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:42:48,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:42:48,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:42:48,058 INFO L87 Difference]: Start difference. First operand has 29 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 28 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:42:48,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:42:48,094 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2025-03-08 22:42:48,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:42:48,099 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-08 22:42:48,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:42:48,102 INFO L225 Difference]: With dead ends: 28 [2025-03-08 22:42:48,103 INFO L226 Difference]: Without dead ends: 26 [2025-03-08 22:42:48,104 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:42:48,107 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 4 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:42:48,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 41 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:42:48,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-08 22:42:48,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-03-08 22:42:48,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:42:48,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2025-03-08 22:42:48,134 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 6 [2025-03-08 22:42:48,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:42:48,135 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2025-03-08 22:42:48,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:42:48,135 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2025-03-08 22:42:48,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-08 22:42:48,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:42:48,135 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-08 22:42:48,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 22:42:48,135 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-08 22:42:48,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:42:48,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1921906749, now seen corresponding path program 1 times [2025-03-08 22:42:48,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:42:48,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772946732] [2025-03-08 22:42:48,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:42:48,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:42:48,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 22:42:48,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 22:42:48,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:42:48,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:42:48,388 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:42:48,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:42:48,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772946732] [2025-03-08 22:42:48,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772946732] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:42:48,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:42:48,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:42:48,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854617373] [2025-03-08 22:42:48,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:42:48,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:42:48,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:42:48,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:42:48,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:42:48,390 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:42:48,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:42:48,409 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2025-03-08 22:42:48,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:42:48,409 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-08 22:42:48,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:42:48,410 INFO L225 Difference]: With dead ends: 29 [2025-03-08 22:42:48,410 INFO L226 Difference]: Without dead ends: 29 [2025-03-08 22:42:48,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:42:48,410 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:42:48,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 52 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:42:48,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-08 22:42:48,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-03-08 22:42:48,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:42:48,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2025-03-08 22:42:48,414 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 6 [2025-03-08 22:42:48,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:42:48,415 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2025-03-08 22:42:48,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:42:48,415 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2025-03-08 22:42:48,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-08 22:42:48,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:42:48,415 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-08 22:42:48,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 22:42:48,415 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-08 22:42:48,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:42:48,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1921936540, now seen corresponding path program 1 times [2025-03-08 22:42:48,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:42:48,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079107886] [2025-03-08 22:42:48,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:42:48,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:42:48,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 22:42:48,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 22:42:48,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:42:48,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:42:48,575 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:42:48,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:42:48,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079107886] [2025-03-08 22:42:48,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079107886] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:42:48,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:42:48,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:42:48,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689202342] [2025-03-08 22:42:48,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:42:48,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:42:48,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:42:48,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:42:48,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:42:48,578 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:42:48,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:42:48,596 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2025-03-08 22:42:48,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:42:48,600 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-08 22:42:48,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:42:48,600 INFO L225 Difference]: With dead ends: 28 [2025-03-08 22:42:48,600 INFO L226 Difference]: Without dead ends: 28 [2025-03-08 22:42:48,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:42:48,601 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:42:48,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 68 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:42:48,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-08 22:42:48,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2025-03-08 22:42:48,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:42:48,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2025-03-08 22:42:48,603 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 6 [2025-03-08 22:42:48,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:42:48,603 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2025-03-08 22:42:48,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:42:48,603 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2025-03-08 22:42:48,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-08 22:42:48,603 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:42:48,603 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:42:48,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 22:42:48,603 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-08 22:42:48,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:42:48,606 INFO L85 PathProgramCache]: Analyzing trace with hash -550432963, now seen corresponding path program 1 times [2025-03-08 22:42:48,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:42:48,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693514933] [2025-03-08 22:42:48,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:42:48,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:42:48,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 22:42:48,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 22:42:48,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:42:48,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:42:48,782 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:42:48,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:42:48,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693514933] [2025-03-08 22:42:48,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693514933] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:42:48,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:42:48,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:42:48,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41138146] [2025-03-08 22:42:48,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:42:48,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:42:48,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:42:48,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:42:48,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:42:48,789 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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:42:48,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:42:48,832 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2025-03-08 22:42:48,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:42:48,833 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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:42:48,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:42:48,833 INFO L225 Difference]: With dead ends: 27 [2025-03-08 22:42:48,833 INFO L226 Difference]: Without dead ends: 27 [2025-03-08 22:42:48,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:42:48,833 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:42:48,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 55 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:42:48,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-08 22:42:48,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2025-03-08 22:42:48,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.5) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:42:48,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2025-03-08 22:42:48,835 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 7 [2025-03-08 22:42:48,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:42:48,835 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2025-03-08 22:42:48,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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:42:48,836 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2025-03-08 22:42:48,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-08 22:42:48,836 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:42:48,836 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:42:48,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 22:42:48,836 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-08 22:42:48,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:42:48,837 INFO L85 PathProgramCache]: Analyzing trace with hash -550432962, now seen corresponding path program 1 times [2025-03-08 22:42:48,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:42:48,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139885346] [2025-03-08 22:42:48,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:42:48,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:42:48,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 22:42:48,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 22:42:48,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:42:48,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:42:48,927 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:42:48,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:42:48,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139885346] [2025-03-08 22:42:48,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139885346] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:42:48,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:42:48,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:42:48,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250507668] [2025-03-08 22:42:48,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:42:48,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:42:48,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:42:48,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:42:48,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:42:48,929 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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:42:48,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:42:48,943 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2025-03-08 22:42:48,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:42:48,945 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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:42:48,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:42:48,945 INFO L225 Difference]: With dead ends: 27 [2025-03-08 22:42:48,945 INFO L226 Difference]: Without dead ends: 27 [2025-03-08 22:42:48,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:42:48,946 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:42:48,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:42:48,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-08 22:42:48,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-03-08 22:42:48,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:42:48,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2025-03-08 22:42:48,947 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 7 [2025-03-08 22:42:48,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:42:48,948 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2025-03-08 22:42:48,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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:42:48,948 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2025-03-08 22:42:48,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-08 22:42:48,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:42:48,948 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:42:48,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 22:42:48,948 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-08 22:42:48,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:42:48,950 INFO L85 PathProgramCache]: Analyzing trace with hash -550403171, now seen corresponding path program 1 times [2025-03-08 22:42:48,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:42:48,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204731185] [2025-03-08 22:42:48,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:42:48,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:42:48,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 22:42:48,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 22:42:48,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:42:48,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:42:49,059 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:42:49,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:42:49,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204731185] [2025-03-08 22:42:49,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204731185] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:42:49,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:42:49,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:42:49,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144904281] [2025-03-08 22:42:49,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:42:49,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:42:49,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:42:49,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:42:49,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:42:49,060 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 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:42:49,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:42:49,074 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2025-03-08 22:42:49,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:42:49,075 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 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:42:49,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:42:49,076 INFO L225 Difference]: With dead ends: 26 [2025-03-08 22:42:49,076 INFO L226 Difference]: Without dead ends: 26 [2025-03-08 22:42:49,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:42:49,076 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 1 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:42:49,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 43 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:42:49,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-08 22:42:49,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2025-03-08 22:42:49,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 22 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:42:49,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2025-03-08 22:42:49,078 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 7 [2025-03-08 22:42:49,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:42:49,078 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2025-03-08 22:42:49,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 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:42:49,078 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2025-03-08 22:42:49,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 22:42:49,078 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:42:49,078 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:42:49,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 22:42:49,082 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-08 22:42:49,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:42:49,082 INFO L85 PathProgramCache]: Analyzing trace with hash 236727384, now seen corresponding path program 1 times [2025-03-08 22:42:49,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:42:49,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780006176] [2025-03-08 22:42:49,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:42:49,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:42:49,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 22:42:49,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 22:42:49,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:42:49,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:42:49,141 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:42:49,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:42:49,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780006176] [2025-03-08 22:42:49,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780006176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:42:49,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:42:49,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:42:49,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077999502] [2025-03-08 22:42:49,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:42:49,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:42:49,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:42:49,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:42:49,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:42:49,142 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:42:49,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:42:49,182 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2025-03-08 22:42:49,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:42:49,183 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-08 22:42:49,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:42:49,183 INFO L225 Difference]: With dead ends: 22 [2025-03-08 22:42:49,183 INFO L226 Difference]: Without dead ends: 22 [2025-03-08 22:42:49,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:42:49,183 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 12 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:42:49,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 43 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:42:49,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-08 22:42:49,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-03-08 22:42:49,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:42:49,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2025-03-08 22:42:49,185 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 10 [2025-03-08 22:42:49,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:42:49,185 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2025-03-08 22:42:49,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:42:49,185 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2025-03-08 22:42:49,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 22:42:49,185 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:42:49,185 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:42:49,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 22:42:49,186 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-08 22:42:49,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:42:49,186 INFO L85 PathProgramCache]: Analyzing trace with hash 236727385, now seen corresponding path program 1 times [2025-03-08 22:42:49,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:42:49,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165570478] [2025-03-08 22:42:49,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:42:49,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:42:49,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 22:42:49,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 22:42:49,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:42:49,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:42:49,303 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:42:49,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:42:49,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165570478] [2025-03-08 22:42:49,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165570478] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:42:49,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:42:49,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 22:42:49,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679861745] [2025-03-08 22:42:49,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:42:49,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 22:42:49,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:42:49,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 22:42:49,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:42:49,304 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:42:49,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:42:49,346 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2025-03-08 22:42:49,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 22:42:49,347 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-08 22:42:49,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:42:49,347 INFO L225 Difference]: With dead ends: 24 [2025-03-08 22:42:49,347 INFO L226 Difference]: Without dead ends: 24 [2025-03-08 22:42:49,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:42:49,348 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:42:49,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 92 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:42:49,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-08 22:42:49,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-03-08 22:42:49,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.35) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:42:49,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2025-03-08 22:42:49,349 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 10 [2025-03-08 22:42:49,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:42:49,349 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2025-03-08 22:42:49,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:42:49,349 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2025-03-08 22:42:49,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-08 22:42:49,350 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:42:49,350 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:42:49,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 22:42:49,350 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-08 22:42:49,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:42:49,350 INFO L85 PathProgramCache]: Analyzing trace with hash 9182743, now seen corresponding path program 1 times [2025-03-08 22:42:49,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:42:49,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857329374] [2025-03-08 22:42:49,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:42:49,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:42:49,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 22:42:49,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 22:42:49,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:42:49,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:42:49,410 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:42:49,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:42:49,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857329374] [2025-03-08 22:42:49,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857329374] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:42:49,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:42:49,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:42:49,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317728101] [2025-03-08 22:42:49,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:42:49,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:42:49,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:42:49,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:42:49,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:42:49,412 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:42:49,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:42:49,473 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2025-03-08 22:42:49,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:42:49,473 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-08 22:42:49,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:42:49,473 INFO L225 Difference]: With dead ends: 24 [2025-03-08 22:42:49,473 INFO L226 Difference]: Without dead ends: 24 [2025-03-08 22:42:49,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:42:49,475 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 21 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:42:49,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 47 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:42:49,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-08 22:42:49,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2025-03-08 22:42:49,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 20 states have (on average 1.3) internal successors, (26), 22 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:42:49,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2025-03-08 22:42:49,478 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 13 [2025-03-08 22:42:49,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:42:49,478 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2025-03-08 22:42:49,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:42:49,479 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2025-03-08 22:42:49,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-08 22:42:49,479 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:42:49,479 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:42:49,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 22:42:49,479 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-08 22:42:49,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:42:49,480 INFO L85 PathProgramCache]: Analyzing trace with hash 9182744, now seen corresponding path program 1 times [2025-03-08 22:42:49,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:42:49,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860127587] [2025-03-08 22:42:49,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:42:49,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:42:49,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 22:42:49,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 22:42:49,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:42:49,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:42:49,627 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:42:49,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:42:49,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860127587] [2025-03-08 22:42:49,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860127587] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:42:49,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:42:49,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 22:42:49,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160739203] [2025-03-08 22:42:49,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:42:49,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 22:42:49,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:42:49,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 22:42:49,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:42:49,628 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:42:49,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:42:49,694 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2025-03-08 22:42:49,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 22:42:49,694 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-08 22:42:49,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:42:49,694 INFO L225 Difference]: With dead ends: 25 [2025-03-08 22:42:49,695 INFO L226 Difference]: Without dead ends: 25 [2025-03-08 22:42:49,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-08 22:42:49,696 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:42:49,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 69 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:42:49,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-08 22:42:49,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-03-08 22:42:49,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:42:49,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2025-03-08 22:42:49,699 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 13 [2025-03-08 22:42:49,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:42:49,699 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2025-03-08 22:42:49,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:42:49,699 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2025-03-08 22:42:49,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 22:42:49,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:42:49,699 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:42:49,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 22:42:49,700 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-08 22:42:49,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:42:49,700 INFO L85 PathProgramCache]: Analyzing trace with hash -2105029295, now seen corresponding path program 1 times [2025-03-08 22:42:49,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:42:49,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076011997] [2025-03-08 22:42:49,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:42:49,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:42:49,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 22:42:49,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 22:42:49,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:42:49,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:42:49,835 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:42:49,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:42:49,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076011997] [2025-03-08 22:42:49,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076011997] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:42:49,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:42:49,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:42:49,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391655568] [2025-03-08 22:42:49,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:42:49,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:42:49,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:42:49,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:42:49,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:42:49,836 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:42:49,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:42:49,850 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2025-03-08 22:42:49,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:42:49,851 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-08 22:42:49,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:42:49,851 INFO L225 Difference]: With dead ends: 24 [2025-03-08 22:42:49,851 INFO L226 Difference]: Without dead ends: 22 [2025-03-08 22:42:49,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:42:49,851 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 7 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:42:49,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 32 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:42:49,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-08 22:42:49,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-03-08 22:42:49,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:42:49,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2025-03-08 22:42:49,853 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 17 [2025-03-08 22:42:49,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:42:49,853 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2025-03-08 22:42:49,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:42:49,853 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2025-03-08 22:42:49,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 22:42:49,853 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:42:49,853 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:42:49,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 22:42:49,853 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-08 22:42:49,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:42:49,854 INFO L85 PathProgramCache]: Analyzing trace with hash -831367537, now seen corresponding path program 1 times [2025-03-08 22:42:49,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:42:49,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99232308] [2025-03-08 22:42:49,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:42:49,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:42:49,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 22:42:49,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 22:42:49,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:42:49,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:42:50,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:42:50,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:42:50,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99232308] [2025-03-08 22:42:50,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99232308] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:42:50,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:42:50,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 22:42:50,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30256800] [2025-03-08 22:42:50,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:42:50,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 22:42:50,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:42:50,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 22:42:50,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-08 22:42:50,037 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 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:42:50,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:42:50,105 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2025-03-08 22:42:50,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 22:42:50,106 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 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 18 [2025-03-08 22:42:50,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:42:50,106 INFO L225 Difference]: With dead ends: 37 [2025-03-08 22:42:50,106 INFO L226 Difference]: Without dead ends: 37 [2025-03-08 22:42:50,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-03-08 22:42:50,107 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 7 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:42:50,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 94 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:42:50,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-08 22:42:50,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2025-03-08 22:42:50,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 35 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:42:50,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2025-03-08 22:42:50,108 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 18 [2025-03-08 22:42:50,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:42:50,108 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2025-03-08 22:42:50,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 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:42:50,109 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2025-03-08 22:42:50,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 22:42:50,109 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:42:50,109 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:42:50,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 22:42:50,109 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-08 22:42:50,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:42:50,109 INFO L85 PathProgramCache]: Analyzing trace with hash -831366384, now seen corresponding path program 1 times [2025-03-08 22:42:50,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:42:50,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597943534] [2025-03-08 22:42:50,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:42:50,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:42:50,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 22:42:50,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 22:42:50,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:42:50,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:42:50,286 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:42:50,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:42:50,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597943534] [2025-03-08 22:42:50,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597943534] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:42:50,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:42:50,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 22:42:50,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915276347] [2025-03-08 22:42:50,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:42:50,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 22:42:50,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:42:50,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 22:42:50,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-08 22:42:50,287 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 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:42:50,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:42:50,342 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2025-03-08 22:42:50,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 22:42:50,343 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 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 18 [2025-03-08 22:42:50,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:42:50,344 INFO L225 Difference]: With dead ends: 64 [2025-03-08 22:42:50,344 INFO L226 Difference]: Without dead ends: 52 [2025-03-08 22:42:50,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-08 22:42:50,344 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 4 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:42:50,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 100 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:42:50,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-08 22:42:50,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2025-03-08 22:42:50,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 50 states have internal predecessors, (56), 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:42:50,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2025-03-08 22:42:50,347 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 18 [2025-03-08 22:42:50,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:42:50,347 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2025-03-08 22:42:50,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 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:42:50,347 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2025-03-08 22:42:50,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 22:42:50,348 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:42:50,348 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:42:50,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 22:42:50,348 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-08 22:42:50,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:42:50,348 INFO L85 PathProgramCache]: Analyzing trace with hash 676184272, now seen corresponding path program 1 times [2025-03-08 22:42:50,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:42:50,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528046326] [2025-03-08 22:42:50,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:42:50,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:42:50,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 22:42:50,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 22:42:50,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:42:50,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:42:50,665 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:42:50,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:42:50,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528046326] [2025-03-08 22:42:50,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528046326] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:42:50,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542228864] [2025-03-08 22:42:50,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:42:50,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:42:50,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:42:50,671 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:42:50,672 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:42:50,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 22:42:50,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 22:42:50,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:42:50,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:42:50,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-03-08 22:42:50,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:42:50,832 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 11 treesize of output 7 [2025-03-08 22:42:50,876 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 14 treesize of output 10 [2025-03-08 22:42:51,323 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:42:51,323 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 20 treesize of output 17 [2025-03-08 22:42:51,481 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:42:51,481 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:42:51,877 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 13 treesize of output 11 [2025-03-08 22:42:51,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 11 [2025-03-08 22:42:51,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 20 [2025-03-08 22:42:51,921 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:42:51,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542228864] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:42:51,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:42:51,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 10] total 33 [2025-03-08 22:42:51,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191678851] [2025-03-08 22:42:51,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:42:51,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-08 22:42:51,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:42:51,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-08 22:42:51,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1012, Unknown=0, NotChecked=0, Total=1122 [2025-03-08 22:42:51,924 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand has 34 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 34 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:42:52,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:42:52,683 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2025-03-08 22:42:52,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-08 22:42:52,683 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 34 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-08 22:42:52,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:42:52,684 INFO L225 Difference]: With dead ends: 61 [2025-03-08 22:42:52,684 INFO L226 Difference]: Without dead ends: 61 [2025-03-08 22:42:52,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=257, Invalid=2499, Unknown=0, NotChecked=0, Total=2756 [2025-03-08 22:42:52,685 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 50 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:42:52,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 108 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:42:52,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-08 22:42:52,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-03-08 22:42:52,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 59 states have (on average 1.1355932203389831) internal successors, (67), 60 states have internal predecessors, (67), 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:42:52,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2025-03-08 22:42:52,689 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 18 [2025-03-08 22:42:52,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:42:52,689 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2025-03-08 22:42:52,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 34 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:42:52,689 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2025-03-08 22:42:52,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 22:42:52,690 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:42:52,690 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:42:52,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 22:42:52,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-08 22:42:52,890 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-08 22:42:52,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:42:52,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1341900561, now seen corresponding path program 1 times [2025-03-08 22:42:52,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:42:52,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358128077] [2025-03-08 22:42:52,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:42:52,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:42:52,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 22:42:52,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 22:42:52,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:42:52,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:42:53,134 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:42:53,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:42:53,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358128077] [2025-03-08 22:42:53,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358128077] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:42:53,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025439785] [2025-03-08 22:42:53,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:42:53,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:42:53,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:42:53,136 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:42:53,138 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:42:53,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 22:42:53,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 22:42:53,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:42:53,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:42:53,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-08 22:42:53,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:42:53,208 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 14 treesize of output 10 [2025-03-08 22:42:53,320 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:42:53,320 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 20 treesize of output 17 [2025-03-08 22:42:53,440 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:42:53,441 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:42:53,714 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 15 treesize of output 13 [2025-03-08 22:42:53,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 9 [2025-03-08 22:42:53,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 treesize of output 16 [2025-03-08 22:42:53,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:42:53,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025439785] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:42:53,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:42:53,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 25 [2025-03-08 22:42:53,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443476045] [2025-03-08 22:42:53,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:42:53,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-08 22:42:53,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:42:53,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-08 22:42:53,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=569, Unknown=0, NotChecked=0, Total=650 [2025-03-08 22:42:53,736 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand has 26 states, 25 states have (on average 1.72) internal successors, (43), 26 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:42:53,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:42:53,981 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2025-03-08 22:42:53,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 22:42:53,981 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.72) internal successors, (43), 26 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-08 22:42:53,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:42:53,982 INFO L225 Difference]: With dead ends: 85 [2025-03-08 22:42:53,982 INFO L226 Difference]: Without dead ends: 85 [2025-03-08 22:42:53,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=111, Invalid=759, Unknown=0, NotChecked=0, Total=870 [2025-03-08 22:42:53,983 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 4 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:42:53,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 149 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:42:53,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-08 22:42:53,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2025-03-08 22:42:53,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 83 states have internal predecessors, (93), 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:42:53,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2025-03-08 22:42:53,986 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 18 [2025-03-08 22:42:53,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:42:53,986 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2025-03-08 22:42:53,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.72) internal successors, (43), 26 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:42:53,987 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2025-03-08 22:42:53,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 22:42:53,987 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:42:53,987 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:42:53,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 22:42:54,191 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,SelfDestructingSolverStorable14 [2025-03-08 22:42:54,191 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-08 22:42:54,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:42:54,191 INFO L85 PathProgramCache]: Analyzing trace with hash 39954135, now seen corresponding path program 2 times [2025-03-08 22:42:54,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:42:54,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298293029] [2025-03-08 22:42:54,191 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:42:54,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:42:54,199 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-08 22:42:54,213 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 22:42:54,216 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:42:54,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:42:54,784 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:42:54,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:42:54,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298293029] [2025-03-08 22:42:54,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298293029] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:42:54,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360878590] [2025-03-08 22:42:54,784 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:42:54,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:42:54,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:42:54,786 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:42:54,788 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:42:54,824 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-08 22:42:54,842 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 22:42:54,842 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:42:54,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:42:54,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-08 22:42:54,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:42:54,868 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 14 treesize of output 10 [2025-03-08 22:42:55,342 INFO L349 Elim1Store]: treesize reduction 4, result has 81.8 percent of original size [2025-03-08 22:42:55,342 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 30 treesize of output 28 [2025-03-08 22:42:55,453 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:42:55,453 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:42:55,995 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 29 treesize of output 25 [2025-03-08 22:42:56,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 11 [2025-03-08 22:42:56,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2025-03-08 22:42:56,039 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:42:56,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360878590] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:42:56,039 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:42:56,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 14] total 40 [2025-03-08 22:42:56,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607280965] [2025-03-08 22:42:56,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:42:56,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-08 22:42:56,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:42:56,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-08 22:42:56,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1512, Unknown=0, NotChecked=0, Total=1640 [2025-03-08 22:42:56,041 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand has 41 states, 40 states have (on average 1.475) internal successors, (59), 41 states have internal predecessors, (59), 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:42:58,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:42:58,177 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2025-03-08 22:42:58,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 22:42:58,178 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.475) internal successors, (59), 41 states have internal predecessors, (59), 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 23 [2025-03-08 22:42:58,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:42:58,178 INFO L225 Difference]: With dead ends: 89 [2025-03-08 22:42:58,178 INFO L226 Difference]: Without dead ends: 69 [2025-03-08 22:42:58,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=363, Invalid=3059, Unknown=0, NotChecked=0, Total=3422 [2025-03-08 22:42:58,179 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 58 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 22:42:58,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 191 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 22:42:58,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-08 22:42:58,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 49. [2025-03-08 22:42:58,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.1041666666666667) internal successors, (53), 48 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:42:58,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2025-03-08 22:42:58,182 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 23 [2025-03-08 22:42:58,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:42:58,182 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2025-03-08 22:42:58,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.475) internal successors, (59), 41 states have internal predecessors, (59), 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:42:58,182 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2025-03-08 22:42:58,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 22:42:58,182 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:42:58,182 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:42:58,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 22:42:58,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:42:58,387 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-08 22:42:58,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:42:58,387 INFO L85 PathProgramCache]: Analyzing trace with hash 497512870, now seen corresponding path program 2 times [2025-03-08 22:42:58,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:42:58,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112403962] [2025-03-08 22:42:58,388 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:42:58,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:42:58,393 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-08 22:42:58,409 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 22:42:58,409 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:42:58,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:42:58,927 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:42:58,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:42:58,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112403962] [2025-03-08 22:42:58,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112403962] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:42:58,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53865731] [2025-03-08 22:42:58,928 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:42:58,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:42:58,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:42:58,930 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:42:58,931 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:42:58,971 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-08 22:42:58,986 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 22:42:58,986 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:42:58,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:42:58,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-08 22:42:58,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:42:59,005 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 14 treesize of output 10 [2025-03-08 22:42:59,421 INFO L349 Elim1Store]: treesize reduction 4, result has 81.8 percent of original size [2025-03-08 22:42:59,421 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 30 treesize of output 28 [2025-03-08 22:42:59,547 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:42:59,547 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:43:00,049 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 29 treesize of output 25 [2025-03-08 22:43:00,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 11 [2025-03-08 22:43:00,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2025-03-08 22:43:00,082 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:43:00,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53865731] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:43:00,082 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:43:00,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 40 [2025-03-08 22:43:00,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998521472] [2025-03-08 22:43:00,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:43:00,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-08 22:43:00,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:43:00,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-08 22:43:00,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1502, Unknown=0, NotChecked=0, Total=1640 [2025-03-08 22:43:00,084 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand has 41 states, 40 states have (on average 1.725) internal successors, (69), 41 states have internal predecessors, (69), 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:43:00,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:43:00,924 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2025-03-08 22:43:00,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-08 22:43:00,925 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.725) internal successors, (69), 41 states have internal predecessors, (69), 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 26 [2025-03-08 22:43:00,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:43:00,925 INFO L225 Difference]: With dead ends: 48 [2025-03-08 22:43:00,925 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 22:43:00,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=312, Invalid=2994, Unknown=0, NotChecked=0, Total=3306 [2025-03-08 22:43:00,926 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 17 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:43:00,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 203 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:43:00,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 22:43:00,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 22:43:00,926 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:43:00,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 22:43:00,926 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2025-03-08 22:43:00,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:43:00,926 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 22:43:00,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.725) internal successors, (69), 41 states have internal predecessors, (69), 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:43:00,927 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 22:43:00,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 22:43:00,928 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (8 of 9 remaining) [2025-03-08 22:43:00,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 9 remaining) [2025-03-08 22:43:00,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 9 remaining) [2025-03-08 22:43:00,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 9 remaining) [2025-03-08 22:43:00,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 9 remaining) [2025-03-08 22:43:00,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 9 remaining) [2025-03-08 22:43:00,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 9 remaining) [2025-03-08 22:43:00,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 9 remaining) [2025-03-08 22:43:00,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 9 remaining) [2025-03-08 22:43:00,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 22:43:01,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-08 22:43:01,132 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:43:01,133 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 22:43:01,135 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 10:43:01 BoogieIcfgContainer [2025-03-08 22:43:01,135 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 22:43:01,135 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 22:43:01,135 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 22:43:01,135 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 22:43:01,136 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:42:47" (3/4) ... [2025-03-08 22:43:01,137 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 22:43:01,145 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-03-08 22:43:01,145 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-08 22:43:01,145 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-08 22:43:01,145 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 22:43:01,205 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 22:43:01,205 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 22:43:01,205 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 22:43:01,206 INFO L158 Benchmark]: Toolchain (without parser) took 14025.61ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 109.9MB in the beginning and 200.5MB in the end (delta: -90.6MB). Peak memory consumption was 111.9MB. Max. memory is 16.1GB. [2025-03-08 22:43:01,207 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:43:01,207 INFO L158 Benchmark]: CACSL2BoogieTranslator took 244.56ms. Allocated memory is still 142.6MB. Free memory was 109.9MB in the beginning and 94.0MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 22:43:01,208 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.32ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 91.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:43:01,208 INFO L158 Benchmark]: Boogie Preprocessor took 23.66ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 90.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:43:01,208 INFO L158 Benchmark]: IcfgBuilder took 248.34ms. Allocated memory is still 142.6MB. Free memory was 90.9MB in the beginning and 76.2MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 22:43:01,209 INFO L158 Benchmark]: TraceAbstraction took 13409.69ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 76.2MB in the beginning and 204.5MB in the end (delta: -128.3MB). Peak memory consumption was 69.9MB. Max. memory is 16.1GB. [2025-03-08 22:43:01,209 INFO L158 Benchmark]: Witness Printer took 70.09ms. Allocated memory is still 343.9MB. Free memory was 204.5MB in the beginning and 200.5MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 22:43:01,210 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.13ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 244.56ms. Allocated memory is still 142.6MB. Free memory was 109.9MB in the beginning and 94.0MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.32ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 91.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 23.66ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 90.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 248.34ms. Allocated memory is still 142.6MB. Free memory was 90.9MB in the beginning and 76.2MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 13409.69ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 76.2MB in the beginning and 204.5MB in the end (delta: -128.3MB). Peak memory consumption was 69.9MB. Max. memory is 16.1GB. * Witness Printer took 70.09ms. Allocated memory is still 343.9MB. Free memory was 204.5MB in the beginning and 200.5MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 561]: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 29 locations, 34 edges, 9 error locations. Started 1 CEGAR loops. OverallTime: 13.4s, OverallIterations: 17, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 204 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 204 mSDsluCounter, 1432 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1150 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2116 IncrementalHoareTripleChecker+Invalid, 2151 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 282 mSDtfsCounter, 2116 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 350 GetRequests, 92 SyntacticMatches, 6 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1744 ImplicationChecksByTransitivity, 6.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=15, InterpolantAutomatonStates: 162, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 17 MinimizatonAttempts, 33 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 308 NumberOfCodeBlocks, 308 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 368 ConstructedInterpolants, 49 QuantifiedInterpolants, 4933 SizeOfPredicates, 35 NumberOfNonLiveVariables, 567 ConjunctsInSsa, 196 ConjunctsInUnsatCore, 25 InterpolantComputations, 13 PerfectInterpolantSequences, 8/79 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 9 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-08 22:43:01,225 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