./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/cstrspn-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/array-memsafety/cstrspn-alloca-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 45a8f33f173b19ce98ca13bb7c3a70605cebce85501309e729b51c966620adf7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 06:12:14,438 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 06:12:14,494 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 06:12:14,501 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 06:12:14,504 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 06:12:14,525 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 06:12:14,527 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 06:12:14,527 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 06:12:14,527 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 06:12:14,527 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 06:12:14,527 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 06:12:14,527 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 06:12:14,528 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 06:12:14,528 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 06:12:14,528 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 06:12:14,528 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 06:12:14,529 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 06:12:14,529 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 06:12:14,529 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 06:12:14,530 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 06:12:14,530 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 06:12:14,530 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 06:12:14,530 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 06:12:14,530 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 06:12:14,530 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 06:12:14,530 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 06:12:14,530 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 06:12:14,530 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 06:12:14,530 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 06:12:14,531 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 06:12:14,531 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 06:12:14,531 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 06:12:14,531 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 06:12:14,531 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:12:14,531 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 06:12:14,531 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 06:12:14,531 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 06:12:14,531 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 06:12:14,531 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 06:12:14,531 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 06:12:14,532 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 06:12:14,532 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 06:12:14,532 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 45a8f33f173b19ce98ca13bb7c3a70605cebce85501309e729b51c966620adf7 [2025-02-08 06:12:14,754 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 06:12:14,760 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 06:12:14,761 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 06:12:14,762 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 06:12:14,762 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 06:12:14,762 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/cstrspn-alloca-1.i [2025-02-08 06:12:15,893 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f875c4006/6ab0ef208a404c7aa1ad93655f48b7fb/FLAGd17450f81 [2025-02-08 06:12:16,161 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 06:12:16,165 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrspn-alloca-1.i [2025-02-08 06:12:16,182 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f875c4006/6ab0ef208a404c7aa1ad93655f48b7fb/FLAGd17450f81 [2025-02-08 06:12:16,198 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f875c4006/6ab0ef208a404c7aa1ad93655f48b7fb [2025-02-08 06:12:16,200 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 06:12:16,201 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 06:12:16,202 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 06:12:16,203 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 06:12:16,205 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 06:12:16,206 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:12:16" (1/1) ... [2025-02-08 06:12:16,208 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e194ceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:12:16, skipping insertion in model container [2025-02-08 06:12:16,208 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:12:16" (1/1) ... [2025-02-08 06:12:16,241 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 06:12:16,431 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:12:16,432 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:12:16,435 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:12:16,443 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 06:12:16,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:12:16,501 INFO L204 MainTranslator]: Completed translation [2025-02-08 06:12:16,502 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:12:16 WrapperNode [2025-02-08 06:12:16,502 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 06:12:16,503 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 06:12:16,503 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 06:12:16,503 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 06:12:16,506 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:12:16" (1/1) ... [2025-02-08 06:12:16,512 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:12:16" (1/1) ... [2025-02-08 06:12:16,522 INFO L138 Inliner]: procedures = 117, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 99 [2025-02-08 06:12:16,523 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 06:12:16,523 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 06:12:16,523 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 06:12:16,523 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 06:12:16,527 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:12:16" (1/1) ... [2025-02-08 06:12:16,528 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:12:16" (1/1) ... [2025-02-08 06:12:16,529 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:12:16" (1/1) ... [2025-02-08 06:12:16,536 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [5, 4]. 56 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 4 writes are split as follows [2, 2]. [2025-02-08 06:12:16,536 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:12:16" (1/1) ... [2025-02-08 06:12:16,536 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:12:16" (1/1) ... [2025-02-08 06:12:16,539 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:12:16" (1/1) ... [2025-02-08 06:12:16,540 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:12:16" (1/1) ... [2025-02-08 06:12:16,540 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:12:16" (1/1) ... [2025-02-08 06:12:16,541 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:12:16" (1/1) ... [2025-02-08 06:12:16,542 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 06:12:16,542 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 06:12:16,542 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 06:12:16,542 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 06:12:16,543 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:12:16" (1/1) ... [2025-02-08 06:12:16,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:12:16,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:12:16,565 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 06:12:16,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 06:12:16,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 06:12:16,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 06:12:16,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 06:12:16,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 06:12:16,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 06:12:16,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 06:12:16,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 06:12:16,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 06:12:16,648 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 06:12:16,649 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 06:12:16,777 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L553: havoc main_#t~ret18#1;call ULTIMATE.dealloc(main_#t~malloc12#1.base, main_#t~malloc12#1.offset);havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call ULTIMATE.dealloc(main_#t~malloc13#1.base, main_#t~malloc13#1.offset);havoc main_#t~malloc13#1.base, main_#t~malloc13#1.offset; [2025-02-08 06:12:16,786 INFO L? ?]: Removed 63 outVars from TransFormulas that were not future-live. [2025-02-08 06:12:16,786 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 06:12:16,792 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 06:12:16,792 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 06:12:16,792 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:12:16 BoogieIcfgContainer [2025-02-08 06:12:16,792 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 06:12:16,794 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 06:12:16,794 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 06:12:16,797 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 06:12:16,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 06:12:16" (1/3) ... [2025-02-08 06:12:16,797 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8d9b4d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:12:16, skipping insertion in model container [2025-02-08 06:12:16,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:12:16" (2/3) ... [2025-02-08 06:12:16,797 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8d9b4d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:12:16, skipping insertion in model container [2025-02-08 06:12:16,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:12:16" (3/3) ... [2025-02-08 06:12:16,798 INFO L128 eAbstractionObserver]: Analyzing ICFG cstrspn-alloca-1.i [2025-02-08 06:12:16,807 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 06:12:16,808 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cstrspn-alloca-1.i that has 1 procedures, 51 locations, 1 initial locations, 4 loop locations, and 19 error locations. [2025-02-08 06:12:16,829 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 06:12:16,839 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;@47c9a55e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 06:12:16,839 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-02-08 06:12:16,841 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 50 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-02-08 06:12:16,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 06:12:16,844 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:16,844 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 06:12:16,845 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:16,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:16,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1456926724, now seen corresponding path program 1 times [2025-02-08 06:12:16,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:16,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909538035] [2025-02-08 06:12:16,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:12:16,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:16,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 06:12:16,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 06:12:16,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:16,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:16,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:12:16,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:16,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909538035] [2025-02-08 06:12:16,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909538035] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:12:16,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:12:16,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:12:16,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515887633] [2025-02-08 06:12:16,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:12:16,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:12:16,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:17,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:12:17,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:12:17,015 INFO L87 Difference]: Start difference. First operand has 51 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 50 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) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:17,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:17,057 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2025-02-08 06:12:17,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:12:17,061 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-08 06:12:17,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:17,065 INFO L225 Difference]: With dead ends: 61 [2025-02-08 06:12:17,065 INFO L226 Difference]: Without dead ends: 58 [2025-02-08 06:12:17,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:12:17,068 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 9 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:17,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 146 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:12:17,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-02-08 06:12:17,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51. [2025-02-08 06:12:17,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.8125) internal successors, (58), 50 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:17,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2025-02-08 06:12:17,096 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 6 [2025-02-08 06:12:17,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:17,096 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2025-02-08 06:12:17,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:17,097 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2025-02-08 06:12:17,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 06:12:17,097 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:17,098 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 06:12:17,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 06:12:17,098 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:17,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:17,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1456003203, now seen corresponding path program 1 times [2025-02-08 06:12:17,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:17,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192471879] [2025-02-08 06:12:17,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:12:17,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:17,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 06:12:17,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 06:12:17,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:17,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:17,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:12:17,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:17,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192471879] [2025-02-08 06:12:17,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192471879] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:12:17,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:12:17,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:12:17,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807032106] [2025-02-08 06:12:17,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:12:17,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:12:17,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:17,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:12:17,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:12:17,241 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:17,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:17,279 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2025-02-08 06:12:17,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:12:17,280 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-08 06:12:17,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:17,280 INFO L225 Difference]: With dead ends: 49 [2025-02-08 06:12:17,280 INFO L226 Difference]: Without dead ends: 49 [2025-02-08 06:12:17,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:12:17,281 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 13 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:17,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 64 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:12:17,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-02-08 06:12:17,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-02-08 06:12:17,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.75) internal successors, (56), 48 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-02-08 06:12:17,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2025-02-08 06:12:17,284 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 6 [2025-02-08 06:12:17,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:17,284 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2025-02-08 06:12:17,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:17,285 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2025-02-08 06:12:17,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 06:12:17,285 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:17,287 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 06:12:17,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 06:12:17,287 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:17,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:17,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1456003202, now seen corresponding path program 1 times [2025-02-08 06:12:17,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:17,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962198504] [2025-02-08 06:12:17,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:12:17,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:17,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 06:12:17,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 06:12:17,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:17,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:17,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:12:17,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:17,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962198504] [2025-02-08 06:12:17,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962198504] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:12:17,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:12:17,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:12:17,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854020151] [2025-02-08 06:12:17,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:12:17,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:12:17,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:17,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:12:17,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:12:17,493 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:17,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:17,581 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2025-02-08 06:12:17,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:12:17,581 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-08 06:12:17,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:17,582 INFO L225 Difference]: With dead ends: 52 [2025-02-08 06:12:17,582 INFO L226 Difference]: Without dead ends: 52 [2025-02-08 06:12:17,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:12:17,583 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 17 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:17,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 128 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:12:17,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-02-08 06:12:17,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2025-02-08 06:12:17,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.7352941176470589) internal successors, (59), 50 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-02-08 06:12:17,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2025-02-08 06:12:17,586 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 6 [2025-02-08 06:12:17,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:17,586 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2025-02-08 06:12:17,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:17,586 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2025-02-08 06:12:17,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 06:12:17,586 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:17,586 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:17,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 06:12:17,586 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:17,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:17,587 INFO L85 PathProgramCache]: Analyzing trace with hash 2079906776, now seen corresponding path program 1 times [2025-02-08 06:12:17,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:17,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096282750] [2025-02-08 06:12:17,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:12:17,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:17,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 06:12:17,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 06:12:17,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:17,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:17,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:12:17,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:17,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096282750] [2025-02-08 06:12:17,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096282750] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:12:17,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:12:17,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:12:17,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237127682] [2025-02-08 06:12:17,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:12:17,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:12:17,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:17,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:12:17,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:12:17,677 INFO L87 Difference]: Start difference. First operand 51 states and 59 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-02-08 06:12:17,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:17,720 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2025-02-08 06:12:17,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:12:17,721 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-02-08 06:12:17,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:17,721 INFO L225 Difference]: With dead ends: 57 [2025-02-08 06:12:17,721 INFO L226 Difference]: Without dead ends: 57 [2025-02-08 06:12:17,723 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-02-08 06:12:17,723 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 6 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:17,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 118 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:12:17,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-02-08 06:12:17,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2025-02-08 06:12:17,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 38 states have (on average 1.736842105263158) internal successors, (66), 54 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:17,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2025-02-08 06:12:17,727 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 7 [2025-02-08 06:12:17,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:17,729 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2025-02-08 06:12:17,729 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-02-08 06:12:17,729 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2025-02-08 06:12:17,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 06:12:17,729 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:17,729 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:17,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 06:12:17,729 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:17,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:17,730 INFO L85 PathProgramCache]: Analyzing trace with hash 2079906935, now seen corresponding path program 1 times [2025-02-08 06:12:17,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:17,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347691737] [2025-02-08 06:12:17,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:12:17,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:17,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 06:12:17,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 06:12:17,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:17,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:17,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:12:17,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:17,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347691737] [2025-02-08 06:12:17,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347691737] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:12:17,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:12:17,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:12:17,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240864650] [2025-02-08 06:12:17,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:12:17,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:12:17,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:17,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:12:17,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:12:17,783 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand has 4 states, 4 states have (on average 1.75) 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-02-08 06:12:17,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:17,807 INFO L93 Difference]: Finished difference Result 71 states and 85 transitions. [2025-02-08 06:12:17,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:12:17,807 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) 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-02-08 06:12:17,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:17,808 INFO L225 Difference]: With dead ends: 71 [2025-02-08 06:12:17,808 INFO L226 Difference]: Without dead ends: 71 [2025-02-08 06:12:17,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:12:17,808 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 8 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:17,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 132 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:12:17,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-02-08 06:12:17,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2025-02-08 06:12:17,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 48 states have (on average 1.6458333333333333) internal successors, (79), 64 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:17,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 79 transitions. [2025-02-08 06:12:17,811 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 79 transitions. Word has length 7 [2025-02-08 06:12:17,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:17,812 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 79 transitions. [2025-02-08 06:12:17,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) 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-02-08 06:12:17,812 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 79 transitions. [2025-02-08 06:12:17,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 06:12:17,812 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:17,812 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:17,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 06:12:17,812 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:17,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:17,813 INFO L85 PathProgramCache]: Analyzing trace with hash 2080830456, now seen corresponding path program 1 times [2025-02-08 06:12:17,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:17,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816803633] [2025-02-08 06:12:17,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:12:17,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:17,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 06:12:17,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 06:12:17,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:17,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:17,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-02-08 06:12:17,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:17,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816803633] [2025-02-08 06:12:17,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816803633] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:12:17,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:12:17,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:12:17,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183279210] [2025-02-08 06:12:17,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:12:17,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:12:17,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:17,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:12:17,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:12:17,929 INFO L87 Difference]: Start difference. First operand 65 states and 79 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-02-08 06:12:17,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:17,982 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2025-02-08 06:12:17,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:12:17,982 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-02-08 06:12:17,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:17,983 INFO L225 Difference]: With dead ends: 64 [2025-02-08 06:12:17,983 INFO L226 Difference]: Without dead ends: 64 [2025-02-08 06:12:17,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:12:17,983 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 25 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:17,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 122 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:12:17,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-02-08 06:12:17,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2025-02-08 06:12:17,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 48 states have (on average 1.5833333333333333) internal successors, (76), 62 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:17,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 76 transitions. [2025-02-08 06:12:17,987 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 76 transitions. Word has length 7 [2025-02-08 06:12:17,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:17,987 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 76 transitions. [2025-02-08 06:12:17,987 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-02-08 06:12:17,987 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2025-02-08 06:12:17,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 06:12:17,987 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:17,987 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:17,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 06:12:17,987 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:17,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:17,988 INFO L85 PathProgramCache]: Analyzing trace with hash 2080830457, now seen corresponding path program 1 times [2025-02-08 06:12:17,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:17,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432369253] [2025-02-08 06:12:17,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:12:17,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:17,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 06:12:17,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 06:12:17,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:17,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:18,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:12:18,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:18,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432369253] [2025-02-08 06:12:18,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432369253] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:12:18,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:12:18,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:12:18,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214721837] [2025-02-08 06:12:18,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:12:18,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:12:18,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:18,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:12:18,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:12:18,189 INFO L87 Difference]: Start difference. First operand 63 states and 76 transitions. Second operand has 6 states, 5 states have (on average 1.4) 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-02-08 06:12:18,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:18,267 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2025-02-08 06:12:18,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:12:18,271 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) 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-02-08 06:12:18,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:18,271 INFO L225 Difference]: With dead ends: 69 [2025-02-08 06:12:18,271 INFO L226 Difference]: Without dead ends: 69 [2025-02-08 06:12:18,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:12:18,272 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 29 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:18,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 114 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:12:18,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-02-08 06:12:18,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2025-02-08 06:12:18,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 52 states have (on average 1.5769230769230769) internal successors, (82), 66 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:18,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 82 transitions. [2025-02-08 06:12:18,278 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 82 transitions. Word has length 7 [2025-02-08 06:12:18,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:18,278 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 82 transitions. [2025-02-08 06:12:18,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) 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-02-08 06:12:18,278 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 82 transitions. [2025-02-08 06:12:18,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 06:12:18,278 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:18,278 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:18,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 06:12:18,278 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:18,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:18,279 INFO L85 PathProgramCache]: Analyzing trace with hash 2108535927, now seen corresponding path program 1 times [2025-02-08 06:12:18,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:18,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827620500] [2025-02-08 06:12:18,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:12:18,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:18,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 06:12:18,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 06:12:18,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:18,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:18,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:12:18,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:18,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827620500] [2025-02-08 06:12:18,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827620500] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:12:18,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:12:18,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:12:18,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058267761] [2025-02-08 06:12:18,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:12:18,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:12:18,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:18,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:12:18,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:12:18,376 INFO L87 Difference]: Start difference. First operand 67 states and 82 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-02-08 06:12:18,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:18,402 INFO L93 Difference]: Finished difference Result 77 states and 94 transitions. [2025-02-08 06:12:18,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:12:18,403 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-02-08 06:12:18,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:18,403 INFO L225 Difference]: With dead ends: 77 [2025-02-08 06:12:18,403 INFO L226 Difference]: Without dead ends: 77 [2025-02-08 06:12:18,403 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-02-08 06:12:18,404 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 24 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:18,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 83 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:12:18,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-02-08 06:12:18,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 67. [2025-02-08 06:12:18,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 52 states have (on average 1.5769230769230769) internal successors, (82), 66 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:18,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 82 transitions. [2025-02-08 06:12:18,407 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 82 transitions. Word has length 7 [2025-02-08 06:12:18,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:18,407 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 82 transitions. [2025-02-08 06:12:18,407 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-02-08 06:12:18,407 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 82 transitions. [2025-02-08 06:12:18,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 06:12:18,407 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:18,407 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:18,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 06:12:18,408 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:18,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:18,408 INFO L85 PathProgramCache]: Analyzing trace with hash 52600599, now seen corresponding path program 1 times [2025-02-08 06:12:18,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:18,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732794259] [2025-02-08 06:12:18,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:12:18,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:18,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 06:12:18,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 06:12:18,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:18,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:18,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:12:18,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:18,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732794259] [2025-02-08 06:12:18,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732794259] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:12:18,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:12:18,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:12:18,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239028447] [2025-02-08 06:12:18,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:12:18,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:12:18,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:18,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:12:18,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:12:18,480 INFO L87 Difference]: Start difference. First operand 67 states and 82 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:18,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:18,494 INFO L93 Difference]: Finished difference Result 72 states and 86 transitions. [2025-02-08 06:12:18,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:12:18,495 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2025-02-08 06:12:18,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:18,495 INFO L225 Difference]: With dead ends: 72 [2025-02-08 06:12:18,495 INFO L226 Difference]: Without dead ends: 72 [2025-02-08 06:12:18,496 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-02-08 06:12:18,496 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 10 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:18,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 85 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:12:18,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-02-08 06:12:18,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2025-02-08 06:12:18,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 55 states have (on average 1.5636363636363637) internal successors, (86), 69 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:18,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 86 transitions. [2025-02-08 06:12:18,499 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 86 transitions. Word has length 8 [2025-02-08 06:12:18,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:18,499 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 86 transitions. [2025-02-08 06:12:18,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:18,499 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 86 transitions. [2025-02-08 06:12:18,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 06:12:18,499 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:18,499 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:18,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 06:12:18,500 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:18,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:18,500 INFO L85 PathProgramCache]: Analyzing trace with hash 81229750, now seen corresponding path program 1 times [2025-02-08 06:12:18,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:18,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710550749] [2025-02-08 06:12:18,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:12:18,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:18,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 06:12:18,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 06:12:18,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:18,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:18,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:12:18,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:18,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710550749] [2025-02-08 06:12:18,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710550749] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:12:18,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:12:18,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:12:18,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340848535] [2025-02-08 06:12:18,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:12:18,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:12:18,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:18,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:12:18,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:12:18,571 INFO L87 Difference]: Start difference. First operand 70 states and 86 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:18,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:18,604 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2025-02-08 06:12:18,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:12:18,604 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2025-02-08 06:12:18,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:18,604 INFO L225 Difference]: With dead ends: 69 [2025-02-08 06:12:18,604 INFO L226 Difference]: Without dead ends: 69 [2025-02-08 06:12:18,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:12:18,605 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 11 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:18,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 90 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:12:18,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-02-08 06:12:18,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2025-02-08 06:12:18,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 52 states have (on average 1.5576923076923077) internal successors, (81), 65 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:18,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 81 transitions. [2025-02-08 06:12:18,607 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 81 transitions. Word has length 8 [2025-02-08 06:12:18,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:18,607 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 81 transitions. [2025-02-08 06:12:18,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:18,608 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 81 transitions. [2025-02-08 06:12:18,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-08 06:12:18,608 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:18,608 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:18,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 06:12:18,608 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:18,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:18,608 INFO L85 PathProgramCache]: Analyzing trace with hash -916672325, now seen corresponding path program 1 times [2025-02-08 06:12:18,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:18,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462197062] [2025-02-08 06:12:18,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:12:18,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:18,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 06:12:18,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 06:12:18,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:18,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:18,854 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:12:18,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:18,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462197062] [2025-02-08 06:12:18,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462197062] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:12:18,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329116444] [2025-02-08 06:12:18,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:12:18,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:18,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:12:18,861 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:12:18,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 06:12:18,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 06:12:18,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 06:12:18,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:18,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:18,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-08 06:12:18,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:12:19,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:12:19,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2025-02-08 06:12:19,017 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 10 treesize of output 8 [2025-02-08 06:12:19,155 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:12:19,155 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:12:19,248 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:12:19,255 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:12:19,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329116444] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:12:19,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:12:19,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2025-02-08 06:12:19,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886362035] [2025-02-08 06:12:19,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:12:19,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 06:12:19,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:19,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 06:12:19,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-02-08 06:12:19,256 INFO L87 Difference]: Start difference. First operand 66 states and 81 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:19,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:19,409 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2025-02-08 06:12:19,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 06:12:19,410 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-08 06:12:19,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:19,410 INFO L225 Difference]: With dead ends: 69 [2025-02-08 06:12:19,410 INFO L226 Difference]: Without dead ends: 69 [2025-02-08 06:12:19,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2025-02-08 06:12:19,411 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 15 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:19,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 245 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:12:19,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-02-08 06:12:19,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2025-02-08 06:12:19,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 50 states have (on average 1.54) internal successors, (77), 62 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:19,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 77 transitions. [2025-02-08 06:12:19,412 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 77 transitions. Word has length 9 [2025-02-08 06:12:19,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:19,413 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 77 transitions. [2025-02-08 06:12:19,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:19,413 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2025-02-08 06:12:19,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 06:12:19,413 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:19,413 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:19,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 06:12:19,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-08 06:12:19,614 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:19,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:19,614 INFO L85 PathProgramCache]: Analyzing trace with hash 757151514, now seen corresponding path program 1 times [2025-02-08 06:12:19,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:19,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136873959] [2025-02-08 06:12:19,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:12:19,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:19,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 06:12:19,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 06:12:19,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:19,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:19,816 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:12:19,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:19,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136873959] [2025-02-08 06:12:19,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136873959] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:12:19,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488637160] [2025-02-08 06:12:19,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:12:19,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:19,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:12:19,821 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:12:19,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 06:12:19,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 06:12:19,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 06:12:19,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:19,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:19,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-08 06:12:19,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:12:19,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2025-02-08 06:12:19,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-02-08 06:12:20,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:12:20,036 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:12:20,195 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:12:20,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488637160] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:12:20,196 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:12:20,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2025-02-08 06:12:20,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680739701] [2025-02-08 06:12:20,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:12:20,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-08 06:12:20,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:20,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-08 06:12:20,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2025-02-08 06:12:20,197 INFO L87 Difference]: Start difference. First operand 63 states and 77 transitions. Second operand has 20 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 19 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-02-08 06:12:20,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:20,388 INFO L93 Difference]: Finished difference Result 66 states and 81 transitions. [2025-02-08 06:12:20,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 06:12:20,388 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 19 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) Word has length 10 [2025-02-08 06:12:20,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:20,388 INFO L225 Difference]: With dead ends: 66 [2025-02-08 06:12:20,389 INFO L226 Difference]: Without dead ends: 66 [2025-02-08 06:12:20,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=414, Unknown=0, NotChecked=0, Total=600 [2025-02-08 06:12:20,389 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 29 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:20,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 262 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:12:20,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-02-08 06:12:20,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 58. [2025-02-08 06:12:20,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 46 states have (on average 1.5) internal successors, (69), 57 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-02-08 06:12:20,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2025-02-08 06:12:20,391 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 10 [2025-02-08 06:12:20,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:20,391 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2025-02-08 06:12:20,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 19 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-02-08 06:12:20,391 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2025-02-08 06:12:20,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 06:12:20,391 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:20,391 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:20,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 06:12:20,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:20,592 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:20,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:20,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1647923930, now seen corresponding path program 1 times [2025-02-08 06:12:20,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:20,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590786970] [2025-02-08 06:12:20,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:12:20,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:20,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 06:12:20,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 06:12:20,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:20,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:20,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:12:20,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:20,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590786970] [2025-02-08 06:12:20,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590786970] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:12:20,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227912689] [2025-02-08 06:12:20,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:12:20,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:20,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:12:20,764 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:12:20,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 06:12:20,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 06:12:20,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 06:12:20,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:20,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:20,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-08 06:12:20,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:12:20,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:12:20,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2025-02-08 06:12:20,828 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 10 treesize of output 8 [2025-02-08 06:12:20,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:12:20,901 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:12:20,968 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:12:20,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:12:20,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227912689] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-08 06:12:20,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:12:20,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 14 [2025-02-08 06:12:20,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070714640] [2025-02-08 06:12:20,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:12:20,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:12:20,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:20,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:12:20,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2025-02-08 06:12:20,993 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand has 6 states, 5 states have (on average 2.0) 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-02-08 06:12:21,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:21,093 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2025-02-08 06:12:21,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:12:21,093 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) 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-02-08 06:12:21,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:21,093 INFO L225 Difference]: With dead ends: 59 [2025-02-08 06:12:21,093 INFO L226 Difference]: Without dead ends: 59 [2025-02-08 06:12:21,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2025-02-08 06:12:21,094 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 14 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:21,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 121 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:12:21,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-02-08 06:12:21,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 50. [2025-02-08 06:12:21,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 49 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:21,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2025-02-08 06:12:21,095 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 10 [2025-02-08 06:12:21,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:21,095 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2025-02-08 06:12:21,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) 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-02-08 06:12:21,096 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2025-02-08 06:12:21,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 06:12:21,096 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:21,096 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:21,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 06:12:21,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:21,296 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:21,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:21,297 INFO L85 PathProgramCache]: Analyzing trace with hash -638636173, now seen corresponding path program 1 times [2025-02-08 06:12:21,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:21,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309327634] [2025-02-08 06:12:21,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:12:21,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:21,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 06:12:21,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 06:12:21,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:21,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:21,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:12:21,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:21,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309327634] [2025-02-08 06:12:21,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309327634] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:12:21,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:12:21,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:12:21,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373561841] [2025-02-08 06:12:21,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:12:21,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:12:21,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:21,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:12:21,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:12:21,332 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:21,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:21,357 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2025-02-08 06:12:21,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:12:21,357 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-08 06:12:21,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:21,357 INFO L225 Difference]: With dead ends: 48 [2025-02-08 06:12:21,357 INFO L226 Difference]: Without dead ends: 48 [2025-02-08 06:12:21,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:12:21,358 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 29 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:21,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 55 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:12:21,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-02-08 06:12:21,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-02-08 06:12:21,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 39 states have (on average 1.435897435897436) internal successors, (56), 47 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-02-08 06:12:21,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2025-02-08 06:12:21,359 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 11 [2025-02-08 06:12:21,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:21,360 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2025-02-08 06:12:21,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:21,360 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2025-02-08 06:12:21,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 06:12:21,360 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:21,360 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:21,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 06:12:21,361 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:21,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:21,361 INFO L85 PathProgramCache]: Analyzing trace with hash -638636172, now seen corresponding path program 1 times [2025-02-08 06:12:21,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:21,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876675763] [2025-02-08 06:12:21,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:12:21,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:21,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 06:12:21,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 06:12:21,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:21,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:21,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:12:21,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:21,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876675763] [2025-02-08 06:12:21,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876675763] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:12:21,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:12:21,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:12:21,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443174104] [2025-02-08 06:12:21,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:12:21,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:12:21,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:21,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:12:21,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:12:21,441 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:21,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:21,499 INFO L93 Difference]: Finished difference Result 78 states and 92 transitions. [2025-02-08 06:12:21,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:12:21,499 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-08 06:12:21,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:21,499 INFO L225 Difference]: With dead ends: 78 [2025-02-08 06:12:21,499 INFO L226 Difference]: Without dead ends: 78 [2025-02-08 06:12:21,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:12:21,500 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 41 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:21,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 98 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:12:21,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-02-08 06:12:21,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 52. [2025-02-08 06:12:21,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 43 states have (on average 1.4186046511627908) internal successors, (61), 51 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:21,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2025-02-08 06:12:21,501 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 11 [2025-02-08 06:12:21,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:21,502 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2025-02-08 06:12:21,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:21,502 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2025-02-08 06:12:21,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-08 06:12:21,502 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:21,502 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:21,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 06:12:21,502 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:21,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:21,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1094895406, now seen corresponding path program 1 times [2025-02-08 06:12:21,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:21,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999483817] [2025-02-08 06:12:21,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:12:21,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:21,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 06:12:21,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 06:12:21,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:21,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:21,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:12:21,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:21,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999483817] [2025-02-08 06:12:21,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999483817] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:12:21,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:12:21,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:12:21,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759737967] [2025-02-08 06:12:21,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:12:21,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:12:21,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:21,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:12:21,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:12:21,573 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:21,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:21,594 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2025-02-08 06:12:21,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:12:21,594 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-02-08 06:12:21,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:21,594 INFO L225 Difference]: With dead ends: 51 [2025-02-08 06:12:21,594 INFO L226 Difference]: Without dead ends: 49 [2025-02-08 06:12:21,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:12:21,595 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 30 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:21,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 57 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:12:21,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-02-08 06:12:21,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-02-08 06:12:21,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 48 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:21,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2025-02-08 06:12:21,596 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 14 [2025-02-08 06:12:21,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:21,596 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2025-02-08 06:12:21,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:21,596 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2025-02-08 06:12:21,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-08 06:12:21,596 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:21,596 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:21,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 06:12:21,597 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:21,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:21,597 INFO L85 PathProgramCache]: Analyzing trace with hash -70776497, now seen corresponding path program 1 times [2025-02-08 06:12:21,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:21,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912949354] [2025-02-08 06:12:21,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:12:21,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:21,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 06:12:21,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 06:12:21,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:21,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:21,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:12:21,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:21,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912949354] [2025-02-08 06:12:21,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912949354] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:12:21,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:12:21,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:12:21,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851035669] [2025-02-08 06:12:21,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:12:21,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:12:21,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:21,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:12:21,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:12:21,633 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:21,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:21,668 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2025-02-08 06:12:21,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:12:21,668 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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 16 [2025-02-08 06:12:21,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:21,668 INFO L225 Difference]: With dead ends: 46 [2025-02-08 06:12:21,668 INFO L226 Difference]: Without dead ends: 46 [2025-02-08 06:12:21,669 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-02-08 06:12:21,669 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 36 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:21,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 61 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:12:21,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-02-08 06:12:21,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-02-08 06:12:21,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 45 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:21,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2025-02-08 06:12:21,671 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 16 [2025-02-08 06:12:21,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:21,671 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2025-02-08 06:12:21,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:21,671 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2025-02-08 06:12:21,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-08 06:12:21,671 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:21,672 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:21,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 06:12:21,672 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:21,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:21,672 INFO L85 PathProgramCache]: Analyzing trace with hash -70776496, now seen corresponding path program 1 times [2025-02-08 06:12:21,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:21,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048145594] [2025-02-08 06:12:21,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:12:21,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:21,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 06:12:21,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 06:12:21,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:21,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:21,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:12:21,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:21,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048145594] [2025-02-08 06:12:21,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048145594] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:12:21,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:12:21,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 06:12:21,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994231956] [2025-02-08 06:12:21,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:12:21,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 06:12:21,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:21,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 06:12:21,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:12:21,805 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:21,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:21,874 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2025-02-08 06:12:21,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 06:12:21,875 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 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 16 [2025-02-08 06:12:21,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:21,876 INFO L225 Difference]: With dead ends: 58 [2025-02-08 06:12:21,876 INFO L226 Difference]: Without dead ends: 58 [2025-02-08 06:12:21,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-08 06:12:21,876 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 47 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:21,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 84 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:12:21,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-02-08 06:12:21,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2025-02-08 06:12:21,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 53 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:21,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2025-02-08 06:12:21,878 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 16 [2025-02-08 06:12:21,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:21,878 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2025-02-08 06:12:21,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:21,879 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2025-02-08 06:12:21,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-08 06:12:21,879 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:21,879 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:21,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 06:12:21,879 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:21,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:21,880 INFO L85 PathProgramCache]: Analyzing trace with hash 54391714, now seen corresponding path program 1 times [2025-02-08 06:12:21,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:21,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683914700] [2025-02-08 06:12:21,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:12:21,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:21,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 06:12:21,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 06:12:21,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:21,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:21,899 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:12:21,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:21,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683914700] [2025-02-08 06:12:21,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683914700] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:12:21,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:12:21,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:12:21,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232500214] [2025-02-08 06:12:21,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:12:21,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:12:21,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:21,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:12:21,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:12:21,901 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:21,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:21,908 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2025-02-08 06:12:21,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:12:21,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-02-08 06:12:21,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:21,909 INFO L225 Difference]: With dead ends: 56 [2025-02-08 06:12:21,909 INFO L226 Difference]: Without dead ends: 56 [2025-02-08 06:12:21,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:12:21,909 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:21,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:12:21,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-02-08 06:12:21,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-02-08 06:12:21,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 55 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:21,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2025-02-08 06:12:21,911 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 21 [2025-02-08 06:12:21,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:21,911 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2025-02-08 06:12:21,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:21,911 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2025-02-08 06:12:21,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-08 06:12:21,911 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:21,911 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:21,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 06:12:21,911 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:21,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:21,912 INFO L85 PathProgramCache]: Analyzing trace with hash 703740836, now seen corresponding path program 1 times [2025-02-08 06:12:21,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:21,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571889627] [2025-02-08 06:12:21,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:12:21,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:21,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 06:12:21,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 06:12:21,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:21,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:22,056 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 06:12:22,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:22,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571889627] [2025-02-08 06:12:22,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571889627] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:12:22,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:12:22,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 06:12:22,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342137267] [2025-02-08 06:12:22,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:12:22,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 06:12:22,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:22,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 06:12:22,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:12:22,057 INFO L87 Difference]: Start difference. First operand 56 states and 66 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:22,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:22,106 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2025-02-08 06:12:22,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:12:22,107 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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-02-08 06:12:22,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:22,107 INFO L225 Difference]: With dead ends: 66 [2025-02-08 06:12:22,107 INFO L226 Difference]: Without dead ends: 51 [2025-02-08 06:12:22,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:12:22,107 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 5 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:22,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 180 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:12:22,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-02-08 06:12:22,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-02-08 06:12:22,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 50 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-02-08 06:12:22,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2025-02-08 06:12:22,109 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 23 [2025-02-08 06:12:22,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:22,109 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2025-02-08 06:12:22,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:22,109 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2025-02-08 06:12:22,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-08 06:12:22,109 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:22,109 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:22,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 06:12:22,109 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:22,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:22,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1334315453, now seen corresponding path program 1 times [2025-02-08 06:12:22,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:22,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298574078] [2025-02-08 06:12:22,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:12:22,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:22,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 06:12:22,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 06:12:22,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:22,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:22,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 06:12:22,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:22,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298574078] [2025-02-08 06:12:22,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298574078] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:12:22,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:12:22,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 06:12:22,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37516144] [2025-02-08 06:12:22,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:12:22,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 06:12:22,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:22,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 06:12:22,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:12:22,249 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:22,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:22,283 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2025-02-08 06:12:22,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 06:12:22,283 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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-02-08 06:12:22,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:22,284 INFO L225 Difference]: With dead ends: 67 [2025-02-08 06:12:22,284 INFO L226 Difference]: Without dead ends: 57 [2025-02-08 06:12:22,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-08 06:12:22,284 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 19 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:22,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 157 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:12:22,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-02-08 06:12:22,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2025-02-08 06:12:22,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 52 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:22,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2025-02-08 06:12:22,286 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 23 [2025-02-08 06:12:22,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:22,286 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2025-02-08 06:12:22,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:22,286 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2025-02-08 06:12:22,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 06:12:22,287 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:22,287 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:22,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 06:12:22,287 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:22,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:22,287 INFO L85 PathProgramCache]: Analyzing trace with hash 666398374, now seen corresponding path program 1 times [2025-02-08 06:12:22,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:22,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873290175] [2025-02-08 06:12:22,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:12:22,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:22,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 06:12:22,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 06:12:22,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:22,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:22,417 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:22,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:22,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873290175] [2025-02-08 06:12:22,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873290175] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:12:22,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:12:22,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 06:12:22,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194884370] [2025-02-08 06:12:22,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:12:22,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 06:12:22,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:22,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 06:12:22,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-08 06:12:22,418 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 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-02-08 06:12:22,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:22,481 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2025-02-08 06:12:22,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 06:12:22,481 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 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) Word has length 26 [2025-02-08 06:12:22,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:22,481 INFO L225 Difference]: With dead ends: 74 [2025-02-08 06:12:22,481 INFO L226 Difference]: Without dead ends: 74 [2025-02-08 06:12:22,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-02-08 06:12:22,482 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 18 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:22,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 174 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:12:22,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-02-08 06:12:22,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2025-02-08 06:12:22,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 67 states have (on average 1.2238805970149254) internal successors, (82), 71 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:22,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2025-02-08 06:12:22,484 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 26 [2025-02-08 06:12:22,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:22,484 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2025-02-08 06:12:22,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 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-02-08 06:12:22,484 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2025-02-08 06:12:22,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 06:12:22,485 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:22,485 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:22,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 06:12:22,485 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:22,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:22,485 INFO L85 PathProgramCache]: Analyzing trace with hash 692042114, now seen corresponding path program 1 times [2025-02-08 06:12:22,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:22,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078756968] [2025-02-08 06:12:22,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:12:22,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:22,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 06:12:22,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 06:12:22,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:22,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:22,576 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:22,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:22,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078756968] [2025-02-08 06:12:22,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078756968] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:12:22,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:12:22,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 06:12:22,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786698045] [2025-02-08 06:12:22,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:12:22,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 06:12:22,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:22,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 06:12:22,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-08 06:12:22,577 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 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-02-08 06:12:22,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:22,669 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2025-02-08 06:12:22,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 06:12:22,670 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 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) Word has length 26 [2025-02-08 06:12:22,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:22,670 INFO L225 Difference]: With dead ends: 71 [2025-02-08 06:12:22,670 INFO L226 Difference]: Without dead ends: 47 [2025-02-08 06:12:22,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2025-02-08 06:12:22,671 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 32 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:22,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 165 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:12:22,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-02-08 06:12:22,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-02-08 06:12:22,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 46 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:22,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2025-02-08 06:12:22,672 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 26 [2025-02-08 06:12:22,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:22,672 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2025-02-08 06:12:22,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 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-02-08 06:12:22,673 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2025-02-08 06:12:22,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 06:12:22,673 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:22,673 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:22,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 06:12:22,673 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:22,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:22,674 INFO L85 PathProgramCache]: Analyzing trace with hash 599391621, now seen corresponding path program 1 times [2025-02-08 06:12:22,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:22,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702973537] [2025-02-08 06:12:22,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:12:22,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:22,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 06:12:22,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 06:12:22,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:22,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:22,929 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:22,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:22,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702973537] [2025-02-08 06:12:22,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702973537] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:12:22,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038944221] [2025-02-08 06:12:22,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:12:22,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:22,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:12:22,934 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:12:22,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 06:12:22,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 06:12:22,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 06:12:22,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:22,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:22,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-08 06:12:22,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:12:23,028 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-02-08 06:12:23,094 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:23,094 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 06:12:23,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038944221] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:12:23,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 06:12:23,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2025-02-08 06:12:23,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814029216] [2025-02-08 06:12:23,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:12:23,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 06:12:23,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:23,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 06:12:23,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2025-02-08 06:12:23,095 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 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-02-08 06:12:23,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:23,172 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2025-02-08 06:12:23,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 06:12:23,172 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 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) Word has length 26 [2025-02-08 06:12:23,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:23,172 INFO L225 Difference]: With dead ends: 62 [2025-02-08 06:12:23,172 INFO L226 Difference]: Without dead ends: 50 [2025-02-08 06:12:23,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2025-02-08 06:12:23,173 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 16 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:23,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 187 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:12:23,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-02-08 06:12:23,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2025-02-08 06:12:23,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 47 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:23,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2025-02-08 06:12:23,174 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 26 [2025-02-08 06:12:23,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:23,174 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2025-02-08 06:12:23,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 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-02-08 06:12:23,174 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2025-02-08 06:12:23,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 06:12:23,175 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:23,175 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:23,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 06:12:23,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-02-08 06:12:23,375 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:23,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:23,376 INFO L85 PathProgramCache]: Analyzing trace with hash -2019661338, now seen corresponding path program 1 times [2025-02-08 06:12:23,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:23,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758364949] [2025-02-08 06:12:23,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:12:23,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:23,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 06:12:23,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 06:12:23,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:23,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:23,563 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:23,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:23,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758364949] [2025-02-08 06:12:23,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758364949] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:12:23,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729890745] [2025-02-08 06:12:23,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:12:23,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:23,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:12:23,566 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:12:23,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 06:12:23,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 06:12:23,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 06:12:23,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:23,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:23,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-08 06:12:23,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:12:23,732 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:23,732 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:12:23,817 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 21 treesize of output 17 [2025-02-08 06:12:23,868 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:23,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1729890745] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:12:23,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:12:23,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 22 [2025-02-08 06:12:23,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179295614] [2025-02-08 06:12:23,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:12:23,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-08 06:12:23,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:23,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-08 06:12:23,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2025-02-08 06:12:23,870 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 23 states, 22 states have (on average 3.590909090909091) internal successors, (79), 23 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:23,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:23,991 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2025-02-08 06:12:23,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 06:12:23,992 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.590909090909091) internal successors, (79), 23 states have internal predecessors, (79), 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 29 [2025-02-08 06:12:23,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:23,992 INFO L225 Difference]: With dead ends: 58 [2025-02-08 06:12:23,992 INFO L226 Difference]: Without dead ends: 54 [2025-02-08 06:12:23,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=577, Unknown=0, NotChecked=0, Total=702 [2025-02-08 06:12:23,993 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 103 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:23,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 124 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:12:23,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-02-08 06:12:23,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2025-02-08 06:12:23,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 44 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:23,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2025-02-08 06:12:23,994 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 29 [2025-02-08 06:12:23,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:23,994 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2025-02-08 06:12:23,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.590909090909091) internal successors, (79), 23 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:23,994 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2025-02-08 06:12:23,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-08 06:12:23,994 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:23,994 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:24,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 06:12:24,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-02-08 06:12:24,199 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:24,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:24,199 INFO L85 PathProgramCache]: Analyzing trace with hash 429226948, now seen corresponding path program 1 times [2025-02-08 06:12:24,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:24,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454443277] [2025-02-08 06:12:24,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:12:24,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:24,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 06:12:24,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 06:12:24,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:24,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:24,302 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:24,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:24,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454443277] [2025-02-08 06:12:24,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454443277] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:12:24,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162578347] [2025-02-08 06:12:24,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:12:24,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:24,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:12:24,304 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:12:24,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 06:12:24,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 06:12:24,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 06:12:24,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:24,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:24,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-08 06:12:24,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:12:24,457 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:24,457 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:12:24,544 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 5 treesize of output 3 [2025-02-08 06:12:24,563 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:24,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162578347] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:12:24,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:12:24,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-02-08 06:12:24,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412423130] [2025-02-08 06:12:24,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:12:24,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-08 06:12:24,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:24,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-08 06:12:24,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2025-02-08 06:12:24,564 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 17 states, 16 states have (on average 4.75) internal successors, (76), 17 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:24,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:24,681 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2025-02-08 06:12:24,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 06:12:24,681 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.75) internal successors, (76), 17 states have internal predecessors, (76), 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 31 [2025-02-08 06:12:24,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:24,682 INFO L225 Difference]: With dead ends: 90 [2025-02-08 06:12:24,682 INFO L226 Difference]: Without dead ends: 90 [2025-02-08 06:12:24,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2025-02-08 06:12:24,682 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 36 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:24,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 220 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:12:24,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-02-08 06:12:24,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 65. [2025-02-08 06:12:24,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 63 states have (on average 1.1428571428571428) internal successors, (72), 64 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:24,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2025-02-08 06:12:24,684 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 31 [2025-02-08 06:12:24,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:24,684 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2025-02-08 06:12:24,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.75) internal successors, (76), 17 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:24,684 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2025-02-08 06:12:24,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-08 06:12:24,684 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:24,684 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:24,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 06:12:24,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-02-08 06:12:24,885 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:24,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:24,885 INFO L85 PathProgramCache]: Analyzing trace with hash 270542414, now seen corresponding path program 2 times [2025-02-08 06:12:24,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:24,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481060165] [2025-02-08 06:12:24,885 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:12:24,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:24,898 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-02-08 06:12:24,907 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 06:12:24,908 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:12:24,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:25,124 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:25,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:25,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481060165] [2025-02-08 06:12:25,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481060165] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:12:25,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798904773] [2025-02-08 06:12:25,125 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:12:25,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:25,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:12:25,127 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:12:25,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 06:12:25,174 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-02-08 06:12:25,193 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 06:12:25,193 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:12:25,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:25,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-02-08 06:12:25,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:12:25,244 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 13 treesize of output 9 [2025-02-08 06:12:25,331 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:25,331 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:12:25,355 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-02-08 06:12:25,356 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 16 treesize of output 12 [2025-02-08 06:12:25,398 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:25,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798904773] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:12:25,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:12:25,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 25 [2025-02-08 06:12:25,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999798975] [2025-02-08 06:12:25,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:12:25,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-08 06:12:25,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:25,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-08 06:12:25,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2025-02-08 06:12:25,399 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand has 25 states, 25 states have (on average 2.72) internal successors, (68), 25 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:25,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:25,569 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2025-02-08 06:12:25,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 06:12:25,569 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.72) internal successors, (68), 25 states have internal predecessors, (68), 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 36 [2025-02-08 06:12:25,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:25,570 INFO L225 Difference]: With dead ends: 112 [2025-02-08 06:12:25,570 INFO L226 Difference]: Without dead ends: 104 [2025-02-08 06:12:25,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=806, Unknown=0, NotChecked=0, Total=930 [2025-02-08 06:12:25,570 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 35 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:25,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 324 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:12:25,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-02-08 06:12:25,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2025-02-08 06:12:25,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 99 states have (on average 1.1111111111111112) internal successors, (110), 100 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:25,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2025-02-08 06:12:25,572 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 36 [2025-02-08 06:12:25,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:25,572 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2025-02-08 06:12:25,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.72) internal successors, (68), 25 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:25,572 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2025-02-08 06:12:25,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-08 06:12:25,572 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:25,573 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:25,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-08 06:12:25,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:25,773 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:25,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:25,773 INFO L85 PathProgramCache]: Analyzing trace with hash -854241937, now seen corresponding path program 3 times [2025-02-08 06:12:25,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:25,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974032068] [2025-02-08 06:12:25,774 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 06:12:25,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:25,782 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 3 equivalence classes. [2025-02-08 06:12:25,791 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 06:12:25,791 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-08 06:12:25,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:25,976 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:25,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:25,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974032068] [2025-02-08 06:12:25,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974032068] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:12:25,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885001245] [2025-02-08 06:12:25,977 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 06:12:25,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:25,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:12:25,978 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:12:25,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 06:12:26,024 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 3 equivalence classes. [2025-02-08 06:12:26,045 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 06:12:26,045 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-08 06:12:26,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:26,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-08 06:12:26,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:12:26,127 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:26,127 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:12:26,249 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 7 treesize of output 5 [2025-02-08 06:12:26,275 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:26,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885001245] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:12:26,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:12:26,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 23 [2025-02-08 06:12:26,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214035728] [2025-02-08 06:12:26,275 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:12:26,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-08 06:12:26,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:26,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-08 06:12:26,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2025-02-08 06:12:26,276 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand has 24 states, 23 states have (on average 3.869565217391304) internal successors, (89), 24 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:26,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:26,463 INFO L93 Difference]: Finished difference Result 132 states and 144 transitions. [2025-02-08 06:12:26,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 06:12:26,463 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.869565217391304) internal successors, (89), 24 states have internal predecessors, (89), 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 39 [2025-02-08 06:12:26,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:26,463 INFO L225 Difference]: With dead ends: 132 [2025-02-08 06:12:26,463 INFO L226 Difference]: Without dead ends: 132 [2025-02-08 06:12:26,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=684, Unknown=0, NotChecked=0, Total=812 [2025-02-08 06:12:26,464 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 121 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:26,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 292 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:12:26,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-02-08 06:12:26,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 115. [2025-02-08 06:12:26,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 113 states have (on average 1.1150442477876106) internal successors, (126), 114 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:26,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 126 transitions. [2025-02-08 06:12:26,466 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 126 transitions. Word has length 39 [2025-02-08 06:12:26,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:26,466 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 126 transitions. [2025-02-08 06:12:26,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.869565217391304) internal successors, (89), 24 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:26,467 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 126 transitions. [2025-02-08 06:12:26,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-08 06:12:26,467 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:26,467 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:26,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-08 06:12:26,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-02-08 06:12:26,671 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:26,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:26,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1820436910, now seen corresponding path program 2 times [2025-02-08 06:12:26,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:26,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868463879] [2025-02-08 06:12:26,671 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:12:26,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:26,676 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-02-08 06:12:26,684 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-02-08 06:12:26,684 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:12:26,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:27,122 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:27,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:27,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868463879] [2025-02-08 06:12:27,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868463879] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:12:27,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324767857] [2025-02-08 06:12:27,122 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:12:27,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:27,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:12:27,124 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:12:27,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 06:12:27,171 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-02-08 06:12:27,190 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-02-08 06:12:27,190 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:12:27,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:27,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 69 conjuncts are in the unsatisfiable core [2025-02-08 06:12:27,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:12:27,258 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 13 treesize of output 9 [2025-02-08 06:12:27,275 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 8 treesize of output 1 [2025-02-08 06:12:27,559 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:12:27,559 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 31 treesize of output 15 [2025-02-08 06:12:27,622 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 16 treesize of output 8 [2025-02-08 06:12:27,644 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:27,644 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:12:27,946 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 23 treesize of output 19 [2025-02-08 06:12:27,979 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 40 treesize of output 34 [2025-02-08 06:12:27,982 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:12:27,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 53 [2025-02-08 06:12:28,123 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:28,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324767857] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:12:28,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:12:28,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 19] total 47 [2025-02-08 06:12:28,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025943130] [2025-02-08 06:12:28,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:12:28,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-02-08 06:12:28,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:28,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-02-08 06:12:28,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1988, Unknown=0, NotChecked=0, Total=2162 [2025-02-08 06:12:28,125 INFO L87 Difference]: Start difference. First operand 115 states and 126 transitions. Second operand has 47 states, 47 states have (on average 2.4680851063829787) internal successors, (116), 47 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:28,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:28,836 INFO L93 Difference]: Finished difference Result 219 states and 236 transitions. [2025-02-08 06:12:28,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-08 06:12:28,836 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.4680851063829787) internal successors, (116), 47 states have internal predecessors, (116), 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 45 [2025-02-08 06:12:28,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:28,837 INFO L225 Difference]: With dead ends: 219 [2025-02-08 06:12:28,837 INFO L226 Difference]: Without dead ends: 192 [2025-02-08 06:12:28,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1063 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=393, Invalid=4029, Unknown=0, NotChecked=0, Total=4422 [2025-02-08 06:12:28,838 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 157 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:28,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 482 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 06:12:28,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-02-08 06:12:28,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 170. [2025-02-08 06:12:28,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 168 states have (on average 1.1071428571428572) internal successors, (186), 169 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:28,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 186 transitions. [2025-02-08 06:12:28,841 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 186 transitions. Word has length 45 [2025-02-08 06:12:28,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:28,841 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 186 transitions. [2025-02-08 06:12:28,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.4680851063829787) internal successors, (116), 47 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:28,841 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 186 transitions. [2025-02-08 06:12:28,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-08 06:12:28,842 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:28,842 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:28,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-08 06:12:29,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-02-08 06:12:29,043 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:29,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:29,043 INFO L85 PathProgramCache]: Analyzing trace with hash 473228965, now seen corresponding path program 4 times [2025-02-08 06:12:29,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:29,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936957634] [2025-02-08 06:12:29,043 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 06:12:29,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:29,049 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 46 statements into 2 equivalence classes. [2025-02-08 06:12:29,053 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 38 of 46 statements. [2025-02-08 06:12:29,054 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 06:12:29,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:29,573 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:29,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:29,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936957634] [2025-02-08 06:12:29,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936957634] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:12:29,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76979042] [2025-02-08 06:12:29,574 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 06:12:29,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:29,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:12:29,576 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:12:29,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-08 06:12:29,632 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 46 statements into 2 equivalence classes. [2025-02-08 06:12:29,650 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 38 of 46 statements. [2025-02-08 06:12:29,650 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 06:12:29,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:29,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-02-08 06:12:29,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:12:29,775 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-02-08 06:12:30,059 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:30,059 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:12:30,130 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 44 treesize of output 38 [2025-02-08 06:12:30,136 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:12:30,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 34 [2025-02-08 06:12:30,253 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:30,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76979042] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:12:30,253 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:12:30,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 34 [2025-02-08 06:12:30,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101788550] [2025-02-08 06:12:30,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:12:30,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-02-08 06:12:30,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:30,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-08 06:12:30,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=966, Unknown=0, NotChecked=0, Total=1122 [2025-02-08 06:12:30,255 INFO L87 Difference]: Start difference. First operand 170 states and 186 transitions. Second operand has 34 states, 34 states have (on average 2.264705882352941) internal successors, (77), 34 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:30,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:30,637 INFO L93 Difference]: Finished difference Result 278 states and 298 transitions. [2025-02-08 06:12:30,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-08 06:12:30,637 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.264705882352941) internal successors, (77), 34 states have internal predecessors, (77), 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 46 [2025-02-08 06:12:30,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:30,638 INFO L225 Difference]: With dead ends: 278 [2025-02-08 06:12:30,638 INFO L226 Difference]: Without dead ends: 266 [2025-02-08 06:12:30,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 76 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=309, Invalid=1947, Unknown=0, NotChecked=0, Total=2256 [2025-02-08 06:12:30,639 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 36 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:30,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 250 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:12:30,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-02-08 06:12:30,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 259. [2025-02-08 06:12:30,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 257 states have (on average 1.0894941634241244) internal successors, (280), 258 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:30,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 280 transitions. [2025-02-08 06:12:30,644 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 280 transitions. Word has length 46 [2025-02-08 06:12:30,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:30,644 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 280 transitions. [2025-02-08 06:12:30,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.264705882352941) internal successors, (77), 34 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:30,644 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 280 transitions. [2025-02-08 06:12:30,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-08 06:12:30,644 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:30,644 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:30,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-08 06:12:30,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:30,846 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:30,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:30,847 INFO L85 PathProgramCache]: Analyzing trace with hash -537317037, now seen corresponding path program 3 times [2025-02-08 06:12:30,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:30,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745305412] [2025-02-08 06:12:30,847 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 06:12:30,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:30,854 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 48 statements into 3 equivalence classes. [2025-02-08 06:12:30,863 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 06:12:30,863 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-08 06:12:30,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:31,053 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:31,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:31,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745305412] [2025-02-08 06:12:31,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745305412] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:12:31,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754886961] [2025-02-08 06:12:31,054 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 06:12:31,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:31,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:12:31,056 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:12:31,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-08 06:12:31,113 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 48 statements into 3 equivalence classes. [2025-02-08 06:12:31,135 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 06:12:31,135 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-08 06:12:31,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:31,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-08 06:12:31,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:12:31,247 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:31,248 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:12:31,393 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 7 treesize of output 5 [2025-02-08 06:12:31,429 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:31,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754886961] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:12:31,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:12:31,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-02-08 06:12:31,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914736891] [2025-02-08 06:12:31,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:12:31,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-08 06:12:31,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:31,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-08 06:12:31,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2025-02-08 06:12:31,431 INFO L87 Difference]: Start difference. First operand 259 states and 280 transitions. Second operand has 21 states, 20 states have (on average 6.15) internal successors, (123), 21 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:31,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:31,649 INFO L93 Difference]: Finished difference Result 386 states and 414 transitions. [2025-02-08 06:12:31,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 06:12:31,649 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 6.15) internal successors, (123), 21 states have internal predecessors, (123), 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 48 [2025-02-08 06:12:31,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:31,650 INFO L225 Difference]: With dead ends: 386 [2025-02-08 06:12:31,650 INFO L226 Difference]: Without dead ends: 386 [2025-02-08 06:12:31,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 81 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2025-02-08 06:12:31,651 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 37 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:31,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 573 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:12:31,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2025-02-08 06:12:31,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 324. [2025-02-08 06:12:31,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 322 states have (on average 1.0869565217391304) internal successors, (350), 323 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:31,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 350 transitions. [2025-02-08 06:12:31,658 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 350 transitions. Word has length 48 [2025-02-08 06:12:31,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:31,658 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 350 transitions. [2025-02-08 06:12:31,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 6.15) internal successors, (123), 21 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:31,664 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 350 transitions. [2025-02-08 06:12:31,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-08 06:12:31,665 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:31,665 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:31,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-08 06:12:31,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2025-02-08 06:12:31,865 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:31,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:31,866 INFO L85 PathProgramCache]: Analyzing trace with hash -207595386, now seen corresponding path program 5 times [2025-02-08 06:12:31,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:31,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225302223] [2025-02-08 06:12:31,866 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 06:12:31,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:31,881 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 49 statements into 4 equivalence classes. [2025-02-08 06:12:31,893 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 06:12:31,893 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-02-08 06:12:31,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:32,217 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 34 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:32,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:32,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225302223] [2025-02-08 06:12:32,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225302223] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:12:32,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847153449] [2025-02-08 06:12:32,218 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 06:12:32,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:32,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:12:32,220 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:12:32,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-08 06:12:32,280 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 49 statements into 4 equivalence classes. [2025-02-08 06:12:32,300 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 06:12:32,301 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-02-08 06:12:32,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:32,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-02-08 06:12:32,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:12:32,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-02-08 06:12:32,472 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 34 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:32,472 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:12:32,755 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 34 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:32,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847153449] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:12:32,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:12:32,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 31 [2025-02-08 06:12:32,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143980516] [2025-02-08 06:12:32,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:12:32,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-08 06:12:32,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:32,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-08 06:12:32,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=839, Unknown=0, NotChecked=0, Total=992 [2025-02-08 06:12:32,757 INFO L87 Difference]: Start difference. First operand 324 states and 350 transitions. Second operand has 32 states, 31 states have (on average 4.032258064516129) internal successors, (125), 32 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:33,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:33,022 INFO L93 Difference]: Finished difference Result 388 states and 421 transitions. [2025-02-08 06:12:33,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-08 06:12:33,022 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 4.032258064516129) internal successors, (125), 32 states have internal predecessors, (125), 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 49 [2025-02-08 06:12:33,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:33,023 INFO L225 Difference]: With dead ends: 388 [2025-02-08 06:12:33,023 INFO L226 Difference]: Without dead ends: 388 [2025-02-08 06:12:33,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=215, Invalid=1191, Unknown=0, NotChecked=0, Total=1406 [2025-02-08 06:12:33,024 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 131 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:33,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 392 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:12:33,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2025-02-08 06:12:33,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 352. [2025-02-08 06:12:33,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 350 states have (on average 1.0914285714285714) internal successors, (382), 351 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:33,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 382 transitions. [2025-02-08 06:12:33,030 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 382 transitions. Word has length 49 [2025-02-08 06:12:33,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:33,030 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 382 transitions. [2025-02-08 06:12:33,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 4.032258064516129) internal successors, (125), 32 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:33,030 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 382 transitions. [2025-02-08 06:12:33,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-08 06:12:33,031 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:33,031 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:33,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-02-08 06:12:33,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:33,235 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:33,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:33,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1787657298, now seen corresponding path program 6 times [2025-02-08 06:12:33,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:33,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087144822] [2025-02-08 06:12:33,236 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 06:12:33,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:33,243 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 5 equivalence classes. [2025-02-08 06:12:33,261 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 56 of 56 statements. [2025-02-08 06:12:33,264 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-02-08 06:12:33,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:33,598 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 17 proven. 45 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:33,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:33,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087144822] [2025-02-08 06:12:33,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087144822] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:12:33,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056484353] [2025-02-08 06:12:33,598 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 06:12:33,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:33,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:12:33,603 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:12:33,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-08 06:12:33,662 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 5 equivalence classes. [2025-02-08 06:12:33,696 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 56 of 56 statements. [2025-02-08 06:12:33,697 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-02-08 06:12:33,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:33,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-02-08 06:12:33,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:12:33,860 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 13 treesize of output 9 [2025-02-08 06:12:33,981 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 17 proven. 45 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:33,981 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:12:34,030 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-02-08 06:12:34,032 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 16 treesize of output 12 [2025-02-08 06:12:34,094 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 17 proven. 45 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:34,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056484353] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:12:34,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:12:34,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 29 [2025-02-08 06:12:34,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097997250] [2025-02-08 06:12:34,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:12:34,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-08 06:12:34,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:34,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-08 06:12:34,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=726, Unknown=0, NotChecked=0, Total=812 [2025-02-08 06:12:34,095 INFO L87 Difference]: Start difference. First operand 352 states and 382 transitions. Second operand has 29 states, 29 states have (on average 3.3448275862068964) internal successors, (97), 29 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:34,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:34,457 INFO L93 Difference]: Finished difference Result 518 states and 557 transitions. [2025-02-08 06:12:34,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-08 06:12:34,458 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.3448275862068964) internal successors, (97), 29 states have internal predecessors, (97), 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 56 [2025-02-08 06:12:34,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:34,459 INFO L225 Difference]: With dead ends: 518 [2025-02-08 06:12:34,459 INFO L226 Difference]: Without dead ends: 502 [2025-02-08 06:12:34,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=155, Invalid=1327, Unknown=0, NotChecked=0, Total=1482 [2025-02-08 06:12:34,460 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 61 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:34,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 773 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:12:34,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2025-02-08 06:12:34,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 490. [2025-02-08 06:12:34,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 488 states have (on average 1.0860655737704918) internal successors, (530), 489 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:34,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 530 transitions. [2025-02-08 06:12:34,467 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 530 transitions. Word has length 56 [2025-02-08 06:12:34,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:34,468 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 530 transitions. [2025-02-08 06:12:34,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.3448275862068964) internal successors, (97), 29 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:34,468 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 530 transitions. [2025-02-08 06:12:34,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-08 06:12:34,469 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:34,469 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:34,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-02-08 06:12:34,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:34,670 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:34,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:34,670 INFO L85 PathProgramCache]: Analyzing trace with hash 856019023, now seen corresponding path program 7 times [2025-02-08 06:12:34,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:34,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102918581] [2025-02-08 06:12:34,671 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 06:12:34,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:34,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-08 06:12:34,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-08 06:12:34,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:34,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:34,934 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 5 proven. 67 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:34,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:34,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102918581] [2025-02-08 06:12:34,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102918581] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:12:34,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456724902] [2025-02-08 06:12:34,935 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 06:12:34,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:34,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:12:34,938 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:12:34,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-02-08 06:12:35,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-08 06:12:35,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-08 06:12:35,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:35,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:35,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-02-08 06:12:35,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:12:35,253 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 12 proven. 60 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:35,253 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:12:35,457 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 5 treesize of output 3 [2025-02-08 06:12:35,515 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 12 proven. 60 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:35,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456724902] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:12:35,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:12:35,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 31 [2025-02-08 06:12:35,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83631151] [2025-02-08 06:12:35,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:12:35,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-08 06:12:35,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:35,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-08 06:12:35,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=871, Unknown=0, NotChecked=0, Total=992 [2025-02-08 06:12:35,517 INFO L87 Difference]: Start difference. First operand 490 states and 530 transitions. Second operand has 32 states, 31 states have (on average 4.161290322580645) internal successors, (129), 32 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:35,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:35,917 INFO L93 Difference]: Finished difference Result 558 states and 605 transitions. [2025-02-08 06:12:35,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-08 06:12:35,920 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 4.161290322580645) internal successors, (129), 32 states have internal predecessors, (129), 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 59 [2025-02-08 06:12:35,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:35,921 INFO L225 Difference]: With dead ends: 558 [2025-02-08 06:12:35,921 INFO L226 Difference]: Without dead ends: 558 [2025-02-08 06:12:35,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 95 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=192, Invalid=1290, Unknown=0, NotChecked=0, Total=1482 [2025-02-08 06:12:35,922 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 146 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:35,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 599 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 06:12:35,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2025-02-08 06:12:35,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 518. [2025-02-08 06:12:35,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 516 states have (on average 1.0891472868217054) internal successors, (562), 517 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:35,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 562 transitions. [2025-02-08 06:12:35,950 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 562 transitions. Word has length 59 [2025-02-08 06:12:35,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:35,950 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 562 transitions. [2025-02-08 06:12:35,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 4.161290322580645) internal successors, (129), 32 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:35,950 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 562 transitions. [2025-02-08 06:12:35,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-08 06:12:35,951 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:35,951 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:35,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-02-08 06:12:36,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2025-02-08 06:12:36,152 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:36,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:36,152 INFO L85 PathProgramCache]: Analyzing trace with hash 756922933, now seen corresponding path program 1 times [2025-02-08 06:12:36,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:36,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080552986] [2025-02-08 06:12:36,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:12:36,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:36,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-08 06:12:36,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-08 06:12:36,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:36,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:36,380 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 36 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-08 06:12:36,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:36,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080552986] [2025-02-08 06:12:36,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080552986] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:12:36,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920237821] [2025-02-08 06:12:36,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:12:36,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:36,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:12:36,384 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:12:36,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-02-08 06:12:36,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-08 06:12:36,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-08 06:12:36,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:36,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:36,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 85 conjuncts are in the unsatisfiable core [2025-02-08 06:12:36,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:12:36,537 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 13 treesize of output 9 [2025-02-08 06:12:36,550 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 8 treesize of output 1 [2025-02-08 06:12:36,904 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:12:36,905 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 33 treesize of output 17 [2025-02-08 06:12:36,982 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 16 treesize of output 8 [2025-02-08 06:12:36,999 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 54 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:36,999 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:12:37,412 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 27 treesize of output 19 [2025-02-08 06:12:37,443 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 40 treesize of output 34 [2025-02-08 06:12:37,446 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:12:37,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 53 [2025-02-08 06:12:37,578 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 25 proven. 29 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-08 06:12:37,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [920237821] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:12:37,578 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:12:37,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 21, 21] total 48 [2025-02-08 06:12:37,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751915232] [2025-02-08 06:12:37,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:12:37,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-02-08 06:12:37,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:37,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-02-08 06:12:37,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=2075, Unknown=0, NotChecked=0, Total=2256 [2025-02-08 06:12:37,580 INFO L87 Difference]: Start difference. First operand 518 states and 562 transitions. Second operand has 48 states, 48 states have (on average 3.2916666666666665) internal successors, (158), 48 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:38,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:38,167 INFO L93 Difference]: Finished difference Result 504 states and 542 transitions. [2025-02-08 06:12:38,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-08 06:12:38,167 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 3.2916666666666665) internal successors, (158), 48 states have internal predecessors, (158), 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 62 [2025-02-08 06:12:38,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:38,168 INFO L225 Difference]: With dead ends: 504 [2025-02-08 06:12:38,168 INFO L226 Difference]: Without dead ends: 428 [2025-02-08 06:12:38,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 816 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=303, Invalid=3479, Unknown=0, NotChecked=0, Total=3782 [2025-02-08 06:12:38,169 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 20 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:38,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 497 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 06:12:38,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2025-02-08 06:12:38,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 425. [2025-02-08 06:12:38,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 423 states have (on average 1.0921985815602837) internal successors, (462), 424 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:38,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 462 transitions. [2025-02-08 06:12:38,174 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 462 transitions. Word has length 62 [2025-02-08 06:12:38,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:38,175 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 462 transitions. [2025-02-08 06:12:38,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 3.2916666666666665) internal successors, (158), 48 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:38,175 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 462 transitions. [2025-02-08 06:12:38,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-08 06:12:38,175 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:38,175 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:38,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-02-08 06:12:38,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-02-08 06:12:38,380 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:38,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:38,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1146201505, now seen corresponding path program 4 times [2025-02-08 06:12:38,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:38,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869130702] [2025-02-08 06:12:38,381 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 06:12:38,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:38,386 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 62 statements into 2 equivalence classes. [2025-02-08 06:12:38,392 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 54 of 62 statements. [2025-02-08 06:12:38,392 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 06:12:38,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:39,674 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:12:39,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:39,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869130702] [2025-02-08 06:12:39,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869130702] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:12:39,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004780709] [2025-02-08 06:12:39,675 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 06:12:39,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:39,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:12:39,677 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:12:39,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-02-08 06:12:39,753 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 62 statements into 2 equivalence classes. [2025-02-08 06:12:39,788 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 54 of 62 statements. [2025-02-08 06:12:39,788 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 06:12:39,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:39,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 81 conjuncts are in the unsatisfiable core [2025-02-08 06:12:39,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:12:39,835 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-02-08 06:12:41,693 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:12:41,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 99 treesize of output 135 [2025-02-08 06:12:42,052 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:12:42,052 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 37 treesize of output 37 [2025-02-08 06:12:42,098 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 2 proven. 46 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 06:12:42,098 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:12:43,042 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:12:43,043 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 37 treesize of output 36 [2025-02-08 06:12:43,297 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 57 treesize of output 49 [2025-02-08 06:12:43,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 104 [2025-02-08 06:12:43,309 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 5 treesize of output 3 [2025-02-08 06:12:43,331 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 06:12:43,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004780709] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:12:43,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:12:43,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 20] total 59 [2025-02-08 06:12:43,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204559794] [2025-02-08 06:12:43,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:12:43,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2025-02-08 06:12:43,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:43,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2025-02-08 06:12:43,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=3219, Unknown=0, NotChecked=0, Total=3540 [2025-02-08 06:12:43,337 INFO L87 Difference]: Start difference. First operand 425 states and 462 transitions. Second operand has 60 states, 59 states have (on average 2.711864406779661) internal successors, (160), 60 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:49,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:49,079 INFO L93 Difference]: Finished difference Result 750 states and 806 transitions. [2025-02-08 06:12:49,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-02-08 06:12:49,079 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 59 states have (on average 2.711864406779661) internal successors, (160), 60 states have internal predecessors, (160), 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 62 [2025-02-08 06:12:49,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:49,080 INFO L225 Difference]: With dead ends: 750 [2025-02-08 06:12:49,080 INFO L226 Difference]: Without dead ends: 367 [2025-02-08 06:12:49,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2152 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=1899, Invalid=8813, Unknown=0, NotChecked=0, Total=10712 [2025-02-08 06:12:49,083 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 387 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 1331 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 1373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:49,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 615 Invalid, 1373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1331 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-08 06:12:49,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2025-02-08 06:12:49,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 130. [2025-02-08 06:12:49,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.0852713178294573) internal successors, (140), 129 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:49,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 140 transitions. [2025-02-08 06:12:49,086 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 140 transitions. Word has length 62 [2025-02-08 06:12:49,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:49,086 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 140 transitions. [2025-02-08 06:12:49,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 59 states have (on average 2.711864406779661) internal successors, (160), 60 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:49,086 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 140 transitions. [2025-02-08 06:12:49,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-08 06:12:49,086 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:49,086 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:49,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-02-08 06:12:49,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:49,287 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:49,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:49,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1712678853, now seen corresponding path program 8 times [2025-02-08 06:12:49,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:49,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872131255] [2025-02-08 06:12:49,288 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:12:49,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:49,295 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 66 statements into 2 equivalence classes. [2025-02-08 06:12:49,303 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 66 of 66 statements. [2025-02-08 06:12:49,303 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:12:49,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:49,617 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 22 proven. 80 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:49,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:49,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872131255] [2025-02-08 06:12:49,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872131255] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:12:49,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758363379] [2025-02-08 06:12:49,618 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:12:49,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:49,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:12:49,621 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:12:49,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-02-08 06:12:49,687 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 66 statements into 2 equivalence classes. [2025-02-08 06:12:49,712 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 66 of 66 statements. [2025-02-08 06:12:49,712 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:12:49,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:49,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-02-08 06:12:49,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:12:49,806 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 13 treesize of output 9 [2025-02-08 06:12:49,883 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 22 proven. 80 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:49,883 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:12:49,922 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-02-08 06:12:49,923 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 16 treesize of output 12 [2025-02-08 06:12:49,972 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 22 proven. 80 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:49,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758363379] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:12:49,972 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:12:49,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 31 [2025-02-08 06:12:49,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521088755] [2025-02-08 06:12:49,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:12:49,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-02-08 06:12:49,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:49,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-02-08 06:12:49,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=839, Unknown=0, NotChecked=0, Total=930 [2025-02-08 06:12:49,974 INFO L87 Difference]: Start difference. First operand 130 states and 140 transitions. Second operand has 31 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:50,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:50,354 INFO L93 Difference]: Finished difference Result 225 states and 239 transitions. [2025-02-08 06:12:50,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-08 06:12:50,355 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 31 states have internal predecessors, (103), 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 66 [2025-02-08 06:12:50,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:50,355 INFO L225 Difference]: With dead ends: 225 [2025-02-08 06:12:50,355 INFO L226 Difference]: Without dead ends: 140 [2025-02-08 06:12:50,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=1635, Unknown=0, NotChecked=0, Total=1806 [2025-02-08 06:12:50,356 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 110 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:50,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 608 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:12:50,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-02-08 06:12:50,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 136. [2025-02-08 06:12:50,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 1.0814814814814815) internal successors, (146), 135 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:50,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 146 transitions. [2025-02-08 06:12:50,357 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 146 transitions. Word has length 66 [2025-02-08 06:12:50,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:50,358 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 146 transitions. [2025-02-08 06:12:50,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:50,358 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 146 transitions. [2025-02-08 06:12:50,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-08 06:12:50,358 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:50,358 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:50,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-02-08 06:12:50,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:50,563 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:50,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:50,564 INFO L85 PathProgramCache]: Analyzing trace with hash -254927066, now seen corresponding path program 9 times [2025-02-08 06:12:50,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:50,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264326297] [2025-02-08 06:12:50,564 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 06:12:50,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:50,571 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 69 statements into 6 equivalence classes. [2025-02-08 06:12:50,581 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 69 of 69 statements. [2025-02-08 06:12:50,581 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-02-08 06:12:50,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:50,876 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 12 proven. 103 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:50,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:50,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264326297] [2025-02-08 06:12:50,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264326297] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:12:50,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475556770] [2025-02-08 06:12:50,877 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 06:12:50,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:50,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:12:50,881 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:12:50,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-02-08 06:12:50,949 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 69 statements into 6 equivalence classes. [2025-02-08 06:12:51,026 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 69 of 69 statements. [2025-02-08 06:12:51,026 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-02-08 06:12:51,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:51,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-02-08 06:12:51,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:12:51,169 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 22 proven. 93 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:51,170 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:12:51,392 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 7 treesize of output 5 [2025-02-08 06:12:51,453 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 22 proven. 93 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:51,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475556770] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:12:51,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:12:51,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 35 [2025-02-08 06:12:51,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046993911] [2025-02-08 06:12:51,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:12:51,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-02-08 06:12:51,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:51,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-02-08 06:12:51,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1091, Unknown=0, NotChecked=0, Total=1260 [2025-02-08 06:12:51,454 INFO L87 Difference]: Start difference. First operand 136 states and 146 transitions. Second operand has 36 states, 35 states have (on average 4.257142857142857) internal successors, (149), 36 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:51,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:51,704 INFO L93 Difference]: Finished difference Result 166 states and 178 transitions. [2025-02-08 06:12:51,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-08 06:12:51,704 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 4.257142857142857) internal successors, (149), 36 states have internal predecessors, (149), 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 69 [2025-02-08 06:12:51,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:51,704 INFO L225 Difference]: With dead ends: 166 [2025-02-08 06:12:51,705 INFO L226 Difference]: Without dead ends: 166 [2025-02-08 06:12:51,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 113 SyntacticMatches, 6 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=287, Invalid=1605, Unknown=0, NotChecked=0, Total=1892 [2025-02-08 06:12:51,705 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 160 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:51,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 248 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:12:51,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-02-08 06:12:51,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 150. [2025-02-08 06:12:51,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 149 states have (on average 1.080536912751678) internal successors, (161), 149 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:51,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 161 transitions. [2025-02-08 06:12:51,708 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 161 transitions. Word has length 69 [2025-02-08 06:12:51,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:51,708 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 161 transitions. [2025-02-08 06:12:51,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 4.257142857142857) internal successors, (149), 36 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:51,708 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 161 transitions. [2025-02-08 06:12:51,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-08 06:12:51,708 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:51,708 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:51,715 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-02-08 06:12:51,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-02-08 06:12:51,909 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:51,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:51,909 INFO L85 PathProgramCache]: Analyzing trace with hash -250214130, now seen corresponding path program 10 times [2025-02-08 06:12:51,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:51,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457310660] [2025-02-08 06:12:51,909 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 06:12:51,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:51,917 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 76 statements into 2 equivalence classes. [2025-02-08 06:12:51,929 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 62 of 76 statements. [2025-02-08 06:12:51,930 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 06:12:51,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:53,017 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 117 proven. 35 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:53,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:53,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457310660] [2025-02-08 06:12:53,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457310660] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:12:53,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033215113] [2025-02-08 06:12:53,017 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 06:12:53,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:53,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:12:53,019 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:12:53,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-02-08 06:12:53,094 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 76 statements into 2 equivalence classes. [2025-02-08 06:12:53,119 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 62 of 76 statements. [2025-02-08 06:12:53,120 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 06:12:53,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:53,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 88 conjuncts are in the unsatisfiable core [2025-02-08 06:12:53,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:12:53,291 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-02-08 06:12:54,479 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 107 proven. 45 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:54,479 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:12:54,682 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 89 treesize of output 77 [2025-02-08 06:12:54,691 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:12:54,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 89 treesize of output 67 [2025-02-08 06:12:55,060 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 117 proven. 35 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:55,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2033215113] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:12:55,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:12:55,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 67 [2025-02-08 06:12:55,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343292466] [2025-02-08 06:12:55,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:12:55,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2025-02-08 06:12:55,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:55,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2025-02-08 06:12:55,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=554, Invalid=3868, Unknown=0, NotChecked=0, Total=4422 [2025-02-08 06:12:55,063 INFO L87 Difference]: Start difference. First operand 150 states and 161 transitions. Second operand has 67 states, 67 states have (on average 2.1791044776119404) internal successors, (146), 67 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:56,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:56,013 INFO L93 Difference]: Finished difference Result 260 states and 276 transitions. [2025-02-08 06:12:56,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-02-08 06:12:56,013 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 2.1791044776119404) internal successors, (146), 67 states have internal predecessors, (146), 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 76 [2025-02-08 06:12:56,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:56,014 INFO L225 Difference]: With dead ends: 260 [2025-02-08 06:12:56,014 INFO L226 Difference]: Without dead ends: 160 [2025-02-08 06:12:56,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 119 SyntacticMatches, 2 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3076 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1063, Invalid=7679, Unknown=0, NotChecked=0, Total=8742 [2025-02-08 06:12:56,017 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 45 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 940 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:56,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 426 Invalid, 941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 940 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 06:12:56,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-02-08 06:12:56,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 156. [2025-02-08 06:12:56,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 1.0774193548387097) internal successors, (167), 155 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:56,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 167 transitions. [2025-02-08 06:12:56,020 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 167 transitions. Word has length 76 [2025-02-08 06:12:56,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:56,021 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 167 transitions. [2025-02-08 06:12:56,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 2.1791044776119404) internal successors, (146), 67 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:56,021 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 167 transitions. [2025-02-08 06:12:56,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-08 06:12:56,021 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:56,021 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:56,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-02-08 06:12:56,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:56,222 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:56,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:56,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1547549487, now seen corresponding path program 11 times [2025-02-08 06:12:56,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:56,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909490038] [2025-02-08 06:12:56,222 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 06:12:56,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:56,234 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 79 statements into 7 equivalence classes. [2025-02-08 06:12:56,242 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 79 of 79 statements. [2025-02-08 06:12:56,242 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-02-08 06:12:56,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:56,587 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 35 proven. 133 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:56,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:56,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909490038] [2025-02-08 06:12:56,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909490038] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:12:56,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103839674] [2025-02-08 06:12:56,588 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 06:12:56,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:56,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:12:56,590 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:12:56,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-02-08 06:12:56,664 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 79 statements into 7 equivalence classes. [2025-02-08 06:12:56,703 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 79 of 79 statements. [2025-02-08 06:12:56,703 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-02-08 06:12:56,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:56,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-02-08 06:12:56,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:12:56,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 06:12:56,979 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 35 proven. 133 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:56,979 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:12:57,498 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 35 proven. 133 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:57,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103839674] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:12:57,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:12:57,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 46 [2025-02-08 06:12:57,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047764948] [2025-02-08 06:12:57,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:12:57,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-02-08 06:12:57,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:57,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-02-08 06:12:57,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=1853, Unknown=0, NotChecked=0, Total=2162 [2025-02-08 06:12:57,500 INFO L87 Difference]: Start difference. First operand 156 states and 167 transitions. Second operand has 47 states, 46 states have (on average 4.217391304347826) internal successors, (194), 47 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:57,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:57,957 INFO L93 Difference]: Finished difference Result 187 states and 200 transitions. [2025-02-08 06:12:57,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-08 06:12:57,957 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 4.217391304347826) internal successors, (194), 47 states have internal predecessors, (194), 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 79 [2025-02-08 06:12:57,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:57,958 INFO L225 Difference]: With dead ends: 187 [2025-02-08 06:12:57,958 INFO L226 Difference]: Without dead ends: 187 [2025-02-08 06:12:57,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 999 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=419, Invalid=2661, Unknown=0, NotChecked=0, Total=3080 [2025-02-08 06:12:57,958 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 264 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:57,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 630 Invalid, 883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 06:12:57,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-02-08 06:12:57,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 170. [2025-02-08 06:12:57,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 1.0769230769230769) internal successors, (182), 169 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:57,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 182 transitions. [2025-02-08 06:12:57,961 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 182 transitions. Word has length 79 [2025-02-08 06:12:57,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:57,961 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 182 transitions. [2025-02-08 06:12:57,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 4.217391304347826) internal successors, (194), 47 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:57,962 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 182 transitions. [2025-02-08 06:12:57,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-08 06:12:57,962 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:57,962 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:57,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-02-08 06:12:58,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-02-08 06:12:58,163 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:58,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:58,163 INFO L85 PathProgramCache]: Analyzing trace with hash 2030665957, now seen corresponding path program 12 times [2025-02-08 06:12:58,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:58,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956048730] [2025-02-08 06:12:58,163 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 06:12:58,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:58,172 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 86 statements into 8 equivalence classes. [2025-02-08 06:12:58,202 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 86 of 86 statements. [2025-02-08 06:12:58,208 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-02-08 06:12:58,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:58,824 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 32 proven. 180 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:58,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:58,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956048730] [2025-02-08 06:12:58,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956048730] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:12:58,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941447983] [2025-02-08 06:12:58,825 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 06:12:58,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:58,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:12:58,827 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:12:58,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-02-08 06:12:58,912 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 86 statements into 8 equivalence classes. [2025-02-08 06:12:59,017 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 86 of 86 statements. [2025-02-08 06:12:59,018 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-02-08 06:12:59,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:59,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 73 conjuncts are in the unsatisfiable core [2025-02-08 06:12:59,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:12:59,133 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-02-08 06:13:03,858 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:13:03,858 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 18 treesize of output 19 [2025-02-08 06:13:04,077 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 35 proven. 177 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:13:04,078 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:13:05,045 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-02-08 06:13:05,048 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-02-08 06:13:05,054 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 7 treesize of output 5 [2025-02-08 06:13:05,161 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 35 proven. 177 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:13:05,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941447983] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:13:05,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:13:05,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 21] total 56 [2025-02-08 06:13:05,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255016772] [2025-02-08 06:13:05,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:13:05,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2025-02-08 06:13:05,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:13:05,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2025-02-08 06:13:05,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=2831, Unknown=1, NotChecked=0, Total=3080 [2025-02-08 06:13:05,162 INFO L87 Difference]: Start difference. First operand 170 states and 182 transitions. Second operand has 56 states, 56 states have (on average 4.053571428571429) internal successors, (227), 56 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:07,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-08 06:13:13,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-08 06:13:38,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.75s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-08 06:13:38,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:13:38,999 INFO L93 Difference]: Finished difference Result 327 states and 347 transitions. [2025-02-08 06:13:38,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-02-08 06:13:38,999 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 4.053571428571429) internal successors, (227), 56 states have internal predecessors, (227), 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 86 [2025-02-08 06:13:39,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:13:39,004 INFO L225 Difference]: With dead ends: 327 [2025-02-08 06:13:39,004 INFO L226 Difference]: Without dead ends: 212 [2025-02-08 06:13:39,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 132 SyntacticMatches, 7 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2025 ImplicationChecksByTransitivity, 31.4s TimeCoverageRelationStatistics Valid=807, Invalid=6332, Unknown=1, NotChecked=0, Total=7140 [2025-02-08 06:13:39,005 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 554 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 1553 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 1567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1553 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2025-02-08 06:13:39,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [554 Valid, 902 Invalid, 1567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1553 Invalid, 1 Unknown, 0 Unchecked, 7.8s Time] [2025-02-08 06:13:39,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-02-08 06:13:39,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 190. [2025-02-08 06:13:39,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 189 states have (on average 1.0740740740740742) internal successors, (203), 189 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:39,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 203 transitions. [2025-02-08 06:13:39,024 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 203 transitions. Word has length 86 [2025-02-08 06:13:39,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:13:39,025 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 203 transitions. [2025-02-08 06:13:39,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 4.053571428571429) internal successors, (227), 56 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:39,025 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 203 transitions. [2025-02-08 06:13:39,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-08 06:13:39,026 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:13:39,026 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:13:39,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-02-08 06:13:39,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2025-02-08 06:13:39,227 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:13:39,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:13:39,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1052985746, now seen corresponding path program 13 times [2025-02-08 06:13:39,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:13:39,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025528003] [2025-02-08 06:13:39,229 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 06:13:39,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:13:39,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-08 06:13:39,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-08 06:13:39,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:13:39,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:13:39,965 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 37 proven. 245 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:13:39,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:13:39,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025528003] [2025-02-08 06:13:39,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025528003] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:13:39,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770133818] [2025-02-08 06:13:39,966 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 06:13:39,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:13:39,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:13:39,968 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:13:39,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-02-08 06:13:40,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-08 06:13:40,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-08 06:13:40,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:13:40,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:13:40,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 95 conjuncts are in the unsatisfiable core [2025-02-08 06:13:40,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:13:40,407 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 13 treesize of output 9 [2025-02-08 06:13:40,603 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 37 proven. 245 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:13:40,603 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:13:40,671 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-02-08 06:13:40,673 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 16 treesize of output 12 [2025-02-08 06:13:40,747 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 37 proven. 245 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:13:40,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770133818] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:13:40,747 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:13:40,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 40 [2025-02-08 06:13:40,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000956690] [2025-02-08 06:13:40,747 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:13:40,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-02-08 06:13:40,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:13:40,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-02-08 06:13:40,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1445, Unknown=0, NotChecked=0, Total=1560 [2025-02-08 06:13:40,748 INFO L87 Difference]: Start difference. First operand 190 states and 203 transitions. Second operand has 40 states, 40 states have (on average 3.55) internal successors, (142), 40 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:41,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:13:41,665 INFO L93 Difference]: Finished difference Result 330 states and 350 transitions. [2025-02-08 06:13:41,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-02-08 06:13:41,665 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 3.55) internal successors, (142), 40 states have internal predecessors, (142), 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 96 [2025-02-08 06:13:41,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:13:41,666 INFO L225 Difference]: With dead ends: 330 [2025-02-08 06:13:41,666 INFO L226 Difference]: Without dead ends: 200 [2025-02-08 06:13:41,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 702 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=231, Invalid=3075, Unknown=0, NotChecked=0, Total=3306 [2025-02-08 06:13:41,668 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 168 mSDsluCounter, 1315 mSDsCounter, 0 mSdLazyCounter, 1655 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 1366 SdHoareTripleChecker+Invalid, 1662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 06:13:41,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 1366 Invalid, 1662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1655 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 06:13:41,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-02-08 06:13:41,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 196. [2025-02-08 06:13:41,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 195 states have (on average 1.0717948717948718) internal successors, (209), 195 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:41,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 209 transitions. [2025-02-08 06:13:41,674 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 209 transitions. Word has length 96 [2025-02-08 06:13:41,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:13:41,675 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 209 transitions. [2025-02-08 06:13:41,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 3.55) internal successors, (142), 40 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:41,675 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 209 transitions. [2025-02-08 06:13:41,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-08 06:13:41,677 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:13:41,677 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:13:41,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-02-08 06:13:41,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2025-02-08 06:13:41,877 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:13:41,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:13:41,878 INFO L85 PathProgramCache]: Analyzing trace with hash 223284751, now seen corresponding path program 14 times [2025-02-08 06:13:41,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:13:41,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464548362] [2025-02-08 06:13:41,878 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:13:41,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:13:41,888 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 99 statements into 2 equivalence classes. [2025-02-08 06:13:41,900 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 99 of 99 statements. [2025-02-08 06:13:41,900 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:13:41,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:13:42,460 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 51 proven. 253 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:13:42,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:13:42,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464548362] [2025-02-08 06:13:42,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464548362] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:13:42,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316311652] [2025-02-08 06:13:42,461 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:13:42,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:13:42,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:13:42,463 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:13:42,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-02-08 06:13:42,564 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 99 statements into 2 equivalence classes. [2025-02-08 06:13:42,603 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 99 of 99 statements. [2025-02-08 06:13:42,603 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:13:42,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:13:42,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 92 conjuncts are in the unsatisfiable core [2025-02-08 06:13:42,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:13:42,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-02-08 06:13:43,073 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 70 proven. 234 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:13:43,074 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:13:43,994 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 70 proven. 234 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:13:43,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316311652] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:13:43,994 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:13:43,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 56 [2025-02-08 06:13:43,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229474160] [2025-02-08 06:13:43,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:13:43,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-02-08 06:13:43,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:13:43,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-02-08 06:13:43,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=441, Invalid=2751, Unknown=0, NotChecked=0, Total=3192 [2025-02-08 06:13:43,996 INFO L87 Difference]: Start difference. First operand 196 states and 209 transitions. Second operand has 57 states, 56 states have (on average 4.285714285714286) internal successors, (240), 57 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:44,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:13:44,828 INFO L93 Difference]: Finished difference Result 229 states and 244 transitions. [2025-02-08 06:13:44,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-08 06:13:44,829 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 4.285714285714286) internal successors, (240), 57 states have internal predecessors, (240), 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 99 [2025-02-08 06:13:44,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:13:44,830 INFO L225 Difference]: With dead ends: 229 [2025-02-08 06:13:44,830 INFO L226 Difference]: Without dead ends: 229 [2025-02-08 06:13:44,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1516 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=587, Invalid=3969, Unknown=0, NotChecked=0, Total=4556 [2025-02-08 06:13:44,835 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 335 mSDsluCounter, 1173 mSDsCounter, 0 mSdLazyCounter, 1467 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 1230 SdHoareTripleChecker+Invalid, 1468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 06:13:44,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 1230 Invalid, 1468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1467 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 06:13:44,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2025-02-08 06:13:44,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 210. [2025-02-08 06:13:44,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 209 states have (on average 1.0717703349282297) internal successors, (224), 209 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:44,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 224 transitions. [2025-02-08 06:13:44,844 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 224 transitions. Word has length 99 [2025-02-08 06:13:44,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:13:44,845 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 224 transitions. [2025-02-08 06:13:44,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 4.285714285714286) internal successors, (240), 57 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:44,845 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 224 transitions. [2025-02-08 06:13:44,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-08 06:13:44,847 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:13:44,847 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:13:44,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-02-08 06:13:45,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,24 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:13:45,048 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:13:45,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:13:45,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1472253435, now seen corresponding path program 15 times [2025-02-08 06:13:45,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:13:45,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500049683] [2025-02-08 06:13:45,049 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 06:13:45,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:13:45,061 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 106 statements into 10 equivalence classes. [2025-02-08 06:13:45,095 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 106 of 106 statements. [2025-02-08 06:13:45,097 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-02-08 06:13:45,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:13:45,834 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 42 proven. 320 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:13:45,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:13:45,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500049683] [2025-02-08 06:13:45,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500049683] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:13:45,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817832639] [2025-02-08 06:13:45,835 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 06:13:45,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:13:45,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:13:45,837 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:13:45,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-02-08 06:13:45,933 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 106 statements into 10 equivalence classes. [2025-02-08 06:13:46,048 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 106 of 106 statements. [2025-02-08 06:13:46,048 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-02-08 06:13:46,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:13:46,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 103 conjuncts are in the unsatisfiable core [2025-02-08 06:13:46,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:13:46,339 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 13 treesize of output 9 [2025-02-08 06:13:46,511 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 42 proven. 320 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:13:46,511 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:13:46,581 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-02-08 06:13:46,583 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 16 treesize of output 12 [2025-02-08 06:13:46,681 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 42 proven. 320 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:13:46,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817832639] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:13:46,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:13:46,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26, 26] total 44 [2025-02-08 06:13:46,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636364924] [2025-02-08 06:13:46,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:13:46,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-02-08 06:13:46,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:13:46,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-02-08 06:13:46,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1793, Unknown=0, NotChecked=0, Total=1892 [2025-02-08 06:13:46,682 INFO L87 Difference]: Start difference. First operand 210 states and 224 transitions. Second operand has 44 states, 44 states have (on average 3.522727272727273) internal successors, (155), 44 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:48,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:13:48,235 INFO L93 Difference]: Finished difference Result 365 states and 387 transitions. [2025-02-08 06:13:48,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-02-08 06:13:48,235 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 3.522727272727273) internal successors, (155), 44 states have internal predecessors, (155), 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 106 [2025-02-08 06:13:48,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:13:48,236 INFO L225 Difference]: With dead ends: 365 [2025-02-08 06:13:48,236 INFO L226 Difference]: Without dead ends: 220 [2025-02-08 06:13:48,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 693 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=311, Invalid=5389, Unknown=0, NotChecked=0, Total=5700 [2025-02-08 06:13:48,237 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 220 mSDsluCounter, 1845 mSDsCounter, 0 mSdLazyCounter, 2369 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 1901 SdHoareTripleChecker+Invalid, 2377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 2369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-08 06:13:48,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 1901 Invalid, 2377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 2369 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-08 06:13:48,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-02-08 06:13:48,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 216. [2025-02-08 06:13:48,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 1.069767441860465) internal successors, (230), 215 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:48,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 230 transitions. [2025-02-08 06:13:48,240 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 230 transitions. Word has length 106 [2025-02-08 06:13:48,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:13:48,240 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 230 transitions. [2025-02-08 06:13:48,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 3.522727272727273) internal successors, (155), 44 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:48,240 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 230 transitions. [2025-02-08 06:13:48,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-08 06:13:48,241 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:13:48,241 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:13:48,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2025-02-08 06:13:48,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2025-02-08 06:13:48,445 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:13:48,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:13:48,445 INFO L85 PathProgramCache]: Analyzing trace with hash -496683930, now seen corresponding path program 16 times [2025-02-08 06:13:48,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:13:48,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392879864] [2025-02-08 06:13:48,445 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 06:13:48,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:13:48,456 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 109 statements into 2 equivalence classes. [2025-02-08 06:13:48,466 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 88 of 109 statements. [2025-02-08 06:13:48,466 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 06:13:48,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat