./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrncpy-alloca-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 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/termination-memory-alloca/openbsd_cstrncpy-alloca-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash a15d7a8babeb47c5803852aa414fd44c9c2ce5952463596f56bd26c728f7d82b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 22:12:50,096 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 22:12:50,156 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-01-09 22:12:50,161 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 22:12:50,162 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 22:12:50,186 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 22:12:50,187 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 22:12:50,187 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 22:12:50,187 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 22:12:50,187 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 22:12:50,187 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 22:12:50,187 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 22:12:50,188 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 22:12:50,188 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 22:12:50,188 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 22:12:50,189 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 22:12:50,189 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 22:12:50,189 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 22:12:50,189 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 22:12:50,189 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 22:12:50,189 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-09 22:12:50,189 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 22:12:50,189 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 22:12:50,190 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 22:12:50,190 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 22:12:50,190 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 22:12:50,190 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 22:12:50,190 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:12:50,190 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:12:50,190 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:12:50,190 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:12:50,191 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 22:12:50,191 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:12:50,191 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:12:50,191 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:12:50,191 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:12:50,191 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 22:12:50,191 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 22:12:50,191 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 22:12:50,191 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 22:12:50,191 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 22:12:50,192 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 22:12:50,192 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 22:12:50,192 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 22:12:50,192 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a15d7a8babeb47c5803852aa414fd44c9c2ce5952463596f56bd26c728f7d82b [2025-01-09 22:12:50,440 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 22:12:50,446 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 22:12:50,448 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 22:12:50,449 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 22:12:50,449 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 22:12:50,450 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrncpy-alloca-1.i [2025-01-09 22:12:51,639 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/765a28e7f/fa972f5c59a8425cb87b258228ec746f/FLAG836229531 [2025-01-09 22:12:51,893 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 22:12:51,894 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/openbsd_cstrncpy-alloca-1.i [2025-01-09 22:12:51,901 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/765a28e7f/fa972f5c59a8425cb87b258228ec746f/FLAG836229531 [2025-01-09 22:12:51,912 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/765a28e7f/fa972f5c59a8425cb87b258228ec746f [2025-01-09 22:12:51,913 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 22:12:51,915 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 22:12:51,915 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 22:12:51,916 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 22:12:51,918 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 22:12:51,919 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:12:51" (1/1) ... [2025-01-09 22:12:51,920 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6162a40a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:12:51, skipping insertion in model container [2025-01-09 22:12:51,920 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:12:51" (1/1) ... [2025-01-09 22:12:51,944 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 22:12:52,144 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 22:12:52,145 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 22:12:52,147 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:12:52,157 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 22:12:52,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:12:52,193 INFO L204 MainTranslator]: Completed translation [2025-01-09 22:12:52,194 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:12:52 WrapperNode [2025-01-09 22:12:52,194 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 22:12:52,195 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 22:12:52,195 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 22:12:52,195 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 22:12:52,199 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:12:52" (1/1) ... [2025-01-09 22:12:52,204 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:12:52" (1/1) ... [2025-01-09 22:12:52,217 INFO L138 Inliner]: procedures = 111, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 73 [2025-01-09 22:12:52,217 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 22:12:52,218 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 22:12:52,218 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 22:12:52,218 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 22:12:52,224 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:12:52" (1/1) ... [2025-01-09 22:12:52,224 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:12:52" (1/1) ... [2025-01-09 22:12:52,226 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:12:52" (1/1) ... [2025-01-09 22:12:52,236 INFO L175 MemorySlicer]: Split 4 memory accesses to 2 slices as follows [2, 2]. 50 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 3 writes are split as follows [1, 2]. [2025-01-09 22:12:52,236 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:12:52" (1/1) ... [2025-01-09 22:12:52,236 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:12:52" (1/1) ... [2025-01-09 22:12:52,239 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:12:52" (1/1) ... [2025-01-09 22:12:52,239 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:12:52" (1/1) ... [2025-01-09 22:12:52,241 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:12:52" (1/1) ... [2025-01-09 22:12:52,242 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:12:52" (1/1) ... [2025-01-09 22:12:52,242 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:12:52" (1/1) ... [2025-01-09 22:12:52,243 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 22:12:52,244 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 22:12:52,244 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 22:12:52,244 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 22:12:52,244 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:12:52" (1/1) ... [2025-01-09 22:12:52,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:12:52,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:12:52,265 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-01-09 22:12:52,270 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-01-09 22:12:52,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 22:12:52,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 22:12:52,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 22:12:52,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 22:12:52,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 22:12:52,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 22:12:52,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 22:12:52,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 22:12:52,372 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 22:12:52,374 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 22:12:52,489 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2025-01-09 22:12:52,490 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 22:12:52,497 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 22:12:52,497 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 22:12:52,497 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:12:52 BoogieIcfgContainer [2025-01-09 22:12:52,498 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 22:12:52,499 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 22:12:52,500 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 22:12:52,504 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 22:12:52,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:12:51" (1/3) ... [2025-01-09 22:12:52,505 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19533b00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:12:52, skipping insertion in model container [2025-01-09 22:12:52,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:12:52" (2/3) ... [2025-01-09 22:12:52,505 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19533b00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:12:52, skipping insertion in model container [2025-01-09 22:12:52,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:12:52" (3/3) ... [2025-01-09 22:12:52,507 INFO L128 eAbstractionObserver]: Analyzing ICFG openbsd_cstrncpy-alloca-1.i [2025-01-09 22:12:52,516 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 22:12:52,517 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG openbsd_cstrncpy-alloca-1.i that has 1 procedures, 32 locations, 1 initial locations, 2 loop locations, and 9 error locations. [2025-01-09 22:12:52,546 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 22:12:52,556 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;@12485432, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 22:12:52,556 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-01-09 22:12:52,559 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 22 states have (on average 1.7727272727272727) 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-01-09 22:12:52,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-09 22:12:52,561 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:12:52,561 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-09 22:12:52,562 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-01-09 22:12:52,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:12:52,565 INFO L85 PathProgramCache]: Analyzing trace with hash 889510731, now seen corresponding path program 1 times [2025-01-09 22:12:52,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:12:52,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057009540] [2025-01-09 22:12:52,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:12:52,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:12:52,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-09 22:12:52,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-09 22:12:52,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:12:52,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:12:52,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:12:52,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:12:52,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057009540] [2025-01-09 22:12:52,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057009540] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:12:52,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:12:52,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:12:52,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060176691] [2025-01-09 22:12:52,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:12:52,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:12:52,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:12:52,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:12:52,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:12:52,748 INFO L87 Difference]: Start difference. First operand has 32 states, 22 states have (on average 1.7727272727272727) 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) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:52,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:12:52,780 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2025-01-09 22:12:52,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:12:52,782 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-01-09 22:12:52,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:12:52,786 INFO L225 Difference]: With dead ends: 31 [2025-01-09 22:12:52,786 INFO L226 Difference]: Without dead ends: 29 [2025-01-09 22:12:52,788 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-01-09 22:12:52,791 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:12:52,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 54 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:12:52,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-01-09 22:12:52,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-01-09 22:12:52,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.619047619047619) internal successors, (34), 28 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:52,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2025-01-09 22:12:52,817 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 6 [2025-01-09 22:12:52,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:12:52,817 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2025-01-09 22:12:52,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:52,818 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2025-01-09 22:12:52,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-09 22:12:52,818 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:12:52,818 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-09 22:12:52,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 22:12:52,818 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-01-09 22:12:52,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:12:52,819 INFO L85 PathProgramCache]: Analyzing trace with hash 889510732, now seen corresponding path program 1 times [2025-01-09 22:12:52,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:12:52,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922142746] [2025-01-09 22:12:52,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:12:52,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:12:52,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-09 22:12:52,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-09 22:12:52,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:12:52,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:12:53,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:12:53,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:12:53,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922142746] [2025-01-09 22:12:53,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922142746] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:12:53,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:12:53,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:12:53,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915914696] [2025-01-09 22:12:53,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:12:53,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:12:53,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:12:53,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:12:53,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:12:53,021 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:53,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:12:53,071 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2025-01-09 22:12:53,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:12:53,072 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-01-09 22:12:53,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:12:53,072 INFO L225 Difference]: With dead ends: 32 [2025-01-09 22:12:53,072 INFO L226 Difference]: Without dead ends: 32 [2025-01-09 22:12:53,072 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-01-09 22:12:53,073 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 1 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:12:53,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 81 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:12:53,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-01-09 22:12:53,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-01-09 22:12:53,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.5833333333333333) 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-01-09 22:12:53,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2025-01-09 22:12:53,076 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 6 [2025-01-09 22:12:53,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:12:53,076 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2025-01-09 22:12:53,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:53,076 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2025-01-09 22:12:53,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-09 22:12:53,076 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:12:53,076 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-09 22:12:53,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 22:12:53,076 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-01-09 22:12:53,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:12:53,077 INFO L85 PathProgramCache]: Analyzing trace with hash 889570314, now seen corresponding path program 1 times [2025-01-09 22:12:53,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:12:53,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784961542] [2025-01-09 22:12:53,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:12:53,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:12:53,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-09 22:12:53,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-09 22:12:53,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:12:53,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:12:53,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:12:53,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:12:53,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784961542] [2025-01-09 22:12:53,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784961542] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:12:53,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:12:53,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:12:53,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256901199] [2025-01-09 22:12:53,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:12:53,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:12:53,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:12:53,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:12:53,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:12:53,228 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:53,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:12:53,262 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2025-01-09 22:12:53,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:12:53,265 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-01-09 22:12:53,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:12:53,266 INFO L225 Difference]: With dead ends: 31 [2025-01-09 22:12:53,266 INFO L226 Difference]: Without dead ends: 31 [2025-01-09 22:12:53,266 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-01-09 22:12:53,266 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:12:53,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 102 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:12:53,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-01-09 22:12:53,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2025-01-09 22:12:53,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 27 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:53,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2025-01-09 22:12:53,269 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 6 [2025-01-09 22:12:53,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:12:53,269 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2025-01-09 22:12:53,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:53,269 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2025-01-09 22:12:53,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-09 22:12:53,269 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:12:53,269 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:12:53,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 22:12:53,269 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-01-09 22:12:53,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:12:53,270 INFO L85 PathProgramCache]: Analyzing trace with hash 624631599, now seen corresponding path program 1 times [2025-01-09 22:12:53,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:12:53,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369790257] [2025-01-09 22:12:53,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:12:53,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:12:53,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-09 22:12:53,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-09 22:12:53,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:12:53,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:12:53,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:12:53,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:12:53,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369790257] [2025-01-09 22:12:53,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369790257] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:12:53,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:12:53,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:12:53,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749198776] [2025-01-09 22:12:53,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:12:53,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:12:53,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:12:53,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:12:53,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:12:53,372 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:53,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:12:53,439 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2025-01-09 22:12:53,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:12:53,440 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-01-09 22:12:53,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:12:53,440 INFO L225 Difference]: With dead ends: 29 [2025-01-09 22:12:53,440 INFO L226 Difference]: Without dead ends: 29 [2025-01-09 22:12:53,440 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-01-09 22:12:53,441 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 18 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:12:53,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 75 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:12:53,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-01-09 22:12:53,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2025-01-09 22:12:53,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 26 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:53,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2025-01-09 22:12:53,443 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 10 [2025-01-09 22:12:53,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:12:53,443 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2025-01-09 22:12:53,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:53,443 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2025-01-09 22:12:53,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-09 22:12:53,443 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:12:53,443 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:12:53,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 22:12:53,445 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-01-09 22:12:53,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:12:53,446 INFO L85 PathProgramCache]: Analyzing trace with hash 624631600, now seen corresponding path program 1 times [2025-01-09 22:12:53,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:12:53,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364971194] [2025-01-09 22:12:53,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:12:53,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:12:53,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-09 22:12:53,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-09 22:12:53,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:12:53,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:12:53,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:12:53,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:12:53,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364971194] [2025-01-09 22:12:53,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364971194] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:12:53,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:12:53,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 22:12:53,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185236988] [2025-01-09 22:12:53,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:12:53,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 22:12:53,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:12:53,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 22:12:53,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:12:53,636 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:53,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:12:53,697 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2025-01-09 22:12:53,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:12:53,697 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-01-09 22:12:53,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:12:53,698 INFO L225 Difference]: With dead ends: 31 [2025-01-09 22:12:53,698 INFO L226 Difference]: Without dead ends: 31 [2025-01-09 22:12:53,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:12:53,698 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 3 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:12:53,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 146 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:12:53,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-01-09 22:12:53,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2025-01-09 22:12:53,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 28 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:53,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2025-01-09 22:12:53,700 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 10 [2025-01-09 22:12:53,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:12:53,700 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2025-01-09 22:12:53,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:53,701 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2025-01-09 22:12:53,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 22:12:53,701 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:12:53,701 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:12:53,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 22:12:53,701 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-01-09 22:12:53,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:12:53,701 INFO L85 PathProgramCache]: Analyzing trace with hash -2109904371, now seen corresponding path program 1 times [2025-01-09 22:12:53,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:12:53,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624946671] [2025-01-09 22:12:53,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:12:53,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:12:53,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 22:12:53,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 22:12:53,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:12:53,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:12:53,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-01-09 22:12:53,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:12:53,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624946671] [2025-01-09 22:12:53,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624946671] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:12:53,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:12:53,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:12:53,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285674498] [2025-01-09 22:12:53,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:12:53,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:12:53,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:12:53,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:12:53,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:12:53,751 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:53,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:12:53,768 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2025-01-09 22:12:53,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:12:53,768 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-01-09 22:12:53,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:12:53,769 INFO L225 Difference]: With dead ends: 40 [2025-01-09 22:12:53,769 INFO L226 Difference]: Without dead ends: 40 [2025-01-09 22:12:53,769 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-01-09 22:12:53,770 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 76 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-01-09 22:12:53,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 76 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:12:53,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-01-09 22:12:53,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2025-01-09 22:12:53,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 32 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-01-09 22:12:53,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2025-01-09 22:12:53,772 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 11 [2025-01-09 22:12:53,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:12:53,772 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2025-01-09 22:12:53,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:53,772 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2025-01-09 22:12:53,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 22:12:53,772 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:12:53,773 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:12:53,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 22:12:53,773 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-01-09 22:12:53,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:12:53,773 INFO L85 PathProgramCache]: Analyzing trace with hash -2111256910, now seen corresponding path program 1 times [2025-01-09 22:12:53,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:12:53,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731671509] [2025-01-09 22:12:53,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:12:53,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:12:53,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 22:12:53,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 22:12:53,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:12:53,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:12:53,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:12:53,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:12:53,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731671509] [2025-01-09 22:12:53,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731671509] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:12:53,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:12:53,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:12:53,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414749357] [2025-01-09 22:12:53,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:12:53,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:12:53,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:12:53,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:12:53,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:12:53,959 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 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-01-09 22:12:54,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:12:54,067 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2025-01-09 22:12:54,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:12:54,068 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 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-01-09 22:12:54,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:12:54,068 INFO L225 Difference]: With dead ends: 52 [2025-01-09 22:12:54,068 INFO L226 Difference]: Without dead ends: 52 [2025-01-09 22:12:54,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:12:54,069 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 25 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:12:54,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 111 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:12:54,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-01-09 22:12:54,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 36. [2025-01-09 22:12:54,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.4) internal successors, (42), 35 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-01-09 22:12:54,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2025-01-09 22:12:54,071 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 11 [2025-01-09 22:12:54,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:12:54,071 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2025-01-09 22:12:54,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 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-01-09 22:12:54,073 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2025-01-09 22:12:54,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 22:12:54,074 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:12:54,074 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:12:54,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 22:12:54,074 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-01-09 22:12:54,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:12:54,074 INFO L85 PathProgramCache]: Analyzing trace with hash -2111256911, now seen corresponding path program 1 times [2025-01-09 22:12:54,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:12:54,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787575593] [2025-01-09 22:12:54,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:12:54,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:12:54,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 22:12:54,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 22:12:54,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:12:54,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:12:54,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:12:54,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:12:54,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787575593] [2025-01-09 22:12:54,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787575593] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:12:54,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:12:54,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:12:54,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115116750] [2025-01-09 22:12:54,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:12:54,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:12:54,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:12:54,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:12:54,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:12:54,164 INFO L87 Difference]: Start difference. First operand 36 states and 42 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-01-09 22:12:54,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:12:54,213 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2025-01-09 22:12:54,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:12:54,213 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-01-09 22:12:54,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:12:54,214 INFO L225 Difference]: With dead ends: 35 [2025-01-09 22:12:54,214 INFO L226 Difference]: Without dead ends: 35 [2025-01-09 22:12:54,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:12:54,214 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 34 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:12:54,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 56 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:12:54,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-01-09 22:12:54,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-01-09 22:12:54,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 34 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-01-09 22:12:54,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2025-01-09 22:12:54,216 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 11 [2025-01-09 22:12:54,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:12:54,216 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2025-01-09 22:12:54,216 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-01-09 22:12:54,216 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2025-01-09 22:12:54,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 22:12:54,217 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:12:54,217 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:12:54,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 22:12:54,217 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-01-09 22:12:54,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:12:54,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1375716299, now seen corresponding path program 1 times [2025-01-09 22:12:54,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:12:54,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9810766] [2025-01-09 22:12:54,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:12:54,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:12:54,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 22:12:54,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 22:12:54,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:12:54,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:12:54,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:12:54,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:12:54,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9810766] [2025-01-09 22:12:54,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9810766] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:12:54,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:12:54,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:12:54,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242508306] [2025-01-09 22:12:54,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:12:54,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:12:54,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:12:54,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:12:54,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:12:54,272 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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-01-09 22:12:54,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:12:54,288 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2025-01-09 22:12:54,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:12:54,289 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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-01-09 22:12:54,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:12:54,289 INFO L225 Difference]: With dead ends: 39 [2025-01-09 22:12:54,289 INFO L226 Difference]: Without dead ends: 39 [2025-01-09 22:12:54,289 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-01-09 22:12:54,290 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 7 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 85 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-01-09 22:12:54,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 85 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:12:54,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-01-09 22:12:54,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2025-01-09 22:12:54,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.3) internal successors, (39), 34 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-01-09 22:12:54,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2025-01-09 22:12:54,292 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 11 [2025-01-09 22:12:54,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:12:54,292 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2025-01-09 22:12:54,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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-01-09 22:12:54,292 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2025-01-09 22:12:54,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 22:12:54,292 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:12:54,292 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:12:54,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 22:12:54,293 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-01-09 22:12:54,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:12:54,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1374363760, now seen corresponding path program 1 times [2025-01-09 22:12:54,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:12:54,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225656627] [2025-01-09 22:12:54,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:12:54,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:12:54,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 22:12:54,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 22:12:54,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:12:54,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:12:54,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:12:54,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:12:54,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225656627] [2025-01-09 22:12:54,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225656627] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:12:54,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:12:54,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 22:12:54,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465427260] [2025-01-09 22:12:54,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:12:54,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 22:12:54,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:12:54,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 22:12:54,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:12:54,474 INFO L87 Difference]: Start difference. First operand 35 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-01-09 22:12:54,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:12:54,539 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2025-01-09 22:12:54,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:12:54,540 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-01-09 22:12:54,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:12:54,540 INFO L225 Difference]: With dead ends: 36 [2025-01-09 22:12:54,540 INFO L226 Difference]: Without dead ends: 36 [2025-01-09 22:12:54,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:12:54,541 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 22 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 62 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-01-09 22:12:54,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 62 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:12:54,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-01-09 22:12:54,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 29. [2025-01-09 22:12:54,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.375) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:54,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2025-01-09 22:12:54,542 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 11 [2025-01-09 22:12:54,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:12:54,543 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2025-01-09 22:12:54,543 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-01-09 22:12:54,543 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2025-01-09 22:12:54,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-09 22:12:54,543 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:12:54,543 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:12:54,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 22:12:54,543 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-01-09 22:12:54,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:12:54,543 INFO L85 PathProgramCache]: Analyzing trace with hash 505369590, now seen corresponding path program 1 times [2025-01-09 22:12:54,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:12:54,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671637128] [2025-01-09 22:12:54,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:12:54,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:12:54,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-09 22:12:54,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 22:12:54,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:12:54,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:12:54,633 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:12:54,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:12:54,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671637128] [2025-01-09 22:12:54,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671637128] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:12:54,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:12:54,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:12:54,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965559747] [2025-01-09 22:12:54,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:12:54,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:12:54,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:12:54,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:12:54,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:12:54,636 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:54,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:12:54,658 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2025-01-09 22:12:54,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:12:54,659 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-01-09 22:12:54,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:12:54,662 INFO L225 Difference]: With dead ends: 39 [2025-01-09 22:12:54,662 INFO L226 Difference]: Without dead ends: 39 [2025-01-09 22:12:54,662 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-01-09 22:12:54,663 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 90 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-01-09 22:12:54,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 90 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:12:54,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-01-09 22:12:54,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2025-01-09 22:12:54,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.303030303030303) 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-01-09 22:12:54,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2025-01-09 22:12:54,664 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 15 [2025-01-09 22:12:54,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:12:54,665 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2025-01-09 22:12:54,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:54,665 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2025-01-09 22:12:54,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-09 22:12:54,665 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:12:54,665 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:12:54,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 22:12:54,665 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-01-09 22:12:54,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:12:54,668 INFO L85 PathProgramCache]: Analyzing trace with hash 763535028, now seen corresponding path program 1 times [2025-01-09 22:12:54,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:12:54,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066589964] [2025-01-09 22:12:54,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:12:54,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:12:54,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-09 22:12:54,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 22:12:54,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:12:54,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:12:54,832 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:12:54,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:12:54,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066589964] [2025-01-09 22:12:54,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066589964] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:12:54,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:12:54,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 22:12:54,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065855473] [2025-01-09 22:12:54,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:12:54,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:12:54,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:12:54,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:12:54,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:12:54,834 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:54,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:12:54,891 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2025-01-09 22:12:54,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:12:54,892 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-01-09 22:12:54,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:12:54,893 INFO L225 Difference]: With dead ends: 55 [2025-01-09 22:12:54,893 INFO L226 Difference]: Without dead ends: 55 [2025-01-09 22:12:54,893 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-01-09 22:12:54,894 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:12:54,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 161 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:12:54,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-01-09 22:12:54,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2025-01-09 22:12:54,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 46 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-01-09 22:12:54,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2025-01-09 22:12:54,898 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 15 [2025-01-09 22:12:54,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:12:54,898 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2025-01-09 22:12:54,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:54,898 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2025-01-09 22:12:54,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-09 22:12:54,898 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:12:54,899 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:12:54,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 22:12:54,899 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-01-09 22:12:54,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:12:54,899 INFO L85 PathProgramCache]: Analyzing trace with hash 176729014, now seen corresponding path program 1 times [2025-01-09 22:12:54,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:12:54,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937116947] [2025-01-09 22:12:54,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:12:54,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:12:54,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-09 22:12:54,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 22:12:54,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:12:54,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:12:55,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:12:55,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:12:55,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937116947] [2025-01-09 22:12:55,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937116947] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:12:55,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447246755] [2025-01-09 22:12:55,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:12:55,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:12:55,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:12:55,251 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-01-09 22:12:55,253 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-01-09 22:12:55,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-09 22:12:55,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 22:12:55,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:12:55,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:12:55,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-01-09 22:12:55,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:12:55,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-01-09 22:12:55,632 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:12:55,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 17 [2025-01-09 22:12:55,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:12:55,748 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:12:56,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-01-09 22:12:56,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2025-01-09 22:12:56,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-01-09 22:12:56,078 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:12:56,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447246755] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:12:56,079 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:12:56,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 25 [2025-01-09 22:12:56,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237858944] [2025-01-09 22:12:56,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:12:56,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-09 22:12:56,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:12:56,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-09 22:12:56,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2025-01-09 22:12:56,080 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 26 states, 25 states have (on average 1.52) internal successors, (38), 26 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-01-09 22:12:56,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:12:56,329 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2025-01-09 22:12:56,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 22:12:56,329 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.52) internal successors, (38), 26 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) Word has length 15 [2025-01-09 22:12:56,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:12:56,329 INFO L225 Difference]: With dead ends: 52 [2025-01-09 22:12:56,329 INFO L226 Difference]: Without dead ends: 52 [2025-01-09 22:12:56,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=104, Invalid=766, Unknown=0, NotChecked=0, Total=870 [2025-01-09 22:12:56,330 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 5 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:12:56,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 246 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:12:56,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-01-09 22:12:56,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2025-01-09 22:12:56,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 50 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:56,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2025-01-09 22:12:56,332 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 15 [2025-01-09 22:12:56,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:12:56,333 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2025-01-09 22:12:56,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.52) internal successors, (38), 26 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-01-09 22:12:56,333 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2025-01-09 22:12:56,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-09 22:12:56,333 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:12:56,333 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:12:56,340 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-01-09 22:12:56,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-09 22:12:56,534 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-01-09 22:12:56,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:12:56,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1531479080, now seen corresponding path program 1 times [2025-01-09 22:12:56,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:12:56,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991549997] [2025-01-09 22:12:56,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:12:56,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:12:56,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 22:12:56,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 22:12:56,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:12:56,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:12:56,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:12:56,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:12:56,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991549997] [2025-01-09 22:12:56,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991549997] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:12:56,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:12:56,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:12:56,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108351583] [2025-01-09 22:12:56,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:12:56,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:12:56,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:12:56,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:12:56,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:12:56,576 INFO L87 Difference]: Start difference. First operand 51 states and 59 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-01-09 22:12:56,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:12:56,621 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2025-01-09 22:12:56,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:12:56,621 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-01-09 22:12:56,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:12:56,622 INFO L225 Difference]: With dead ends: 50 [2025-01-09 22:12:56,623 INFO L226 Difference]: Without dead ends: 50 [2025-01-09 22:12:56,624 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-01-09 22:12:56,624 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 10 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:12:56,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 60 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:12:56,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-01-09 22:12:56,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-01-09 22:12:56,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 49 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:56,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2025-01-09 22:12:56,629 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 16 [2025-01-09 22:12:56,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:12:56,629 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2025-01-09 22:12:56,629 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-01-09 22:12:56,629 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2025-01-09 22:12:56,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-09 22:12:56,630 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:12:56,630 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:12:56,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 22:12:56,630 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-01-09 22:12:56,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:12:56,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1531479079, now seen corresponding path program 1 times [2025-01-09 22:12:56,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:12:56,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726056722] [2025-01-09 22:12:56,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:12:56,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:12:56,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 22:12:56,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 22:12:56,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:12:56,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:12:56,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:12:56,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:12:56,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726056722] [2025-01-09 22:12:56,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726056722] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:12:56,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:12:56,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:12:56,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245380465] [2025-01-09 22:12:56,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:12:56,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:12:56,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:12:56,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:12:56,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:12:56,690 INFO L87 Difference]: Start difference. First operand 50 states and 58 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-01-09 22:12:56,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:12:56,709 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2025-01-09 22:12:56,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:12:56,709 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-01-09 22:12:56,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:12:56,709 INFO L225 Difference]: With dead ends: 60 [2025-01-09 22:12:56,709 INFO L226 Difference]: Without dead ends: 60 [2025-01-09 22:12:56,710 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-01-09 22:12:56,710 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 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-01-09 22:12:56,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:12:56,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-01-09 22:12:56,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-01-09 22:12:56,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 56 states have (on average 1.2142857142857142) internal successors, (68), 59 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-01-09 22:12:56,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2025-01-09 22:12:56,713 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 16 [2025-01-09 22:12:56,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:12:56,713 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2025-01-09 22:12:56,713 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-01-09 22:12:56,713 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2025-01-09 22:12:56,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-09 22:12:56,713 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:12:56,713 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:12:56,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 22:12:56,714 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-01-09 22:12:56,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:12:56,714 INFO L85 PathProgramCache]: Analyzing trace with hash -2118285093, now seen corresponding path program 1 times [2025-01-09 22:12:56,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:12:56,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858690346] [2025-01-09 22:12:56,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:12:56,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:12:56,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 22:12:56,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 22:12:56,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:12:56,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:12:57,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:12:57,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:12:57,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858690346] [2025-01-09 22:12:57,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858690346] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:12:57,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:12:57,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 22:12:57,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512850126] [2025-01-09 22:12:57,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:12:57,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 22:12:57,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:12:57,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 22:12:57,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-09 22:12:57,010 INFO L87 Difference]: Start difference. First operand 60 states and 68 transitions. Second operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 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-01-09 22:12:57,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:12:57,172 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2025-01-09 22:12:57,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 22:12:57,172 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 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-01-09 22:12:57,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:12:57,173 INFO L225 Difference]: With dead ends: 64 [2025-01-09 22:12:57,173 INFO L226 Difference]: Without dead ends: 64 [2025-01-09 22:12:57,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2025-01-09 22:12:57,173 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:12:57,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 92 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:12:57,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-01-09 22:12:57,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-01-09 22:12:57,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 60 states have (on average 1.2166666666666666) internal successors, (73), 63 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:57,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2025-01-09 22:12:57,176 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 16 [2025-01-09 22:12:57,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:12:57,176 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2025-01-09 22:12:57,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 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-01-09 22:12:57,176 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2025-01-09 22:12:57,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-09 22:12:57,176 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:12:57,176 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:12:57,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 22:12:57,177 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-01-09 22:12:57,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:12:57,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1183632108, now seen corresponding path program 1 times [2025-01-09 22:12:57,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:12:57,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269768666] [2025-01-09 22:12:57,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:12:57,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:12:57,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 22:12:57,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 22:12:57,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:12:57,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:12:57,483 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:12:57,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:12:57,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269768666] [2025-01-09 22:12:57,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269768666] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:12:57,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533893737] [2025-01-09 22:12:57,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:12:57,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:12:57,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:12:57,485 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-01-09 22:12:57,487 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-01-09 22:12:57,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 22:12:57,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 22:12:57,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:12:57,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:12:57,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-01-09 22:12:57,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:12:57,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:12:57,591 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-01-09 22:12:57,593 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-01-09 22:12:57,841 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:12:57,841 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:12:58,102 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:12:58,180 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:12:58,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533893737] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:12:58,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:12:58,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2025-01-09 22:12:58,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326600069] [2025-01-09 22:12:58,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:12:58,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-01-09 22:12:58,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:12:58,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-01-09 22:12:58,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=875, Unknown=0, NotChecked=0, Total=992 [2025-01-09 22:12:58,182 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. Second operand has 32 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 32 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:58,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:12:58,457 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2025-01-09 22:12:58,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 22:12:58,458 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 32 states have internal predecessors, (46), 0 states have call successors, (0), 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-01-09 22:12:58,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:12:58,458 INFO L225 Difference]: With dead ends: 65 [2025-01-09 22:12:58,458 INFO L226 Difference]: Without dead ends: 65 [2025-01-09 22:12:58,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=161, Invalid=1099, Unknown=0, NotChecked=0, Total=1260 [2025-01-09 22:12:58,459 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 15 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:12:58,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 201 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:12:58,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-01-09 22:12:58,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-01-09 22:12:58,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 61 states have (on average 1.2131147540983607) internal successors, (74), 64 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-01-09 22:12:58,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2025-01-09 22:12:58,461 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 16 [2025-01-09 22:12:58,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:12:58,461 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2025-01-09 22:12:58,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 32 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:58,461 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2025-01-09 22:12:58,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-09 22:12:58,462 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:12:58,462 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:12:58,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 22:12:58,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-09 22:12:58,666 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-01-09 22:12:58,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:12:58,667 INFO L85 PathProgramCache]: Analyzing trace with hash -947973315, now seen corresponding path program 1 times [2025-01-09 22:12:58,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:12:58,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873857153] [2025-01-09 22:12:58,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:12:58,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:12:58,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 22:12:58,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 22:12:58,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:12:58,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:12:58,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:12:58,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:12:58,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873857153] [2025-01-09 22:12:58,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873857153] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:12:58,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:12:58,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:12:58,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494726801] [2025-01-09 22:12:58,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:12:58,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:12:58,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:12:58,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:12:58,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:12:58,759 INFO L87 Difference]: Start difference. First operand 65 states and 74 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:58,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:12:58,773 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2025-01-09 22:12:58,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:12:58,773 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-01-09 22:12:58,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:12:58,773 INFO L225 Difference]: With dead ends: 64 [2025-01-09 22:12:58,773 INFO L226 Difference]: Without dead ends: 41 [2025-01-09 22:12:58,773 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-01-09 22:12:58,774 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 12 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:12:58,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 42 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:12:58,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-01-09 22:12:58,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-01-09 22:12:58,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 40 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-01-09 22:12:58,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2025-01-09 22:12:58,775 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 17 [2025-01-09 22:12:58,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:12:58,775 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2025-01-09 22:12:58,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:12:58,775 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2025-01-09 22:12:58,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-09 22:12:58,775 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:12:58,775 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:12:58,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 22:12:58,776 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-01-09 22:12:58,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:12:58,776 INFO L85 PathProgramCache]: Analyzing trace with hash -474099137, now seen corresponding path program 1 times [2025-01-09 22:12:58,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:12:58,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676255908] [2025-01-09 22:12:58,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:12:58,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:12:58,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 22:12:58,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 22:12:58,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:12:58,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:12:59,130 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:12:59,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:12:59,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676255908] [2025-01-09 22:12:59,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676255908] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:12:59,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911005577] [2025-01-09 22:12:59,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:12:59,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:12:59,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:12:59,133 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-01-09 22:12:59,134 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-01-09 22:12:59,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 22:12:59,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 22:12:59,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:12:59,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:12:59,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-01-09 22:12:59,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:12:59,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:12:59,207 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-01-09 22:12:59,210 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-01-09 22:12:59,554 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:12:59,555 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:12:59,993 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:12:59,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911005577] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:12:59,994 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:12:59,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 34 [2025-01-09 22:12:59,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131363804] [2025-01-09 22:12:59,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:12:59,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-01-09 22:12:59,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:12:59,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-01-09 22:12:59,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1066, Unknown=0, NotChecked=0, Total=1190 [2025-01-09 22:12:59,995 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 35 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 35 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-01-09 22:13:02,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:13:02,063 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2025-01-09 22:13:02,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-01-09 22:13:02,063 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 35 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) Word has length 20 [2025-01-09 22:13:02,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:13:02,063 INFO L225 Difference]: With dead ends: 71 [2025-01-09 22:13:02,063 INFO L226 Difference]: Without dead ends: 71 [2025-01-09 22:13:02,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=290, Invalid=2362, Unknown=0, NotChecked=0, Total=2652 [2025-01-09 22:13:02,065 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 23 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 22:13:02,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 130 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 22:13:02,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-01-09 22:13:02,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 67. [2025-01-09 22:13:02,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 64 states have (on average 1.1875) internal successors, (76), 66 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:13:02,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 76 transitions. [2025-01-09 22:13:02,067 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 76 transitions. Word has length 20 [2025-01-09 22:13:02,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:13:02,067 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 76 transitions. [2025-01-09 22:13:02,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 35 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-01-09 22:13:02,067 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 76 transitions. [2025-01-09 22:13:02,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-09 22:13:02,067 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:13:02,067 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:13:02,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 22:13:02,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:13:02,272 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-01-09 22:13:02,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:13:02,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1276291888, now seen corresponding path program 2 times [2025-01-09 22:13:02,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:13:02,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990389873] [2025-01-09 22:13:02,272 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:13:02,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:13:02,281 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-01-09 22:13:02,298 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 22:13:02,299 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:13:02,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:13:02,657 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:13:02,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:13:02,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990389873] [2025-01-09 22:13:02,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990389873] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:13:02,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424515073] [2025-01-09 22:13:02,658 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:13:02,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:13:02,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:13:02,660 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-01-09 22:13:02,661 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-01-09 22:13:02,708 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-01-09 22:13:02,728 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 22:13:02,728 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:13:02,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:13:02,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-01-09 22:13:02,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:13:02,755 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-01-09 22:13:02,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-01-09 22:13:03,129 INFO L349 Elim1Store]: treesize reduction 4, result has 81.8 percent of original size [2025-01-09 22:13:03,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 28 [2025-01-09 22:13:03,190 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:13:03,190 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:13:03,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2025-01-09 22:13:03,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2025-01-09 22:13:03,617 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:13:03,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424515073] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:13:03,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:13:03,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 32 [2025-01-09 22:13:03,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184587753] [2025-01-09 22:13:03,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:13:03,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-01-09 22:13:03,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:13:03,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-01-09 22:13:03,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=957, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 22:13:03,619 INFO L87 Difference]: Start difference. First operand 67 states and 76 transitions. Second operand has 33 states, 32 states have (on average 1.59375) internal successors, (51), 33 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-01-09 22:13:04,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:13:04,281 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2025-01-09 22:13:04,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 22:13:04,281 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.59375) internal successors, (51), 33 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) Word has length 20 [2025-01-09 22:13:04,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:13:04,282 INFO L225 Difference]: With dead ends: 79 [2025-01-09 22:13:04,282 INFO L226 Difference]: Without dead ends: 79 [2025-01-09 22:13:04,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=190, Invalid=1702, Unknown=0, NotChecked=0, Total=1892 [2025-01-09 22:13:04,283 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 9 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:13:04,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 232 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:13:04,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-01-09 22:13:04,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 66. [2025-01-09 22:13:04,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 64 states have (on average 1.15625) internal successors, (74), 65 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-01-09 22:13:04,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 74 transitions. [2025-01-09 22:13:04,288 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 74 transitions. Word has length 20 [2025-01-09 22:13:04,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:13:04,288 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 74 transitions. [2025-01-09 22:13:04,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.59375) internal successors, (51), 33 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-01-09 22:13:04,289 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2025-01-09 22:13:04,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-09 22:13:04,289 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:13:04,289 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:13:04,300 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-01-09 22:13:04,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:13:04,490 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-01-09 22:13:04,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:13:04,490 INFO L85 PathProgramCache]: Analyzing trace with hash 892275679, now seen corresponding path program 1 times [2025-01-09 22:13:04,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:13:04,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806695888] [2025-01-09 22:13:04,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:13:04,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:13:04,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 22:13:04,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 22:13:04,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:13:04,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:13:04,844 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:13:04,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:13:04,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806695888] [2025-01-09 22:13:04,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806695888] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:13:04,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587505741] [2025-01-09 22:13:04,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:13:04,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:13:04,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:13:04,846 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-01-09 22:13:04,848 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-01-09 22:13:04,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 22:13:04,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 22:13:04,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:13:04,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:13:04,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-01-09 22:13:04,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:13:04,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:13:04,913 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-01-09 22:13:04,917 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-01-09 22:13:05,193 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:13:05,194 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:13:05,582 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:13:05,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587505741] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:13:05,582 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:13:05,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 34 [2025-01-09 22:13:05,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278722405] [2025-01-09 22:13:05,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:13:05,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-01-09 22:13:05,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:13:05,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-01-09 22:13:05,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1066, Unknown=0, NotChecked=0, Total=1190 [2025-01-09 22:13:05,583 INFO L87 Difference]: Start difference. First operand 66 states and 74 transitions. Second operand has 35 states, 34 states have (on average 1.5588235294117647) internal successors, (53), 35 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-01-09 22:13:07,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:13:07,566 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2025-01-09 22:13:07,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-01-09 22:13:07,566 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.5588235294117647) internal successors, (53), 35 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) Word has length 21 [2025-01-09 22:13:07,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:13:07,567 INFO L225 Difference]: With dead ends: 76 [2025-01-09 22:13:07,567 INFO L226 Difference]: Without dead ends: 76 [2025-01-09 22:13:07,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=330, Invalid=2976, Unknown=0, NotChecked=0, Total=3306 [2025-01-09 22:13:07,568 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 37 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:13:07,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 127 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 22:13:07,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-01-09 22:13:07,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 63. [2025-01-09 22:13:07,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 61 states have (on average 1.1639344262295082) internal successors, (71), 62 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-01-09 22:13:07,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2025-01-09 22:13:07,570 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 21 [2025-01-09 22:13:07,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:13:07,570 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2025-01-09 22:13:07,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.5588235294117647) internal successors, (53), 35 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-01-09 22:13:07,570 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2025-01-09 22:13:07,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-09 22:13:07,570 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:13:07,571 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:13:07,576 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-01-09 22:13:07,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:13:07,771 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-01-09 22:13:07,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:13:07,771 INFO L85 PathProgramCache]: Analyzing trace with hash 910342834, now seen corresponding path program 2 times [2025-01-09 22:13:07,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:13:07,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832700440] [2025-01-09 22:13:07,772 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:13:07,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:13:07,779 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-01-09 22:13:07,791 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 22:13:07,791 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:13:07,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:13:08,160 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:13:08,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:13:08,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832700440] [2025-01-09 22:13:08,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832700440] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:13:08,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654134882] [2025-01-09 22:13:08,161 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:13:08,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:13:08,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:13:08,163 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-01-09 22:13:08,164 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-01-09 22:13:08,206 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-01-09 22:13:08,243 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 22:13:08,243 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:13:08,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:13:08,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-01-09 22:13:08,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:13:08,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:13:08,251 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-01-09 22:13:08,254 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-01-09 22:13:08,590 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:13:08,590 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:13:08,982 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:13:08,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654134882] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:13:08,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:13:08,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 37 [2025-01-09 22:13:08,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982228998] [2025-01-09 22:13:08,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:13:08,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-01-09 22:13:08,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:13:08,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-01-09 22:13:08,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1268, Unknown=0, NotChecked=0, Total=1406 [2025-01-09 22:13:08,984 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand has 38 states, 37 states have (on average 1.5675675675675675) internal successors, (58), 38 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-01-09 22:13:09,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:13:09,620 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2025-01-09 22:13:09,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-01-09 22:13:09,623 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.5675675675675675) internal successors, (58), 38 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 21 [2025-01-09 22:13:09,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:13:09,623 INFO L225 Difference]: With dead ends: 70 [2025-01-09 22:13:09,623 INFO L226 Difference]: Without dead ends: 70 [2025-01-09 22:13:09,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=323, Invalid=2757, Unknown=0, NotChecked=0, Total=3080 [2025-01-09 22:13:09,625 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 45 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:13:09,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 119 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:13:09,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-01-09 22:13:09,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 62. [2025-01-09 22:13:09,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.1147540983606556) internal successors, (68), 61 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-01-09 22:13:09,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2025-01-09 22:13:09,626 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 21 [2025-01-09 22:13:09,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:13:09,626 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2025-01-09 22:13:09,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.5675675675675675) internal successors, (58), 38 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-01-09 22:13:09,626 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2025-01-09 22:13:09,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-09 22:13:09,628 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:13:09,628 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:13:09,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 22:13:09,828 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,SelfDestructingSolverStorable21 [2025-01-09 22:13:09,828 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-01-09 22:13:09,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:13:09,829 INFO L85 PathProgramCache]: Analyzing trace with hash 173982315, now seen corresponding path program 2 times [2025-01-09 22:13:09,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:13:09,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289111482] [2025-01-09 22:13:09,829 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:13:09,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:13:09,834 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-01-09 22:13:09,851 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 22:13:09,852 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:13:09,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:13:10,350 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:13:10,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:13:10,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289111482] [2025-01-09 22:13:10,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289111482] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:13:10,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569511900] [2025-01-09 22:13:10,351 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:13:10,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:13:10,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:13:10,352 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-01-09 22:13:10,354 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-01-09 22:13:10,400 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-01-09 22:13:10,435 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 22:13:10,435 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:13:10,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:13:10,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 86 conjuncts are in the unsatisfiable core [2025-01-09 22:13:10,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:13:10,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:13:10,454 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-01-09 22:13:10,464 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-01-09 22:13:11,011 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:13:11,011 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:13:11,680 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:13:11,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569511900] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:13:11,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:13:11,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 17] total 50 [2025-01-09 22:13:11,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586519216] [2025-01-09 22:13:11,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:13:11,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-01-09 22:13:11,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:13:11,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-01-09 22:13:11,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=2277, Unknown=0, NotChecked=0, Total=2550 [2025-01-09 22:13:11,682 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand has 51 states, 50 states have (on average 1.72) internal successors, (86), 51 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:13:12,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:13:12,821 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2025-01-09 22:13:12,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-01-09 22:13:12,821 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 1.72) internal successors, (86), 51 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-01-09 22:13:12,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:13:12,821 INFO L225 Difference]: With dead ends: 84 [2025-01-09 22:13:12,821 INFO L226 Difference]: Without dead ends: 39 [2025-01-09 22:13:12,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1675 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=700, Invalid=5620, Unknown=0, NotChecked=0, Total=6320 [2025-01-09 22:13:12,823 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 79 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 912 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:13:12,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 273 Invalid, 971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 912 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 22:13:12,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-01-09 22:13:12,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2025-01-09 22:13:12,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:13:12,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2025-01-09 22:13:12,824 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 32 [2025-01-09 22:13:12,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:13:12,824 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2025-01-09 22:13:12,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 1.72) internal successors, (86), 51 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:13:12,824 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2025-01-09 22:13:12,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-09 22:13:12,825 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:13:12,825 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:13:12,834 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-01-09 22:13:13,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:13:13,025 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-01-09 22:13:13,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:13:13,026 INFO L85 PathProgramCache]: Analyzing trace with hash -393264231, now seen corresponding path program 2 times [2025-01-09 22:13:13,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:13:13,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325562383] [2025-01-09 22:13:13,026 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:13:13,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:13:13,031 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-01-09 22:13:13,044 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 22:13:13,045 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:13:13,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:13:13,806 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:13:13,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:13:13,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325562383] [2025-01-09 22:13:13,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325562383] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:13:13,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745159012] [2025-01-09 22:13:13,806 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:13:13,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:13:13,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:13:13,811 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-01-09 22:13:13,813 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-01-09 22:13:13,860 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-01-09 22:13:13,910 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 22:13:13,910 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:13:13,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:13:13,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 87 conjuncts are in the unsatisfiable core [2025-01-09 22:13:13,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:13:13,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:13:13,920 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-01-09 22:13:13,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 10 treesize of output 8 [2025-01-09 22:13:14,528 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:13:14,528 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:13:15,383 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:13:15,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745159012] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:13:15,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:13:15,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 17, 17] total 54 [2025-01-09 22:13:15,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848935175] [2025-01-09 22:13:15,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:13:15,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-01-09 22:13:15,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:13:15,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-01-09 22:13:15,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=2718, Unknown=0, NotChecked=0, Total=2970 [2025-01-09 22:13:15,385 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand has 55 states, 54 states have (on average 1.9074074074074074) internal successors, (103), 55 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:13:19,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:13:19,194 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2025-01-09 22:13:19,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2025-01-09 22:13:19,195 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 1.9074074074074074) internal successors, (103), 55 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-01-09 22:13:19,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:13:19,195 INFO L225 Difference]: With dead ends: 127 [2025-01-09 22:13:19,195 INFO L226 Difference]: Without dead ends: 87 [2025-01-09 22:13:19,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2848 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1470, Invalid=12572, Unknown=0, NotChecked=0, Total=14042 [2025-01-09 22:13:19,198 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 77 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:13:19,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 187 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 22:13:19,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-01-09 22:13:19,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-01-09 22:13:19,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 1.0116279069767442) internal successors, (87), 86 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-01-09 22:13:19,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2025-01-09 22:13:19,200 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 36 [2025-01-09 22:13:19,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:13:19,200 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2025-01-09 22:13:19,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 1.9074074074074074) internal successors, (103), 55 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:13:19,200 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2025-01-09 22:13:19,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 22:13:19,200 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:13:19,200 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:13:19,207 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-01-09 22:13:19,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:13:19,401 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-01-09 22:13:19,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:13:19,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1812602457, now seen corresponding path program 3 times [2025-01-09 22:13:19,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:13:19,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069896748] [2025-01-09 22:13:19,401 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 22:13:19,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:13:19,412 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 86 statements into 15 equivalence classes. [2025-01-09 22:13:19,482 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 22:13:19,482 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2025-01-09 22:13:19,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:13:20,652 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 44 proven. 108 refuted. 0 times theorem prover too weak. 359 trivial. 0 not checked. [2025-01-09 22:13:20,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:13:20,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069896748] [2025-01-09 22:13:20,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069896748] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:13:20,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657291710] [2025-01-09 22:13:20,652 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 22:13:20,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:13:20,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:13:20,654 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-01-09 22:13:20,655 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-01-09 22:13:20,714 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 86 statements into 15 equivalence classes. [2025-01-09 22:13:21,253 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 22:13:21,253 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2025-01-09 22:13:21,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:13:21,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 629 conjuncts, 187 conjuncts are in the unsatisfiable core [2025-01-09 22:13:21,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:13:21,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:13:21,269 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-01-09 22:13:21,271 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-01-09 22:13:22,658 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:13:22,658 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:13:25,303 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:13:25,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657291710] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:13:25,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:13:25,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 37, 37] total 89 [2025-01-09 22:13:25,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425364788] [2025-01-09 22:13:25,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:13:25,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 90 states [2025-01-09 22:13:25,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:13:25,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2025-01-09 22:13:25,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=734, Invalid=7276, Unknown=0, NotChecked=0, Total=8010 [2025-01-09 22:13:25,308 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand has 90 states, 89 states have (on average 2.202247191011236) internal successors, (196), 90 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:13:30,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:13:30,013 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2025-01-09 22:13:30,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2025-01-09 22:13:30,014 INFO L78 Accepts]: Start accepts. Automaton has has 90 states, 89 states have (on average 2.202247191011236) internal successors, (196), 90 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-01-09 22:13:30,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:13:30,014 INFO L225 Difference]: With dead ends: 95 [2025-01-09 22:13:30,014 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 22:13:30,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3709 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=2250, Invalid=23190, Unknown=0, NotChecked=0, Total=25440 [2025-01-09 22:13:30,017 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 49 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 3483 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 3537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 3483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:13:30,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 167 Invalid, 3537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 3483 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 22:13:30,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 22:13:30,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 22:13:30,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:13:30,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 22:13:30,018 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 86 [2025-01-09 22:13:30,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:13:30,018 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 22:13:30,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 90 states, 89 states have (on average 2.202247191011236) internal successors, (196), 90 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:13:30,018 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 22:13:30,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 22:13:30,023 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 9 remaining) [2025-01-09 22:13:30,024 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 9 remaining) [2025-01-09 22:13:30,024 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 9 remaining) [2025-01-09 22:13:30,024 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 9 remaining) [2025-01-09 22:13:30,024 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 9 remaining) [2025-01-09 22:13:30,024 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 9 remaining) [2025-01-09 22:13:30,024 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 9 remaining) [2025-01-09 22:13:30,024 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 9 remaining) [2025-01-09 22:13:30,024 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (0 of 9 remaining) [2025-01-09 22:13:30,033 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-01-09 22:13:30,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:13:30,227 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:13:30,230 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 22:13:30,232 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 10:13:30 BoogieIcfgContainer [2025-01-09 22:13:30,232 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 22:13:30,232 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 22:13:30,232 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 22:13:30,232 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 22:13:30,233 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:12:52" (3/4) ... [2025-01-09 22:13:30,235 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 22:13:30,242 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-01-09 22:13:30,243 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 22:13:30,243 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-01-09 22:13:30,243 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 22:13:30,299 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 22:13:30,299 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 22:13:30,299 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 22:13:30,301 INFO L158 Benchmark]: Toolchain (without parser) took 38385.50ms. Allocated memory was 142.6MB in the beginning and 478.2MB in the end (delta: 335.5MB). Free memory was 111.5MB in the beginning and 188.3MB in the end (delta: -76.8MB). Peak memory consumption was 259.1MB. Max. memory is 16.1GB. [2025-01-09 22:13:30,301 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 22:13:30,301 INFO L158 Benchmark]: CACSL2BoogieTranslator took 278.58ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 94.8MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 22:13:30,302 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.91ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 93.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 22:13:30,302 INFO L158 Benchmark]: Boogie Preprocessor took 25.28ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 91.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 22:13:30,302 INFO L158 Benchmark]: RCFGBuilder took 254.09ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 78.1MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 22:13:30,302 INFO L158 Benchmark]: TraceAbstraction took 37732.97ms. Allocated memory was 142.6MB in the beginning and 478.2MB in the end (delta: 335.5MB). Free memory was 77.6MB in the beginning and 194.7MB in the end (delta: -117.1MB). Peak memory consumption was 217.2MB. Max. memory is 16.1GB. [2025-01-09 22:13:30,302 INFO L158 Benchmark]: Witness Printer took 67.31ms. Allocated memory is still 478.2MB. Free memory was 194.7MB in the beginning and 188.3MB in the end (delta: 6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 22:13:30,305 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 278.58ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 94.8MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.91ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 93.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.28ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 91.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 254.09ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 78.1MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 37732.97ms. Allocated memory was 142.6MB in the beginning and 478.2MB in the end (delta: 335.5MB). Free memory was 77.6MB in the beginning and 194.7MB in the end (delta: -117.1MB). Peak memory consumption was 217.2MB. Max. memory is 16.1GB. * Witness Printer took 67.31ms. Allocated memory is still 478.2MB. Free memory was 194.7MB in the beginning and 188.3MB in the end (delta: 6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 563]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 32 locations, 9 error locations. Started 1 CEGAR loops. OverallTime: 37.7s, OverallIterations: 25, TraceHistogramMax: 15, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 16.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 488 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 488 mSDsluCounter, 3061 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2584 mSDsCounter, 283 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8190 IncrementalHoareTripleChecker+Invalid, 8473 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 283 mSolverCounterUnsat, 477 mSDtfsCounter, 8190 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1022 GetRequests, 326 SyntacticMatches, 2 SemanticMatches, 694 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10732 ImplicationChecksByTransitivity, 21.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=24, InterpolantAutomatonStates: 426, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 25 MinimizatonAttempts, 91 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 17.5s InterpolantComputationTime, 722 NumberOfCodeBlocks, 722 NumberOfCodeBlocksAsserted, 70 NumberOfCheckSat, 946 ConstructedInterpolants, 19 QuantifiedInterpolants, 13283 SizeOfPredicates, 109 NumberOfNonLiveVariables, 2030 ConjunctsInSsa, 661 ConjunctsInUnsatCore, 43 InterpolantComputations, 16 PerfectInterpolantSequences, 429/1894 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 22:13:30,326 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE