./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/openbsd_cstpncpy-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc 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/openbsd_cstpncpy-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 36c3a12d89778d96e6058a4f11ff4e1483403bd2fab9b14de640491057c7f753 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 10:06:28,671 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 10:06:28,722 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 10:06:28,726 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 10:06:28,726 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 10:06:28,748 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 10:06:28,749 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 10:06:28,749 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 10:06:28,750 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 10:06:28,750 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 10:06:28,750 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 10:06:28,751 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 10:06:28,751 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 10:06:28,751 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 10:06:28,751 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 10:06:28,751 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 10:06:28,752 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 10:06:28,752 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 10:06:28,752 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 10:06:28,752 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 10:06:28,752 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 10:06:28,752 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 10:06:28,752 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 10:06:28,752 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 10:06:28,752 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 10:06:28,752 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 10:06:28,752 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 10:06:28,752 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 10:06:28,752 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 10:06:28,753 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 10:06:28,753 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 10:06:28,753 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 10:06:28,753 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 10:06:28,753 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:06:28,753 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 10:06:28,753 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 10:06:28,754 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 10:06:28,754 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 10:06:28,754 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 10:06:28,754 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 10:06:28,754 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 10:06:28,754 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 10:06:28,754 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 -> 36c3a12d89778d96e6058a4f11ff4e1483403bd2fab9b14de640491057c7f753 [2025-02-06 10:06:28,974 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 10:06:28,982 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 10:06:28,984 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 10:06:28,985 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 10:06:28,986 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 10:06:28,987 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/openbsd_cstpncpy-alloca-1.i [2025-02-06 10:06:30,127 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/72a5073d4/c8e5c664433f443bb9e13656e1cd068b/FLAGd61959448 [2025-02-06 10:06:30,349 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 10:06:30,349 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cstpncpy-alloca-1.i [2025-02-06 10:06:30,359 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/72a5073d4/c8e5c664433f443bb9e13656e1cd068b/FLAGd61959448 [2025-02-06 10:06:30,370 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/72a5073d4/c8e5c664433f443bb9e13656e1cd068b [2025-02-06 10:06:30,372 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 10:06:30,374 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 10:06:30,375 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 10:06:30,376 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 10:06:30,379 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 10:06:30,379 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:06:30" (1/1) ... [2025-02-06 10:06:30,381 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44c8ff0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:06:30, skipping insertion in model container [2025-02-06 10:06:30,381 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:06:30" (1/1) ... [2025-02-06 10:06:30,404 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 10:06:30,581 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-06 10:06:30,582 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-06 10:06:30,584 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:06:30,591 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 10:06:30,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:06:30,643 INFO L204 MainTranslator]: Completed translation [2025-02-06 10:06:30,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:06:30 WrapperNode [2025-02-06 10:06:30,644 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 10:06:30,645 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 10:06:30,646 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 10:06:30,646 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 10:06:30,650 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:06:30" (1/1) ... [2025-02-06 10:06:30,660 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:06:30" (1/1) ... [2025-02-06 10:06:30,677 INFO L138 Inliner]: procedures = 117, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 85 [2025-02-06 10:06:30,679 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 10:06:30,680 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 10:06:30,680 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 10:06:30,680 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 10:06:30,685 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:06:30" (1/1) ... [2025-02-06 10:06:30,686 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:06:30" (1/1) ... [2025-02-06 10:06:30,688 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:06:30" (1/1) ... [2025-02-06 10:06:30,705 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 4 writes are split as follows [2, 2]. [2025-02-06 10:06:30,705 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:06:30" (1/1) ... [2025-02-06 10:06:30,706 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:06:30" (1/1) ... [2025-02-06 10:06:30,709 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:06:30" (1/1) ... [2025-02-06 10:06:30,714 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:06:30" (1/1) ... [2025-02-06 10:06:30,715 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:06:30" (1/1) ... [2025-02-06 10:06:30,717 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:06:30" (1/1) ... [2025-02-06 10:06:30,718 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 10:06:30,718 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 10:06:30,721 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 10:06:30,721 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 10:06:30,721 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:06:30" (1/1) ... [2025-02-06 10:06:30,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:06:30,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:06:30,750 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-06 10:06:30,753 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-06 10:06:30,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 10:06:30,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 10:06:30,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 10:06:30,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 10:06:30,773 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 10:06:30,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 10:06:30,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 10:06:30,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 10:06:30,856 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 10:06:30,857 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 10:06:31,032 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L540: call ULTIMATE.dealloc(main_#t~malloc10#1.base, main_#t~malloc10#1.offset);havoc main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call ULTIMATE.dealloc(main_#t~malloc11#1.base, main_#t~malloc11#1.offset);havoc main_#t~malloc11#1.base, main_#t~malloc11#1.offset; [2025-02-06 10:06:31,047 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2025-02-06 10:06:31,047 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 10:06:31,056 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 10:06:31,056 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 10:06:31,057 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:06:31 BoogieIcfgContainer [2025-02-06 10:06:31,057 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 10:06:31,058 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 10:06:31,059 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 10:06:31,062 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 10:06:31,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 10:06:30" (1/3) ... [2025-02-06 10:06:31,063 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@518526f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:06:31, skipping insertion in model container [2025-02-06 10:06:31,064 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:06:30" (2/3) ... [2025-02-06 10:06:31,065 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@518526f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:06:31, skipping insertion in model container [2025-02-06 10:06:31,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:06:31" (3/3) ... [2025-02-06 10:06:31,066 INFO L128 eAbstractionObserver]: Analyzing ICFG openbsd_cstpncpy-alloca-1.i [2025-02-06 10:06:31,077 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 10:06:31,079 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG openbsd_cstpncpy-alloca-1.i that has 1 procedures, 36 locations, 1 initial locations, 3 loop locations, and 11 error locations. [2025-02-06 10:06:31,113 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 10:06:31,122 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;@77d05c39, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 10:06:31,122 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-02-06 10:06:31,126 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 35 states have internal predecessors, (44), 0 states have call successors, (0), 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-06 10:06:31,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 10:06:31,130 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:31,131 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:31,131 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-02-06 10:06:31,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:31,136 INFO L85 PathProgramCache]: Analyzing trace with hash -596115029, now seen corresponding path program 1 times [2025-02-06 10:06:31,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:31,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385709899] [2025-02-06 10:06:31,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:06:31,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:31,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 10:06:31,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 10:06:31,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:06:31,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:31,320 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-06 10:06:31,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:31,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385709899] [2025-02-06 10:06:31,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385709899] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:06:31,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:06:31,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:06:31,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371128345] [2025-02-06 10:06:31,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:06:31,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:06:31,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:06:31,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:06:31,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:06:31,341 INFO L87 Difference]: Start difference. First operand has 36 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 35 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-06 10:06:31,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:06:31,387 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2025-02-06 10:06:31,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:06:31,392 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-06 10:06:31,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:06:31,396 INFO L225 Difference]: With dead ends: 34 [2025-02-06 10:06:31,396 INFO L226 Difference]: Without dead ends: 32 [2025-02-06 10:06:31,397 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-06 10:06:31,399 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 4 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:06:31,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 55 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:06:31,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-02-06 10:06:31,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-02-06 10:06:31,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 31 states have internal predecessors, (38), 0 states have call successors, (0), 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-06 10:06:31,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2025-02-06 10:06:31,420 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 7 [2025-02-06 10:06:31,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:06:31,420 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2025-02-06 10:06:31,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-06 10:06:31,420 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2025-02-06 10:06:31,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 10:06:31,421 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:31,421 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:31,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 10:06:31,421 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-02-06 10:06:31,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:31,422 INFO L85 PathProgramCache]: Analyzing trace with hash -596115028, now seen corresponding path program 1 times [2025-02-06 10:06:31,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:31,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681129284] [2025-02-06 10:06:31,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:06:31,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:31,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 10:06:31,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 10:06:31,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:06:31,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:31,640 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-06 10:06:31,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:31,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681129284] [2025-02-06 10:06:31,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681129284] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:06:31,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:06:31,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:06:31,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768323052] [2025-02-06 10:06:31,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:06:31,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:06:31,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:06:31,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:06:31,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:06:31,642 INFO L87 Difference]: Start difference. First operand 32 states and 38 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-06 10:06:31,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:06:31,693 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2025-02-06 10:06:31,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:06:31,693 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-06 10:06:31,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:06:31,694 INFO L225 Difference]: With dead ends: 39 [2025-02-06 10:06:31,695 INFO L226 Difference]: Without dead ends: 39 [2025-02-06 10:06:31,696 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-06 10:06:31,696 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 5 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:06:31,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 83 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:06:31,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-02-06 10:06:31,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2025-02-06 10:06:31,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 37 states have internal predecessors, (47), 0 states have call successors, (0), 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-06 10:06:31,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2025-02-06 10:06:31,701 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 7 [2025-02-06 10:06:31,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:06:31,701 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2025-02-06 10:06:31,701 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-06 10:06:31,701 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2025-02-06 10:06:31,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 10:06:31,702 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:31,702 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:31,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 10:06:31,702 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-02-06 10:06:31,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:31,705 INFO L85 PathProgramCache]: Analyzing trace with hash -596114868, now seen corresponding path program 1 times [2025-02-06 10:06:31,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:31,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272128788] [2025-02-06 10:06:31,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:06:31,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:31,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 10:06:31,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 10:06:31,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:06:31,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:31,750 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-06 10:06:31,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:31,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272128788] [2025-02-06 10:06:31,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272128788] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:06:31,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:06:31,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:06:31,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653638413] [2025-02-06 10:06:31,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:06:31,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:06:31,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:06:31,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:06:31,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:06:31,754 INFO L87 Difference]: Start difference. First operand 38 states and 47 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-06 10:06:31,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:06:31,780 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2025-02-06 10:06:31,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:06:31,780 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-06 10:06:31,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:06:31,781 INFO L225 Difference]: With dead ends: 36 [2025-02-06 10:06:31,781 INFO L226 Difference]: Without dead ends: 36 [2025-02-06 10:06:31,781 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-06 10:06:31,781 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 2 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:06:31,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 92 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:06:31,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-02-06 10:06:31,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-02-06 10:06:31,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 35 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:31,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2025-02-06 10:06:31,784 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 7 [2025-02-06 10:06:31,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:06:31,784 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2025-02-06 10:06:31,784 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-06 10:06:31,784 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2025-02-06 10:06:31,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 10:06:31,785 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:31,785 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:31,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 10:06:31,785 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-02-06 10:06:31,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:31,785 INFO L85 PathProgramCache]: Analyzing trace with hash -595191507, now seen corresponding path program 1 times [2025-02-06 10:06:31,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:31,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803992736] [2025-02-06 10:06:31,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:06:31,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:31,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 10:06:31,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 10:06:31,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:06:31,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:31,907 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-06 10:06:31,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:31,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803992736] [2025-02-06 10:06:31,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803992736] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:06:31,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:06:31,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:06:31,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395515991] [2025-02-06 10:06:31,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:06:31,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:06:31,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:06:31,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:06:31,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:06:31,908 INFO L87 Difference]: Start difference. First operand 36 states and 43 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-06 10:06:31,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:06:31,926 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2025-02-06 10:06:31,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:06:31,928 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-06 10:06:31,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:06:31,928 INFO L225 Difference]: With dead ends: 35 [2025-02-06 10:06:31,928 INFO L226 Difference]: Without dead ends: 35 [2025-02-06 10:06:31,928 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-06 10:06:31,929 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 8 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:06:31,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 81 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:06:31,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-02-06 10:06:31,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2025-02-06 10:06:31,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 33 states have internal predecessors, (41), 0 states have call successors, (0), 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-06 10:06:31,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2025-02-06 10:06:31,931 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 7 [2025-02-06 10:06:31,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:06:31,931 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2025-02-06 10:06:31,931 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-06 10:06:31,932 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2025-02-06 10:06:31,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 10:06:31,932 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:31,932 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:31,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 10:06:31,932 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-02-06 10:06:31,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:31,932 INFO L85 PathProgramCache]: Analyzing trace with hash -595191347, now seen corresponding path program 1 times [2025-02-06 10:06:31,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:31,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843672293] [2025-02-06 10:06:31,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:06:31,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:31,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 10:06:31,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 10:06:31,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:06:31,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:32,039 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-06 10:06:32,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:32,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843672293] [2025-02-06 10:06:32,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843672293] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:06:32,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:06:32,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:06:32,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695632756] [2025-02-06 10:06:32,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:06:32,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:06:32,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:06:32,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:06:32,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:06:32,041 INFO L87 Difference]: Start difference. First operand 34 states and 41 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-06 10:06:32,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:06:32,081 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2025-02-06 10:06:32,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:06:32,082 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-06 10:06:32,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:06:32,082 INFO L225 Difference]: With dead ends: 37 [2025-02-06 10:06:32,082 INFO L226 Difference]: Without dead ends: 37 [2025-02-06 10:06:32,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-06 10:06:32,083 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 13 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:06:32,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 76 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:06:32,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-02-06 10:06:32,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2025-02-06 10:06:32,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 35 states have internal predecessors, (44), 0 states have call successors, (0), 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-06 10:06:32,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2025-02-06 10:06:32,085 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 7 [2025-02-06 10:06:32,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:06:32,085 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2025-02-06 10:06:32,085 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-06 10:06:32,085 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2025-02-06 10:06:32,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-06 10:06:32,086 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:32,086 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:32,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 10:06:32,086 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-02-06 10:06:32,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:32,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1720442310, now seen corresponding path program 1 times [2025-02-06 10:06:32,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:32,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775820681] [2025-02-06 10:06:32,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:06:32,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:32,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 10:06:32,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 10:06:32,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:06:32,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:32,289 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-06 10:06:32,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:32,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775820681] [2025-02-06 10:06:32,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775820681] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:06:32,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858573176] [2025-02-06 10:06:32,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:06:32,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:06:32,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:06:32,294 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-06 10:06:32,296 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-06 10:06:32,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 10:06:32,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 10:06:32,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:06:32,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:32,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 10:06:32,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:06:32,397 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-06 10:06:32,405 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 8 treesize of output 1 [2025-02-06 10:06:32,524 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-06 10:06:32,524 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:06:32,650 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-06 10:06:32,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1858573176] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:06:32,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:06:32,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-02-06 10:06:32,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328529217] [2025-02-06 10:06:32,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:06:32,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 10:06:32,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:06:32,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 10:06:32,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-02-06 10:06:32,652 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:32,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:06:32,798 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2025-02-06 10:06:32,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:06:32,798 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-02-06 10:06:32,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:06:32,800 INFO L225 Difference]: With dead ends: 37 [2025-02-06 10:06:32,800 INFO L226 Difference]: Without dead ends: 37 [2025-02-06 10:06:32,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2025-02-06 10:06:32,800 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 7 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:06:32,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 178 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:06:32,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-02-06 10:06:32,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2025-02-06 10:06:32,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 32 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:32,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2025-02-06 10:06:32,804 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 10 [2025-02-06 10:06:32,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:06:32,804 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2025-02-06 10:06:32,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:32,804 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2025-02-06 10:06:32,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-06 10:06:32,804 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:32,804 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:32,814 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-06 10:06:33,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:06:33,005 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-02-06 10:06:33,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:33,005 INFO L85 PathProgramCache]: Analyzing trace with hash -134572826, now seen corresponding path program 1 times [2025-02-06 10:06:33,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:33,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25121519] [2025-02-06 10:06:33,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:06:33,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:33,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 10:06:33,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 10:06:33,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:06:33,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:33,090 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-06 10:06:33,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:33,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25121519] [2025-02-06 10:06:33,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25121519] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:06:33,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:06:33,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:06:33,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604793242] [2025-02-06 10:06:33,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:06:33,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:06:33,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:06:33,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:06:33,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:06:33,092 INFO L87 Difference]: Start difference. First operand 33 states and 40 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-06 10:06:33,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:06:33,137 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2025-02-06 10:06:33,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:06:33,138 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-06 10:06:33,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:06:33,138 INFO L225 Difference]: With dead ends: 34 [2025-02-06 10:06:33,138 INFO L226 Difference]: Without dead ends: 34 [2025-02-06 10:06:33,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:06:33,139 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 21 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:06:33,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 83 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:06:33,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-02-06 10:06:33,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2025-02-06 10:06:33,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.5) internal successors, (39), 31 states have internal predecessors, (39), 0 states have call successors, (0), 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-06 10:06:33,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2025-02-06 10:06:33,142 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 11 [2025-02-06 10:06:33,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:06:33,142 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2025-02-06 10:06:33,143 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-06 10:06:33,143 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2025-02-06 10:06:33,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-06 10:06:33,143 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:33,143 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:33,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 10:06:33,143 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-02-06 10:06:33,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:33,143 INFO L85 PathProgramCache]: Analyzing trace with hash -134572825, now seen corresponding path program 1 times [2025-02-06 10:06:33,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:33,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640036912] [2025-02-06 10:06:33,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:06:33,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:33,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 10:06:33,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 10:06:33,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:06:33,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:33,298 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-06 10:06:33,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:33,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640036912] [2025-02-06 10:06:33,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640036912] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:06:33,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:06:33,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 10:06:33,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261298804] [2025-02-06 10:06:33,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:06:33,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 10:06:33,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:06:33,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 10:06:33,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:06:33,302 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 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-06 10:06:33,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:06:33,374 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2025-02-06 10:06:33,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 10:06:33,374 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 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-06 10:06:33,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:06:33,375 INFO L225 Difference]: With dead ends: 39 [2025-02-06 10:06:33,375 INFO L226 Difference]: Without dead ends: 39 [2025-02-06 10:06:33,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-06 10:06:33,375 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 12 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:06:33,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 123 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:06:33,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-02-06 10:06:33,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 34. [2025-02-06 10:06:33,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 33 states have internal predecessors, (41), 0 states have call successors, (0), 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-06 10:06:33,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2025-02-06 10:06:33,377 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 11 [2025-02-06 10:06:33,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:06:33,382 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2025-02-06 10:06:33,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 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-06 10:06:33,382 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2025-02-06 10:06:33,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 10:06:33,382 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:33,386 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:33,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 10:06:33,386 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-02-06 10:06:33,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:33,386 INFO L85 PathProgramCache]: Analyzing trace with hash 123216666, now seen corresponding path program 1 times [2025-02-06 10:06:33,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:33,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739127575] [2025-02-06 10:06:33,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:06:33,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:33,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 10:06:33,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 10:06:33,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:06:33,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:33,458 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-06 10:06:33,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:33,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739127575] [2025-02-06 10:06:33,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739127575] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:06:33,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:06:33,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:06:33,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907376874] [2025-02-06 10:06:33,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:06:33,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:06:33,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:06:33,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:06:33,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:06:33,459 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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-06 10:06:33,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:06:33,479 INFO L93 Difference]: Finished difference Result 50 states and 59 transitions. [2025-02-06 10:06:33,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:06:33,480 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2025-02-06 10:06:33,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:06:33,481 INFO L225 Difference]: With dead ends: 50 [2025-02-06 10:06:33,481 INFO L226 Difference]: Without dead ends: 50 [2025-02-06 10:06:33,481 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:06:33,481 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 10 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:06:33,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 85 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:06:33,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-02-06 10:06:33,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2025-02-06 10:06:33,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 42 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:33,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2025-02-06 10:06:33,484 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 12 [2025-02-06 10:06:33,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:06:33,484 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2025-02-06 10:06:33,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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-06 10:06:33,484 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2025-02-06 10:06:33,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 10:06:33,485 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:33,485 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:33,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 10:06:33,485 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-02-06 10:06:33,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:33,485 INFO L85 PathProgramCache]: Analyzing trace with hash 123209683, now seen corresponding path program 1 times [2025-02-06 10:06:33,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:33,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961070561] [2025-02-06 10:06:33,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:06:33,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:33,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 10:06:33,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 10:06:33,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:06:33,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:33,583 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-06 10:06:33,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:33,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961070561] [2025-02-06 10:06:33,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961070561] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:06:33,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:06:33,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 10:06:33,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199486737] [2025-02-06 10:06:33,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:06:33,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:06:33,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:06:33,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:06:33,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:06:33,584 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 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-06 10:06:33,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:06:33,636 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2025-02-06 10:06:33,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:06:33,637 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2025-02-06 10:06:33,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:06:33,637 INFO L225 Difference]: With dead ends: 42 [2025-02-06 10:06:33,637 INFO L226 Difference]: Without dead ends: 42 [2025-02-06 10:06:33,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-06 10:06:33,638 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 37 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:06:33,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 63 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:06:33,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-02-06 10:06:33,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-02-06 10:06:33,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 41 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:33,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2025-02-06 10:06:33,640 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 12 [2025-02-06 10:06:33,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:06:33,640 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2025-02-06 10:06:33,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 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-06 10:06:33,640 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2025-02-06 10:06:33,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 10:06:33,640 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:33,640 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:33,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 10:06:33,641 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-02-06 10:06:33,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:33,641 INFO L85 PathProgramCache]: Analyzing trace with hash 123209684, now seen corresponding path program 1 times [2025-02-06 10:06:33,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:33,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575926351] [2025-02-06 10:06:33,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:06:33,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:33,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 10:06:33,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 10:06:33,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:06:33,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:33,815 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-06 10:06:33,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:33,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575926351] [2025-02-06 10:06:33,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575926351] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:06:33,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:06:33,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 10:06:33,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349539101] [2025-02-06 10:06:33,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:06:33,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:06:33,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:06:33,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:06:33,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:06:33,816 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 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-06 10:06:33,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:06:33,879 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2025-02-06 10:06:33,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:06:33,880 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2025-02-06 10:06:33,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:06:33,884 INFO L225 Difference]: With dead ends: 45 [2025-02-06 10:06:33,884 INFO L226 Difference]: Without dead ends: 45 [2025-02-06 10:06:33,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:06:33,884 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 9 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:06:33,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 126 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:06:33,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-02-06 10:06:33,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-02-06 10:06:33,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.325) internal successors, (53), 44 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-06 10:06:33,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2025-02-06 10:06:33,886 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 12 [2025-02-06 10:06:33,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:06:33,887 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2025-02-06 10:06:33,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 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-06 10:06:33,887 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2025-02-06 10:06:33,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 10:06:33,887 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:33,887 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:33,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 10:06:33,887 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-02-06 10:06:33,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:33,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1684237797, now seen corresponding path program 1 times [2025-02-06 10:06:33,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:33,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604512294] [2025-02-06 10:06:33,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:06:33,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:33,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 10:06:33,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 10:06:33,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:06:33,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:33,941 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-06 10:06:33,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:33,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604512294] [2025-02-06 10:06:33,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604512294] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:06:33,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:06:33,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:06:33,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103137578] [2025-02-06 10:06:33,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:06:33,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:06:33,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:06:33,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:06:33,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:06:33,943 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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-06 10:06:33,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:06:33,959 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2025-02-06 10:06:33,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:06:33,960 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2025-02-06 10:06:33,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:06:33,960 INFO L225 Difference]: With dead ends: 49 [2025-02-06 10:06:33,960 INFO L226 Difference]: Without dead ends: 49 [2025-02-06 10:06:33,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:06:33,961 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 10 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:06:33,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 89 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:06:33,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-02-06 10:06:33,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2025-02-06 10:06:33,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.3) internal successors, (52), 44 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-06 10:06:33,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2025-02-06 10:06:33,963 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 12 [2025-02-06 10:06:33,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:06:33,963 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2025-02-06 10:06:33,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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-06 10:06:33,964 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2025-02-06 10:06:33,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 10:06:33,964 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:33,964 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:33,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 10:06:33,964 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-02-06 10:06:33,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:33,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1684244779, now seen corresponding path program 1 times [2025-02-06 10:06:33,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:33,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641818482] [2025-02-06 10:06:33,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:06:33,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:33,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 10:06:33,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 10:06:33,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:06:33,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:34,150 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-06 10:06:34,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:34,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641818482] [2025-02-06 10:06:34,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641818482] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:06:34,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:06:34,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 10:06:34,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091377565] [2025-02-06 10:06:34,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:06:34,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 10:06:34,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:06:34,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 10:06:34,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:06:34,152 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 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-06 10:06:34,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:06:34,196 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2025-02-06 10:06:34,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:06:34,197 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2025-02-06 10:06:34,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:06:34,197 INFO L225 Difference]: With dead ends: 46 [2025-02-06 10:06:34,197 INFO L226 Difference]: Without dead ends: 46 [2025-02-06 10:06:34,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:06:34,197 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 7 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 106 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.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:06:34,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 106 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:06:34,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-02-06 10:06:34,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 34. [2025-02-06 10:06:34,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 33 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:34,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2025-02-06 10:06:34,199 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 12 [2025-02-06 10:06:34,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:06:34,199 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2025-02-06 10:06:34,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 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-06 10:06:34,200 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2025-02-06 10:06:34,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-06 10:06:34,200 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:34,200 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:34,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 10:06:34,200 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-02-06 10:06:34,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:34,200 INFO L85 PathProgramCache]: Analyzing trace with hash 160771051, now seen corresponding path program 1 times [2025-02-06 10:06:34,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:34,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118987116] [2025-02-06 10:06:34,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:06:34,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:34,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 10:06:34,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 10:06:34,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:06:34,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:34,260 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-06 10:06:34,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:34,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118987116] [2025-02-06 10:06:34,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118987116] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:06:34,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:06:34,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:06:34,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250208590] [2025-02-06 10:06:34,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:06:34,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:06:34,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:06:34,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:06:34,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:06:34,262 INFO L87 Difference]: Start difference. First operand 34 states and 40 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-06 10:06:34,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:06:34,307 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2025-02-06 10:06:34,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:06:34,308 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-06 10:06:34,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:06:34,308 INFO L225 Difference]: With dead ends: 33 [2025-02-06 10:06:34,308 INFO L226 Difference]: Without dead ends: 33 [2025-02-06 10:06:34,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:06:34,310 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 10 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:06:34,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 69 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:06:34,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-02-06 10:06:34,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-02-06 10:06:34,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 32 states have internal predecessors, (39), 0 states have call successors, (0), 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-06 10:06:34,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2025-02-06 10:06:34,312 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 16 [2025-02-06 10:06:34,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:06:34,315 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2025-02-06 10:06:34,315 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-06 10:06:34,315 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2025-02-06 10:06:34,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-06 10:06:34,316 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:34,316 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:34,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 10:06:34,316 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-02-06 10:06:34,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:34,316 INFO L85 PathProgramCache]: Analyzing trace with hash 160771052, now seen corresponding path program 1 times [2025-02-06 10:06:34,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:34,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595900503] [2025-02-06 10:06:34,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:06:34,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:34,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 10:06:34,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 10:06:34,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:06:34,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:34,403 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-06 10:06:34,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:34,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595900503] [2025-02-06 10:06:34,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595900503] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:06:34,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:06:34,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:06:34,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125680100] [2025-02-06 10:06:34,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:06:34,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:06:34,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:06:34,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:06:34,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:06:34,406 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 5 states, 5 states have (on average 3.2) 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-06 10:06:34,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:06:34,428 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2025-02-06 10:06:34,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:06:34,429 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) 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-06 10:06:34,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:06:34,429 INFO L225 Difference]: With dead ends: 48 [2025-02-06 10:06:34,429 INFO L226 Difference]: Without dead ends: 48 [2025-02-06 10:06:34,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:06:34,430 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 3 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 98 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-06 10:06:34,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 98 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:06:34,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-02-06 10:06:34,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-02-06 10:06:34,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 44 states have (on average 1.2727272727272727) 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-06 10:06:34,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2025-02-06 10:06:34,433 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 16 [2025-02-06 10:06:34,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:06:34,433 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2025-02-06 10:06:34,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) 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-06 10:06:34,434 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2025-02-06 10:06:34,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-06 10:06:34,434 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:34,434 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:34,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 10:06:34,434 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-02-06 10:06:34,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:34,435 INFO L85 PathProgramCache]: Analyzing trace with hash 160821411, now seen corresponding path program 1 times [2025-02-06 10:06:34,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:34,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962971995] [2025-02-06 10:06:34,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:06:34,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:34,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 10:06:34,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 10:06:34,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:06:34,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:34,534 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-06 10:06:34,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:34,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962971995] [2025-02-06 10:06:34,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962971995] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:06:34,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:06:34,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:06:34,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119893725] [2025-02-06 10:06:34,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:06:34,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:06:34,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:06:34,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:06:34,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:06:34,536 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand has 5 states, 5 states have (on average 3.2) 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-06 10:06:34,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:06:34,555 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2025-02-06 10:06:34,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:06:34,556 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) 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-06 10:06:34,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:06:34,556 INFO L225 Difference]: With dead ends: 49 [2025-02-06 10:06:34,556 INFO L226 Difference]: Without dead ends: 49 [2025-02-06 10:06:34,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:06:34,557 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 4 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 98 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-06 10:06:34,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 98 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:06:34,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-02-06 10:06:34,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-02-06 10:06:34,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 45 states have (on average 1.2666666666666666) 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-06 10:06:34,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2025-02-06 10:06:34,561 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 16 [2025-02-06 10:06:34,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:06:34,561 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2025-02-06 10:06:34,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) 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-06 10:06:34,561 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2025-02-06 10:06:34,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-06 10:06:34,561 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:34,561 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:34,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 10:06:34,561 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-02-06 10:06:34,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:34,562 INFO L85 PathProgramCache]: Analyzing trace with hash -132631955, now seen corresponding path program 1 times [2025-02-06 10:06:34,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:34,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515604995] [2025-02-06 10:06:34,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:06:34,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:34,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 10:06:34,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 10:06:34,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:06:34,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:34,810 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-06 10:06:34,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:34,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515604995] [2025-02-06 10:06:34,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515604995] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:06:34,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:06:34,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 10:06:34,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626415544] [2025-02-06 10:06:34,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:06:34,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 10:06:34,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:06:34,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 10:06:34,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 10:06:34,812 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 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-06 10:06:34,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:06:34,896 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2025-02-06 10:06:34,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 10:06:34,897 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 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-06 10:06:34,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:06:34,897 INFO L225 Difference]: With dead ends: 53 [2025-02-06 10:06:34,897 INFO L226 Difference]: Without dead ends: 53 [2025-02-06 10:06:34,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 10:06:34,898 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 3 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:06:34,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 107 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:06:34,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-02-06 10:06:34,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-02-06 10:06:34,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 52 states have internal predecessors, (63), 0 states have call successors, (0), 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-06 10:06:34,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2025-02-06 10:06:34,900 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 16 [2025-02-06 10:06:34,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:06:34,900 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2025-02-06 10:06:34,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 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-06 10:06:34,900 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2025-02-06 10:06:34,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-06 10:06:34,901 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:34,901 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:34,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 10:06:34,901 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-02-06 10:06:34,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:34,901 INFO L85 PathProgramCache]: Analyzing trace with hash -132581596, now seen corresponding path program 1 times [2025-02-06 10:06:34,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:34,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405740967] [2025-02-06 10:06:34,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:06:34,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:34,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 10:06:34,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 10:06:34,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:06:34,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:35,044 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-06 10:06:35,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:35,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405740967] [2025-02-06 10:06:35,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405740967] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:06:35,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:06:35,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 10:06:35,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864793919] [2025-02-06 10:06:35,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:06:35,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 10:06:35,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:06:35,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 10:06:35,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-06 10:06:35,045 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 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-06 10:06:35,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:06:35,087 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2025-02-06 10:06:35,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 10:06:35,087 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 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-06 10:06:35,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:06:35,087 INFO L225 Difference]: With dead ends: 67 [2025-02-06 10:06:35,087 INFO L226 Difference]: Without dead ends: 67 [2025-02-06 10:06:35,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-06 10:06:35,088 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:06:35,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 146 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:06:35,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-02-06 10:06:35,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-02-06 10:06:35,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 63 states have (on average 1.2222222222222223) internal successors, (77), 66 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-06 10:06:35,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 77 transitions. [2025-02-06 10:06:35,090 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 77 transitions. Word has length 16 [2025-02-06 10:06:35,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:06:35,090 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 77 transitions. [2025-02-06 10:06:35,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 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-06 10:06:35,090 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 77 transitions. [2025-02-06 10:06:35,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-06 10:06:35,091 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:35,091 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:35,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 10:06:35,091 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-02-06 10:06:35,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:35,091 INFO L85 PathProgramCache]: Analyzing trace with hash -638140221, now seen corresponding path program 1 times [2025-02-06 10:06:35,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:35,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715167444] [2025-02-06 10:06:35,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:06:35,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:35,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 10:06:35,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 10:06:35,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:06:35,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:35,246 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-06 10:06:35,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:35,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715167444] [2025-02-06 10:06:35,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715167444] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:06:35,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:06:35,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 10:06:35,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766804220] [2025-02-06 10:06:35,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:06:35,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 10:06:35,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:06:35,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 10:06:35,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:06:35,248 INFO L87 Difference]: Start difference. First operand 67 states and 77 transitions. Second operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 10 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-06 10:06:35,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:06:35,307 INFO L93 Difference]: Finished difference Result 87 states and 99 transitions. [2025-02-06 10:06:35,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 10:06:35,307 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 10 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-06 10:06:35,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:06:35,308 INFO L225 Difference]: With dead ends: 87 [2025-02-06 10:06:35,308 INFO L226 Difference]: Without dead ends: 87 [2025-02-06 10:06:35,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:06:35,308 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 10 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:06:35,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 130 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:06:35,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-02-06 10:06:35,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 69. [2025-02-06 10:06:35,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 65 states have (on average 1.2461538461538462) internal successors, (81), 68 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-06 10:06:35,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 81 transitions. [2025-02-06 10:06:35,310 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 81 transitions. Word has length 16 [2025-02-06 10:06:35,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:06:35,311 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 81 transitions. [2025-02-06 10:06:35,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 10 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-06 10:06:35,311 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 81 transitions. [2025-02-06 10:06:35,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-06 10:06:35,311 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:35,311 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:35,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 10:06:35,311 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-02-06 10:06:35,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:35,312 INFO L85 PathProgramCache]: Analyzing trace with hash 640778716, now seen corresponding path program 1 times [2025-02-06 10:06:35,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:35,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552763696] [2025-02-06 10:06:35,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:06:35,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:35,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 10:06:35,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 10:06:35,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:06:35,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:35,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:35,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:35,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552763696] [2025-02-06 10:06:35,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552763696] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:06:35,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:06:35,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:06:35,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101196361] [2025-02-06 10:06:35,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:06:35,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:06:35,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:06:35,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:06:35,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:06:35,390 INFO L87 Difference]: Start difference. First operand 69 states and 81 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 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-06 10:06:35,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:06:35,402 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2025-02-06 10:06:35,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:06:35,403 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2025-02-06 10:06:35,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:06:35,403 INFO L225 Difference]: With dead ends: 68 [2025-02-06 10:06:35,403 INFO L226 Difference]: Without dead ends: 40 [2025-02-06 10:06:35,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:06:35,404 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 13 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:06:35,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 46 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:06:35,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-02-06 10:06:35,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-02-06 10:06:35,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 39 states have internal predecessors, (45), 0 states have call successors, (0), 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-06 10:06:35,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2025-02-06 10:06:35,405 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 19 [2025-02-06 10:06:35,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:06:35,405 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2025-02-06 10:06:35,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 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-06 10:06:35,405 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2025-02-06 10:06:35,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-06 10:06:35,405 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:35,405 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:35,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 10:06:35,406 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-02-06 10:06:35,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:35,406 INFO L85 PathProgramCache]: Analyzing trace with hash 131299171, now seen corresponding path program 1 times [2025-02-06 10:06:35,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:35,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897994811] [2025-02-06 10:06:35,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:06:35,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:35,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 10:06:35,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 10:06:35,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:06:35,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:35,887 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:35,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:35,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897994811] [2025-02-06 10:06:35,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897994811] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:06:35,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744304433] [2025-02-06 10:06:35,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:06:35,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:06:35,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:06:35,890 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-06 10:06:35,891 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-06 10:06:35,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 10:06:35,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 10:06:35,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:06:35,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:35,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-02-06 10:06:35,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:06:35,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:06:35,982 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-06 10:06:35,987 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-06 10:06:36,332 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:36,332 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:06:36,816 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:36,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744304433] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:06:36,817 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:06:36,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 33 [2025-02-06 10:06:36,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836774344] [2025-02-06 10:06:36,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:06:36,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-02-06 10:06:36,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:06:36,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-06 10:06:36,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1025, Unknown=0, NotChecked=0, Total=1122 [2025-02-06 10:06:36,819 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 34 states, 33 states have (on average 1.5757575757575757) internal successors, (52), 34 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-06 10:06:37,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:06:37,710 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2025-02-06 10:06:37,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-02-06 10:06:37,711 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.5757575757575757) internal successors, (52), 34 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) Word has length 19 [2025-02-06 10:06:37,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:06:37,711 INFO L225 Difference]: With dead ends: 63 [2025-02-06 10:06:37,711 INFO L226 Difference]: Without dead ends: 42 [2025-02-06 10:06:37,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=245, Invalid=2205, Unknown=0, NotChecked=0, Total=2450 [2025-02-06 10:06:37,712 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 40 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:06:37,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 156 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:06:37,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-02-06 10:06:37,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2025-02-06 10:06:37,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 37 states have internal predecessors, (44), 0 states have call successors, (0), 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-06 10:06:37,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2025-02-06 10:06:37,714 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 19 [2025-02-06 10:06:37,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:06:37,714 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2025-02-06 10:06:37,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.5757575757575757) internal successors, (52), 34 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-06 10:06:37,714 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2025-02-06 10:06:37,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-06 10:06:37,714 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:37,714 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:37,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 10:06:37,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:06:37,915 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-02-06 10:06:37,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:37,916 INFO L85 PathProgramCache]: Analyzing trace with hash 178633300, now seen corresponding path program 1 times [2025-02-06 10:06:37,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:37,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264737748] [2025-02-06 10:06:37,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:06:37,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:37,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 10:06:37,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 10:06:37,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:06:37,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:38,101 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:38,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:38,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264737748] [2025-02-06 10:06:38,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264737748] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:06:38,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400343618] [2025-02-06 10:06:38,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:06:38,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:06:38,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:06:38,104 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-06 10:06:38,105 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-06 10:06:38,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 10:06:38,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 10:06:38,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:06:38,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:38,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-06 10:06:38,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:06:38,244 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:38,244 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:06:38,361 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-06 10:06:38,381 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:38,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400343618] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:06:38,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:06:38,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 22 [2025-02-06 10:06:38,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662185497] [2025-02-06 10:06:38,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:06:38,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-06 10:06:38,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:06:38,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-06 10:06:38,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2025-02-06 10:06:38,383 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 23 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 23 states have internal predecessors, (39), 0 states have call successors, (0), 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-06 10:06:38,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:06:38,507 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2025-02-06 10:06:38,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 10:06:38,508 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 23 states have internal predecessors, (39), 0 states have call successors, (0), 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 19 [2025-02-06 10:06:38,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:06:38,508 INFO L225 Difference]: With dead ends: 40 [2025-02-06 10:06:38,508 INFO L226 Difference]: Without dead ends: 40 [2025-02-06 10:06:38,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=518, Unknown=0, NotChecked=0, Total=600 [2025-02-06 10:06:38,509 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 5 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:06:38,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 131 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:06:38,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-02-06 10:06:38,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2025-02-06 10:06:38,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:38,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2025-02-06 10:06:38,510 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 19 [2025-02-06 10:06:38,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:06:38,510 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2025-02-06 10:06:38,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 23 states have internal predecessors, (39), 0 states have call successors, (0), 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-06 10:06:38,511 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2025-02-06 10:06:38,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-06 10:06:38,511 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:38,511 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:38,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 10:06:38,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:06:38,715 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-02-06 10:06:38,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:38,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1242664967, now seen corresponding path program 1 times [2025-02-06 10:06:38,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:38,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018902167] [2025-02-06 10:06:38,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:06:38,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:38,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 10:06:38,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 10:06:38,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:06:38,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:39,020 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-06 10:06:39,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:39,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018902167] [2025-02-06 10:06:39,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018902167] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:06:39,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989810232] [2025-02-06 10:06:39,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:06:39,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:06:39,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:06:39,023 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-06 10:06:39,024 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-06 10:06:39,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 10:06:39,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 10:06:39,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:06:39,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:39,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-02-06 10:06:39,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:06:39,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:06:39,099 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-06 10:06:39,102 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-06 10:06:39,344 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-06 10:06:39,344 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:06:39,648 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-06 10:06:39,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989810232] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:06:39,648 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:06:39,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 27 [2025-02-06 10:06:39,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906822617] [2025-02-06 10:06:39,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:06:39,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-06 10:06:39,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:06:39,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-06 10:06:39,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=666, Unknown=0, NotChecked=0, Total=756 [2025-02-06 10:06:39,649 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 28 states, 27 states have (on average 2.037037037037037) internal successors, (55), 28 states have internal predecessors, (55), 0 states have call successors, (0), 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-06 10:06:39,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:06:39,909 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2025-02-06 10:06:39,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 10:06:39,909 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.037037037037037) internal successors, (55), 28 states have internal predecessors, (55), 0 states have call successors, (0), 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 20 [2025-02-06 10:06:39,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:06:39,909 INFO L225 Difference]: With dead ends: 38 [2025-02-06 10:06:39,910 INFO L226 Difference]: Without dead ends: 38 [2025-02-06 10:06:39,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=125, Invalid=931, Unknown=0, NotChecked=0, Total=1056 [2025-02-06 10:06:39,911 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 1 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:06:39,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 112 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:06:39,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-02-06 10:06:39,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-02-06 10:06:39,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 35 states have (on average 1.2) internal successors, (42), 37 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:39,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2025-02-06 10:06:39,912 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 20 [2025-02-06 10:06:39,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:06:39,912 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2025-02-06 10:06:39,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.037037037037037) internal successors, (55), 28 states have internal predecessors, (55), 0 states have call successors, (0), 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-06 10:06:39,912 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2025-02-06 10:06:39,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 10:06:39,913 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:39,913 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:39,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 10:06:40,117 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,SelfDestructingSolverStorable22 [2025-02-06 10:06:40,117 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-02-06 10:06:40,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:40,118 INFO L85 PathProgramCache]: Analyzing trace with hash -954637665, now seen corresponding path program 1 times [2025-02-06 10:06:40,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:40,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814150452] [2025-02-06 10:06:40,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:06:40,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:40,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 10:06:40,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 10:06:40,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:06:40,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:40,446 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:06:40,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:40,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814150452] [2025-02-06 10:06:40,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814150452] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:06:40,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314835144] [2025-02-06 10:06:40,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:06:40,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:06:40,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:06:40,449 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-06 10:06:40,457 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-06 10:06:40,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 10:06:40,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 10:06:40,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:06:40,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:40,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-02-06 10:06:40,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:06:40,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:06:40,537 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-06 10:06:40,540 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-06 10:06:40,787 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:06:40,787 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:06:41,139 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:06:41,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314835144] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:06:41,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:06:41,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2025-02-06 10:06:41,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031591077] [2025-02-06 10:06:41,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:06:41,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-02-06 10:06:41,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:06:41,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-02-06 10:06:41,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=823, Unknown=0, NotChecked=0, Total=930 [2025-02-06 10:06:41,140 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 31 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 31 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-06 10:06:45,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 10:06:45,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:06:45,612 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2025-02-06 10:06:45,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-06 10:06:45,613 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 31 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) Word has length 24 [2025-02-06 10:06:45,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:06:45,613 INFO L225 Difference]: With dead ends: 38 [2025-02-06 10:06:45,613 INFO L226 Difference]: Without dead ends: 28 [2025-02-06 10:06:45,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=217, Invalid=1505, Unknown=0, NotChecked=0, Total=1722 [2025-02-06 10:06:45,614 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 22 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 21 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:06:45,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 148 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 306 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-02-06 10:06:45,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-02-06 10:06:45,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2025-02-06 10:06:45,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:45,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2025-02-06 10:06:45,615 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2025-02-06 10:06:45,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:06:45,615 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2025-02-06 10:06:45,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 31 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-06 10:06:45,615 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2025-02-06 10:06:45,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 10:06:45,615 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:45,615 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:45,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 10:06:45,816 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,SelfDestructingSolverStorable23 [2025-02-06 10:06:45,816 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-02-06 10:06:45,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:45,817 INFO L85 PathProgramCache]: Analyzing trace with hash -954587306, now seen corresponding path program 2 times [2025-02-06 10:06:45,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:45,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092278100] [2025-02-06 10:06:45,817 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:06:45,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:45,823 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-02-06 10:06:45,838 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 10:06:45,838 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:06:45,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:46,101 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:46,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:46,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092278100] [2025-02-06 10:06:46,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092278100] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:06:46,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920397438] [2025-02-06 10:06:46,102 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:06:46,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:06:46,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:06:46,104 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-06 10:06:46,105 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-06 10:06:46,150 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-02-06 10:06:46,169 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 10:06:46,169 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:06:46,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:46,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-02-06 10:06:46,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:06:46,225 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-06 10:06:46,270 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:46,270 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:06:46,284 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-06 10:06:46,286 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-06 10:06:46,325 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:46,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920397438] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:06:46,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:06:46,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 23 [2025-02-06 10:06:46,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027954424] [2025-02-06 10:06:46,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:06:46,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-06 10:06:46,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:06:46,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-06 10:06:46,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2025-02-06 10:06:46,326 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 23 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 23 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:46,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:06:46,433 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2025-02-06 10:06:46,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 10:06:46,434 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 23 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-02-06 10:06:46,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:06:46,434 INFO L225 Difference]: With dead ends: 44 [2025-02-06 10:06:46,434 INFO L226 Difference]: Without dead ends: 32 [2025-02-06 10:06:46,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=507, Unknown=0, NotChecked=0, Total=600 [2025-02-06 10:06:46,435 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 12 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:06:46,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 95 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:06:46,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-02-06 10:06:46,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2025-02-06 10:06:46,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 29 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:46,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2025-02-06 10:06:46,436 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 24 [2025-02-06 10:06:46,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:06:46,436 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2025-02-06 10:06:46,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 23 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:46,436 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2025-02-06 10:06:46,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-06 10:06:46,436 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:46,436 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:46,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-06 10:06:46,636 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,SelfDestructingSolverStorable24 [2025-02-06 10:06:46,637 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-02-06 10:06:46,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:46,637 INFO L85 PathProgramCache]: Analyzing trace with hash -192741401, now seen corresponding path program 3 times [2025-02-06 10:06:46,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:46,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537463183] [2025-02-06 10:06:46,637 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:06:46,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:46,643 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 3 equivalence classes. [2025-02-06 10:06:46,649 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 10:06:46,649 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-06 10:06:46,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:46,856 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:46,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:46,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537463183] [2025-02-06 10:06:46,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537463183] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:06:46,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991206692] [2025-02-06 10:06:46,856 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:06:46,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:06:46,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:06:46,858 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-06 10:06:46,859 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-06 10:06:46,907 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 3 equivalence classes. [2025-02-06 10:06:46,928 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 10:06:46,928 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-06 10:06:46,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:46,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-02-06 10:06:46,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:06:47,055 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:47,055 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:06:47,179 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-06 10:06:47,252 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:47,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991206692] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:06:47,253 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:06:47,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 26 [2025-02-06 10:06:47,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359543129] [2025-02-06 10:06:47,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:06:47,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-06 10:06:47,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:06:47,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-06 10:06:47,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=617, Unknown=0, NotChecked=0, Total=702 [2025-02-06 10:06:47,254 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 27 states, 26 states have (on average 2.423076923076923) internal successors, (63), 27 states have internal predecessors, (63), 0 states have call successors, (0), 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-06 10:06:47,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:06:47,417 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2025-02-06 10:06:47,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 10:06:47,417 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.423076923076923) internal successors, (63), 27 states have internal predecessors, (63), 0 states have call successors, (0), 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 27 [2025-02-06 10:06:47,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:06:47,418 INFO L225 Difference]: With dead ends: 34 [2025-02-06 10:06:47,418 INFO L226 Difference]: Without dead ends: 34 [2025-02-06 10:06:47,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=763, Unknown=0, NotChecked=0, Total=870 [2025-02-06 10:06:47,418 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 4 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:06:47,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 129 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:06:47,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-02-06 10:06:47,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-02-06 10:06:47,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 32 states have (on average 1.09375) internal successors, (35), 33 states have internal predecessors, (35), 0 states have call successors, (0), 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-06 10:06:47,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2025-02-06 10:06:47,419 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 27 [2025-02-06 10:06:47,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:06:47,419 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2025-02-06 10:06:47,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.423076923076923) internal successors, (63), 27 states have internal predecessors, (63), 0 states have call successors, (0), 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-06 10:06:47,419 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2025-02-06 10:06:47,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-06 10:06:47,420 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:47,420 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:47,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-06 10:06:47,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:06:47,620 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-02-06 10:06:47,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:47,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1680016172, now seen corresponding path program 2 times [2025-02-06 10:06:47,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:47,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784835687] [2025-02-06 10:06:47,621 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:06:47,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:47,628 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-02-06 10:06:47,638 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 10:06:47,638 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:06:47,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:47,999 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 10:06:47,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:47,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784835687] [2025-02-06 10:06:47,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784835687] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:06:47,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559337054] [2025-02-06 10:06:47,999 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:06:47,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:06:47,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:06:48,001 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-06 10:06:48,002 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-06 10:06:48,050 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-02-06 10:06:48,072 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 10:06:48,072 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:06:48,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:48,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 75 conjuncts are in the unsatisfiable core [2025-02-06 10:06:48,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:06:48,098 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2025-02-06 10:06:48,098 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 1 case distinctions, treesize of input 13 treesize of output 11 [2025-02-06 10:06:48,104 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-06 10:06:48,569 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 10:06:48,569 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:06:49,014 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 10:06:49,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559337054] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:06:49,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:06:49,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 37 [2025-02-06 10:06:49,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338160458] [2025-02-06 10:06:49,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:06:49,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-02-06 10:06:49,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:06:49,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-02-06 10:06:49,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1269, Unknown=0, NotChecked=0, Total=1406 [2025-02-06 10:06:49,016 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 38 states, 37 states have (on average 1.8918918918918919) internal successors, (70), 38 states have internal predecessors, (70), 0 states have call successors, (0), 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-06 10:06:49,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:06:49,697 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2025-02-06 10:06:49,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-06 10:06:49,698 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.8918918918918919) internal successors, (70), 38 states have internal predecessors, (70), 0 states have call successors, (0), 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 28 [2025-02-06 10:06:49,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:06:49,698 INFO L225 Difference]: With dead ends: 47 [2025-02-06 10:06:49,698 INFO L226 Difference]: Without dead ends: 47 [2025-02-06 10:06:49,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=294, Invalid=2568, Unknown=0, NotChecked=0, Total=2862 [2025-02-06 10:06:49,699 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 14 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:06:49,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 120 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:06:49,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-02-06 10:06:49,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2025-02-06 10:06:49,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 44 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:49,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2025-02-06 10:06:49,700 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 28 [2025-02-06 10:06:49,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:06:49,700 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2025-02-06 10:06:49,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.8918918918918919) internal successors, (70), 38 states have internal predecessors, (70), 0 states have call successors, (0), 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-06 10:06:49,701 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2025-02-06 10:06:49,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-06 10:06:49,701 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:49,701 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:49,707 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-06 10:06:49,905 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,SelfDestructingSolverStorable26 [2025-02-06 10:06:49,905 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-02-06 10:06:49,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:49,905 INFO L85 PathProgramCache]: Analyzing trace with hash 949511587, now seen corresponding path program 4 times [2025-02-06 10:06:49,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:49,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815478313] [2025-02-06 10:06:49,906 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 10:06:49,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:49,911 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-02-06 10:06:49,934 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 10:06:49,934 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 10:06:49,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:50,250 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:50,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:50,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815478313] [2025-02-06 10:06:50,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815478313] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:06:50,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070359797] [2025-02-06 10:06:50,251 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 10:06:50,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:06:50,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:06:50,254 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-06 10:06:50,255 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-06 10:06:50,306 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-02-06 10:06:50,334 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 10:06:50,334 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 10:06:50,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:50,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 76 conjuncts are in the unsatisfiable core [2025-02-06 10:06:50,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:06:50,455 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-06 10:06:50,629 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 7 treesize of output 3 [2025-02-06 10:06:50,630 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:50,631 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:06:50,706 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-06 10:06:50,708 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-06 10:06:50,808 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:50,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070359797] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:06:50,808 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:06:50,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 34 [2025-02-06 10:06:50,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085809904] [2025-02-06 10:06:50,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:06:50,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-02-06 10:06:50,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:06:50,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-06 10:06:50,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1015, Unknown=0, NotChecked=0, Total=1122 [2025-02-06 10:06:50,809 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand has 34 states, 34 states have (on average 2.0) internal successors, (68), 34 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-06 10:06:50,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:06:50,967 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2025-02-06 10:06:50,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 10:06:50,967 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.0) internal successors, (68), 34 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 32 [2025-02-06 10:06:50,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:06:50,967 INFO L225 Difference]: With dead ends: 67 [2025-02-06 10:06:50,967 INFO L226 Difference]: Without dead ends: 50 [2025-02-06 10:06:50,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=1142, Unknown=0, NotChecked=0, Total=1260 [2025-02-06 10:06:50,968 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 6 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:06:50,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 224 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:06:50,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-02-06 10:06:50,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2025-02-06 10:06:50,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 46 states have (on average 1.108695652173913) internal successors, (51), 47 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:50,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2025-02-06 10:06:50,969 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 32 [2025-02-06 10:06:50,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:06:50,969 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2025-02-06 10:06:50,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.0) internal successors, (68), 34 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-06 10:06:50,969 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2025-02-06 10:06:50,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-06 10:06:50,970 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:50,970 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:50,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-06 10:06:51,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:06:51,170 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-02-06 10:06:51,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:51,171 INFO L85 PathProgramCache]: Analyzing trace with hash 913055028, now seen corresponding path program 5 times [2025-02-06 10:06:51,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:51,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192720883] [2025-02-06 10:06:51,171 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 10:06:51,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:51,176 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 35 statements into 4 equivalence classes. [2025-02-06 10:06:51,186 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 10:06:51,186 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-02-06 10:06:51,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:51,421 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:51,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:51,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192720883] [2025-02-06 10:06:51,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192720883] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:06:51,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835477335] [2025-02-06 10:06:51,422 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 10:06:51,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:06:51,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:06:51,424 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-06 10:06:51,425 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-06 10:06:51,476 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 35 statements into 4 equivalence classes. [2025-02-06 10:06:51,511 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 10:06:51,511 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-02-06 10:06:51,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:51,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-02-06 10:06:51,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:06:51,518 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-06 10:06:51,637 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:51,637 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:06:51,862 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:51,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835477335] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:06:51,862 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:06:51,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 29 [2025-02-06 10:06:51,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755490727] [2025-02-06 10:06:51,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:06:51,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-06 10:06:51,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:06:51,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-06 10:06:51,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=754, Unknown=0, NotChecked=0, Total=870 [2025-02-06 10:06:51,864 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand has 30 states, 29 states have (on average 2.793103448275862) internal successors, (81), 30 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-06 10:06:52,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:06:52,018 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2025-02-06 10:06:52,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 10:06:52,018 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.793103448275862) internal successors, (81), 30 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) Word has length 35 [2025-02-06 10:06:52,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:06:52,018 INFO L225 Difference]: With dead ends: 48 [2025-02-06 10:06:52,018 INFO L226 Difference]: Without dead ends: 48 [2025-02-06 10:06:52,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=973, Unknown=0, NotChecked=0, Total=1122 [2025-02-06 10:06:52,019 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 4 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:06:52,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 100 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:06:52,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-02-06 10:06:52,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-02-06 10:06:52,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 47 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:06:52,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2025-02-06 10:06:52,020 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 35 [2025-02-06 10:06:52,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:06:52,020 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2025-02-06 10:06:52,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.793103448275862) internal successors, (81), 30 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-06 10:06:52,020 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2025-02-06 10:06:52,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-06 10:06:52,021 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:52,021 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:52,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-06 10:06:52,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-02-06 10:06:52,221 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-02-06 10:06:52,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:52,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1069641610, now seen corresponding path program 6 times [2025-02-06 10:06:52,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:52,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259075429] [2025-02-06 10:06:52,222 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 10:06:52,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:52,228 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 40 statements into 5 equivalence classes. [2025-02-06 10:06:52,250 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 10:06:52,250 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-02-06 10:06:52,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:52,589 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 11 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:52,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:52,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259075429] [2025-02-06 10:06:52,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259075429] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:06:52,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541974624] [2025-02-06 10:06:52,589 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 10:06:52,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:06:52,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:06:52,591 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-06 10:06:52,592 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-06 10:06:52,647 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 40 statements into 5 equivalence classes. [2025-02-06 10:06:52,724 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 10:06:52,724 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-02-06 10:06:52,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:52,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-02-06 10:06:52,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:06:52,824 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-06 10:06:52,897 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 11 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:52,897 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:06:52,920 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-06 10:06:52,922 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-06 10:06:52,966 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 11 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:52,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541974624] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:06:52,966 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:06:52,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 28 [2025-02-06 10:06:52,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119057088] [2025-02-06 10:06:52,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:06:52,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-06 10:06:52,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:06:52,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-06 10:06:52,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=679, Unknown=0, NotChecked=0, Total=756 [2025-02-06 10:06:52,967 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand has 28 states, 28 states have (on average 2.142857142857143) internal successors, (60), 28 states have internal predecessors, (60), 0 states have call successors, (0), 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-06 10:06:53,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:06:53,181 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2025-02-06 10:06:53,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-06 10:06:53,182 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.142857142857143) internal successors, (60), 28 states have internal predecessors, (60), 0 states have call successors, (0), 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 40 [2025-02-06 10:06:53,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:06:53,182 INFO L225 Difference]: With dead ends: 75 [2025-02-06 10:06:53,182 INFO L226 Difference]: Without dead ends: 53 [2025-02-06 10:06:53,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=833, Unknown=0, NotChecked=0, Total=930 [2025-02-06 10:06:53,183 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 7 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:06:53,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 237 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:06:53,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-02-06 10:06:53,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2025-02-06 10:06:53,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 50 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-06 10:06:53,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2025-02-06 10:06:53,184 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 40 [2025-02-06 10:06:53,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:06:53,184 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2025-02-06 10:06:53,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.142857142857143) internal successors, (60), 28 states have internal predecessors, (60), 0 states have call successors, (0), 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-06 10:06:53,184 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2025-02-06 10:06:53,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-06 10:06:53,184 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:53,184 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:53,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-02-06 10:06:53,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:06:53,389 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-02-06 10:06:53,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:53,390 INFO L85 PathProgramCache]: Analyzing trace with hash 556672775, now seen corresponding path program 7 times [2025-02-06 10:06:53,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:53,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023380010] [2025-02-06 10:06:53,390 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 10:06:53,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:53,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-06 10:06:53,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 10:06:53,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:06:53,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:53,723 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 5 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:53,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:53,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023380010] [2025-02-06 10:06:53,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023380010] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:06:53,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612092989] [2025-02-06 10:06:53,723 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 10:06:53,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:06:53,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:06:53,725 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-06 10:06:53,725 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-06 10:06:53,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-06 10:06:53,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 10:06:53,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:06:53,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:53,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-02-06 10:06:53,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:06:53,952 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 12 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:53,952 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:06:54,169 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-06 10:06:54,248 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 12 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:54,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612092989] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:06:54,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:06:54,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 33 [2025-02-06 10:06:54,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131406042] [2025-02-06 10:06:54,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:06:54,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-02-06 10:06:54,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:06:54,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-06 10:06:54,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1003, Unknown=0, NotChecked=0, Total=1122 [2025-02-06 10:06:54,250 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand has 34 states, 33 states have (on average 2.6363636363636362) internal successors, (87), 34 states have internal predecessors, (87), 0 states have call successors, (0), 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-06 10:06:54,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:06:54,543 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2025-02-06 10:06:54,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-06 10:06:54,543 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.6363636363636362) internal successors, (87), 34 states have internal predecessors, (87), 0 states have call successors, (0), 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 43 [2025-02-06 10:06:54,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:06:54,544 INFO L225 Difference]: With dead ends: 51 [2025-02-06 10:06:54,544 INFO L226 Difference]: Without dead ends: 51 [2025-02-06 10:06:54,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 62 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=159, Invalid=1323, Unknown=0, NotChecked=0, Total=1482 [2025-02-06 10:06:54,544 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 4 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:06:54,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 221 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:06:54,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-02-06 10:06:54,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-02-06 10:06:54,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 50 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-06 10:06:54,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2025-02-06 10:06:54,545 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 43 [2025-02-06 10:06:54,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:06:54,545 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2025-02-06 10:06:54,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.6363636363636362) internal successors, (87), 34 states have internal predecessors, (87), 0 states have call successors, (0), 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-06 10:06:54,545 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2025-02-06 10:06:54,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-06 10:06:54,546 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:54,546 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:54,552 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-06 10:06:54,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:06:54,746 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-02-06 10:06:54,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:54,746 INFO L85 PathProgramCache]: Analyzing trace with hash 40415875, now seen corresponding path program 8 times [2025-02-06 10:06:54,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:54,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140046529] [2025-02-06 10:06:54,747 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:06:54,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:54,756 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-02-06 10:06:54,770 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 10:06:54,770 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:06:54,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:55,133 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 14 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:55,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:55,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140046529] [2025-02-06 10:06:55,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140046529] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:06:55,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852869799] [2025-02-06 10:06:55,134 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:06:55,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:06:55,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:06:55,135 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-06 10:06:55,146 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-06 10:06:55,202 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-02-06 10:06:55,233 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 10:06:55,233 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:06:55,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:55,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-02-06 10:06:55,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:06:55,355 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-06 10:06:55,432 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 14 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:55,432 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:06:55,479 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-06 10:06:55,480 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-06 10:06:55,532 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 14 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:55,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852869799] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:06:55,532 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:06:55,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 31 [2025-02-06 10:06:55,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455425565] [2025-02-06 10:06:55,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:06:55,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-02-06 10:06:55,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:06:55,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-02-06 10:06:55,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=849, Unknown=0, NotChecked=0, Total=930 [2025-02-06 10:06:55,533 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand has 31 states, 31 states have (on average 2.2903225806451615) internal successors, (71), 31 states have internal predecessors, (71), 0 states have call successors, (0), 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-06 10:06:55,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:06:55,840 INFO L93 Difference]: Finished difference Result 83 states and 84 transitions. [2025-02-06 10:06:55,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-06 10:06:55,841 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.2903225806451615) internal successors, (71), 31 states have internal predecessors, (71), 0 states have call successors, (0), 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-06 10:06:55,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:06:55,841 INFO L225 Difference]: With dead ends: 83 [2025-02-06 10:06:55,841 INFO L226 Difference]: Without dead ends: 56 [2025-02-06 10:06:55,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=1288, Unknown=0, NotChecked=0, Total=1406 [2025-02-06 10:06:55,842 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 8 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:06:55,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 385 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:06:55,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-02-06 10:06:55,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2025-02-06 10:06:55,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 53 states have internal predecessors, (55), 0 states have call successors, (0), 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-06 10:06:55,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2025-02-06 10:06:55,848 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 48 [2025-02-06 10:06:55,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:06:55,848 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2025-02-06 10:06:55,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.2903225806451615) internal successors, (71), 31 states have internal predecessors, (71), 0 states have call successors, (0), 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-06 10:06:55,848 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2025-02-06 10:06:55,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-06 10:06:55,848 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:55,848 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:55,860 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-06 10:06:56,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:06:56,049 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-02-06 10:06:56,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:56,049 INFO L85 PathProgramCache]: Analyzing trace with hash 405088276, now seen corresponding path program 9 times [2025-02-06 10:06:56,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:56,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638289637] [2025-02-06 10:06:56,049 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:06:56,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:56,058 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 51 statements into 6 equivalence classes. [2025-02-06 10:06:56,073 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 51 of 51 statements. [2025-02-06 10:06:56,073 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-02-06 10:06:56,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:56,461 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 12 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:56,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:56,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638289637] [2025-02-06 10:06:56,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638289637] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:06:56,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766711693] [2025-02-06 10:06:56,462 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:06:56,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:06:56,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:06:56,463 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-06 10:06:56,465 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-06 10:06:56,523 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 51 statements into 6 equivalence classes. [2025-02-06 10:06:56,605 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 51 of 51 statements. [2025-02-06 10:06:56,605 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-02-06 10:06:56,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:56,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-02-06 10:06:56,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:06:56,809 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 22 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:56,810 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:06:57,179 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-06 10:06:57,281 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 22 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:06:57,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [766711693] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:06:57,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:06:57,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 17] total 39 [2025-02-06 10:06:57,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658767885] [2025-02-06 10:06:57,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:06:57,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-02-06 10:06:57,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:06:57,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-02-06 10:06:57,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1380, Unknown=0, NotChecked=0, Total=1560 [2025-02-06 10:06:57,282 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand has 40 states, 39 states have (on average 2.7435897435897436) internal successors, (107), 40 states have internal predecessors, (107), 0 states have call successors, (0), 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-06 10:06:57,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:06:57,638 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2025-02-06 10:06:57,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-06 10:06:57,639 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.7435897435897436) internal successors, (107), 40 states have internal predecessors, (107), 0 states have call successors, (0), 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 51 [2025-02-06 10:06:57,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:06:57,639 INFO L225 Difference]: With dead ends: 58 [2025-02-06 10:06:57,639 INFO L226 Difference]: Without dead ends: 58 [2025-02-06 10:06:57,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 75 SyntacticMatches, 6 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 766 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=324, Invalid=2126, Unknown=0, NotChecked=0, Total=2450 [2025-02-06 10:06:57,640 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 2 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:06:57,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 135 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:06:57,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-02-06 10:06:57,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-02-06 10:06:57,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 57 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-06 10:06:57,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2025-02-06 10:06:57,641 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 51 [2025-02-06 10:06:57,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:06:57,641 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2025-02-06 10:06:57,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.7435897435897436) internal successors, (107), 40 states have internal predecessors, (107), 0 states have call successors, (0), 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-06 10:06:57,641 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2025-02-06 10:06:57,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-06 10:06:57,642 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:57,642 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:57,649 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-06 10:06:57,842 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,SelfDestructingSolverStorable32 [2025-02-06 10:06:57,842 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-02-06 10:06:57,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:57,842 INFO L85 PathProgramCache]: Analyzing trace with hash -327165369, now seen corresponding path program 3 times [2025-02-06 10:06:57,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:57,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151740458] [2025-02-06 10:06:57,843 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:06:57,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:57,850 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 52 statements into 6 equivalence classes. [2025-02-06 10:06:57,866 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 52 of 52 statements. [2025-02-06 10:06:57,866 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-02-06 10:06:57,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:58,315 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 10 proven. 31 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-02-06 10:06:58,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:58,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151740458] [2025-02-06 10:06:58,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151740458] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:06:58,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889049766] [2025-02-06 10:06:58,316 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:06:58,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:06:58,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:06:58,317 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-06 10:06:58,318 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-06 10:06:58,377 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 52 statements into 6 equivalence classes. [2025-02-06 10:06:58,436 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 52 of 52 statements. [2025-02-06 10:06:58,436 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-02-06 10:06:58,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:58,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 89 conjuncts are in the unsatisfiable core [2025-02-06 10:06:58,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:06:58,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:06:58,472 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-06 10:06:58,478 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-06 10:06:58,952 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-02-06 10:06:58,952 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:06:59,624 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:06:59,626 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-02-06 10:06:59,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889049766] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:06:59,626 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:06:59,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19, 17] total 49 [2025-02-06 10:06:59,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042984229] [2025-02-06 10:06:59,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:06:59,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-02-06 10:06:59,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:06:59,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-02-06 10:06:59,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=2203, Unknown=0, NotChecked=0, Total=2450 [2025-02-06 10:06:59,628 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand has 50 states, 49 states have (on average 2.163265306122449) internal successors, (106), 50 states have internal predecessors, (106), 0 states have call successors, (0), 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-06 10:07:00,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:00,375 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2025-02-06 10:07:00,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-02-06 10:07:00,375 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 2.163265306122449) internal successors, (106), 50 states have internal predecessors, (106), 0 states have call successors, (0), 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 52 [2025-02-06 10:07:00,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:00,376 INFO L225 Difference]: With dead ends: 58 [2025-02-06 10:07:00,376 INFO L226 Difference]: Without dead ends: 58 [2025-02-06 10:07:00,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1516 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=580, Invalid=4822, Unknown=0, NotChecked=0, Total=5402 [2025-02-06 10:07:00,377 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 14 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:00,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 109 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 708 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:07:00,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-02-06 10:07:00,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2025-02-06 10:07:00,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 56 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-06 10:07:00,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2025-02-06 10:07:00,378 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 52 [2025-02-06 10:07:00,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:00,378 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2025-02-06 10:07:00,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 2.163265306122449) internal successors, (106), 50 states have internal predecessors, (106), 0 states have call successors, (0), 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-06 10:07:00,379 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2025-02-06 10:07:00,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-06 10:07:00,379 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:00,379 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:00,386 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-06 10:07:00,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:00,580 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-02-06 10:07:00,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:00,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1730588266, now seen corresponding path program 10 times [2025-02-06 10:07:00,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:00,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835164035] [2025-02-06 10:07:00,580 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 10:07:00,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:00,589 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-02-06 10:07:00,605 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-02-06 10:07:00,608 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 10:07:00,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:01,011 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 17 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:01,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:01,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835164035] [2025-02-06 10:07:01,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835164035] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:07:01,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621739863] [2025-02-06 10:07:01,011 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 10:07:01,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:01,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:07:01,013 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-06 10:07:01,014 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-06 10:07:01,077 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-02-06 10:07:01,332 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-02-06 10:07:01,332 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 10:07:01,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:01,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 119 conjuncts are in the unsatisfiable core [2025-02-06 10:07:01,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:07:01,524 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-06 10:07:01,796 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 7 treesize of output 3 [2025-02-06 10:07:01,797 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 17 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:01,797 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:07:01,891 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-06 10:07:01,892 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-06 10:07:02,066 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 17 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:02,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621739863] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:07:02,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:07:02,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 49 [2025-02-06 10:07:02,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215008290] [2025-02-06 10:07:02,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:07:02,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-02-06 10:07:02,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:02,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-02-06 10:07:02,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=2217, Unknown=0, NotChecked=0, Total=2352 [2025-02-06 10:07:02,068 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand has 49 states, 49 states have (on average 2.5510204081632653) internal successors, (125), 49 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-06 10:07:02,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:02,536 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2025-02-06 10:07:02,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-06 10:07:02,537 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.5510204081632653) internal successors, (125), 49 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 56 [2025-02-06 10:07:02,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:02,537 INFO L225 Difference]: With dead ends: 94 [2025-02-06 10:07:02,537 INFO L226 Difference]: Without dead ends: 62 [2025-02-06 10:07:02,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=164, Invalid=2698, Unknown=0, NotChecked=0, Total=2862 [2025-02-06 10:07:02,538 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 7 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 1257 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 1262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:02,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 670 Invalid, 1262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1257 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 10:07:02,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-02-06 10:07:02,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2025-02-06 10:07:02,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.0338983050847457) internal successors, (61), 59 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-06 10:07:02,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2025-02-06 10:07:02,539 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 56 [2025-02-06 10:07:02,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:02,539 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2025-02-06 10:07:02,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.5510204081632653) internal successors, (125), 49 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-06 10:07:02,539 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2025-02-06 10:07:02,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-06 10:07:02,539 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:02,539 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:02,547 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-06 10:07:02,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:02,740 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-02-06 10:07:02,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:02,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1947444775, now seen corresponding path program 11 times [2025-02-06 10:07:02,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:02,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302171606] [2025-02-06 10:07:02,740 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 10:07:02,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:02,747 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 59 statements into 7 equivalence classes. [2025-02-06 10:07:02,763 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 59 of 59 statements. [2025-02-06 10:07:02,763 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-02-06 10:07:02,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:03,140 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 35 proven. 103 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:03,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:03,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302171606] [2025-02-06 10:07:03,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302171606] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:07:03,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245323265] [2025-02-06 10:07:03,140 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 10:07:03,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:03,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:07:03,142 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-06 10:07:03,144 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-06 10:07:03,222 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 59 statements into 7 equivalence classes. [2025-02-06 10:07:03,322 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 59 of 59 statements. [2025-02-06 10:07:03,322 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-02-06 10:07:03,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:03,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 78 conjuncts are in the unsatisfiable core [2025-02-06 10:07:03,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:07:03,331 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-06 10:07:03,562 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 35 proven. 103 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:03,562 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:07:04,041 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 35 proven. 103 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:04,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245323265] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:07:04,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:07:04,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 18] total 47 [2025-02-06 10:07:04,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035510897] [2025-02-06 10:07:04,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:07:04,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-02-06 10:07:04,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:04,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-02-06 10:07:04,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=1976, Unknown=0, NotChecked=0, Total=2256 [2025-02-06 10:07:04,043 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand has 48 states, 47 states have (on average 3.0) internal successors, (141), 48 states have internal predecessors, (141), 0 states have call successors, (0), 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-06 10:07:04,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:04,454 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2025-02-06 10:07:04,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-06 10:07:04,454 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 3.0) internal successors, (141), 48 states have internal predecessors, (141), 0 states have call successors, (0), 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-06 10:07:04,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:04,454 INFO L225 Difference]: With dead ends: 65 [2025-02-06 10:07:04,454 INFO L226 Difference]: Without dead ends: 65 [2025-02-06 10:07:04,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 777 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=350, Invalid=2620, Unknown=0, NotChecked=0, Total=2970 [2025-02-06 10:07:04,455 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 4 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 890 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:04,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 326 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 890 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:07:04,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-02-06 10:07:04,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-02-06 10:07:04,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.03125) internal successors, (66), 64 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-06 10:07:04,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2025-02-06 10:07:04,457 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 59 [2025-02-06 10:07:04,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:04,457 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2025-02-06 10:07:04,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 3.0) internal successors, (141), 48 states have internal predecessors, (141), 0 states have call successors, (0), 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-06 10:07:04,457 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2025-02-06 10:07:04,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-06 10:07:04,457 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:04,457 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:04,465 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-06 10:07:04,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:04,662 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-02-06 10:07:04,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:04,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1531599005, now seen corresponding path program 12 times [2025-02-06 10:07:04,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:04,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601770668] [2025-02-06 10:07:04,663 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 10:07:04,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:04,671 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 64 statements into 8 equivalence classes. [2025-02-06 10:07:04,693 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 64 of 64 statements. [2025-02-06 10:07:04,693 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-02-06 10:07:04,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:05,327 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 22 proven. 148 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:05,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:05,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601770668] [2025-02-06 10:07:05,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601770668] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:07:05,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131983940] [2025-02-06 10:07:05,327 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 10:07:05,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:05,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:07:05,329 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-06 10:07:05,330 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-06 10:07:05,413 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 64 statements into 8 equivalence classes. [2025-02-06 10:07:05,527 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 64 of 64 statements. [2025-02-06 10:07:05,527 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-02-06 10:07:05,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:05,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 126 conjuncts are in the unsatisfiable core [2025-02-06 10:07:05,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:07:05,772 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-06 10:07:06,103 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 20 proven. 150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:06,103 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:07:06,381 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-06 10:07:06,382 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-06 10:07:06,626 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 20 proven. 150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:06,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131983940] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:07:06,626 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:07:06,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 63 [2025-02-06 10:07:06,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566381180] [2025-02-06 10:07:06,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:07:06,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2025-02-06 10:07:06,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:06,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2025-02-06 10:07:06,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=3690, Unknown=0, NotChecked=0, Total=3906 [2025-02-06 10:07:06,628 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand has 63 states, 63 states have (on average 2.8412698412698414) internal successors, (179), 63 states have internal predecessors, (179), 0 states have call successors, (0), 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-06 10:07:08,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:08,289 INFO L93 Difference]: Finished difference Result 112 states and 113 transitions. [2025-02-06 10:07:08,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-02-06 10:07:08,289 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 2.8412698412698414) internal successors, (179), 63 states have internal predecessors, (179), 0 states have call successors, (0), 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 64 [2025-02-06 10:07:08,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:08,290 INFO L225 Difference]: With dead ends: 112 [2025-02-06 10:07:08,290 INFO L226 Difference]: Without dead ends: 75 [2025-02-06 10:07:08,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2166 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=677, Invalid=9223, Unknown=0, NotChecked=0, Total=9900 [2025-02-06 10:07:08,292 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 36 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 1780 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 1798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:08,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 609 Invalid, 1798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1780 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 10:07:08,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-02-06 10:07:08,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2025-02-06 10:07:08,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 0 states have call successors, (0), 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-06 10:07:08,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2025-02-06 10:07:08,293 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 64 [2025-02-06 10:07:08,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:08,293 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2025-02-06 10:07:08,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 2.8412698412698414) internal successors, (179), 63 states have internal predecessors, (179), 0 states have call successors, (0), 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-06 10:07:08,293 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2025-02-06 10:07:08,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-06 10:07:08,294 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:08,294 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:08,301 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-06 10:07:08,494 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,SelfDestructingSolverStorable36 [2025-02-06 10:07:08,494 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-02-06 10:07:08,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:08,495 INFO L85 PathProgramCache]: Analyzing trace with hash 207383222, now seen corresponding path program 13 times [2025-02-06 10:07:08,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:08,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674916967] [2025-02-06 10:07:08,495 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 10:07:08,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:08,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-06 10:07:08,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-06 10:07:08,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:07:08,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:09,029 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 23 proven. 203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:09,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:09,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674916967] [2025-02-06 10:07:09,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674916967] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:07:09,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898830764] [2025-02-06 10:07:09,030 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 10:07:09,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:09,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:07:09,031 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-06 10:07:09,032 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-06 10:07:09,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-06 10:07:09,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-06 10:07:09,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:07:09,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:09,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-02-06 10:07:09,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:07:09,327 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-06 10:07:09,421 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 23 proven. 203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:09,421 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:07:09,462 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-06 10:07:09,463 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-06 10:07:09,528 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 23 proven. 203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:09,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898830764] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:07:09,528 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:07:09,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 40 [2025-02-06 10:07:09,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402557618] [2025-02-06 10:07:09,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:07:09,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-02-06 10:07:09,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:09,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-02-06 10:07:09,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1455, Unknown=0, NotChecked=0, Total=1560 [2025-02-06 10:07:09,529 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand has 40 states, 40 states have (on average 2.6) internal successors, (104), 40 states have internal predecessors, (104), 0 states have call successors, (0), 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-06 10:07:10,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:10,019 INFO L93 Difference]: Finished difference Result 120 states and 121 transitions. [2025-02-06 10:07:10,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-02-06 10:07:10,019 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.6) internal successors, (104), 40 states have internal predecessors, (104), 0 states have call successors, (0), 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 72 [2025-02-06 10:07:10,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:10,020 INFO L225 Difference]: With dead ends: 120 [2025-02-06 10:07:10,020 INFO L226 Difference]: Without dead ends: 78 [2025-02-06 10:07:10,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=145, Invalid=2017, Unknown=0, NotChecked=0, Total=2162 [2025-02-06 10:07:10,020 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 13 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 1275 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 1282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:10,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 678 Invalid, 1282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1275 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 10:07:10,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-02-06 10:07:10,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2025-02-06 10:07:10,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.0266666666666666) internal successors, (77), 75 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-06 10:07:10,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2025-02-06 10:07:10,022 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 72 [2025-02-06 10:07:10,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:10,022 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2025-02-06 10:07:10,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.6) internal successors, (104), 40 states have internal predecessors, (104), 0 states have call successors, (0), 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-06 10:07:10,022 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2025-02-06 10:07:10,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-06 10:07:10,022 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:10,022 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:10,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-02-06 10:07:10,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:10,223 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-02-06 10:07:10,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:10,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1599767225, now seen corresponding path program 14 times [2025-02-06 10:07:10,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:10,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496554697] [2025-02-06 10:07:10,223 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:07:10,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:10,233 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 75 statements into 2 equivalence classes. [2025-02-06 10:07:10,251 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 75 of 75 statements. [2025-02-06 10:07:10,251 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:07:10,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:10,764 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 51 proven. 197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:10,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:10,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496554697] [2025-02-06 10:07:10,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496554697] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:07:10,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869492452] [2025-02-06 10:07:10,764 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:07:10,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:10,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:07:10,766 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-06 10:07:10,766 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-06 10:07:10,841 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 75 statements into 2 equivalence classes. [2025-02-06 10:07:10,876 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 75 of 75 statements. [2025-02-06 10:07:10,876 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:07:10,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:10,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 90 conjuncts are in the unsatisfiable core [2025-02-06 10:07:10,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:07:11,155 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 70 proven. 178 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:11,155 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:07:11,511 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-06 10:07:11,682 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 70 proven. 178 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:11,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869492452] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:07:11,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:07:11,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 49 [2025-02-06 10:07:11,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405563771] [2025-02-06 10:07:11,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:07:11,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-02-06 10:07:11,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:11,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-02-06 10:07:11,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=2199, Unknown=0, NotChecked=0, Total=2450 [2025-02-06 10:07:11,683 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand has 50 states, 49 states have (on average 3.0816326530612246) internal successors, (151), 50 states have internal predecessors, (151), 0 states have call successors, (0), 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-06 10:07:12,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:12,257 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2025-02-06 10:07:12,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-02-06 10:07:12,258 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 3.0816326530612246) internal successors, (151), 50 states have internal predecessors, (151), 0 states have call successors, (0), 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 75 [2025-02-06 10:07:12,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:12,258 INFO L225 Difference]: With dead ends: 81 [2025-02-06 10:07:12,258 INFO L226 Difference]: Without dead ends: 81 [2025-02-06 10:07:12,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 114 SyntacticMatches, 9 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1170 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=341, Invalid=3081, Unknown=0, NotChecked=0, Total=3422 [2025-02-06 10:07:12,259 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 1371 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 1371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:12,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 429 Invalid, 1371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1371 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 10:07:12,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-06 10:07:12,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-02-06 10:07:12,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.025) internal successors, (82), 80 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-06 10:07:12,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2025-02-06 10:07:12,261 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 75 [2025-02-06 10:07:12,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:12,261 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2025-02-06 10:07:12,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 3.0816326530612246) internal successors, (151), 50 states have internal predecessors, (151), 0 states have call successors, (0), 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-06 10:07:12,261 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2025-02-06 10:07:12,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-06 10:07:12,262 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:12,262 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:12,269 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-06 10:07:12,462 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,SelfDestructingSolverStorable38 [2025-02-06 10:07:12,463 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-02-06 10:07:12,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:12,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1018346429, now seen corresponding path program 15 times [2025-02-06 10:07:12,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:12,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020968315] [2025-02-06 10:07:12,463 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:07:12,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:12,471 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 80 statements into 10 equivalence classes. [2025-02-06 10:07:12,497 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 80 of 80 statements. [2025-02-06 10:07:12,497 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-02-06 10:07:12,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:13,214 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 26 proven. 264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:13,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:13,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020968315] [2025-02-06 10:07:13,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020968315] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:07:13,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414003787] [2025-02-06 10:07:13,215 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:07:13,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:13,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:07:13,216 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-06 10:07:13,217 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-06 10:07:13,296 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 80 statements into 10 equivalence classes. [2025-02-06 10:07:13,954 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 80 of 80 statements. [2025-02-06 10:07:13,954 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-02-06 10:07:13,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:13,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 106 conjuncts are in the unsatisfiable core [2025-02-06 10:07:13,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:07:14,172 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-06 10:07:14,277 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 26 proven. 264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:14,277 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:07:14,319 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-06 10:07:14,320 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-06 10:07:14,393 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 26 proven. 264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:14,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1414003787] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:07:14,393 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:07:14,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 26, 26] total 46 [2025-02-06 10:07:14,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765973228] [2025-02-06 10:07:14,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:07:14,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-02-06 10:07:14,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:14,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-02-06 10:07:14,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1949, Unknown=0, NotChecked=0, Total=2070 [2025-02-06 10:07:14,394 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand has 46 states, 46 states have (on average 2.630434782608696) internal successors, (121), 46 states have internal predecessors, (121), 0 states have call successors, (0), 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-06 10:07:15,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:15,046 INFO L93 Difference]: Finished difference Result 133 states and 134 transitions. [2025-02-06 10:07:15,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-02-06 10:07:15,046 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.630434782608696) internal successors, (121), 46 states have internal predecessors, (121), 0 states have call successors, (0), 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 80 [2025-02-06 10:07:15,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:15,047 INFO L225 Difference]: With dead ends: 133 [2025-02-06 10:07:15,047 INFO L226 Difference]: Without dead ends: 86 [2025-02-06 10:07:15,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=166, Invalid=2696, Unknown=0, NotChecked=0, Total=2862 [2025-02-06 10:07:15,047 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 12 mSDsluCounter, 888 mSDsCounter, 0 mSdLazyCounter, 1652 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 1660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:15,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 918 Invalid, 1660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1652 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 10:07:15,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-02-06 10:07:15,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2025-02-06 10:07:15,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 1.0240963855421688) internal successors, (85), 83 states have internal predecessors, (85), 0 states have call successors, (0), 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-06 10:07:15,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2025-02-06 10:07:15,049 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 80 [2025-02-06 10:07:15,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:15,049 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2025-02-06 10:07:15,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.630434782608696) internal successors, (121), 46 states have internal predecessors, (121), 0 states have call successors, (0), 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-06 10:07:15,049 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2025-02-06 10:07:15,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-06 10:07:15,049 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:15,049 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:15,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-02-06 10:07:15,250 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,SelfDestructingSolverStorable39 [2025-02-06 10:07:15,250 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-02-06 10:07:15,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:15,250 INFO L85 PathProgramCache]: Analyzing trace with hash -920177196, now seen corresponding path program 16 times [2025-02-06 10:07:15,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:15,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151729929] [2025-02-06 10:07:15,250 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 10:07:15,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:15,259 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 83 statements into 2 equivalence classes. [2025-02-06 10:07:15,270 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-02-06 10:07:15,270 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 10:07:15,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:15,830 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 92 proven. 223 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:15,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:15,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151729929] [2025-02-06 10:07:15,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151729929] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:07:15,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368593263] [2025-02-06 10:07:15,830 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 10:07:15,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:15,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:07:15,833 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-06 10:07:15,834 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-06 10:07:15,925 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 83 statements into 2 equivalence classes. [2025-02-06 10:07:16,164 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-02-06 10:07:16,164 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 10:07:16,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:16,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 102 conjuncts are in the unsatisfiable core [2025-02-06 10:07:16,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:07:16,576 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 92 proven. 223 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:16,576 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:07:16,967 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-06 10:07:17,293 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 92 proven. 223 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:17,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1368593263] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:07:17,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:07:17,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24, 24] total 62 [2025-02-06 10:07:17,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790016526] [2025-02-06 10:07:17,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:07:17,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2025-02-06 10:07:17,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:17,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2025-02-06 10:07:17,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=442, Invalid=3464, Unknown=0, NotChecked=0, Total=3906 [2025-02-06 10:07:17,295 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand has 63 states, 62 states have (on average 3.193548387096774) internal successors, (198), 63 states have internal predecessors, (198), 0 states have call successors, (0), 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-06 10:07:17,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:17,856 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2025-02-06 10:07:17,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-02-06 10:07:17,857 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 62 states have (on average 3.193548387096774) internal successors, (198), 63 states have internal predecessors, (198), 0 states have call successors, (0), 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 83 [2025-02-06 10:07:17,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:17,857 INFO L225 Difference]: With dead ends: 89 [2025-02-06 10:07:17,857 INFO L226 Difference]: Without dead ends: 89 [2025-02-06 10:07:17,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1380 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=557, Invalid=4699, Unknown=0, NotChecked=0, Total=5256 [2025-02-06 10:07:17,858 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 4 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 1427 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 1427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:17,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 464 Invalid, 1427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1427 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 10:07:17,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-02-06 10:07:17,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-02-06 10:07:17,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 88 states have (on average 1.0227272727272727) internal successors, (90), 88 states have internal predecessors, (90), 0 states have call successors, (0), 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-06 10:07:17,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2025-02-06 10:07:17,859 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 83 [2025-02-06 10:07:17,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:17,859 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2025-02-06 10:07:17,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 62 states have (on average 3.193548387096774) internal successors, (198), 63 states have internal predecessors, (198), 0 states have call successors, (0), 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-06 10:07:17,859 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2025-02-06 10:07:17,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-06 10:07:17,859 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:17,859 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:17,868 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-06 10:07:18,059 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,SelfDestructingSolverStorable40 [2025-02-06 10:07:18,060 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-02-06 10:07:18,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:18,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1346774058, now seen corresponding path program 17 times [2025-02-06 10:07:18,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:18,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384096456] [2025-02-06 10:07:18,060 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 10:07:18,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:18,069 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 88 statements into 11 equivalence classes. [2025-02-06 10:07:18,100 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 88 of 88 statements. [2025-02-06 10:07:18,102 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-02-06 10:07:18,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:18,849 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 29 proven. 333 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:18,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:18,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384096456] [2025-02-06 10:07:18,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384096456] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:07:18,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662957211] [2025-02-06 10:07:18,849 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 10:07:18,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:18,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:07:18,851 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-06 10:07:18,852 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-06 10:07:18,937 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 88 statements into 11 equivalence classes. [2025-02-06 10:07:19,179 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 88 of 88 statements. [2025-02-06 10:07:19,179 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-02-06 10:07:19,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:19,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 114 conjuncts are in the unsatisfiable core [2025-02-06 10:07:19,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:07:19,427 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-06 10:07:19,544 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 29 proven. 333 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:19,544 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:07:19,598 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-06 10:07:19,599 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-06 10:07:19,679 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 29 proven. 333 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:19,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [662957211] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:07:19,679 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:07:19,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 46 [2025-02-06 10:07:19,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687139579] [2025-02-06 10:07:19,679 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:07:19,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-02-06 10:07:19,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:19,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-02-06 10:07:19,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1951, Unknown=0, NotChecked=0, Total=2070 [2025-02-06 10:07:19,680 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand has 46 states, 46 states have (on average 2.739130434782609) internal successors, (126), 46 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-06 10:07:20,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:20,403 INFO L93 Difference]: Finished difference Result 146 states and 147 transitions. [2025-02-06 10:07:20,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-02-06 10:07:20,403 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.739130434782609) internal successors, (126), 46 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) Word has length 88 [2025-02-06 10:07:20,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:20,403 INFO L225 Difference]: With dead ends: 146 [2025-02-06 10:07:20,404 INFO L226 Difference]: Without dead ends: 94 [2025-02-06 10:07:20,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=169, Invalid=2801, Unknown=0, NotChecked=0, Total=2970 [2025-02-06 10:07:20,404 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 13 mSDsluCounter, 1087 mSDsCounter, 0 mSdLazyCounter, 1958 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 1967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:20,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1120 Invalid, 1967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1958 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 10:07:20,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-02-06 10:07:20,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2025-02-06 10:07:20,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.021978021978022) internal successors, (93), 91 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:07:20,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2025-02-06 10:07:20,407 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 88 [2025-02-06 10:07:20,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:20,407 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2025-02-06 10:07:20,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.739130434782609) internal successors, (126), 46 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-06 10:07:20,408 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2025-02-06 10:07:20,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-06 10:07:20,410 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:20,410 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:20,418 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-06 10:07:20,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,24 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:20,611 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-02-06 10:07:20,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:20,611 INFO L85 PathProgramCache]: Analyzing trace with hash 869641319, now seen corresponding path program 18 times [2025-02-06 10:07:20,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:20,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355181856] [2025-02-06 10:07:20,611 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 10:07:20,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:20,624 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 91 statements into 11 equivalence classes. [2025-02-06 10:07:20,656 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) and asserted 91 of 91 statements. [2025-02-06 10:07:20,656 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2025-02-06 10:07:20,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:21,458 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 92 proven. 298 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:21,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:21,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355181856] [2025-02-06 10:07:21,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355181856] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:07:21,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084855542] [2025-02-06 10:07:21,458 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 10:07:21,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:21,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:07:21,460 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-06 10:07:21,460 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-06 10:07:21,550 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 91 statements into 11 equivalence classes. [2025-02-06 10:07:23,226 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) and asserted 91 of 91 statements. [2025-02-06 10:07:23,227 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2025-02-06 10:07:23,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:23,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 593 conjuncts, 91 conjuncts are in the unsatisfiable core [2025-02-06 10:07:23,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:07:23,239 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-06 10:07:23,557 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 117 proven. 273 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:23,557 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:07:24,336 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 117 proven. 273 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:24,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084855542] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:07:24,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:07:24,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 27, 27] total 71 [2025-02-06 10:07:24,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355220997] [2025-02-06 10:07:24,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:07:24,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2025-02-06 10:07:24,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:24,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2025-02-06 10:07:24,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=643, Invalid=4469, Unknown=0, NotChecked=0, Total=5112 [2025-02-06 10:07:24,338 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand has 72 states, 71 states have (on average 3.112676056338028) internal successors, (221), 72 states have internal predecessors, (221), 0 states have call successors, (0), 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-06 10:07:25,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:25,106 INFO L93 Difference]: Finished difference Result 97 states and 98 transitions. [2025-02-06 10:07:25,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-02-06 10:07:25,106 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 71 states have (on average 3.112676056338028) internal successors, (221), 72 states have internal predecessors, (221), 0 states have call successors, (0), 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 91 [2025-02-06 10:07:25,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:25,107 INFO L225 Difference]: With dead ends: 97 [2025-02-06 10:07:25,107 INFO L226 Difference]: Without dead ends: 97 [2025-02-06 10:07:25,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2776 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1126, Invalid=7246, Unknown=0, NotChecked=0, Total=8372 [2025-02-06 10:07:25,108 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 2 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:25,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 131 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 841 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:07:25,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-02-06 10:07:25,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-02-06 10:07:25,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.0208333333333333) internal successors, (98), 96 states have internal predecessors, (98), 0 states have call successors, (0), 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-06 10:07:25,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2025-02-06 10:07:25,112 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 91 [2025-02-06 10:07:25,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:25,112 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2025-02-06 10:07:25,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 71 states have (on average 3.112676056338028) internal successors, (221), 72 states have internal predecessors, (221), 0 states have call successors, (0), 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-06 10:07:25,112 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2025-02-06 10:07:25,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-06 10:07:25,112 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:25,113 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:25,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-02-06 10:07:25,313 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,SelfDestructingSolverStorable42 [2025-02-06 10:07:25,313 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-02-06 10:07:25,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:25,313 INFO L85 PathProgramCache]: Analyzing trace with hash 410880291, now seen corresponding path program 19 times [2025-02-06 10:07:25,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:25,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079531595] [2025-02-06 10:07:25,314 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 10:07:25,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:25,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-06 10:07:25,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-06 10:07:25,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:07:25,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:26,133 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 32 proven. 410 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:26,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:26,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079531595] [2025-02-06 10:07:26,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079531595] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:07:26,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359482349] [2025-02-06 10:07:26,133 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 10:07:26,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:26,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:07:26,135 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:07:26,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-02-06 10:07:26,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-06 10:07:26,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-06 10:07:26,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:07:26,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:26,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 629 conjuncts, 126 conjuncts are in the unsatisfiable core [2025-02-06 10:07:26,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:07:26,561 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-06 10:07:26,679 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 32 proven. 410 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:26,679 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:07:26,727 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-06 10:07:26,729 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-06 10:07:26,808 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 32 proven. 410 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:26,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359482349] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:07:26,808 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:07:26,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 49 [2025-02-06 10:07:26,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167946143] [2025-02-06 10:07:26,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:07:26,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-02-06 10:07:26,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:26,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-02-06 10:07:26,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=2226, Unknown=0, NotChecked=0, Total=2352 [2025-02-06 10:07:26,809 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand has 49 states, 49 states have (on average 2.795918367346939) internal successors, (137), 49 states have internal predecessors, (137), 0 states have call successors, (0), 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-06 10:07:27,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:27,605 INFO L93 Difference]: Finished difference Result 159 states and 160 transitions. [2025-02-06 10:07:27,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-02-06 10:07:27,605 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.795918367346939) internal successors, (137), 49 states have internal predecessors, (137), 0 states have call successors, (0), 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-06 10:07:27,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:27,606 INFO L225 Difference]: With dead ends: 159 [2025-02-06 10:07:27,606 INFO L226 Difference]: Without dead ends: 102 [2025-02-06 10:07:27,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=181, Invalid=3241, Unknown=0, NotChecked=0, Total=3422 [2025-02-06 10:07:27,607 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 14 mSDsluCounter, 1229 mSDsCounter, 0 mSdLazyCounter, 2196 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1265 SdHoareTripleChecker+Invalid, 2206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:27,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1265 Invalid, 2206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2196 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 10:07:27,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-02-06 10:07:27,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2025-02-06 10:07:27,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 1.02020202020202) internal successors, (101), 99 states have internal predecessors, (101), 0 states have call successors, (0), 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-06 10:07:27,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2025-02-06 10:07:27,609 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 96 [2025-02-06 10:07:27,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:27,609 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2025-02-06 10:07:27,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.795918367346939) internal successors, (137), 49 states have internal predecessors, (137), 0 states have call successors, (0), 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-06 10:07:27,609 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2025-02-06 10:07:27,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-06 10:07:27,610 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:27,610 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:27,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-02-06 10:07:27,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2025-02-06 10:07:27,811 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-02-06 10:07:27,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:27,811 INFO L85 PathProgramCache]: Analyzing trace with hash -427018060, now seen corresponding path program 20 times [2025-02-06 10:07:27,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:27,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688203685] [2025-02-06 10:07:27,811 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:07:27,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:27,823 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 99 statements into 2 equivalence classes. [2025-02-06 10:07:27,834 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 99 of 99 statements. [2025-02-06 10:07:27,834 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:07:27,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:28,590 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 117 proven. 356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:28,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:28,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688203685] [2025-02-06 10:07:28,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688203685] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:07:28,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582773658] [2025-02-06 10:07:28,591 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:07:28,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:28,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:07:28,593 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:07:28,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-02-06 10:07:28,697 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 99 statements into 2 equivalence classes. [2025-02-06 10:07:28,745 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 99 of 99 statements. [2025-02-06 10:07:28,745 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:07:28,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:28,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 117 conjuncts are in the unsatisfiable core [2025-02-06 10:07:28,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:07:29,166 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 145 proven. 328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:29,166 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:07:29,653 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-06 10:07:29,850 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 145 proven. 328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:29,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582773658] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:07:29,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:07:29,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 61 [2025-02-06 10:07:29,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467085637] [2025-02-06 10:07:29,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:07:29,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2025-02-06 10:07:29,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:29,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2025-02-06 10:07:29,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=392, Invalid=3390, Unknown=0, NotChecked=0, Total=3782 [2025-02-06 10:07:29,851 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand has 62 states, 61 states have (on average 3.262295081967213) internal successors, (199), 62 states have internal predecessors, (199), 0 states have call successors, (0), 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-06 10:07:30,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:30,672 INFO L93 Difference]: Finished difference Result 105 states and 106 transitions. [2025-02-06 10:07:30,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-02-06 10:07:30,673 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 3.262295081967213) internal successors, (199), 62 states have internal predecessors, (199), 0 states have call successors, (0), 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-06 10:07:30,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:30,673 INFO L225 Difference]: With dead ends: 105 [2025-02-06 10:07:30,673 INFO L226 Difference]: Without dead ends: 105 [2025-02-06 10:07:30,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 153 SyntacticMatches, 12 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2019 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=530, Invalid=4872, Unknown=0, NotChecked=0, Total=5402 [2025-02-06 10:07:30,674 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 4 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 2070 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 2070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:30,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 701 Invalid, 2070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2070 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 10:07:30,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-02-06 10:07:30,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2025-02-06 10:07:30,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 1.0192307692307692) internal successors, (106), 104 states have internal predecessors, (106), 0 states have call successors, (0), 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-06 10:07:30,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2025-02-06 10:07:30,676 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 99 [2025-02-06 10:07:30,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:30,676 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2025-02-06 10:07:30,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 3.262295081967213) internal successors, (199), 62 states have internal predecessors, (199), 0 states have call successors, (0), 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-06 10:07:30,676 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2025-02-06 10:07:30,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-06 10:07:30,676 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:30,676 INFO L218 NwaCegarLoop]: trace histogram [13, 12, 12, 12, 12, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:30,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2025-02-06 10:07:30,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,27 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:30,881 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-02-06 10:07:30,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:30,881 INFO L85 PathProgramCache]: Analyzing trace with hash 291742966, now seen corresponding path program 21 times [2025-02-06 10:07:30,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:30,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381449858] [2025-02-06 10:07:30,881 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:07:30,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:30,891 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 104 statements into 13 equivalence classes. [2025-02-06 10:07:30,933 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) and asserted 104 of 104 statements. [2025-02-06 10:07:30,933 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2025-02-06 10:07:30,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:31,949 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 35 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:31,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:31,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381449858] [2025-02-06 10:07:31,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381449858] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:07:31,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038230408] [2025-02-06 10:07:31,950 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:07:31,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:31,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:07:31,952 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:07:31,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-02-06 10:07:32,063 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 104 statements into 13 equivalence classes. [2025-02-06 10:07:34,081 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) and asserted 104 of 104 statements. [2025-02-06 10:07:34,081 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2025-02-06 10:07:34,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:34,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 678 conjuncts, 197 conjuncts are in the unsatisfiable core [2025-02-06 10:07:34,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:07:34,573 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-06 10:07:35,219 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 35 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:35,219 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:07:35,371 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-06 10:07:35,372 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-06 10:07:35,830 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 35 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:35,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038230408] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:07:35,830 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:07:35,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 32, 32] total 81 [2025-02-06 10:07:35,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636804662] [2025-02-06 10:07:35,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:07:35,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2025-02-06 10:07:35,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:35,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2025-02-06 10:07:35,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=6241, Unknown=0, NotChecked=0, Total=6480 [2025-02-06 10:07:35,832 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand has 81 states, 81 states have (on average 3.0) internal successors, (243), 81 states have internal predecessors, (243), 0 states have call successors, (0), 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-06 10:07:37,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:37,006 INFO L93 Difference]: Finished difference Result 172 states and 173 transitions. [2025-02-06 10:07:37,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-02-06 10:07:37,006 INFO L78 Accepts]: Start accepts. Automaton has has 81 states, 81 states have (on average 3.0) internal successors, (243), 81 states have internal predecessors, (243), 0 states have call successors, (0), 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 104 [2025-02-06 10:07:37,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:37,006 INFO L225 Difference]: With dead ends: 172 [2025-02-06 10:07:37,007 INFO L226 Difference]: Without dead ends: 110 [2025-02-06 10:07:37,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1735 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=314, Invalid=8428, Unknown=0, NotChecked=0, Total=8742 [2025-02-06 10:07:37,007 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 13 mSDsluCounter, 1832 mSDsCounter, 0 mSdLazyCounter, 3389 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1871 SdHoareTripleChecker+Invalid, 3400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 3389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:37,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1871 Invalid, 3400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 3389 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 10:07:37,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-02-06 10:07:37,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2025-02-06 10:07:37,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 1.0186915887850467) internal successors, (109), 107 states have internal predecessors, (109), 0 states have call successors, (0), 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-06 10:07:37,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 109 transitions. [2025-02-06 10:07:37,009 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 109 transitions. Word has length 104 [2025-02-06 10:07:37,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:37,009 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 109 transitions. [2025-02-06 10:07:37,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 81 states have (on average 3.0) internal successors, (243), 81 states have internal predecessors, (243), 0 states have call successors, (0), 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-06 10:07:37,009 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 109 transitions. [2025-02-06 10:07:37,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-06 10:07:37,010 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:37,010 INFO L218 NwaCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:37,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2025-02-06 10:07:37,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2025-02-06 10:07:37,211 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-02-06 10:07:37,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:37,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1273613433, now seen corresponding path program 22 times [2025-02-06 10:07:37,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:37,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412168117] [2025-02-06 10:07:37,211 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 10:07:37,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:37,221 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 107 statements into 2 equivalence classes. [2025-02-06 10:07:37,237 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 107 of 107 statements. [2025-02-06 10:07:37,237 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 10:07:37,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:38,077 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 176 proven. 388 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:38,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:38,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412168117] [2025-02-06 10:07:38,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412168117] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:07:38,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167308932] [2025-02-06 10:07:38,077 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 10:07:38,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:38,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:07:38,080 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:07:38,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-02-06 10:07:38,186 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 107 statements into 2 equivalence classes. [2025-02-06 10:07:38,575 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 107 of 107 statements. [2025-02-06 10:07:38,575 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 10:07:38,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:38,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 129 conjuncts are in the unsatisfiable core [2025-02-06 10:07:38,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:07:39,198 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 176 proven. 388 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:39,198 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:07:39,797 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-06 10:07:40,278 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 176 proven. 388 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:40,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [167308932] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:07:40,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:07:40,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30, 30] total 77 [2025-02-06 10:07:40,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259906851] [2025-02-06 10:07:40,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:07:40,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2025-02-06 10:07:40,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:40,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2025-02-06 10:07:40,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=700, Invalid=5306, Unknown=0, NotChecked=0, Total=6006 [2025-02-06 10:07:40,280 INFO L87 Difference]: Start difference. First operand 108 states and 109 transitions. Second operand has 78 states, 77 states have (on average 3.311688311688312) internal successors, (255), 78 states have internal predecessors, (255), 0 states have call successors, (0), 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-06 10:07:41,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:41,152 INFO L93 Difference]: Finished difference Result 113 states and 114 transitions. [2025-02-06 10:07:41,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-02-06 10:07:41,153 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 77 states have (on average 3.311688311688312) internal successors, (255), 78 states have internal predecessors, (255), 0 states have call successors, (0), 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 107 [2025-02-06 10:07:41,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:41,153 INFO L225 Difference]: With dead ends: 113 [2025-02-06 10:07:41,153 INFO L226 Difference]: Without dead ends: 113 [2025-02-06 10:07:41,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2223 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=869, Invalid=7321, Unknown=0, NotChecked=0, Total=8190 [2025-02-06 10:07:41,154 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 4 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 2334 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 2334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:41,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 762 Invalid, 2334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2334 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 10:07:41,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-02-06 10:07:41,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-02-06 10:07:41,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 112 states have (on average 1.0178571428571428) internal successors, (114), 112 states have internal predecessors, (114), 0 states have call successors, (0), 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-06 10:07:41,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2025-02-06 10:07:41,155 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 107 [2025-02-06 10:07:41,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:41,155 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2025-02-06 10:07:41,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 77 states have (on average 3.311688311688312) internal successors, (255), 78 states have internal predecessors, (255), 0 states have call successors, (0), 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-06 10:07:41,156 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2025-02-06 10:07:41,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-06 10:07:41,156 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:41,156 INFO L218 NwaCegarLoop]: trace histogram [14, 13, 13, 13, 13, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:41,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2025-02-06 10:07:41,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2025-02-06 10:07:41,356 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-02-06 10:07:41,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:41,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1427404291, now seen corresponding path program 23 times [2025-02-06 10:07:41,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:41,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599476507] [2025-02-06 10:07:41,357 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 10:07:41,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:41,368 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 112 statements into 14 equivalence classes. [2025-02-06 10:07:41,419 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) and asserted 112 of 112 statements. [2025-02-06 10:07:41,419 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2025-02-06 10:07:41,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:42,345 INFO L134 CoverageAnalysis]: Checked inductivity of 626 backedges. 38 proven. 588 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:42,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:42,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599476507] [2025-02-06 10:07:42,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599476507] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:07:42,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098191203] [2025-02-06 10:07:42,345 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 10:07:42,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:42,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:07:42,347 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:07:42,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-02-06 10:07:42,462 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 112 statements into 14 equivalence classes. [2025-02-06 10:07:47,065 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) and asserted 112 of 112 statements. [2025-02-06 10:07:47,065 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2025-02-06 10:07:47,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:47,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 727 conjuncts, 146 conjuncts are in the unsatisfiable core [2025-02-06 10:07:47,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:07:47,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 10:07:47,196 INFO L134 CoverageAnalysis]: Checked inductivity of 626 backedges. 38 proven. 588 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:47,197 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:07:47,257 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-06 10:07:47,259 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-06 10:07:47,340 INFO L134 CoverageAnalysis]: Checked inductivity of 626 backedges. 38 proven. 588 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:47,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098191203] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:07:47,341 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:07:47,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 34, 34] total 39 [2025-02-06 10:07:47,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174726594] [2025-02-06 10:07:47,341 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:07:47,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-02-06 10:07:47,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:47,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-02-06 10:07:47,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1393, Unknown=0, NotChecked=0, Total=1482 [2025-02-06 10:07:47,342 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand has 39 states, 39 states have (on average 3.1538461538461537) internal successors, (123), 39 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-06 10:07:48,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:48,136 INFO L93 Difference]: Finished difference Result 185 states and 186 transitions. [2025-02-06 10:07:48,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-02-06 10:07:48,136 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 3.1538461538461537) internal successors, (123), 39 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 112 [2025-02-06 10:07:48,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:48,137 INFO L225 Difference]: With dead ends: 185 [2025-02-06 10:07:48,137 INFO L226 Difference]: Without dead ends: 118 [2025-02-06 10:07:48,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=133, Invalid=2317, Unknown=0, NotChecked=0, Total=2450 [2025-02-06 10:07:48,137 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 16 mSDsluCounter, 1270 mSDsCounter, 0 mSdLazyCounter, 2335 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 1312 SdHoareTripleChecker+Invalid, 2347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:48,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 1312 Invalid, 2347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2335 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 10:07:48,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-02-06 10:07:48,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2025-02-06 10:07:48,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 1.017391304347826) internal successors, (117), 115 states have internal predecessors, (117), 0 states have call successors, (0), 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-06 10:07:48,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 117 transitions. [2025-02-06 10:07:48,139 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 117 transitions. Word has length 112 [2025-02-06 10:07:48,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:48,139 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 117 transitions. [2025-02-06 10:07:48,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 3.1538461538461537) internal successors, (123), 39 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-06 10:07:48,139 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 117 transitions. [2025-02-06 10:07:48,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-06 10:07:48,139 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:48,140 INFO L218 NwaCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:48,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2025-02-06 10:07:48,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47,30 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:48,340 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-02-06 10:07:48,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:48,340 INFO L85 PathProgramCache]: Analyzing trace with hash 370926484, now seen corresponding path program 24 times [2025-02-06 10:07:48,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:48,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961625919] [2025-02-06 10:07:48,341 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 10:07:48,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:48,351 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 115 statements into 14 equivalence classes. [2025-02-06 10:07:48,391 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) and asserted 115 of 115 statements. [2025-02-06 10:07:48,392 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2025-02-06 10:07:48,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:49,615 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 176 proven. 487 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:49,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:49,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961625919] [2025-02-06 10:07:49,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961625919] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:07:49,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228024231] [2025-02-06 10:07:49,617 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 10:07:49,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:49,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:07:49,618 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:07:49,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-02-06 10:07:49,738 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 115 statements into 14 equivalence classes. [2025-02-06 10:07:53,639 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) and asserted 115 of 115 statements. [2025-02-06 10:07:53,639 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2025-02-06 10:07:53,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:53,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 740 conjuncts, 111 conjuncts are in the unsatisfiable core [2025-02-06 10:07:53,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:07:54,088 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 210 proven. 453 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:54,088 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:07:54,836 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-06 10:07:55,116 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 210 proven. 453 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:55,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228024231] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:07:55,116 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:07:55,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 33, 33] total 74 [2025-02-06 10:07:55,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191547868] [2025-02-06 10:07:55,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:07:55,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2025-02-06 10:07:55,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:55,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2025-02-06 10:07:55,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=763, Invalid=4787, Unknown=0, NotChecked=0, Total=5550 [2025-02-06 10:07:55,117 INFO L87 Difference]: Start difference. First operand 116 states and 117 transitions. Second operand has 75 states, 74 states have (on average 3.2567567567567566) internal successors, (241), 75 states have internal predecessors, (241), 0 states have call successors, (0), 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-06 10:07:56,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:56,093 INFO L93 Difference]: Finished difference Result 121 states and 122 transitions. [2025-02-06 10:07:56,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-02-06 10:07:56,093 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 74 states have (on average 3.2567567567567566) internal successors, (241), 75 states have internal predecessors, (241), 0 states have call successors, (0), 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 115 [2025-02-06 10:07:56,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:56,094 INFO L225 Difference]: With dead ends: 121 [2025-02-06 10:07:56,094 INFO L226 Difference]: Without dead ends: 121 [2025-02-06 10:07:56,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 179 SyntacticMatches, 14 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4167 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1513, Invalid=8587, Unknown=0, NotChecked=0, Total=10100 [2025-02-06 10:07:56,095 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 2 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 1263 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 1289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:56,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 189 Invalid, 1289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1263 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 10:07:56,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-02-06 10:07:56,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2025-02-06 10:07:56,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 1.0166666666666666) internal successors, (122), 120 states have internal predecessors, (122), 0 states have call successors, (0), 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-06 10:07:56,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2025-02-06 10:07:56,096 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 115 [2025-02-06 10:07:56,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:56,097 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2025-02-06 10:07:56,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 74 states have (on average 3.2567567567567566) internal successors, (241), 75 states have internal predecessors, (241), 0 states have call successors, (0), 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-06 10:07:56,097 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2025-02-06 10:07:56,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-06 10:07:56,097 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:56,097 INFO L218 NwaCegarLoop]: trace histogram [15, 14, 14, 14, 14, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:56,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2025-02-06 10:07:56,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2025-02-06 10:07:56,298 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-02-06 10:07:56,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:07:56,298 INFO L85 PathProgramCache]: Analyzing trace with hash -649345514, now seen corresponding path program 25 times [2025-02-06 10:07:56,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:07:56,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516135900] [2025-02-06 10:07:56,298 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 10:07:56,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:07:56,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-06 10:07:56,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-06 10:07:56,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:07:56,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:57,401 INFO L134 CoverageAnalysis]: Checked inductivity of 730 backedges. 41 proven. 689 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:57,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:07:57,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516135900] [2025-02-06 10:07:57,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516135900] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:07:57,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940254026] [2025-02-06 10:07:57,401 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 10:07:57,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:07:57,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:07:57,403 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:07:57,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-02-06 10:07:57,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-06 10:07:57,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-06 10:07:57,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:07:57,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:07:57,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 776 conjuncts, 156 conjuncts are in the unsatisfiable core [2025-02-06 10:07:57,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:07:58,029 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-06 10:07:58,179 INFO L134 CoverageAnalysis]: Checked inductivity of 730 backedges. 41 proven. 689 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:58,179 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:07:58,245 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-06 10:07:58,246 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-06 10:07:58,343 INFO L134 CoverageAnalysis]: Checked inductivity of 730 backedges. 41 proven. 689 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:07:58,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940254026] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:07:58,343 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:07:58,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 36, 36] total 58 [2025-02-06 10:07:58,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320179464] [2025-02-06 10:07:58,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:07:58,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2025-02-06 10:07:58,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:07:58,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2025-02-06 10:07:58,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=3159, Unknown=0, NotChecked=0, Total=3306 [2025-02-06 10:07:58,344 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand has 58 states, 58 states have (on average 2.9310344827586206) internal successors, (170), 58 states have internal predecessors, (170), 0 states have call successors, (0), 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-06 10:07:59,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:07:59,592 INFO L93 Difference]: Finished difference Result 198 states and 199 transitions. [2025-02-06 10:07:59,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-02-06 10:07:59,592 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 2.9310344827586206) internal successors, (170), 58 states have internal predecessors, (170), 0 states have call successors, (0), 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 120 [2025-02-06 10:07:59,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:07:59,592 INFO L225 Difference]: With dead ends: 198 [2025-02-06 10:07:59,592 INFO L226 Difference]: Without dead ends: 126 [2025-02-06 10:07:59,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=217, Invalid=4753, Unknown=0, NotChecked=0, Total=4970 [2025-02-06 10:07:59,593 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 17 mSDsluCounter, 1921 mSDsCounter, 0 mSdLazyCounter, 3426 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1966 SdHoareTripleChecker+Invalid, 3439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 3426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 10:07:59,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1966 Invalid, 3439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 3426 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 10:07:59,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-02-06 10:07:59,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2025-02-06 10:07:59,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 123 states have (on average 1.016260162601626) internal successors, (125), 123 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-06 10:07:59,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 125 transitions. [2025-02-06 10:07:59,595 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 125 transitions. Word has length 120 [2025-02-06 10:07:59,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:07:59,595 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 125 transitions. [2025-02-06 10:07:59,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 2.9310344827586206) internal successors, (170), 58 states have internal predecessors, (170), 0 states have call successors, (0), 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-06 10:07:59,595 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 125 transitions. [2025-02-06 10:07:59,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-06 10:07:59,595 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:07:59,595 INFO L218 NwaCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:07:59,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0